1. 0.16 s $ /nix/store/9ypz3flqsrl5xl495mm8h645gadjsxi1-coreutils-9.11/bin/timeout --kill-after=15s 7200s /nix/store/23zk8sgzamrbmj1fday15szf7f2279s8-nix-2.34.7/bin/nix --extra-experimental-features nix-command --extra-experimental-features flakes --log-format internal-json build --no-link --print-out-paths git+https://github.com/sellout/duoids?ref=renovate%2Flock-file-maintenance&rev=aeca24e0ba147679323a49b0d71b1010da9c6629#packages.x86_64-linux.ghc9103_all --print-build-logs
  2. 0.21 s warning: ignoring untrusted flake configuration setting 'allow-import-from-derivation'.
  3. 0.21 s Pass '--accept-flake-config' to trust it
  4. 0.21 s warning: ignoring untrusted flake configuration setting 'extra-experimental-features'.
  5. 0.21 s Pass '--accept-flake-config' to trust it
  6. 0.21 s warning: ignoring untrusted flake configuration setting 'extra-substituters'.
  7. 0.21 s Pass '--accept-flake-config' to trust it
  8. 0.21 s warning: ignoring untrusted flake configuration setting 'extra-trusted-public-keys'.
  9. 0.21 s Pass '--accept-flake-config' to trust it
  10. 0.21 s warning: ignoring untrusted flake configuration setting 'sandbox'.
  11. 0.21 s Pass '--accept-flake-config' to trust it
  12. 0.21 s warning: ignoring untrusted flake configuration setting 'use-registries'.
  13. 0.21 s Pass '--accept-flake-config' to trust it
  14. 0.21 s
  15. 2.53 s Downloading cached barbies-2.1.1.0-doc from https://cache.nix-ci.com
  16. 2.53 s Downloading cached erf-2.0.0.0-doc from https://cache.nix-ci.com
  17. 2.53 s Downloading cached concurrent-output-1.10.21-doc from https://cache.nix-ci.com
  18. 2.53 s Downloading cached lifted-base-0.2.3.12-doc from https://cache.nix-ci.com
  19. 2.53 s Downloading cached wl-pprint-annotated-0.1.0.1-doc from https://cache.nix-ci.com
  20. 2.53 s Downloading cached Cabal-syntax-3.12.1.0-doc from https://cache.nix-ci.com
  21. 2.53 s Downloading cached inspection-testing-0.6.2-doc from https://cache.nix-ci.com
  22. 2.54 s Downloading cached ghc-paths-0.1.0.12-doc from https://cache.nix-ci.com
  23. 2.54 s Downloading cached silently-1.2.5.4-doc from https://cache.nix-ci.com
  24. 2.54 s Downloading cached stringbuilder-0.5.1-doc from https://cache.nix-ci.com
  25. 2.55 s Downloading cached ChasingBottoms-1.3.1.17-doc from https://cache.nix-ci.com
  26. 2.56 s Downloading cached wherefrom-compat-0.1.1.1-doc from https://cache.nix-ci.com
  27. 2.61 s Progress: 0 of 34 built, 1 of 36 downloaded from cache (11 downloading)
  28. 2.61 s Progress: 0 of 34 built, 2 of 36 downloaded from cache (11 downloading)
  29. 2.61 s Downloading cached wl-pprint-annotated from https://cache.nix-ci.com
  30. 2.61 s Downloading cached barbies from https://cache.nix-ci.com
  31. 2.61 s Progress: 0 of 34 built, 3 of 36 downloaded from cache (11 downloading)
  32. 2.61 s Downloading cached erf from https://cache.nix-ci.com
  33. 2.61 s Progress: 0 of 34 built, 4 of 36 downloaded from cache (11 downloading)
  34. 2.61 s Downloading cached inspection-testing from https://cache.nix-ci.com
  35. 2.61 s Downloading cached tasty-inspection-testing-0.2.1-doc from https://cache.nix-ci.com
  36. 2.62 s Progress: 0 of 34 built, 5 of 36 downloaded from cache (12 downloading)
  37. 2.62 s Downloading cached wherefrom-compat from https://cache.nix-ci.com
  38. 2.62 s Progress: 0 of 34 built, 6 of 36 downloaded from cache (12 downloading)
  39. 2.62 s Downloading cached ghc-paths from https://cache.nix-ci.com
  40. 2.63 s Progress: 0 of 34 built, 7 of 36 downloaded from cache (12 downloading)
  41. 2.63 s Downloading cached ChasingBottoms from https://cache.nix-ci.com
  42. 2.67 s Progress: 0 of 34 built, 8 of 36 downloaded from cache (12 downloading)
  43. 2.67 s Progress: 0 of 34 built, 9 of 36 downloaded from cache (11 downloading)
  44. 2.68 s Progress: 0 of 33 built, 10 of 36 downloaded from cache (10 downloading)
  45. 2.68 s Progress: 0 of 32 built, 11 of 36 downloaded from cache (9 downloading)
  46. 2.70 s Progress: 0 of 31 built, 12 of 36 downloaded from cache (8 downloading)
  47. 2.70 s Downloading cached concurrent-output from https://cache.nix-ci.com
  48. 2.70 s Progress: 0 of 31 built, 13 of 36 downloaded from cache (8 downloading)
  49. 2.70 s Progress: 0 of 30 built, 14 of 36 downloaded from cache (7 downloading)
  50. 2.70 s Downloading cached tasty-inspection-testing from https://cache.nix-ci.com
  51. 2.70 s Progress: 0 of 29 built, 15 of 36 downloaded from cache (7 downloading)
  52. 2.71 s Downloading cached stringbuilder from https://cache.nix-ci.com
  53. 2.71 s Progress: 0 of 29 built, 16 of 36 downloaded from cache (7 downloading)
  54. 2.71 s Downloading cached lifted-base from https://cache.nix-ci.com
  55. 2.71 s Downloading cached lifted-async-0.10.2.7-doc from https://cache.nix-ci.com
  56. 2.71 s Progress: 0 of 29 built, 17 of 36 downloaded from cache (8 downloading)
  57. 2.75 s Progress: 0 of 28 built, 18 of 36 downloaded from cache (7 downloading)
  58. 2.75 s Downloading cached silently from https://cache.nix-ci.com
  59. 2.75 s Progress: 0 of 28 built, 19 of 36 downloaded from cache (7 downloading)
  60. 2.76 s Progress: 0 of 27 built, 20 of 36 downloaded from cache (6 downloading)
  61. 2.77 s Progress: 0 of 26 built, 21 of 36 downloaded from cache (5 downloading)
  62. 2.78 s Progress: 0 of 25 built, 22 of 36 downloaded from cache (4 downloading)
  63. 2.78 s Downloading cached hedgehog-1.5-doc from https://cache.nix-ci.com
  64. 2.83 s Progress: 0 of 25 built, 23 of 36 downloaded from cache (4 downloading)
  65. 2.83 s Downloading cached Cabal-3.12.1.0-doc from https://cache.nix-ci.com
  66. 2.83 s Downloading cached Cabal-syntax from https://cache.nix-ci.com
  67. 2.86 s Progress: 0 of 25 built, 24 of 36 downloaded from cache (5 downloading)
  68. 2.86 s Downloading cached lifted-async from https://cache.nix-ci.com
  69. 2.87 s Progress: 0 of 24 built, 25 of 36 downloaded from cache (5 downloading)
  70. 2.89 s Progress: 0 of 23 built, 26 of 36 downloaded from cache (4 downloading)
  71. 2.89 s Downloading cached tasty-hedgehog-1.4.0.2-doc from https://cache.nix-ci.com
  72. 2.93 s Progress: 0 of 23 built, 27 of 36 downloaded from cache (4 downloading)
  73. 3.14 s Building /nix/store/jps3wnh8a1dvhxg7gi6hq3v9f50l0gry-doctest-0.24.2.drv
  74. 3.14 s Progress: 0 of 22 built (1 building), 28 of 36 downloaded from cache (3 downloading)
  75. 3.15 s Progress: 0 of 22 built (1 building), 29 of 36 downloaded from cache (2 downloading)
  76. 3.15 s Progress: 0 of 22 built (1 building), 30 of 36 downloaded from cache (1 downloading)
  77. 3.15 s Downloading cached cabal-doctest-1.0.12-doc from https://cache.nix-ci.com
  78. 3.15 s Downloading cached hedgehog from https://cache.nix-ci.com
  79. 3.22 s Progress: 0 of 21 built (1 building), 31 of 36 downloaded from cache (2 downloading)
  80. 3.28 s [doctest] Phase: setupCompilerEnvironmentPhase
  81. 3.29 s [doctest] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  82. 3.34 s Progress: 0 of 21 built (1 building), 32 of 36 downloaded from cache (1 downloading)
  83. 3.34 s Downloading cached tasty-hedgehog from https://cache.nix-ci.com
  84. 3.40 s Progress: 0 of 20 built (1 building), 33 of 36 downloaded from cache (1 downloading)
  85. 3.53 s [doctest] Phase: unpackPhase
  86. 3.54 s [doctest] unpacking source archive /nix/store/bhl15ifbap4vkm5qbpgwa3svq4yanr2l-doctest-0.24.2.tar.gz
  87. 3.56 s [doctest] source root is doctest-0.24.2
  88. 3.56 s [doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "doctest-0.24.2/test/UtilSpec.hs"
  89. 3.57 s [doctest] Phase: patchPhase
  90. 3.58 s [doctest] Phase: compileBuildDriverPhase
  91. 3.66 s [doctest] setupCompileFlags: -package-db=/build/tmp.4onUNlh2kL/setup-package.conf.d -threaded
  92. 3.75 s [doctest] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.4onUNlh2kL/Main.o )
  93. 3.83 s [doctest] [2 of 2] Linking Setup
  94. 3.95 s Progress: 0 of 19 built (1 building), 34 of 36 downloaded from cache
  95. 3.96 s Downloading cached Cabal from https://cache.nix-ci.com
  96. 4.56 s Progress: 0 of 19 built (1 building), 35 of 36 downloaded from cache
  97. 4.56 s Downloading cached cabal-doctest from https://cache.nix-ci.com
  98. 4.65 s Progress: 0 of 18 built (1 building), 36 of 36 downloaded from cache
  99. 5.38 s [doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  100. 5.40 s [doctest] Phase: configurePhase
  101. 5.45 s [doctest] configureFlags: --verbose --prefix=/nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc/share/doc/doctest-0.24.2 --with-gcc=gcc --package-db=/build/tmp.4onUNlh2kL/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/lib
  102. 5.45 s [doctest] Using Parsec parser
  103. 5.45 s [doctest] Configuring doctest-0.24.2...
  104. 5.77 s [doctest] Flags chosen: cabal-doctest=False
  105. 6.03 s [doctest] Dependency base >=4.12 && <5: using base-4.20.2.0
  106. 6.03 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  107. 6.03 s [doctest] Dependency containers: using containers-0.7
  108. 6.03 s [doctest] Dependency deepseq: using deepseq-1.5.0.0
  109. 6.03 s [doctest] Dependency directory: using directory-1.3.8.5
  110. 6.03 s [doctest] Dependency exceptions: using exceptions-0.10.9
  111. 6.03 s [doctest] Dependency filepath: using filepath-1.5.4.0
  112. 6.03 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.10.3
  113. 6.03 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  114. 6.03 s [doctest] Dependency process: using process-1.6.26.1
  115. 6.03 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  116. 6.03 s [doctest] Dependency temporary: using temporary-1.3
  117. 6.03 s [doctest] Dependency transformers: using transformers-0.6.1.1
  118. 6.03 s [doctest] Dependency base >=4.12 && <5: using base-4.20.2.0
  119. 6.03 s [doctest] Dependency doctest: using doctest-0.24.2
  120. 6.03 s [doctest] Dependency HUnit: using HUnit-1.6.2.0
  121. 6.03 s [doctest] Dependency QuickCheck >=2.13.1: using QuickCheck-2.15.0.1
  122. 6.03 s [doctest] Dependency base >=4.12 && <5: using base-4.20.2.0
  123. 6.03 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  124. 6.03 s [doctest] Dependency containers: using containers-0.7
  125. 6.03 s [doctest] Dependency deepseq: using deepseq-1.5.0.0
  126. 6.03 s [doctest] Dependency directory: using directory-1.3.8.5
  127. 6.03 s [doctest] Dependency exceptions: using exceptions-0.10.9
  128. 6.03 s [doctest] Dependency filepath: using filepath-1.5.4.0
  129. 6.03 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.10.3
  130. 6.03 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  131. 6.03 s [doctest] Dependency hspec >=2.3.0: using hspec-2.11.14
  132. 6.03 s [doctest] Dependency hspec-core >=2.3.0: using hspec-core-2.11.14
  133. 6.03 s [doctest] Dependency mockery: using mockery-0.3.5
  134. 6.03 s [doctest] Dependency process: using process-1.6.26.1
  135. 6.03 s [doctest] Dependency silently >=1.2.4: using silently-1.2.5.4
  136. 6.03 s [doctest] Dependency stringbuilder >=0.4: using stringbuilder-0.5.1
  137. 6.03 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  138. 6.03 s [doctest] Dependency temporary: using temporary-1.3
  139. 6.03 s [doctest] Dependency transformers: using transformers-0.6.1.1
  140. 6.03 s [doctest] Source component graph:
  141. 6.03 s [doctest] component test:spec
  142. 6.03 s [doctest] component lib
  143. 6.03 s [doctest] component exe:doctest dependency lib
  144. 6.03 s [doctest] Configured component graph:
  145. 6.03 s [doctest] component doctest-0.24.2-1YXKG5Q5DdM3pnUo2D7x9m-spec
  146. 6.03 s [doctest] include HUnit-1.6.2.0-JXuCVna2BYuFcGoUe74k6J
  147. 6.03 s [doctest] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  148. 6.03 s [doctest] include base-4.20.2.0-64da
  149. 6.03 s [doctest] include code-page-0.2.1-4ck80FZkSU6JrQOTDtg1a7
  150. 6.03 s [doctest] include containers-0.7-504a
  151. 6.03 s [doctest] include deepseq-1.5.0.0-9a2c
  152. 6.03 s [doctest] include directory-1.3.8.5-c84a
  153. 6.03 s [doctest] include exceptions-0.10.9-1a12
  154. 6.03 s [doctest] include filepath-1.5.4.0-e600
  155. 6.03 s [doctest] include ghc-9.10.3-05f6
  156. 6.03 s [doctest] include ghc-paths-0.1.0.12-AsPapRUQXcyIavWIfzs7Gr
  157. 6.03 s [doctest] include hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  158. 6.03 s [doctest] include hspec-core-2.11.14-FxcNNMEYpft21horraLswU
  159. 6.03 s [doctest] include mockery-0.3.5-EoPvviUQGlu2sq9REsFLwG
  160. 6.03 s [doctest] include process-1.6.26.1-ccf0
  161. 6.03 s [doctest] include silently-1.2.5.4-EGV9f2Y2wfhJHQ1FyxFMJ5
  162. 6.03 s [doctest] include stringbuilder-0.5.1-7V3tQKTV9qlL9xhSHfYWuU
  163. 6.03 s [doctest] include syb-0.7.2.4-AW3ocNy0fipJrho8aY78CS
  164. 6.03 s [doctest] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  165. 6.03 s [doctest] include transformers-0.6.1.1-6a26
  166. 6.03 s [doctest] component doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  167. 6.03 s [doctest] include base-4.20.2.0-64da
  168. 6.03 s [doctest] include code-page-0.2.1-4ck80FZkSU6JrQOTDtg1a7
  169. 6.03 s [doctest] include containers-0.7-504a
  170. 6.03 s [doctest] include deepseq-1.5.0.0-9a2c
  171. 6.03 s [doctest] include directory-1.3.8.5-c84a
  172. 6.04 s [doctest] include exceptions-0.10.9-1a12
  173. 6.04 s [doctest] include filepath-1.5.4.0-e600
  174. 6.04 s [doctest] include ghc-9.10.3-05f6
  175. 6.04 s [doctest] include ghc-paths-0.1.0.12-AsPapRUQXcyIavWIfzs7Gr
  176. 6.04 s [doctest] include process-1.6.26.1-ccf0
  177. 6.04 s [doctest] include syb-0.7.2.4-AW3ocNy0fipJrho8aY78CS
  178. 6.04 s [doctest] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  179. 6.04 s [doctest] include transformers-0.6.1.1-6a26
  180. 6.04 s [doctest] component doctest-0.24.2-6BMFWQ0ROX5KvSokEgm4W1-doctest
  181. 6.04 s [doctest] include base-4.20.2.0-64da
  182. 6.04 s [doctest] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  183. 6.04 s [doctest] Linked component graph:
  184. 6.04 s [doctest] unit doctest-0.24.2-1YXKG5Q5DdM3pnUo2D7x9m-spec
  185. 6.04 s [doctest] include HUnit-1.6.2.0-JXuCVna2BYuFcGoUe74k6J
  186. 6.04 s [doctest] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  187. 6.04 s [doctest] include base-4.20.2.0-64da
  188. 6.04 s [doctest] include code-page-0.2.1-4ck80FZkSU6JrQOTDtg1a7
  189. 6.04 s [doctest] include containers-0.7-504a
  190. 6.04 s [doctest] include deepseq-1.5.0.0-9a2c
  191. 6.04 s [doctest] include directory-1.3.8.5-c84a
  192. 6.04 s [doctest] include exceptions-0.10.9-1a12
  193. 6.04 s [doctest] include filepath-1.5.4.0-e600
  194. 6.04 s [doctest] include ghc-9.10.3-05f6
  195. 6.04 s [doctest] include ghc-paths-0.1.0.12-AsPapRUQXcyIavWIfzs7Gr
  196. 6.04 s [doctest] include hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  197. 6.04 s [doctest] include hspec-core-2.11.14-FxcNNMEYpft21horraLswU
  198. 6.04 s [doctest] include mockery-0.3.5-EoPvviUQGlu2sq9REsFLwG
  199. 6.04 s [doctest] include process-1.6.26.1-ccf0
  200. 6.04 s [doctest] include silently-1.2.5.4-EGV9f2Y2wfhJHQ1FyxFMJ5
  201. 6.04 s [doctest] include stringbuilder-0.5.1-7V3tQKTV9qlL9xhSHfYWuU
  202. 6.04 s [doctest] include syb-0.7.2.4-AW3ocNy0fipJrho8aY78CS
  203. 6.04 s [doctest] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  204. 6.04 s [doctest] include transformers-0.6.1.1-6a26
  205. 6.04 s [doctest] unit doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  206. 6.04 s [doctest] include base-4.20.2.0-64da
  207. 6.04 s [doctest] include code-page-0.2.1-4ck80FZkSU6JrQOTDtg1a7
  208. 6.04 s [doctest] include containers-0.7-504a
  209. 6.04 s [doctest] include deepseq-1.5.0.0-9a2c
  210. 6.04 s [doctest] include directory-1.3.8.5-c84a
  211. 6.04 s [doctest] include exceptions-0.10.9-1a12
  212. 6.04 s [doctest] include filepath-1.5.4.0-e600
  213. 6.04 s [doctest] include ghc-9.10.3-05f6
  214. 6.04 s [doctest] include ghc-paths-0.1.0.12-AsPapRUQXcyIavWIfzs7Gr
  215. 6.04 s [doctest] include process-1.6.26.1-ccf0
  216. 6.04 s [doctest] include syb-0.7.2.4-AW3ocNy0fipJrho8aY78CS
  217. 6.04 s [doctest] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  218. 6.04 s [doctest] include transformers-0.6.1.1-6a26
  219. 6.04 s [doctest] Test.DocTest=doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8:Test.DocTest,Test.DocTest.Internal.Cabal=doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8:Test.DocTest.Internal.Cabal,Test.DocTest.Internal.Extract=doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8:Test.DocTest.Internal.Extract,Test.DocTest.Internal.Location=doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8:Test.DocTest.Internal.Location,Test.DocTest.Internal.Parse=doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8:Test.DocTest.Internal.Parse,Test.DocTest.Internal.Run=doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8:Test.DocTest.Internal.Run
  220. 6.04 s [doctest] unit doctest-0.24.2-6BMFWQ0ROX5KvSokEgm4W1-doctest
  221. 6.04 s [doctest] include base-4.20.2.0-64da
  222. 6.04 s [doctest] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  223. 6.04 s [doctest] Ready component graph:
  224. 6.04 s [doctest] definite doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  225. 6.04 s [doctest] depends base-4.20.2.0-64da
  226. 6.04 s [doctest] depends code-page-0.2.1-4ck80FZkSU6JrQOTDtg1a7
  227. 6.04 s [doctest] depends containers-0.7-504a
  228. 6.04 s [doctest] depends deepseq-1.5.0.0-9a2c
  229. 6.04 s [doctest] depends directory-1.3.8.5-c84a
  230. 6.04 s [doctest] depends exceptions-0.10.9-1a12
  231. 6.04 s [doctest] depends filepath-1.5.4.0-e600
  232. 6.04 s [doctest] depends ghc-9.10.3-05f6
  233. 6.04 s [doctest] depends ghc-paths-0.1.0.12-AsPapRUQXcyIavWIfzs7Gr
  234. 6.04 s [doctest] depends process-1.6.26.1-ccf0
  235. 6.04 s [doctest] depends syb-0.7.2.4-AW3ocNy0fipJrho8aY78CS
  236. 6.04 s [doctest] depends temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  237. 6.04 s [doctest] depends transformers-0.6.1.1-6a26
  238. 6.04 s [doctest] definite doctest-0.24.2-6BMFWQ0ROX5KvSokEgm4W1-doctest
  239. 6.04 s [doctest] depends base-4.20.2.0-64da
  240. 6.04 s [doctest] depends doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  241. 6.04 s [doctest] definite doctest-0.24.2-1YXKG5Q5DdM3pnUo2D7x9m-spec
  242. 6.04 s [doctest] depends HUnit-1.6.2.0-JXuCVna2BYuFcGoUe74k6J
  243. 6.04 s [doctest] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  244. 6.04 s [doctest] depends base-4.20.2.0-64da
  245. 6.04 s [doctest] depends code-page-0.2.1-4ck80FZkSU6JrQOTDtg1a7
  246. 6.04 s [doctest] depends containers-0.7-504a
  247. 6.04 s [doctest] depends deepseq-1.5.0.0-9a2c
  248. 6.04 s [doctest] depends directory-1.3.8.5-c84a
  249. 6.04 s [doctest] depends exceptions-0.10.9-1a12
  250. 6.04 s [doctest] depends filepath-1.5.4.0-e600
  251. 6.04 s [doctest] depends ghc-9.10.3-05f6
  252. 6.04 s [doctest] depends ghc-paths-0.1.0.12-AsPapRUQXcyIavWIfzs7Gr
  253. 6.04 s [doctest] depends hspec-2.11.14-2owp4iDtqTw5MLSF8XDmva
  254. 6.04 s [doctest] depends hspec-core-2.11.14-FxcNNMEYpft21horraLswU
  255. 6.04 s [doctest] depends mockery-0.3.5-EoPvviUQGlu2sq9REsFLwG
  256. 6.04 s [doctest] depends process-1.6.26.1-ccf0
  257. 6.04 s [doctest] depends silently-1.2.5.4-EGV9f2Y2wfhJHQ1FyxFMJ5
  258. 6.04 s [doctest] depends stringbuilder-0.5.1-7V3tQKTV9qlL9xhSHfYWuU
  259. 6.04 s [doctest] depends syb-0.7.2.4-AW3ocNy0fipJrho8aY78CS
  260. 6.04 s [doctest] depends temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  261. 6.04 s [doctest] depends transformers-0.6.1.1-6a26
  262. 6.04 s [doctest] Using Cabal-3.12.1.0 compiled by ghc-9.10
  263. 6.04 s [doctest] Using compiler: ghc-9.10.3
  264. 6.04 s [doctest] Using install prefix:
  265. 6.04 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2
  266. 6.04 s [doctest] Executables installed in:
  267. 6.04 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin
  268. 6.04 s [doctest] Libraries installed in:
  269. 6.04 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  270. 6.04 s [doctest] Dynamic Libraries installed in:
  271. 6.04 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  272. 6.05 s [doctest] Private executables installed in:
  273. 6.05 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/libexec/x86_64-linux-ghc-9.10.3-05f6/doctest-0.24.2
  274. 6.05 s [doctest] Data files installed in:
  275. 6.05 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/share/x86_64-linux-ghc-9.10.3-05f6/doctest-0.24.2
  276. 6.05 s [doctest] Documentation installed in:
  277. 6.05 s [doctest] /nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc/share/doc/doctest-0.24.2
  278. 6.05 s [doctest] Configuration files installed in:
  279. 6.05 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/etc
  280. 6.05 s [doctest] No alex found
  281. 6.05 s [doctest] Using ar found on system at:
  282. 6.05 s [doctest] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  283. 6.05 s [doctest] No c2hs found
  284. 6.05 s [doctest] No cpphs found
  285. 6.05 s [doctest] No doctest found
  286. 6.05 s [doctest] Using gcc version 14.3.0 given by user at:
  287. 6.05 s [doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  288. 6.05 s [doctest] Using ghc version 9.10.3 found on system at:
  289. 6.05 s [doctest] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  290. 6.05 s [doctest] Using ghc-pkg version 9.10.3 found on system at:
  291. 6.05 s [doctest] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  292. 6.05 s [doctest] No ghcjs found
  293. 6.05 s [doctest] No ghcjs-pkg found
  294. 6.05 s [doctest] No greencard found
  295. 6.05 s [doctest] Using haddock version 2.31.1 found on system at:
  296. 6.05 s [doctest] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  297. 6.05 s [doctest] No happy found
  298. 6.05 s [doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  299. 6.05 s [doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  300. 6.05 s [doctest] No hmake found
  301. 6.05 s [doctest] Using hpc version 0.69 found on system at:
  302. 6.05 s [doctest] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  303. 6.05 s [doctest] Using hsc2hs version 0.68.10 found on system at:
  304. 6.05 s [doctest] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  305. 6.05 s [doctest] Using hscolour version 1.25 found on system at:
  306. 6.05 s [doctest] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  307. 6.05 s [doctest] No jhc found
  308. 6.05 s [doctest] Using ld found on system at:
  309. 6.05 s [doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  310. 6.05 s [doctest] No pkg-config found
  311. 6.05 s [doctest] Using runghc version 9.10.3 found on system at:
  312. 6.05 s [doctest] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  313. 6.05 s [doctest] Using strip version 2.44 found on system at:
  314. 6.05 s [doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  315. 6.05 s [doctest] Using tar found on system at:
  316. 6.05 s [doctest] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  317. 6.05 s [doctest] No uhc found
  318. 6.33 s [doctest] Phase: buildPhase
  319. 6.41 s [doctest] Preprocessing library for doctest-0.24.2...
  320. 6.42 s [doctest] Building library for doctest-0.24.2...
  321. 6.89 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.o, dist/build/Imports.dyn_o )
  322. 7.01 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.o, dist/build/GhcUtil.dyn_o )
  323. 8.74 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.o, dist/build/Cabal/ReplOptions.dyn_o )
  324. 8.74 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.o, dist/build/Cabal/Paths.dyn_o )
  325. 8.74 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.o, dist/build/Cabal/Options.dyn_o )
  326. 8.74 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.o, dist/build/Language/Haskell/GhciWrapper.dyn_o )
  327. 8.74 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.o, dist/build/Interpreter.dyn_o )
  328. 8.74 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.o, dist/build/Location.dyn_o )
  329. 8.74 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.o, dist/build/PackageDBs.dyn_o )
  330. 8.74 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.o, dist/build/Paths_doctest.dyn_o )
  331. 8.74 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.o, dist/build/Info.dyn_o )
  332. 8.74 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.o, dist/build/Options.dyn_o )
  333. 8.74 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.o, dist/build/Cabal.dyn_o )
  334. 8.74 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.o, dist/build/Test/DocTest/Internal/Cabal.dyn_o )
  335. 8.74 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.o, dist/build/Test/DocTest/Internal/Location.dyn_o )
  336. 8.74 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.o, dist/build/Util.dyn_o )
  337. 8.74 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.o, dist/build/Extract.dyn_o )
  338. 9.60 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.o, dist/build/Test/DocTest/Internal/Extract.dyn_o )
  339. 9.63 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.o, dist/build/Parse.dyn_o )
  340. 9.90 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.o, dist/build/Test/DocTest/Internal/Parse.dyn_o )
  341. 9.92 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.o, dist/build/Runner/Example.dyn_o )
  342. 10.26 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.o, dist/build/Property.dyn_o )
  343. 10.26 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.o, dist/build/Runner.dyn_o )
  344. 10.72 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.o, dist/build/Run.dyn_o )
  345. 10.85 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.o, dist/build/Test/DocTest/Internal/Run.dyn_o )
  346. 10.87 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.o, dist/build/Test/DocTest.dyn_o )
  347. 11.55 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.p_o )
  348. 11.77 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.p_o )
  349. 12.69 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.p_o )
  350. 12.69 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.p_o )
  351. 12.69 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.p_o )
  352. 12.75 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.p_o )
  353. 12.76 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.p_o )
  354. 12.76 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.p_o )
  355. 12.76 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.p_o )
  356. 12.76 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.p_o )
  357. 12.76 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.p_o )
  358. 12.76 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.p_o )
  359. 13.23 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.p_o )
  360. 13.23 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.p_o )
  361. 13.23 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.p_o )
  362. 13.23 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.p_o )
  363. 13.23 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.p_o )
  364. 13.33 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.p_o )
  365. 13.47 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.p_o )
  366. 13.82 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.p_o )
  367. 13.95 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.p_o )
  368. 14.17 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.p_o )
  369. 14.17 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.p_o )
  370. 14.71 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.p_o )
  371. 14.94 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.p_o )
  372. 15.08 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.p_o )
  373. 18.35 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2...
  374. 18.35 s [doctest] Building executable 'doctest' for doctest-0.24.2...
  375. 18.44 s [doctest] [1 of 2] Compiling Main ( driver/doctest.hs, dist/build/doctest/doctest-tmp/Main.o )
  376. 18.58 s [doctest] [2 of 2] Compiling Paths_doctest ( dist/build/doctest/autogen/Paths_doctest.hs, dist/build/doctest/doctest-tmp/Paths_doctest.o )
  377. 18.72 s [doctest] [3 of 3] Linking dist/build/doctest/doctest
  378. 22.81 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2...
  379. 22.82 s [doctest] Building test suite 'spec' for doctest-0.24.2...
  380. 23.36 s [doctest] [ 1 of 44] Compiling Imports ( src/Imports.hs, dist/build/spec/spec-tmp/Imports.o )
  381. 23.44 s [doctest] [ 2 of 44] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/spec/spec-tmp/GhcUtil.o )
  382. 24.05 s [doctest] [ 3 of 44] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/spec/spec-tmp/Cabal/ReplOptions.o )
  383. 24.05 s [doctest] [ 4 of 44] Compiling Cabal.ReplOptionsSpec ( test/Cabal/ReplOptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/ReplOptionsSpec.o )
  384. 24.16 s [doctest] [ 5 of 44] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/spec/spec-tmp/Cabal/Paths.o )
  385. 24.16 s [doctest] [ 6 of 44] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/spec/spec-tmp/Cabal/Options.o )
  386. 24.16 s [doctest] [ 7 of 44] Compiling Cabal.OptionsSpec ( test/Cabal/OptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/OptionsSpec.o )
  387. 24.30 s [doctest] [ 8 of 44] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapper.o )
  388. 24.30 s [doctest] [ 9 of 44] Compiling Interpreter ( src/Interpreter.hs, dist/build/spec/spec-tmp/Interpreter.o )
  389. 24.30 s [doctest] [10 of 44] Compiling InterpreterSpec ( test/InterpreterSpec.hs, dist/build/spec/spec-tmp/InterpreterSpec.o )
  390. 24.30 s [doctest] [11 of 44] Compiling Info ( src/Info.hs, dist/build/spec/spec-tmp/Info.o )
  391. 24.30 s [doctest] [12 of 44] Compiling InfoSpec ( test/InfoSpec.hs, dist/build/spec/spec-tmp/InfoSpec.o )
  392. 24.30 s [doctest] [13 of 44] Compiling Cabal ( src/Cabal.hs, dist/build/spec/spec-tmp/Cabal.o )
  393. 24.30 s [doctest] [14 of 44] Compiling Cabal.PathsSpec ( test/Cabal/PathsSpec.hs, dist/build/spec/spec-tmp/Cabal/PathsSpec.o )
  394. 24.30 s [doctest] [15 of 44] Compiling Language.Haskell.GhciWrapperSpec ( test/Language/Haskell/GhciWrapperSpec.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapperSpec.o )
  395. 24.30 s [doctest] [16 of 44] Compiling Location ( src/Location.hs, dist/build/spec/spec-tmp/Location.o )
  396. 24.30 s [doctest] [17 of 44] Compiling LocationSpec ( test/LocationSpec.hs, dist/build/spec/spec-tmp/LocationSpec.o )
  397. 24.30 s [doctest] [18 of 44] Compiling Options ( src/Options.hs, dist/build/spec/spec-tmp/Options.o )
  398. 24.30 s [doctest] [19 of 44] Compiling OptionsSpec ( test/OptionsSpec.hs, dist/build/spec/spec-tmp/OptionsSpec.o )
  399. 24.43 s [doctest] [20 of 44] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/spec/spec-tmp/PackageDBs.o )
  400. 24.43 s [doctest] [21 of 44] Compiling PackageDBsSpec ( test/PackageDBsSpec.hs, dist/build/spec/spec-tmp/PackageDBsSpec.o )
  401. 24.43 s [doctest] [22 of 44] Compiling Paths_doctest ( dist/build/spec/autogen/Paths_doctest.hs, dist/build/spec/spec-tmp/Paths_doctest.o )
  402. 24.43 s [doctest] [23 of 44] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Cabal.o )
  403. 24.43 s [doctest] [24 of 44] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Location.o )
  404. 24.43 s [doctest] [25 of 44] Compiling Util ( src/Util.hs, dist/build/spec/spec-tmp/Util.o )
  405. 24.43 s [doctest] [26 of 44] Compiling Extract ( src/Extract.hs, dist/build/spec/spec-tmp/Extract.o )
  406. 24.43 s [doctest] [27 of 44] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Extract.o )
  407. 24.44 s [doctest] [28 of 44] Compiling Parse ( src/Parse.hs, dist/build/spec/spec-tmp/Parse.o )
  408. 24.59 s [doctest] [29 of 44] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Parse.o )
  409. 24.60 s [doctest] [30 of 44] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/spec/spec-tmp/Runner/Example.o )
  410. 24.80 s [doctest] [31 of 44] Compiling Runner.ExampleSpec ( test/Runner/ExampleSpec.hs, dist/build/spec/spec-tmp/Runner/ExampleSpec.o )
  411. 25.11 s [doctest] [32 of 44] Compiling Property ( src/Property.hs, dist/build/spec/spec-tmp/Property.o )
  412. 25.11 s [doctest] [33 of 44] Compiling Runner ( src/Runner.hs, dist/build/spec/spec-tmp/Runner.o )
  413. 25.11 s [doctest] [34 of 44] Compiling RunnerSpec ( test/RunnerSpec.hs, dist/build/spec/spec-tmp/RunnerSpec.o )
  414. 25.18 s [doctest] [35 of 44] Compiling Run ( src/Run.hs, dist/build/spec/spec-tmp/Run.o )
  415. 25.20 s [doctest] [36 of 44] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Run.o )
  416. 25.21 s [doctest] [37 of 44] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/spec/spec-tmp/Test/DocTest.o )
  417. 25.23 s [doctest] [38 of 44] Compiling RunSpec ( test/RunSpec.hs, dist/build/spec/spec-tmp/RunSpec.o )
  418. 25.49 s [doctest] [39 of 44] Compiling MainSpec ( test/MainSpec.hs, dist/build/spec/spec-tmp/MainSpec.o )
  419. 25.57 s [doctest] [40 of 44] Compiling PropertySpec ( test/PropertySpec.hs, dist/build/spec/spec-tmp/PropertySpec.o )
  420. 25.57 s [doctest] [41 of 44] Compiling ParseSpec ( test/ParseSpec.hs, dist/build/spec/spec-tmp/ParseSpec.o )
  421. 25.57 s [doctest] [42 of 44] Compiling ExtractSpec ( test/ExtractSpec.hs, dist/build/spec/spec-tmp/ExtractSpec.o )
  422. 25.57 s [doctest] [43 of 44] Compiling UtilSpec ( test/UtilSpec.hs, dist/build/spec/spec-tmp/UtilSpec.o )
  423. 25.57 s [doctest] [44 of 44] Compiling Main ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
  424. 26.56 s [doctest] [45 of 45] Linking dist/build/spec/spec
  425. 30.66 s [doctest] Phase: checkPhase
  426. 30.89 s [doctest] Running 1 test suites...
  427. 30.89 s [doctest] Test suite spec: RUNNING...
  428. 30.95 s [doctest]
  429. 30.95 s [doctest] Extract
  430. 30.95 s [doctest] extract
  431. 30.95 s [doctest] extracts documentation for a top-level declaration [✔]
  432. 30.95 s [doctest] extracts documentation from argument list [✔]
  433. 30.96 s [doctest] extracts documentation for a type class function [✔]
  434. 30.98 s [doctest] extracts documentation from the argument list of a type class function [✔]
  435. 31.00 s [doctest] extracts documentation from the module header [✔]
  436. 31.01 s [doctest] extracts documentation from imported modules [✔]
  437. 31.03 s [doctest] extracts documentation from export list [✔]
  438. 31.05 s [doctest] extracts documentation from named chunks [✔]
  439. 31.06 s [doctest] returns docstrings in the same order they appear in the source [✔]
  440. 31.08 s [doctest] extracts $setup code [✔]
  441. 31.10 s [doctest] fails on invalid flags [✔]
  442. 31.10 s [doctest] extract (regression tests)
  443. 31.11 s [doctest] works with infix operators [✔]
  444. 31.12 s [doctest] works with parallel list comprehensions [✔]
  445. 31.14 s [doctest] works with list comprehensions in instance definitions [✔]
  446. 31.16 s [doctest] works with foreign imports [✔]
  447. 31.18 s [doctest] works for rewrite rules [✔]
  448. 31.20 s [doctest] works for rewrite rules with type signatures [✔]
  449. 31.22 s [doctest] strips CR from dos line endings [✔]
  450. 31.24 s [doctest] works with a module that splices in an expression from an other module [✔]
  451. 31.25 s [doctest] works for type families and GHC 7.6.1 [✔]
  452. 31.25 s [doctest] Info
  453. 31.25 s [doctest] formatInfo
  454. 31.30 s [doctest] formats --info output [✔]
  455. 31.30 s [doctest] Interpreter
  456. 31.30 s [doctest] interpreterSupported
  457. 31.33 s [doctest] indicates whether GHCi is supported on current platform [✔]
  458. 31.33 s [doctest] ghcInfo
  459. 31.36 s [doctest] includes "Have interpreter" [✔]
  460. 31.36 s [doctest] safeEval
  461. 31.50 s [doctest] evaluates an expression [✔]
  462. 31.64 s [doctest] returns Left on unterminated multiline command [✔]
  463. 31.64 s [doctest] filterExpression
  464. 31.64 s [doctest] removes :set -XTemplateHaskell [✔]
  465. 31.64 s [doctest] filters -XTemplateHaskell [✔]
  466. 31.64 s [doctest] leaves :set-statement that do not set -XTemplateHaskell alone [✔]
  467. 31.64 s [doctest] Language.Haskell.GhciWrapper
  468. 31.64 s [doctest] evalEcho
  469. 31.79 s [doctest] prints result to stdout [✔]
  470. 31.79 s [doctest] evalWith
  471. 31.79 s [doctest] with PreserveIt
  472. 31.93 s [doctest] preserves it [✔]
  473. 31.93 s [doctest] eval
  474. 32.08 s [doctest] shows literals [✔]
  475. 32.22 s [doctest] shows string literals containing Unicode [✔]
  476. 32.36 s [doctest] evaluates simple expressions [✔]
  477. 32.50 s [doctest] supports let bindings [✔]
  478. 32.65 s [doctest] allows import statements [✔]
  479. 32.79 s [doctest] captures stdout [✔]
  480. 32.92 s [doctest] captures stdout (Unicode) [✔]
  481. 33.08 s [doctest] captures stdout (empty line) [✔]
  482. 33.24 s [doctest] captures stdout (multiple lines) [✔]
  483. 33.43 s [doctest] captures stderr [✔]
  484. 33.60 s [doctest] captures stderr (Unicode) [✔]
  485. 33.78 s [doctest] shows exceptions [✔]
  486. 33.99 s [doctest] shows exceptions (ExitCode) [✔]
  487. 34.20 s [doctest] gives an error message for identifiers that are not in scope [✔]
  488. 34.20 s [doctest] when configVerbose is True
  489. 34.46 s [doctest] prints prompt [✔]
  490. 34.46 s [doctest] with -XOverloadedStrings, -Wall and -Werror
  491. 34.67 s [doctest] does not fail on marker expression (bug fix) [✔]
  492. 34.67 s [doctest] with NoImplicitPrelude
  493. 34.84 s [doctest] works [✔]
  494. 34.84 s [doctest] with a strange String type
  495. 35.02 s [doctest] works [✔]
  496. 35.02 s [doctest] Location
  497. 35.02 s [doctest] toLocation
  498. 35.02 s [doctest] works for a regular SrcSpan [✔]
  499. 35.02 s [doctest] works for a single-line SrcSpan [✔]
  500. 35.02 s [doctest] works for a SrcSpan that corresponds to single point [✔]
  501. 35.02 s [doctest] works for a bad SrcSpan [✔]
  502. 35.02 s [doctest] works for a SrcLoc with bad locations [✔]
  503. 35.02 s [doctest] enumerate
  504. 35.02 s [doctest] replicates UnhelpfulLocation [✔]
  505. 35.02 s [doctest] enumerates Location [✔]
  506. 35.02 s [doctest] Main
  507. 35.02 s [doctest] doctest
  508. 35.26 s [doctest] testSimple [✔]
  509. 35.52 s [doctest] it-variable [✔]
  510. 35.78 s [doctest] it-variable in $setup [✔]
  511. 36.02 s [doctest] failing [✔]
  512. 36.27 s [doctest] skips subsequent examples from the same group if an example fails [✔]
  513. 36.32 s [doctest] without --fail-fast
  514. 36.52 s [doctest] continuous even if some tests fail [✔]
  515. 36.52 s [doctest] with --fail-fast
  516. 36.74 s [doctest] stops after the first failure [✔]
  517. 36.95 s [doctest] stops after failures in $setup [✔]
  518. 37.37 s [doctest] testImport [✔]
  519. 37.64 s [doctest] testCommentLocation [✔]
  520. 37.83 s [doctest] testPutStr [✔]
  521. 38.01 s [doctest] fails on multi-line expressions, introduced with :{ [✔]
  522. 38.22 s [doctest] testBlankline [✔]
  523. 38.43 s [doctest] examples from the same Haddock comment share the same scope [✔]
  524. 38.62 s [doctest] testDocumentationForArguments [✔]
  525. 38.85 s [doctest] template-haskell [✔]
  526. 39.06 s [doctest] handles source files with CRLF line endings [✔]
  527. 39.24 s [doctest] runs $setup before each test group [✔]
  528. 39.42 s [doctest] skips subsequent tests from a module, if $setup fails [✔]
  529. 39.63 s [doctest] ignores trailing whitespace when matching test output [✔]
  530. 39.63 s [doctest] doctest as a runner for QuickCheck properties
  531. 39.88 s [doctest] runs a boolean property [✔]
  532. 40.14 s [doctest] runs an explicitly quantified property [✔]
  533. 40.41 s [doctest] runs an implicitly quantified property [✔]
  534. 40.67 s [doctest] reports a failing property [✔]
  535. 40.91 s [doctest] runs a boolean property with an explicit type signature [✔]
  536. 41.19 s [doctest] runs $setup before each property [✔]
  537. 41.19 s [doctest] doctest (regression tests)
  538. 41.61 s [doctest] bugfixWorkingDirectory [✔]
  539. 41.80 s [doctest] bugfixOutputToStdErr [✔]
  540. 42.00 s [doctest] bugfixImportHierarchical [✔]
  541. 42.20 s [doctest] bugfixMultipleModules [✔]
  542. 42.60 s [doctest] testCPP [✔]
  543. 42.91 s [doctest] template-haskell-bugfix [✔]
  544. 43.07 s [doctest] doesn't clash with user bindings of stdout/stderr [✔]
  545. 43.24 s [doctest] doesn't get confused by doctests using System.IO imports [✔]
  546. 43.24 s [doctest] Options
  547. 43.24 s [doctest] parseOptions
  548. 43.24 s [doctest] strips --optghc [✔]
  549. 43.24 s [doctest] strips --optghc= [✔]
  550. 43.24 s [doctest] with ghc options that are not valid with --interactive
  551. 43.27 s [doctest] returns ProxyToGhc [✔]
  552. 43.27 s [doctest] +++ OK, passed 100 tests.
  553. 43.27 s [doctest] with --interactive
  554. 43.27 s [doctest] disables magic mode [✔]
  555. 43.27 s [doctest] filters out --interactive [✔]
  556. 43.27 s [doctest] accepts --fast [✔]
  557. 43.27 s [doctest] --no-magic
  558. 43.27 s [doctest] without --no-magic
  559. 43.27 s [doctest] enables magic mode [✔]
  560. 43.27 s [doctest] with --no-magic
  561. 43.27 s [doctest] disables magic mode [✔]
  562. 43.27 s [doctest] --fast
  563. 43.27 s [doctest] without --fast
  564. 43.27 s [doctest] disables fast mode [✔]
  565. 43.27 s [doctest] with --fast
  566. 43.27 s [doctest] enables fast mode [✔]
  567. 43.27 s [doctest] --preserve-it
  568. 43.27 s [doctest] without --preserve-it
  569. 43.27 s [doctest] does not preserve the `it` variable [✔]
  570. 43.27 s [doctest] with --preserve-it
  571. 43.27 s [doctest] preserves the `it` variable [✔]
  572. 43.27 s [doctest] --fail-fast
  573. 43.27 s [doctest] without --fail-fast
  574. 43.27 s [doctest] disables fail-fast mode [✔]
  575. 43.27 s [doctest] with --fail-fast
  576. 43.27 s [doctest] enables fail-fast mode [✔]
  577. 43.27 s [doctest] with --help
  578. 43.27 s [doctest] outputs usage information [✔]
  579. 43.27 s [doctest] with --version
  580. 43.27 s [doctest] outputs version information [✔]
  581. 43.27 s [doctest] with --info
  582. 43.30 s [doctest] outputs machine readable version information [✔]
  583. 43.30 s [doctest] --verbose
  584. 43.30 s [doctest] without --verbose
  585. 43.30 s [doctest] is not verbose by default [✔]
  586. 43.30 s [doctest] with --verbose
  587. 43.30 s [doctest] parses verbose option [✔]
  588. 43.30 s [doctest] PackageDBs
  589. 43.30 s [doctest] getPackageDBsFromEnv
  590. 43.30 s [doctest] uses global and user when no env used [✔]
  591. 43.30 s [doctest] respects GHC_PACKAGE_PATH [✔]
  592. 43.30 s [doctest] Parse
  593. 43.30 s [doctest] extractDocTests
  594. 43.31 s [doctest] extracts properties from a module [✔]
  595. 43.32 s [doctest] extracts examples from a module [✔]
  596. 43.34 s [doctest] extracts examples from documentation for non-exported names [✔]
  597. 43.35 s [doctest] extracts multiple examples from a module [✔]
  598. 43.36 s [doctest] returns an empty list, if documentation contains no examples [✔]
  599. 43.38 s [doctest] sets setup code to Nothing, if it does not contain any tests [✔]
  600. 43.39 s [doctest] keeps modules that only contain setup code [✔]
  601. 43.39 s [doctest] parseInteractions (an internal function)
  602. 43.39 s [doctest] parses an interaction [✔]
  603. 43.39 s [doctest] drops whitespace as appropriate [✔]
  604. 43.39 s [doctest] parses an interaction without a result [✔]
  605. 43.39 s [doctest] works with a complex example [✔]
  606. 43.39 s [doctest] attaches location information to parsed interactions [✔]
  607. 43.39 s [doctest] basic multiline [✔]
  608. 43.39 s [doctest] multiline align output [✔]
  609. 43.39 s [doctest] multiline align output with >>> [✔]
  610. 43.39 s [doctest] parses wild cards lines [✔]
  611. 43.39 s [doctest] parses wild card chunks [✔]
  612. 43.39 s [doctest] parseProperties (an internal function)
  613. 43.39 s [doctest] parses a property [✔]
  614. 43.39 s [doctest] mkLineChunks (an internal function)
  615. 43.39 s [doctest] replaces ellipsis with WildCardChunks [✔]
  616. 43.39 s [doctest] doesn't replace fewer than 3 consecutive dots [✔]
  617. 43.39 s [doctest] handles leading and trailing dots [✔]
  618. 43.39 s [doctest] handles leading and trailing ellipsis [✔]
  619. 43.39 s [doctest] Property
  620. 43.39 s [doctest] runProperty
  621. 43.59 s [doctest] reports a failing property [✔]
  622. 43.80 s [doctest] runs a Bool property [✔]
  623. 44.00 s [doctest] runs a Bool property with an explicit type signature [✔]
  624. 44.23 s [doctest] runs an implicitly quantified property [✔]
  625. 44.45 s [doctest] runs an implicitly quantified property even with GHC 7.4 [✔]
  626. 44.69 s [doctest] runs an explicitly quantified property [✔]
  627. 44.90 s [doctest] allows to mix implicit and explicit quantification [✔]
  628. 45.12 s [doctest] reports the value for which a property fails [✔]
  629. 45.33 s [doctest] reports the values for which a property that takes multiple arguments fails [✔]
  630. 45.54 s [doctest] defaults ambiguous type variables to Integer [✔]
  631. 45.54 s [doctest] freeVariables
  632. 45.69 s [doctest] finds a free variables in a term [✔]
  633. 45.83 s [doctest] ignores duplicates [✔]
  634. 45.97 s [doctest] works for terms with multiple names [✔]
  635. 46.11 s [doctest] works for names that contain a prime [✔]
  636. 46.26 s [doctest] works for names that are similar to other names that are in scope [✔]
  637. 46.26 s [doctest] parseNotInScope
  638. 46.26 s [doctest] when error message was produced by GHC 7.4.1
  639. 46.26 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  640. 46.26 s [doctest] ignores duplicates [✔]
  641. 46.26 s [doctest] works for variable names that contain a prime [✔]
  642. 46.26 s [doctest] works for error messages with suggestions [✔]
  643. 46.26 s [doctest] when error message was produced by GHC 8.0.1
  644. 46.26 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  645. 46.26 s [doctest] ignores duplicates [✔]
  646. 46.26 s [doctest] works for variable names that contain a prime [✔]
  647. 46.26 s [doctest] works for error messages with suggestions [✔]
  648. 46.26 s [doctest] Run
  649. 46.26 s [doctest] doctest
  650. 46.48 s [doctest] exits with ExitFailure if at least one test case fails [✔]
  651. 46.48 s [doctest] prints help on --help [✔]
  652. 46.48 s [doctest] prints version on --version [✔]
  653. 46.72 s [doctest] accepts arbitrary GHC options [✔]
  654. 46.94 s [doctest] accepts GHC options with --optghc [✔]
  655. 47.16 s [doctest] prints a deprecation message for --optghc [✔]
  656. 47.21 s [doctest] prints error message on invalid option [✔]
  657. 47.44 s [doctest] interprets GHC response files [✔]
  658. 47.67 s [doctest] prints verbose description of a specification [✔]
  659. 47.94 s [doctest] prints verbose description of a property [✔]
  660. 48.16 s [doctest] prints verbose error [✔]
  661. 48.45 s [doctest] can deal with potentially problematic GHC options [✔]
  662. 48.45 s [doctest] doctestWithResult
  663. 48.45 s [doctest] on parse error
  664. 48.46 s [doctest] aborts with (ExitFailure 1) [✔]
  665. 48.48 s [doctest] prints a useful error message [✔]
  666. 48.48 s [doctest] expandDirs
  667. 48.48 s [doctest] expands a directory [✔]
  668. 48.48 s [doctest] ignores files [✔]
  669. 48.48 s [doctest] ignores random things [✔]
  670. 48.48 s [doctest] Runner
  671. 48.48 s [doctest] report
  672. 48.48 s [doctest] when mode is interactive
  673. 48.48 s [doctest] writes to stderr [✔]
  674. 48.48 s [doctest] when mode is non-interactive
  675. 48.48 s [doctest] writes to stderr [✔]
  676. 48.48 s [doctest] report_
  677. 48.48 s [doctest] when mode is interactive
  678. 48.48 s [doctest] writes transient output to stderr [✔]
  679. 48.48 s [doctest] when mode is non-interactive
  680. 48.48 s [doctest] is ignored [✔]
  681. 48.48 s [doctest] Runner.Example
  682. 48.48 s [doctest] mkResult
  683. 48.52 s [doctest] returns Equal when output matches [✔]
  684. 48.52 s [doctest] +++ OK, passed 100 tests.
  685. 48.52 s [doctest] ignores trailing whitespace [✔]
  686. 48.52 s [doctest] with WildCardLine
  687. 48.52 s [doctest] matches zero lines [✔]
  688. 48.52 s [doctest] matches first zero line [✔]
  689. 48.52 s [doctest] matches final zero line [✔]
  690. 48.52 s [doctest] matches an arbitrary number of lines [✔]
  691. 48.52 s [doctest] matches an arbitrary number of lines (quickcheck) [✔]
  692. 48.52 s [doctest] +++ OK, passed 100 tests.
  693. 48.52 s [doctest] with WildCardChunk
  694. 48.52 s [doctest] matches an arbitrary line chunk [✔]
  695. 48.52 s [doctest] matches an arbitrary line chunk at end [✔]
  696. 48.52 s [doctest] does not match at end [✔]
  697. 48.52 s [doctest] does not match at start [✔]
  698. 48.52 s [doctest] when output does not match
  699. 48.52 s [doctest] constructs failure message [✔]
  700. 48.52 s [doctest] constructs failure message for multi-line output [✔]
  701. 48.52 s [doctest] when any output line contains "unsafe" characters
  702. 48.52 s [doctest] uses show to format output lines [✔]
  703. 48.52 s [doctest] insert caret after last matching character on different lengths [✔]
  704. 48.52 s [doctest] insert caret after mismatching line for multi-line output [✔]
  705. 48.52 s [doctest] insert caret after mismatching line with the longest match for multi-line wildcard pattern [✔]
  706. 48.52 s [doctest] insert caret after longest match for wildcard [✔]
  707. 48.52 s [doctest] show expanded pattern for long matches [✔]
  708. 48.52 s [doctest] Util
  709. 48.52 s [doctest] convertDosLineEndings
  710. 48.52 s [doctest] converts CRLF to LF [✔]
  711. 48.52 s [doctest] strips a trailing CR [✔]
  712. 48.52 s [doctest] takeWhileEnd
  713. 48.52 s [doctest] returns the longest suffix of elements that satisfy a given predicate [✔]
  714. 48.52 s [doctest]
  715. 48.52 s [doctest] Finished in 17.6186 seconds
  716. 48.52 s [doctest] 198 examples, 0 failures
  717. 48.53 s [doctest] Test suite spec: PASS
  718. 48.53 s [doctest] Test suite logged to: dist/test/doctest-0.24.2-spec.log
  719. 48.53 s [doctest] 1 of 1 test suites (1 of 1 test cases) passed.
  720. 48.54 s [doctest] Phase: haddockPhase
  721. 48.65 s [doctest] Preprocessing library for doctest-0.24.2...
  722. 48.65 s [doctest] Running Haddock on library for doctest-0.24.2...
  723. 49.17 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, nothing )
  724. 49.22 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, nothing )
  725. 49.52 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, nothing )
  726. 49.55 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, nothing )
  727. 49.57 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, nothing )
  728. 49.58 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, nothing )
  729. 49.61 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, nothing )
  730. 49.62 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, nothing )
  731. 49.64 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, nothing )
  732. 49.64 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, nothing )
  733. 49.65 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, nothing )
  734. 49.66 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, nothing )
  735. 49.81 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, nothing )
  736. 49.84 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, nothing )
  737. 49.84 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, nothing )
  738. 49.85 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, nothing )
  739. 49.85 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, nothing )
  740. 49.96 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, nothing )
  741. 49.96 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, nothing )
  742. 49.99 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, nothing )
  743. 49.99 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, nothing )
  744. 50.02 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, nothing )
  745. 50.03 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, nothing )
  746. 50.07 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, nothing )
  747. 50.09 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, nothing )
  748. 50.09 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, nothing )
  749. 50.09 s [doctest] Haddock coverage:
  750. 50.09 s [doctest] Warning: Imports: Could not find documentation for exported module: Imports
  751. 50.10 s [doctest] 0% ( 0 / 2) in 'Test.DocTest.Internal.Cabal'
  752. 50.10 s [doctest] Missing documentation for:
  753. 50.10 s [doctest] Module header
  754. 50.10 s [doctest] doctest (src/Test/DocTest/Internal/Cabal.hs:10)
  755. 50.10 s [doctest] 88% ( 8 / 9) in 'Test.DocTest.Internal.Location'
  756. 50.10 s [doctest] Missing documentation for:
  757. 50.10 s [doctest] Module header
  758. 50.10 s [doctest] Warning: 'SomeException' is ambiguous. It is defined
  759. 50.10 s [doctest] * in ‘GHC.Internal.Exception.Type’
  760. 50.10 s [doctest] * in ‘GHC.Internal.Exception.Type’
  761. 50.10 s [doctest] You may be able to disambiguate the identifier by qualifying it or
  762. 50.10 s [doctest] by specifying the type/value namespace explicitly.
  763. 50.10 s [doctest] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  764. 50.10 s [doctest] 66% ( 2 / 3) in 'Test.DocTest.Internal.Extract'
  765. 50.10 s [doctest] Missing documentation for:
  766. 50.10 s [doctest] Module header
  767. 50.10 s [doctest] 22% ( 2 / 9) in 'Test.DocTest.Internal.Parse'
  768. 50.10 s [doctest] Missing documentation for:
  769. 50.10 s [doctest] Module header
  770. 50.10 s [doctest] DocTest (src/Parse.hs:29)
  771. 50.10 s [doctest] Expression (src/Parse.hs:44)
  772. 50.10 s [doctest] ExpectedResult (src/Parse.hs:45)
  773. 50.10 s [doctest] ExpectedLine (src/Parse.hs:38)
  774. 50.10 s [doctest] LineChunk (src/Parse.hs:32)
  775. 50.10 s [doctest] parseModules (src/Parse.hs:60)
  776. 50.10 s [doctest] Warning: 'report_' is out of scope.
  777. 50.10 s [doctest] If you qualify the identifier, haddock can try to link it anyway.
  778. 50.10 s [doctest] 15% ( 2 / 13) in 'Test.DocTest.Internal.Run'
  779. 50.10 s [doctest] Missing documentation for:
  780. 50.10 s [doctest] Module header
  781. 50.10 s [doctest] Result (src/Run.hs:139)
  782. 50.10 s [doctest] Config (src/Options.hs:58)
  783. 50.10 s [doctest] isSuccess (src/Runner.hs:55)
  784. 50.10 s [doctest] defaultConfig (src/Options.hs:68)
  785. 50.10 s [doctest] doctestWithRepl (src/Run.hs:67)
  786. 50.10 s [doctest] doctestWith (src/Run.hs:137)
  787. 50.10 s [doctest] formatSummary (src/Runner.hs:58)
  788. 50.10 s [doctest] evaluateResult (src/Run.hs:142)
  789. 50.10 s [doctest] doctestWithResult (src/Run.hs:145)
  790. 50.10 s [doctest] runDocTests (src/Run.hs:155)
  791. 50.10 s [doctest] 50% ( 1 / 2) in 'Test.DocTest'
  792. 50.10 s [doctest] Missing documentation for:
  793. 50.10 s [doctest] Module header
  794. 59.64 s [doctest] Documentation created: dist/doc/html/doctest/,
  795. 59.64 s [doctest] dist/doc/html/doctest/doctest.txt
  796. 59.70 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2...
  797. 59.70 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2...
  798. 59.71 s [doctest] Phase: installPhase
  799. 59.78 s [doctest] Installing library in /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  800. 59.89 s [doctest] Installing executable doctest in /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin
  801. 59.89 s [doctest] Warning: The directory
  802. 59.89 s [doctest] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin is not in the
  803. 59.89 s [doctest] system search path.
  804. 60.43 s [doctest] Phase: fixupPhase
  805. 60.45 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2
  806. 60.47 s [doctest] shrinking /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSdoctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8-ghc9.10.3.so
  807. 60.48 s [doctest] shrinking /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin/doctest
  808. 60.56 s [doctest] checking for references to /build/ in /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2...
  809. 60.65 s [doctest] patching script interpreter paths in /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2
  810. 60.65 s [doctest] stripping (with command strip and flags -S -p) in /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/lib /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin
  811. 60.86 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc
  812. 60.87 s [doctest] checking for references to /build/ in /nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc...
  813. 60.89 s [doctest] patching script interpreter paths in /nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc
  814. 61.13 s [doctest:post-build] Uploading to cachix cache "sellout": /nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2
  815. 61.72 s [doctest:post-build] Nothing to push - all store paths are already on Cachix.
  816. 61.75 s [doctest:post-build] Uploading to the NixCI cache: /nix/store/5hm8359n4pwznwdj08shagjawjnd7dr0-doctest-0.24.2-doc /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2
  817. 61.85 s [doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  818. 61.99 s [doctest:post-build] copying 1 paths...
  819. 61.99 s [doctest:post-build] copying path '/nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2' to 'https://cache.nix-ci.com'...
  820. 95.07 s [doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  821. 95.26 s [doctest:post-build] copying 0 paths...
  822. 95.37 s Progress: 1 of 18 built, 36 of 36 downloaded from cache
  823. 95.44 s Building /nix/store/6hkrxmy4yj8facxlvn54nrc60rim1h1a-duoids-0.0.1.0.drv
  824. 95.49 s Building /nix/store/w2gq8i6jvy0bi4cr65w2d8m4sg7l6qnf-vector-0.13.2.0.drv
  825. 95.55 s [duoids] Phase: setupCompilerEnvironmentPhase
  826. 95.55 s [duoids] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  827. 95.64 s [vector] Phase: setupCompilerEnvironmentPhase
  828. 95.64 s [vector] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  829. 95.80 s [duoids] Phase: unpackPhase
  830. 95.80 s [duoids] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./core
  831. 95.81 s [duoids] source root is core
  832. 95.83 s [duoids] Phase: patchPhase
  833. 95.84 s [duoids] Phase: compileBuildDriverPhase
  834. 95.84 s [duoids] setupCompileFlags: -package-db=/build/tmp.OxSekIAe0q/setup-package.conf.d -threaded
  835. 95.93 s [vector] Phase: unpackPhase
  836. 95.93 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  837. 95.94 s [vector] source root is vector-0.13.2.0
  838. 95.94 s [duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.OxSekIAe0q/Main.o )
  839. 95.95 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  840. 95.96 s [vector] Phase: patchPhase
  841. 95.96 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/2.cabal.
  842. 95.97 s [vector] Run jailbreak-cabal to lift version restrictions on build inputs.
  843. 95.99 s [vector] Phase: compileBuildDriverPhase
  844. 96.00 s [vector] setupCompileFlags: -package-db=/build/tmp.YWk2VslZXo/setup-package.conf.d -threaded
  845. 96.03 s [duoids] [2 of 2] Linking Setup
  846. 96.08 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.YWk2VslZXo/Main.o )
  847. 96.17 s [vector] [2 of 2] Linking Setup
  848. 98.08 s [duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  849. 98.10 s [duoids] Phase: configurePhase
  850. 98.11 s [duoids] configureFlags: --verbose --prefix=/nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.OxSekIAe0q/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/lib
  851. 98.13 s [duoids] Using Parsec parser
  852. 98.13 s [duoids] Configuring duoids-0.0.1.0...
  853. 98.24 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  854. 98.25 s [vector] Phase: configurePhase
  855. 98.26 s [vector] configureFlags: --verbose --prefix=/nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.YWk2VslZXo/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/lib
  856. 98.29 s [vector] Using Parsec parser
  857. 98.29 s [vector] Configuring vector-0.13.2.0...
  858. 98.61 s [duoids] Flags chosen: lint=False, noisy-deprecations=True
  859. 98.74 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  860. 98.74 s [vector] wall=False
  861. 99.03 s [duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  862. 99.03 s [duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  863. 99.03 s [duoids] <4.23: using base-4.20.2.0
  864. 99.03 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  865. 99.03 s [duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  866. 99.03 s [duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  867. 99.03 s [duoids] <4.23: using base-4.20.2.0
  868. 99.03 s [duoids] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  869. 99.03 s [duoids] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  870. 99.03 s [duoids] doctest-0.24.2
  871. 99.03 s [duoids] Dependency duoids: using duoids-0.0.1.0
  872. 99.03 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  873. 99.03 s [duoids] Source component graph:
  874. 99.03 s [duoids] component lib
  875. 99.03 s [duoids] component test:doctests dependency lib
  876. 99.03 s [duoids] Configured component graph:
  877. 99.04 s [duoids] component duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  878. 99.04 s [duoids] include base-4.20.2.0-64da
  879. 99.04 s [duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  880. 99.04 s [duoids] component duoids-0.0.1.0-EnXTH3qCR9Q7DYYsKRHADF-doctests
  881. 99.04 s [duoids] include base-4.20.2.0-64da
  882. 99.04 s [duoids] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  883. 99.04 s [duoids] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  884. 99.04 s [duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  885. 99.04 s [duoids] Linked component graph:
  886. 99.04 s [duoids] unit duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  887. 99.04 s [duoids] include base-4.20.2.0-64da
  888. 99.04 s [duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  889. 99.04 s [duoids] Control.Duoidal=duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4:Control.Duoidal,Control.Duoidal.Either=duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4:Control.Duoidal.Either,Control.Duoidal.Laws=duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4:Data.Duoid.Laws
  890. 99.04 s [duoids] unit duoids-0.0.1.0-EnXTH3qCR9Q7DYYsKRHADF-doctests
  891. 99.04 s [duoids] include base-4.20.2.0-64da
  892. 99.04 s [duoids] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  893. 99.04 s [duoids] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  894. 99.04 s [duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  895. 99.04 s [duoids] Ready component graph:
  896. 99.04 s [duoids] definite duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  897. 99.04 s [duoids] depends base-4.20.2.0-64da
  898. 99.04 s [duoids] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  899. 99.04 s [duoids] definite duoids-0.0.1.0-EnXTH3qCR9Q7DYYsKRHADF-doctests
  900. 99.04 s [duoids] depends base-4.20.2.0-64da
  901. 99.04 s [duoids] depends doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  902. 99.04 s [duoids] depends duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  903. 99.04 s [duoids] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  904. 99.04 s [duoids] Using Cabal-3.12.1.0 compiled by ghc-9.10
  905. 99.04 s [duoids] Using compiler: ghc-9.10.3
  906. 99.04 s [duoids] Using install prefix:
  907. 99.04 s [duoids] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0
  908. 99.04 s [duoids] Executables installed in:
  909. 99.04 s [duoids] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/bin
  910. 99.04 s [duoids] Libraries installed in:
  911. 99.04 s [duoids] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  912. 99.04 s [duoids] Dynamic Libraries installed in:
  913. 99.04 s [duoids] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  914. 99.04 s [duoids] Private executables installed in:
  915. 99.04 s [duoids] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-05f6/duoids-0.0.1.0
  916. 99.04 s [duoids] Data files installed in:
  917. 99.04 s [duoids] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/share/x86_64-linux-ghc-9.10.3-05f6/duoids-0.0.1.0
  918. 99.04 s [duoids] Documentation installed in:
  919. 99.04 s [duoids] /nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
  920. 99.04 s [duoids] Configuration files installed in:
  921. 99.04 s [duoids] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/etc
  922. 99.04 s [duoids] No alex found
  923. 99.04 s [duoids] Using ar found on system at:
  924. 99.04 s [duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  925. 99.04 s [duoids] No c2hs found
  926. 99.04 s [duoids] No cpphs found
  927. 99.04 s [duoids] Using doctest version 0.24.2 found on system at:
  928. 99.04 s [duoids] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin/doctest
  929. 99.04 s [duoids] Using gcc version 14.3.0 given by user at:
  930. 99.04 s [duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  931. 99.04 s [duoids] Using ghc version 9.10.3 found on system at:
  932. 99.04 s [duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  933. 99.04 s [duoids] Using ghc-pkg version 9.10.3 found on system at:
  934. 99.04 s [duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  935. 99.04 s [duoids] No ghcjs found
  936. 99.04 s [duoids] No ghcjs-pkg found
  937. 99.04 s [duoids] No greencard found
  938. 99.04 s [duoids] Using haddock version 2.31.1 found on system at:
  939. 99.04 s [duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  940. 99.04 s [duoids] No happy found
  941. 99.04 s [duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  942. 99.04 s [duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  943. 99.04 s [duoids] No hmake found
  944. 99.04 s [duoids] Using hpc version 0.69 found on system at:
  945. 99.04 s [duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  946. 99.04 s [duoids] Using hsc2hs version 0.68.10 found on system at:
  947. 99.04 s [duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  948. 99.04 s [duoids] Using hscolour version 1.25 found on system at:
  949. 99.04 s [duoids] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  950. 99.04 s [duoids] No jhc found
  951. 99.04 s [duoids] Using ld found on system at:
  952. 99.04 s [duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  953. 99.04 s [duoids] No pkg-config found
  954. 99.04 s [duoids] Using runghc version 9.10.3 found on system at:
  955. 99.04 s [duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  956. 99.04 s [duoids] Using strip version 2.44 found on system at:
  957. 99.04 s [duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  958. 99.04 s [duoids] Using tar found on system at:
  959. 99.04 s [duoids] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  960. 99.04 s [duoids] No uhc found
  961. 99.13 s [vector] Dependency base: using base-4.20.2.0
  962. 99.13 s [vector] Dependency deepseq: using deepseq-1.5.0.0
  963. 99.13 s [vector] Dependency primitive: using primitive-0.9.1.0
  964. 99.13 s [vector] Dependency vector-stream: using vector-stream-0.1.0.1
  965. 99.13 s [vector] Dependency base: using base-4.20.2.0
  966. 99.13 s [vector] Dependency random: using random-1.2.1.3
  967. 99.13 s [vector] Dependency tasty: using tasty-1.5.3
  968. 99.13 s [vector] Dependency vector: using vector-0.13.2.0
  969. 99.13 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  970. 99.13 s [vector] Dependency base: using base-4.20.2.0
  971. 99.13 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  972. 99.13 s [vector] Dependency primitive: using primitive-0.9.1.0
  973. 99.13 s [vector] Dependency random: using random-1.2.1.3
  974. 99.13 s [vector] Dependency tasty: using tasty-1.5.3
  975. 99.13 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  976. 99.13 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  977. 99.13 s [vector] Dependency template-haskell: using template-haskell-2.22.0.0
  978. 99.13 s [vector] Dependency transformers: using transformers-0.6.1.1
  979. 99.13 s [vector] Dependency vector: using vector-0.13.2.0
  980. 99.13 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  981. 99.13 s [vector] Dependency base: using base-4.20.2.0
  982. 99.13 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  983. 99.13 s [vector] Dependency primitive: using primitive-0.9.1.0
  984. 99.13 s [vector] Dependency random: using random-1.2.1.3
  985. 99.13 s [vector] Dependency tasty: using tasty-1.5.3
  986. 99.13 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  987. 99.13 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  988. 99.13 s [vector] Dependency template-haskell: using template-haskell-2.22.0.0
  989. 99.13 s [vector] Dependency transformers: using transformers-0.6.1.1
  990. 99.13 s [vector] Dependency vector: using vector-0.13.2.0
  991. 99.13 s [vector] Dependency base: using base-4.20.2.0
  992. 99.13 s [vector] Dependency doctest: using doctest-0.24.2
  993. 99.13 s [vector] Dependency primitive: using primitive-0.9.1.0
  994. 99.13 s [vector] Dependency vector: using vector-0.13.2.0
  995. 99.13 s [vector] Dependency base: using base-4.20.2.0
  996. 99.13 s [vector] Dependency primitive: using primitive-0.9.1.0
  997. 99.13 s [vector] Dependency tasty: using tasty-1.5.3
  998. 99.13 s [vector] Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
  999. 99.13 s [vector] Dependency vector: using vector-0.13.2.0
  1000. 99.13 s [vector] Source component graph:
  1001. 99.13 s [vector] component lib
  1002. 99.13 s [vector] component lib:benchmarks-O2 dependency lib
  1003. 99.13 s [vector] component test:vector-doctest dependency lib
  1004. 99.13 s [vector] component test:vector-inspection dependency lib
  1005. 99.13 s [vector] component test:vector-tests-O0 dependency lib
  1006. 99.13 s [vector] component test:vector-tests-O2 dependency lib
  1007. 99.13 s [vector] Configured component graph:
  1008. 99.13 s [vector] component vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1009. 99.13 s [vector] include base-4.20.2.0-64da
  1010. 99.13 s [vector] include deepseq-1.5.0.0-9a2c
  1011. 99.13 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1012. 99.13 s [vector] include vector-stream-0.1.0.1-itT1vUTIBQHCSMVqGEqOG
  1013. 99.13 s [vector] component vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2
  1014. 99.13 s [vector] include base-4.20.2.0-64da
  1015. 99.13 s [vector] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1016. 99.13 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1017. 99.13 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1018. 99.13 s [vector] component vector-0.13.2.0-EnRUp7R9xm43Cm9n0bdp6H-vector-doctest
  1019. 99.13 s [vector] include base-4.20.2.0-64da
  1020. 99.13 s [vector] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1021. 99.13 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1022. 99.13 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1023. 99.13 s [vector] component vector-0.13.2.0-620zwB5ek2s4PoiwQdsE4k-vector-inspection
  1024. 99.13 s [vector] include base-4.20.2.0-64da
  1025. 99.13 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1026. 99.13 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1027. 99.13 s [vector] include tasty-inspection-testing-0.2.1-1mW6bnKI6ZeJ0lgAunhsnE
  1028. 99.13 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1029. 99.13 s [vector] component vector-0.13.2.0-K8Rhp60DJrJ8B7TnxokOfc-vector-tests-O0
  1030. 99.13 s [vector] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1031. 99.13 s [vector] include base-4.20.2.0-64da
  1032. 99.13 s [vector] include base-orphans-0.9.3-D1WE1j2zvdCLL4qfcorbYm
  1033. 99.13 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1034. 99.13 s [vector] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1035. 99.13 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1036. 99.13 s [vector] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  1037. 99.13 s [vector] include tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  1038. 99.13 s [vector] include template-haskell-2.22.0.0-09e7
  1039. 99.13 s [vector] include transformers-0.6.1.1-6a26
  1040. 99.13 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1041. 99.13 s [vector] component vector-0.13.2.0-9Jfj4Iin60i4uaUUiYjW89-vector-tests-O2
  1042. 99.13 s [vector] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1043. 99.13 s [vector] include base-4.20.2.0-64da
  1044. 99.13 s [vector] include base-orphans-0.9.3-D1WE1j2zvdCLL4qfcorbYm
  1045. 99.13 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1046. 99.13 s [vector] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1047. 99.13 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1048. 99.13 s [vector] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  1049. 99.13 s [vector] include tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  1050. 99.13 s [vector] include template-haskell-2.22.0.0-09e7
  1051. 99.13 s [vector] include transformers-0.6.1.1-6a26
  1052. 99.13 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1053. 99.13 s [vector] Linked component graph:
  1054. 99.13 s [vector] unit vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1055. 99.13 s [vector] include base-4.20.2.0-64da
  1056. 99.14 s [vector] include deepseq-1.5.0.0-9a2c
  1057. 99.14 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1058. 99.14 s [vector] include vector-stream-0.1.0.1-itT1vUTIBQHCSMVqGEqOG
  1059. 99.14 s [vector] Data.Vector=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a:Data.Vector.Unboxed.Mutable
  1060. 99.14 s [vector] unit vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2
  1061. 99.14 s [vector] include base-4.20.2.0-64da
  1062. 99.14 s [vector] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1063. 99.14 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1064. 99.14 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1065. 99.16 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2:Bench.Vector.TestData.ParenTree
  1066. 99.16 s [vector] unit vector-0.13.2.0-EnRUp7R9xm43Cm9n0bdp6H-vector-doctest
  1067. 99.16 s [vector] include base-4.20.2.0-64da
  1068. 99.16 s [vector] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1069. 99.16 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1070. 99.16 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1071. 99.16 s [vector] unit vector-0.13.2.0-620zwB5ek2s4PoiwQdsE4k-vector-inspection
  1072. 99.16 s [vector] include base-4.20.2.0-64da
  1073. 99.16 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1074. 99.16 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1075. 99.16 s [vector] include tasty-inspection-testing-0.2.1-1mW6bnKI6ZeJ0lgAunhsnE
  1076. 99.16 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1077. 99.16 s [vector] unit vector-0.13.2.0-K8Rhp60DJrJ8B7TnxokOfc-vector-tests-O0
  1078. 99.16 s [vector] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1079. 99.16 s [vector] include base-4.20.2.0-64da
  1080. 99.16 s [vector] include base-orphans-0.9.3-D1WE1j2zvdCLL4qfcorbYm
  1081. 99.16 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1082. 99.16 s [vector] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1083. 99.16 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1084. 99.16 s [vector] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  1085. 99.16 s [vector] include tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  1086. 99.16 s [vector] include template-haskell-2.22.0.0-09e7
  1087. 99.16 s [vector] include transformers-0.6.1.1-6a26
  1088. 99.16 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1089. 99.16 s [vector] unit vector-0.13.2.0-9Jfj4Iin60i4uaUUiYjW89-vector-tests-O2
  1090. 99.16 s [vector] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1091. 99.16 s [vector] include base-4.20.2.0-64da
  1092. 99.16 s [vector] include base-orphans-0.9.3-D1WE1j2zvdCLL4qfcorbYm
  1093. 99.16 s [vector] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1094. 99.16 s [vector] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1095. 99.16 s [vector] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1096. 99.16 s [vector] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  1097. 99.16 s [vector] include tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  1098. 99.16 s [vector] include template-haskell-2.22.0.0-09e7
  1099. 99.16 s [vector] include transformers-0.6.1.1-6a26
  1100. 99.16 s [vector] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1101. 99.16 s [vector] Ready component graph:
  1102. 99.17 s [vector] definite vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1103. 99.17 s [vector] depends base-4.20.2.0-64da
  1104. 99.17 s [vector] depends deepseq-1.5.0.0-9a2c
  1105. 99.17 s [vector] depends primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1106. 99.17 s [vector] depends vector-stream-0.1.0.1-itT1vUTIBQHCSMVqGEqOG
  1107. 99.17 s [vector] definite vector-0.13.2.0-K8Rhp60DJrJ8B7TnxokOfc-vector-tests-O0
  1108. 99.17 s [vector] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1109. 99.17 s [vector] depends base-4.20.2.0-64da
  1110. 99.17 s [vector] depends base-orphans-0.9.3-D1WE1j2zvdCLL4qfcorbYm
  1111. 99.17 s [vector] depends primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1112. 99.17 s [vector] depends random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1113. 99.17 s [vector] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1114. 99.17 s [vector] depends tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  1115. 99.17 s [vector] depends tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  1116. 99.17 s [vector] depends template-haskell-2.22.0.0-09e7
  1117. 99.17 s [vector] depends transformers-0.6.1.1-6a26
  1118. 99.17 s [vector] depends vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1119. 99.17 s [vector] definite vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2
  1120. 99.17 s [vector] depends base-4.20.2.0-64da
  1121. 99.17 s [vector] depends random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1122. 99.17 s [vector] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1123. 99.17 s [vector] depends vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1124. 99.17 s [vector] definite vector-0.13.2.0-EnRUp7R9xm43Cm9n0bdp6H-vector-doctest
  1125. 99.17 s [vector] depends base-4.20.2.0-64da
  1126. 99.17 s [vector] depends doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1127. 99.17 s [vector] depends primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1128. 99.17 s [vector] depends vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1129. 99.17 s [vector] definite vector-0.13.2.0-9Jfj4Iin60i4uaUUiYjW89-vector-tests-O2
  1130. 99.17 s [vector] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  1131. 99.17 s [vector] depends base-4.20.2.0-64da
  1132. 99.17 s [vector] depends base-orphans-0.9.3-D1WE1j2zvdCLL4qfcorbYm
  1133. 99.17 s [vector] depends primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1134. 99.17 s [vector] depends random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  1135. 99.17 s [vector] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1136. 99.17 s [vector] depends tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  1137. 99.17 s [vector] depends tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  1138. 99.17 s [vector] depends template-haskell-2.22.0.0-09e7
  1139. 99.17 s [vector] depends transformers-0.6.1.1-6a26
  1140. 99.17 s [vector] depends vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1141. 99.17 s [vector] definite vector-0.13.2.0-620zwB5ek2s4PoiwQdsE4k-vector-inspection
  1142. 99.17 s [vector] depends base-4.20.2.0-64da
  1143. 99.17 s [vector] depends primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  1144. 99.17 s [vector] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  1145. 99.17 s [vector] depends tasty-inspection-testing-0.2.1-1mW6bnKI6ZeJ0lgAunhsnE
  1146. 99.17 s [vector] depends vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1147. 99.17 s [vector] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1148. 99.17 s [vector] Using compiler: ghc-9.10.3
  1149. 99.17 s [vector] Using install prefix:
  1150. 99.17 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0
  1151. 99.17 s [vector] Executables installed in:
  1152. 99.17 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/bin
  1153. 99.17 s [vector] Libraries installed in:
  1154. 99.17 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  1155. 99.17 s [vector] Dynamic Libraries installed in:
  1156. 99.17 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  1157. 99.17 s [vector] Private executables installed in:
  1158. 99.17 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.10.3-05f6/vector-0.13.2.0
  1159. 99.17 s [vector] Data files installed in:
  1160. 99.17 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/share/x86_64-linux-ghc-9.10.3-05f6/vector-0.13.2.0
  1161. 99.17 s [vector] Documentation installed in:
  1162. 99.17 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.10.3-05f6/vector-0.13.2.0
  1163. 99.17 s [vector] Configuration files installed in:
  1164. 99.17 s [vector] /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/etc
  1165. 99.17 s [vector] No alex found
  1166. 99.17 s [vector] Using ar found on system at:
  1167. 99.17 s [vector] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  1168. 99.17 s [vector] No c2hs found
  1169. 99.17 s [vector] No cpphs found
  1170. 99.17 s [vector] Using doctest version 0.24.2 found on system at:
  1171. 99.17 s [vector] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin/doctest
  1172. 99.17 s [vector] Using gcc version 14.3.0 given by user at:
  1173. 99.17 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  1174. 99.17 s [vector] Using ghc version 9.10.3 found on system at:
  1175. 99.17 s [vector] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  1176. 99.17 s [vector] Using ghc-pkg version 9.10.3 found on system at:
  1177. 99.17 s [vector] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  1178. 99.17 s [vector] No ghcjs found
  1179. 99.17 s [vector] No ghcjs-pkg found
  1180. 99.17 s [vector] No greencard found
  1181. 99.17 s [vector] Using haddock version 2.31.1 found on system at:
  1182. 99.17 s [vector] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  1183. 99.17 s [vector] No happy found
  1184. 99.17 s [vector] Using haskell-suite found on system at: haskell-suite-dummy-location
  1185. 99.17 s [vector] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1186. 99.17 s [vector] No hmake found
  1187. 99.17 s [vector] Using hpc version 0.69 found on system at:
  1188. 99.17 s [vector] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  1189. 99.17 s [vector] Using hsc2hs version 0.68.10 found on system at:
  1190. 99.17 s [vector] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  1191. 99.17 s [vector] Using hscolour version 1.25 found on system at:
  1192. 99.17 s [vector] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  1193. 99.17 s [vector] No jhc found
  1194. 99.17 s [vector] Using ld found on system at:
  1195. 99.17 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  1196. 99.17 s [vector] No pkg-config found
  1197. 99.17 s [vector] Using runghc version 9.10.3 found on system at:
  1198. 99.17 s [vector] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  1199. 99.17 s [vector] Using strip version 2.44 found on system at:
  1200. 99.17 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  1201. 99.17 s [vector] Using tar found on system at:
  1202. 99.17 s [vector] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  1203. 99.17 s [vector] No uhc found
  1204. 99.27 s [duoids] Phase: buildPhase
  1205. 99.34 s [duoids] Preprocessing library for duoids-0.0.1.0...
  1206. 99.34 s [duoids] Building library for duoids-0.0.1.0...
  1207. 99.44 s [vector] Phase: buildPhase
  1208. 99.50 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.o, dist/build/Control/Duoidal/Async.dyn_o )
  1209. 99.52 s [vector] Preprocessing library for vector-0.13.2.0...
  1210. 99.52 s [vector] Building library for vector-0.13.2.0...
  1211. 100.11 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
  1212. 100.28 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 )
  1213. 100.28 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 )
  1214. 100.28 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 )
  1215. 100.51 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 )
  1216. 100.51 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 )
  1217. 100.51 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 )
  1218. 100.51 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 )
  1219. 101.92 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
  1220. 104.85 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.o, dist/build/Control/Duoidal/Either.dyn_o )
  1221. 104.92 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.o, dist/build/Data/Duoid/Laws.dyn_o )
  1222. 104.92 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.o, dist/build/Control/Duoidal/Laws.dyn_o )
  1223. 105.47 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
  1224. 106.44 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
  1225. 108.13 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 )
  1226. 108.43 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
  1227. 110.69 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
  1228. 110.87 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
  1229. 110.87 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
  1230. 111.45 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 )
  1231. 113.98 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  1232. 113.98 s [duoids] Building test suite 'doctests' for duoids-0.0.1.0...
  1233. 114.09 s [duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1234. 114.53 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 )
  1235. 114.55 s [duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1236. 115.03 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 )
  1237. 115.29 s [duoids] [3 of 3] Linking dist/build/doctests/doctests
  1238. 121.00 s [duoids] Phase: checkPhase
  1239. 121.32 s [duoids] Running 1 test suites...
  1240. 121.32 s [duoids] Test suite doctests: RUNNING...
  1241. 121.88 s [duoids] on the commandline: warning: [GHC-98887]
  1242. 121.88 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1243. 121.88 s [duoids]
  1244. 121.89 s [duoids] on the commandline: warning: [GHC-98887]
  1245. 121.89 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1246. 121.89 s [duoids]
  1247. 121.89 s [duoids] on the commandline: warning: [GHC-98887]
  1248. 121.89 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1249. 121.89 s [duoids]
  1250. 121.89 s [duoids] on the commandline: warning: [GHC-98887]
  1251. 121.89 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1252. 121.89 s [duoids]
  1253. 121.89 s [duoids] on the commandline: warning: [GHC-98887]
  1254. 121.89 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1255. 121.89 s [duoids]
  1256. 121.89 s [duoids] on the commandline: warning: [GHC-98887]
  1257. 121.89 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1258. 121.89 s [duoids]
  1259. 121.89 s [duoids] on the commandline: warning: [GHC-98887]
  1260. 121.89 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1261. 121.89 s [duoids]
  1262. 121.90 s [duoids] on the commandline: warning: [GHC-98887]
  1263. 121.90 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1264. 121.90 s [duoids]
  1265. 121.90 s [duoids] on the commandline: warning: [GHC-98887]
  1266. 121.90 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1267. 121.90 s [duoids]
  1268. 121.90 s [duoids] on the commandline: warning: [GHC-98887]
  1269. 121.90 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1270. 121.90 s [duoids]
  1271. 123.69 s [duoids] Examples: 5 Tried: 5 Errors: 0 Failures: 0
  1272. 123.76 s [duoids] NameLib Nothing
  1273. 123.76 s [duoids] ----------------------------------------
  1274. 123.79 s [duoids] Test suite doctests: PASS
  1275. 123.79 s [duoids] Test suite logged to: dist/test/duoids-0.0.1.0-doctests.log
  1276. 123.79 s [duoids] 1 of 1 test suites (1 of 1 test cases) passed.
  1277. 123.79 s [duoids] Phase: haddockPhase
  1278. 124.08 s [duoids] Preprocessing library for duoids-0.0.1.0...
  1279. 124.08 s [duoids] Running Haddock on library for duoids-0.0.1.0...
  1280. 124.72 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, nothing )
  1281. 125.20 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, nothing )
  1282. 125.81 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, nothing )
  1283. 125.97 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 )
  1284. 125.97 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  1285. 126.67 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, nothing )
  1286. 126.71 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, nothing )
  1287. 126.72 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, nothing )
  1288. 126.75 s [duoids] Haddock coverage:
  1289. 126.75 s [duoids] Warning: 'cancel' is out of scope.
  1290. 126.75 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1291. 126.75 s [duoids] Warning: 'Applicative' is out of scope.
  1292. 126.75 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1293. 126.75 s [duoids] Warning: 'Alternative' is out of scope.
  1294. 126.75 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1295. 126.76 s [duoids] Warning: 'Par' is ambiguous. It is defined
  1296. 126.76 s [duoids] * at src/Data/Duoid.hs:62:5
  1297. 126.76 s [duoids] * at src/Data/Duoid.hs:58:1
  1298. 126.76 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1299. 126.76 s [duoids] by specifying the type/value namespace explicitly.
  1300. 126.76 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:58:1
  1301. 126.76 s [duoids] Warning: 'Seq' is ambiguous. It is defined
  1302. 126.76 s [duoids] * at src/Data/Duoid.hs:118:5
  1303. 126.76 s [duoids] * at src/Data/Duoid.hs:114:1
  1304. 126.76 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1305. 126.76 s [duoids] by specifying the type/value namespace explicitly.
  1306. 126.76 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:114:1
  1307. 126.76 s [duoids] 100% ( 10 / 10) in 'Data.Duoid'
  1308. 126.76 s [duoids] Warning: 'ExceptT' is out of scope.
  1309. 126.76 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1310. 126.76 s [duoids] Warning: 'Parallel' is ambiguous. It is defined
  1311. 126.76 s [duoids] * at src/Control/Duoidal.hs:238:5
  1312. 126.76 s [duoids] * at src/Control/Duoidal.hs:234:1
  1313. 126.76 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1314. 126.76 s [duoids] by specifying the type/value namespace explicitly.
  1315. 126.76 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:234:1
  1316. 126.76 s [duoids] Warning: 'Sequential' is ambiguous. It is defined
  1317. 126.76 s [duoids] * at src/Control/Duoidal.hs:308:5
  1318. 126.76 s [duoids] * at src/Control/Duoidal.hs:304:1
  1319. 126.76 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1320. 126.76 s [duoids] by specifying the type/value namespace explicitly.
  1321. 126.76 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:304:1
  1322. 126.76 s [duoids] Warning: 'NoDefaultPrelude' is out of scope.
  1323. 126.76 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1324. 126.76 s [duoids] Warning: 'Validation' is out of scope.
  1325. 126.76 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1326. 126.76 s [duoids] Warning: 'fail' is out of scope.
  1327. 126.76 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1328. 126.76 s [duoids] Warning: 'MonadFail' is out of scope.
  1329. 126.76 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1330. 126.76 s [duoids] Warning: 'Commutative' is ambiguous. It is defined
  1331. 126.76 s [duoids] * at src/Control/Duoidal.hs:774:5
  1332. 126.76 s [duoids] * at src/Control/Duoidal.hs:770:1
  1333. 126.76 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1334. 126.76 s [duoids] by specifying the type/value namespace explicitly.
  1335. 126.76 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:770:1
  1336. 126.76 s [duoids] Warning: 'Writer' is out of scope.
  1337. 126.76 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1338. 126.76 s [duoids] Warning: 'Set' is out of scope.
  1339. 126.76 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1340. 126.76 s [duoids] Warning: 'Char' is out of scope.
  1341. 126.76 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1342. 126.77 s [duoids] Warning: 'Const' is ambiguous. It is defined
  1343. 126.77 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  1344. 126.77 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  1345. 126.77 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1346. 126.77 s [duoids] by specifying the type/value namespace explicitly.
  1347. 126.77 s [duoids] Defaulting to the one defined in ‘GHC.Internal.Data.Functor.Const’
  1348. 126.77 s [duoids] Warning: 'Normal' is ambiguous. It is defined
  1349. 126.77 s [duoids] * at src/Control/Duoidal.hs:395:1
  1350. 126.77 s [duoids] * at src/Data/Duoid.hs:183:1
  1351. 126.77 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1352. 126.77 s [duoids] by specifying the type/value namespace explicitly.
  1353. 126.77 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:183:1
  1354. 126.78 s [duoids] 100% ( 60 / 60) in 'Control.Duoidal'
  1355. 126.78 s [duoids] 100% ( 2 / 2) in 'Control.Duoidal.Either'
  1356. 126.78 s [duoids] Warning: 'Normal' is out of scope.
  1357. 126.78 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1358. 126.78 s [duoids] Warning: 'Law' is ambiguous. It is defined
  1359. 126.78 s [duoids] * at src/Data/Duoid/Laws.hs:38:5
  1360. 126.78 s [duoids] * at src/Data/Duoid/Laws.hs:34:1
  1361. 126.78 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1362. 126.78 s [duoids] by specifying the type/value namespace explicitly.
  1363. 126.78 s [duoids] Defaulting to the one defined at src/Data/Duoid/Laws.hs:34:1
  1364. 126.79 s [duoids] 100% ( 12 / 12) in 'Data.Duoid.Laws'
  1365. 126.79 s [duoids] 100% ( 6 / 6) in 'Control.Duoidal.Laws'
  1366. 127.10 s [duoids] Warning: Data.Duoid: could not find link destinations for:
  1367. 127.10 s [duoids] - Data.Duoid.Rep_Comm
  1368. 127.10 s [duoids] - Data.Duoid.Rep1_Comm
  1369. 127.10 s [duoids] - Data.Duoid.Rep_Seq
  1370. 127.10 s [duoids] - Data.Duoid.Rep1_Seq
  1371. 127.10 s [duoids] - Data.Duoid.Rep_Par
  1372. 127.10 s [duoids] - Data.Duoid.Rep1_Par
  1373. 127.13 s [duoids] Warning: Control.Duoidal: could not find link destinations for:
  1374. 127.13 s [duoids] - Control.Duoidal.Rep_Commutative
  1375. 127.13 s [duoids] - Control.Duoidal.Rep1_Commutative
  1376. 127.13 s [duoids] - Control.Duoidal.Rep_Sequential
  1377. 127.13 s [duoids] - Control.Duoidal.Rep1_Sequential
  1378. 127.13 s [duoids] - Control.Duoidal.Rep_Parallel
  1379. 127.13 s [duoids] - Control.Duoidal.Rep1_Parallel
  1380. 127.13 s [duoids] Warning: Data.Duoid.Laws: could not find link destinations for:
  1381. 127.13 s [duoids] - Data.Duoid.Laws.Rep_NormalLaws
  1382. 127.13 s [duoids] - Data.Duoid.Laws.Rep1_NormalLaws
  1383. 127.13 s [duoids] - Data.Duoid.Laws.Rep_Laws
  1384. 127.13 s [duoids] - Data.Duoid.Laws.Rep_Law
  1385. 136.19 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.o, dist/build/Data/Vector/Primitive/Mutable.dyn_o )
  1386. 136.23 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.o, dist/build/Data/Vector/Primitive.dyn_o )
  1387. 136.23 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.o, dist/build/Data/Vector/Storable/Internal.dyn_o )
  1388. 136.23 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.o, dist/build/Data/Vector/Storable/Mutable.dyn_o )
  1389. 136.23 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.o, dist/build/Data/Vector/Storable.dyn_o )
  1390. 136.70 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 )
  1391. 136.70 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 )
  1392. 141.24 s [duoids] Documentation created: dist/doc/html/duoids/, dist/doc/html/duoids/duoids.txt
  1393. 141.45 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  1394. 141.63 s [duoids] Phase: installPhase
  1395. 142.00 s [duoids] Installing library in /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1396. 142.78 s [duoids] Phase: fixupPhase
  1397. 142.88 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0
  1398. 142.89 s [duoids] shrinking /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSduoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4-ghc9.10.3.so
  1399. 143.02 s [duoids] checking for references to /build/ in /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0...
  1400. 143.06 s [duoids] patching script interpreter paths in /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0
  1401. 143.08 s [duoids] stripping (with command strip and flags -S -p) in /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/lib
  1402. 143.24 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc
  1403. 143.26 s [duoids] checking for references to /build/ in /nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc...
  1404. 143.27 s [duoids] patching script interpreter paths in /nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc
  1405. 143.50 s [duoids:post-build] Uploading to cachix cache "sellout": /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0 /nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc
  1406. 144.11 s [duoids:post-build] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  1407. 144.11 s [duoids:post-build]
  1408. 144.46 s [duoids:post-build] Pushing /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0 (8.23 MiB)
  1409. 144.64 s [duoids:post-build] Pushing /nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc (2.25 MiB)
  1410. 145.68 s [duoids:post-build]
  1411. 145.68 s [duoids:post-build] All done.
  1412. 145.71 s [duoids:post-build] Uploading to the NixCI cache: /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0 /nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc
  1413. 145.77 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1414. 145.78 s [duoids:post-build] copying 2 paths...
  1415. 145.78 s [duoids:post-build] copying path '/nix/store/gsgv9qh0iaf5jdrblv7k29d04sm8c616-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1416. 146.47 s [duoids:post-build] copying path '/nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  1417. 149.32 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1418. 149.75 s [duoids:post-build] copying 1 paths...
  1419. 149.75 s [duoids:post-build] copying path '/nix/store/6hkrxmy4yj8facxlvn54nrc60rim1h1a-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1420. 150.15 s Progress: 2 of 18 built (1 building), 36 of 36 downloaded from cache
  1421. 150.22 s Building /nix/store/wpals71jdqjq2fbnyagaz6kr6f7gp6m5-duoidal-transformers-0.0.1.0.drv
  1422. 150.34 s Building /nix/store/3jbnk7arvcxgrhycawb0z88850xvvhb7-duoids-hedgehog-0.0.1.0.drv
  1423. 150.34 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 )
  1424. 150.34 s [duoidal-transformers] Phase: setupCompilerEnvironmentPhase
  1425. 150.37 s [duoidal-transformers] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  1426. 150.52 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  1427. 150.52 s [duoids-hedgehog] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  1428. 150.63 s [duoidal-transformers] Phase: unpackPhase
  1429. 150.63 s [duoidal-transformers] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./transformers
  1430. 150.65 s [duoidal-transformers] source root is transformers
  1431. 150.73 s [duoidal-transformers] Phase: patchPhase
  1432. 150.73 s [duoidal-transformers] Phase: compileBuildDriverPhase
  1433. 150.74 s [duoidal-transformers] setupCompileFlags: -package-db=/build/tmp.LOTa3QhAlq/setup-package.conf.d -threaded
  1434. 150.85 s [duoidal-transformers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.LOTa3QhAlq/Main.o )
  1435. 150.96 s [duoidal-transformers] [2 of 2] Linking Setup
  1436. 151.10 s [duoids-hedgehog] Phase: unpackPhase
  1437. 151.10 s [duoids-hedgehog] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./hedgehog
  1438. 151.13 s [duoids-hedgehog] source root is hedgehog
  1439. 151.16 s [duoids-hedgehog] Phase: patchPhase
  1440. 151.18 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  1441. 151.19 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.Ccp9pjkSsK/setup-package.conf.d -threaded
  1442. 151.34 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.Ccp9pjkSsK/Main.o )
  1443. 151.49 s [duoids-hedgehog] [2 of 2] Linking Setup
  1444. 152.90 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 )
  1445. 153.15 s [duoidal-transformers] Phase: updateAutotoolsGnuConfigScriptsPhase
  1446. 153.17 s [duoidal-transformers] Phase: configurePhase
  1447. 153.21 s [duoidal-transformers] configureFlags: --verbose --prefix=/nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.LOTa3QhAlq/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/lib
  1448. 153.24 s [duoidal-transformers] Using Parsec parser
  1449. 153.24 s [duoidal-transformers] Configuring duoidal-transformers-0.0.1.0...
  1450. 153.59 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  1451. 153.62 s [duoids-hedgehog] Phase: configurePhase
  1452. 153.67 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.Ccp9pjkSsK/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/lib
  1453. 153.70 s [duoids-hedgehog] Using Parsec parser
  1454. 153.70 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  1455. 154.17 s [duoidal-transformers] Flags chosen: lint=False, noisy-deprecations=True
  1456. 154.34 s [duoids-hedgehog] Flags chosen: lint=False, noisy-deprecations=True
  1457. 154.78 s [duoidal-transformers] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  1458. 154.78 s [duoidal-transformers] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  1459. 154.78 s [duoidal-transformers] <4.23: using base-4.20.2.0
  1460. 154.78 s [duoidal-transformers] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  1461. 154.78 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1462. 154.78 s [duoidal-transformers] Dependency transformers >=0.5.6 && <0.6 || >=0.6.1 && <0.7: using
  1463. 154.78 s [duoidal-transformers] transformers-0.6.1.1
  1464. 154.78 s [duoidal-transformers] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  1465. 154.78 s [duoidal-transformers] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  1466. 154.78 s [duoidal-transformers] <4.23: using base-4.20.2.0
  1467. 154.78 s [duoidal-transformers] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  1468. 154.78 s [duoidal-transformers] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  1469. 154.78 s [duoidal-transformers] doctest-0.24.2
  1470. 154.78 s [duoidal-transformers] Dependency duoidal-transformers: using duoidal-transformers-0.0.1.0
  1471. 154.78 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1472. 154.78 s [duoidal-transformers] Source component graph:
  1473. 154.78 s [duoidal-transformers] component lib
  1474. 154.78 s [duoidal-transformers] component test:doctests dependency lib
  1475. 154.78 s [duoidal-transformers] Configured component graph:
  1476. 154.78 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1477. 154.78 s [duoidal-transformers] include base-4.20.2.0-64da
  1478. 154.78 s [duoidal-transformers] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1479. 154.78 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1480. 154.78 s [duoidal-transformers] include transformers-0.6.1.1-6a26
  1481. 154.78 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-KhnlJXfsdUG3006wXowqMA-doctests
  1482. 154.78 s [duoidal-transformers] include base-4.20.2.0-64da
  1483. 154.78 s [duoidal-transformers] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1484. 154.78 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1485. 154.78 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1486. 154.78 s [duoidal-transformers] Linked component graph:
  1487. 154.78 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1488. 154.78 s [duoidal-transformers] include base-4.20.2.0-64da
  1489. 154.78 s [duoidal-transformers] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1490. 154.78 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1491. 154.78 s [duoidal-transformers] include transformers-0.6.1.1-6a26
  1492. 154.78 s [duoidal-transformers] Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP:Control.Duoidal.Trans.Orphans
  1493. 154.78 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-KhnlJXfsdUG3006wXowqMA-doctests
  1494. 154.78 s [duoidal-transformers] include base-4.20.2.0-64da
  1495. 154.78 s [duoidal-transformers] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1496. 154.78 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1497. 154.78 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1498. 154.78 s [duoidal-transformers] Ready component graph:
  1499. 154.78 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1500. 154.78 s [duoidal-transformers] depends base-4.20.2.0-64da
  1501. 154.78 s [duoidal-transformers] depends duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1502. 154.78 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1503. 154.78 s [duoidal-transformers] depends transformers-0.6.1.1-6a26
  1504. 154.78 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-KhnlJXfsdUG3006wXowqMA-doctests
  1505. 154.78 s [duoidal-transformers] depends base-4.20.2.0-64da
  1506. 154.78 s [duoidal-transformers] depends doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1507. 154.78 s [duoidal-transformers] depends duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1508. 154.78 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1509. 154.78 s [duoidal-transformers] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1510. 154.78 s [duoidal-transformers] Using compiler: ghc-9.10.3
  1511. 154.78 s [duoidal-transformers] Using install prefix:
  1512. 154.78 s [duoidal-transformers] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0
  1513. 154.78 s [duoidal-transformers] Executables installed in:
  1514. 154.78 s [duoidal-transformers] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/bin
  1515. 154.78 s [duoidal-transformers] Libraries installed in:
  1516. 154.78 s [duoidal-transformers] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1517. 154.78 s [duoidal-transformers] Dynamic Libraries installed in:
  1518. 154.78 s [duoidal-transformers] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  1519. 154.78 s [duoidal-transformers] Private executables installed in:
  1520. 154.78 s [duoidal-transformers] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-05f6/duoidal-transformers-0.0.1.0
  1521. 154.78 s [duoidal-transformers] Data files installed in:
  1522. 154.78 s [duoidal-transformers] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.10.3-05f6/duoidal-transformers-0.0.1.0
  1523. 154.78 s [duoidal-transformers] Documentation installed in:
  1524. 154.78 s [duoidal-transformers] /nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
  1525. 154.78 s [duoidal-transformers] Configuration files installed in:
  1526. 154.78 s [duoidal-transformers] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/etc
  1527. 154.78 s [duoidal-transformers] No alex found
  1528. 154.78 s [duoidal-transformers] Using ar found on system at:
  1529. 154.78 s [duoidal-transformers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  1530. 154.78 s [duoidal-transformers] No c2hs found
  1531. 154.78 s [duoidal-transformers] No cpphs found
  1532. 154.78 s [duoidal-transformers] Using doctest version 0.24.2 found on system at:
  1533. 154.78 s [duoidal-transformers] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin/doctest
  1534. 154.78 s [duoidal-transformers] Using gcc version 14.3.0 given by user at:
  1535. 154.78 s [duoidal-transformers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  1536. 154.78 s [duoidal-transformers] Using ghc version 9.10.3 found on system at:
  1537. 154.78 s [duoidal-transformers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  1538. 154.78 s [duoidal-transformers] Using ghc-pkg version 9.10.3 found on system at:
  1539. 154.78 s [duoidal-transformers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  1540. 154.78 s [duoidal-transformers] No ghcjs found
  1541. 154.78 s [duoidal-transformers] No ghcjs-pkg found
  1542. 154.78 s [duoidal-transformers] No greencard found
  1543. 154.78 s [duoidal-transformers] Using haddock version 2.31.1 found on system at:
  1544. 154.78 s [duoidal-transformers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  1545. 154.78 s [duoidal-transformers] No happy found
  1546. 154.78 s [duoidal-transformers] Using haskell-suite found on system at: haskell-suite-dummy-location
  1547. 154.78 s [duoidal-transformers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1548. 154.78 s [duoidal-transformers] No hmake found
  1549. 154.78 s [duoidal-transformers] Using hpc version 0.69 found on system at:
  1550. 154.78 s [duoidal-transformers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  1551. 154.78 s [duoidal-transformers] Using hsc2hs version 0.68.10 found on system at:
  1552. 154.78 s [duoidal-transformers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  1553. 154.78 s [duoidal-transformers] Using hscolour version 1.25 found on system at:
  1554. 154.78 s [duoidal-transformers] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  1555. 154.78 s [duoidal-transformers] No jhc found
  1556. 154.78 s [duoidal-transformers] Using ld found on system at:
  1557. 154.78 s [duoidal-transformers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  1558. 154.78 s [duoidal-transformers] No pkg-config found
  1559. 154.78 s [duoidal-transformers] Using runghc version 9.10.3 found on system at:
  1560. 154.78 s [duoidal-transformers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  1561. 154.78 s [duoidal-transformers] Using strip version 2.44 found on system at:
  1562. 154.78 s [duoidal-transformers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  1563. 154.79 s [duoidal-transformers] Using tar found on system at:
  1564. 154.79 s [duoidal-transformers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  1565. 154.79 s [duoidal-transformers] No uhc found
  1566. 154.90 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  1567. 154.90 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  1568. 154.90 s [duoids-hedgehog] <4.23: using base-4.20.2.0
  1569. 154.90 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  1570. 154.90 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1571. 154.90 s [duoids-hedgehog] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  1572. 154.90 s [duoids-hedgehog] hedgehog-1.5
  1573. 154.90 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  1574. 154.90 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  1575. 154.90 s [duoids-hedgehog] <4.23: using base-4.20.2.0
  1576. 154.90 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  1577. 154.90 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1578. 154.90 s [duoids-hedgehog] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  1579. 154.90 s [duoids-hedgehog] hedgehog-1.5
  1580. 154.90 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  1581. 154.90 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  1582. 154.90 s [duoids-hedgehog] <4.23: using base-4.20.2.0
  1583. 154.90 s [duoids-hedgehog] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  1584. 154.90 s [duoids-hedgehog] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  1585. 154.90 s [duoids-hedgehog] doctest-0.24.2
  1586. 154.90 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  1587. 154.90 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  1588. 154.90 s [duoids-hedgehog] Source component graph:
  1589. 154.90 s [duoids-hedgehog] component lib
  1590. 154.91 s [duoids-hedgehog] component test:doctests dependency lib
  1591. 154.91 s [duoids-hedgehog] component test:laws dependency lib
  1592. 154.91 s [duoids-hedgehog] Configured component graph:
  1593. 154.91 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1594. 154.91 s [duoids-hedgehog] include base-4.20.2.0-64da
  1595. 154.91 s [duoids-hedgehog] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1596. 154.91 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1597. 154.91 s [duoids-hedgehog] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  1598. 154.91 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-A0jaxPLmvWY7pKYUuF2Hhr-doctests
  1599. 154.91 s [duoids-hedgehog] include base-4.20.2.0-64da
  1600. 154.91 s [duoids-hedgehog] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1601. 154.91 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1602. 154.91 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1603. 154.91 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-EHzJOZ6IhCAe5LlUCqzGu-laws
  1604. 154.91 s [duoids-hedgehog] include base-4.20.2.0-64da
  1605. 154.91 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1606. 154.91 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1607. 154.91 s [duoids-hedgehog] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  1608. 154.91 s [duoids-hedgehog] Linked component graph:
  1609. 154.91 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1610. 154.91 s [duoids-hedgehog] include base-4.20.2.0-64da
  1611. 154.91 s [duoids-hedgehog] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1612. 154.91 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1613. 154.91 s [duoids-hedgehog] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  1614. 154.91 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27:Test.Duoidal
  1615. 154.91 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-A0jaxPLmvWY7pKYUuF2Hhr-doctests
  1616. 154.91 s [duoids-hedgehog] include base-4.20.2.0-64da
  1617. 154.91 s [duoids-hedgehog] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1618. 154.91 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1619. 154.91 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1620. 154.91 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-EHzJOZ6IhCAe5LlUCqzGu-laws
  1621. 154.91 s [duoids-hedgehog] include base-4.20.2.0-64da
  1622. 154.91 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1623. 154.91 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1624. 154.91 s [duoids-hedgehog] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  1625. 154.91 s [duoids-hedgehog] Ready component graph:
  1626. 154.91 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1627. 154.91 s [duoids-hedgehog] depends base-4.20.2.0-64da
  1628. 154.91 s [duoids-hedgehog] depends duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  1629. 154.91 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1630. 154.91 s [duoids-hedgehog] depends hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  1631. 154.91 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-EHzJOZ6IhCAe5LlUCqzGu-laws
  1632. 154.91 s [duoids-hedgehog] depends base-4.20.2.0-64da
  1633. 154.91 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1634. 154.91 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1635. 154.91 s [duoids-hedgehog] depends hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  1636. 154.91 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-A0jaxPLmvWY7pKYUuF2Hhr-doctests
  1637. 154.91 s [duoids-hedgehog] depends base-4.20.2.0-64da
  1638. 154.91 s [duoids-hedgehog] depends doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  1639. 154.91 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1640. 154.91 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  1641. 154.91 s [duoids-hedgehog] Using Cabal-3.12.1.0 compiled by ghc-9.10
  1642. 154.91 s [duoids-hedgehog] Using compiler: ghc-9.10.3
  1643. 154.91 s [duoids-hedgehog] Using install prefix:
  1644. 154.91 s [duoids-hedgehog] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0
  1645. 154.91 s [duoids-hedgehog] Executables installed in:
  1646. 154.91 s [duoids-hedgehog] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/bin
  1647. 154.91 s [duoids-hedgehog] Libraries installed in:
  1648. 154.91 s [duoids-hedgehog] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1649. 154.91 s [duoids-hedgehog] Dynamic Libraries installed in:
  1650. 154.91 s [duoids-hedgehog] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  1651. 154.91 s [duoids-hedgehog] Private executables installed in:
  1652. 154.91 s [duoids-hedgehog] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-05f6/duoids-hedgehog-0.0.1.0
  1653. 154.91 s [duoids-hedgehog] Data files installed in:
  1654. 154.91 s [duoids-hedgehog] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.10.3-05f6/duoids-hedgehog-0.0.1.0
  1655. 154.91 s [duoids-hedgehog] Documentation installed in:
  1656. 154.91 s [duoids-hedgehog] /nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  1657. 154.91 s [duoids-hedgehog] Configuration files installed in:
  1658. 154.91 s [duoids-hedgehog] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/etc
  1659. 154.91 s [duoids-hedgehog] No alex found
  1660. 154.91 s [duoids-hedgehog] Using ar found on system at:
  1661. 154.91 s [duoids-hedgehog] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  1662. 154.91 s [duoids-hedgehog] No c2hs found
  1663. 154.91 s [duoids-hedgehog] No cpphs found
  1664. 154.91 s [duoids-hedgehog] Using doctest version 0.24.2 found on system at:
  1665. 154.91 s [duoids-hedgehog] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin/doctest
  1666. 154.91 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  1667. 154.91 s [duoids-hedgehog] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  1668. 154.91 s [duoids-hedgehog] Using ghc version 9.10.3 found on system at:
  1669. 154.91 s [duoids-hedgehog] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  1670. 154.91 s [duoids-hedgehog] Using ghc-pkg version 9.10.3 found on system at:
  1671. 154.91 s [duoids-hedgehog] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  1672. 154.91 s [duoids-hedgehog] No ghcjs found
  1673. 154.91 s [duoids-hedgehog] No ghcjs-pkg found
  1674. 154.91 s [duoids-hedgehog] No greencard found
  1675. 154.91 s [duoids-hedgehog] Using haddock version 2.31.1 found on system at:
  1676. 154.91 s [duoids-hedgehog] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  1677. 154.91 s [duoids-hedgehog] No happy found
  1678. 154.91 s [duoids-hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  1679. 154.91 s [duoids-hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1680. 154.91 s [duoids-hedgehog] No hmake found
  1681. 154.91 s [duoids-hedgehog] Using hpc version 0.69 found on system at:
  1682. 154.91 s [duoids-hedgehog] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  1683. 154.91 s [duoids-hedgehog] Using hsc2hs version 0.68.10 found on system at:
  1684. 154.91 s [duoids-hedgehog] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  1685. 154.91 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  1686. 154.91 s [duoids-hedgehog] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  1687. 154.91 s [duoids-hedgehog] No jhc found
  1688. 154.91 s [duoids-hedgehog] Using ld found on system at:
  1689. 154.91 s [duoids-hedgehog] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  1690. 154.91 s [duoids-hedgehog] No pkg-config found
  1691. 154.91 s [duoids-hedgehog] Using runghc version 9.10.3 found on system at:
  1692. 154.91 s [duoids-hedgehog] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  1693. 154.91 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  1694. 154.91 s [duoids-hedgehog] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  1695. 154.91 s [duoids-hedgehog] Using tar found on system at:
  1696. 154.91 s [duoids-hedgehog] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  1697. 154.91 s [duoids-hedgehog] No uhc found
  1698. 155.08 s [duoidal-transformers] Phase: buildPhase
  1699. 155.17 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  1700. 155.17 s [duoidal-transformers] Building library for duoidal-transformers-0.0.1.0...
  1701. 155.25 s [duoids-hedgehog] Phase: buildPhase
  1702. 155.32 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 )
  1703. 155.37 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  1704. 155.37 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  1705. 155.58 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
  1706. 155.70 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 )
  1707. 156.38 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  1708. 156.40 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 )
  1709. 156.69 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  1710. 156.88 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 )
  1711. 157.47 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  1712. 160.86 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1713. 160.96 s [duoidal-transformers] Building test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1714. 160.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 )
  1715. 161.38 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1716. 161.38 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1717. 161.50 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  1718. 161.70 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 )
  1719. 161.70 s [duoidal-transformers] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1720. 162.43 s [duoidal-transformers] [3 of 3] Linking dist/build/doctests/doctests
  1721. 162.46 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 )
  1722. 162.59 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  1723. 162.63 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  1724. 162.65 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 )
  1725. 162.94 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 )
  1726. 162.94 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  1727. 162.94 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  1728. 162.94 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 )
  1729. 163.62 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1730. 163.62 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1731. 163.76 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1732. 164.24 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1733. 164.89 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  1734. 166.40 s [duoidal-transformers] Phase: checkPhase
  1735. 166.63 s [duoidal-transformers] Running 1 test suites...
  1736. 166.63 s [duoidal-transformers] Test suite doctests: RUNNING...
  1737. 166.88 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1738. 166.88 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1739. 166.88 s [duoidal-transformers]
  1740. 166.88 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1741. 166.88 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1742. 166.88 s [duoidal-transformers]
  1743. 166.88 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1744. 166.88 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1745. 166.88 s [duoidal-transformers]
  1746. 167.04 s [duoidal-transformers] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  1747. 167.07 s [duoidal-transformers] NameLib Nothing
  1748. 167.07 s [duoidal-transformers] ----------------------------------------
  1749. 167.07 s [duoidal-transformers] Test suite doctests: PASS
  1750. 167.07 s [duoidal-transformers] Test suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
  1751. 167.07 s [duoidal-transformers] 1 of 1 test suites (1 of 1 test cases) passed.
  1752. 167.08 s [duoidal-transformers] Phase: haddockPhase
  1753. 167.20 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  1754. 167.20 s [duoidal-transformers] Running Haddock on library for duoidal-transformers-0.0.1.0...
  1755. 167.53 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, nothing )
  1756. 167.87 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, nothing )
  1757. 167.99 s [duoidal-transformers] Haddock coverage:
  1758. 167.99 s [duoidal-transformers] Warning: 'MonadTrans' is out of scope.
  1759. 167.99 s [duoidal-transformers] If you qualify the identifier, haddock can try to link it anyway.
  1760. 167.99 s [duoidal-transformers] 100% ( 3 / 3) in 'Control.Duoidal.Trans.Class'
  1761. 167.99 s [duoidal-transformers] 100% ( 1 / 1) in 'Control.Duoidal.Trans.Orphans'
  1762. 168.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 )
  1763. 169.42 s [duoids-hedgehog] Phase: checkPhase
  1764. 169.81 s [duoids-hedgehog] Running 2 test suites...
  1765. 169.81 s [duoids-hedgehog] Test suite laws: RUNNING...
  1766. 169.82 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  1767. 169.82 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1768. 169.82 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1769. 169.82 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1770. 169.82 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1771. 169.82 s [duoids-hedgehog] ✓ 4 succeeded.
  1772. 169.82 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  1773. 169.83 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1774. 169.83 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1775. 169.83 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1776. 169.83 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1777. 169.83 s [duoids-hedgehog] ✓ 4 succeeded.
  1778. 169.83 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  1779. 169.83 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1780. 169.83 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1781. 169.83 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1782. 169.83 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1783. 169.83 s [duoids-hedgehog] ✓ 4 succeeded.
  1784. 169.83 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  1785. 169.83 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1786. 169.83 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1787. 169.83 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1788. 169.83 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1789. 169.83 s [duoids-hedgehog] ✓ 4 succeeded.
  1790. 169.83 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  1791. 169.83 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1792. 169.83 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1793. 169.83 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1794. 169.83 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1795. 169.83 s [duoids-hedgehog] ✓ 4 succeeded.
  1796. 169.83 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  1797. 169.84 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1798. 169.84 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1799. 169.84 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1800. 169.84 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1801. 169.84 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1802. 169.84 s [duoids-hedgehog] ✓ 5 succeeded.
  1803. 169.84 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  1804. 169.84 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1805. 169.84 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1806. 169.84 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1807. 169.84 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1808. 169.84 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1809. 169.84 s [duoids-hedgehog] ✓ 5 succeeded.
  1810. 169.84 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  1811. 169.84 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1812. 169.84 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1813. 169.84 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1814. 169.84 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1815. 169.84 s [duoids-hedgehog] ✓ 4 succeeded.
  1816. 169.84 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  1817. 169.84 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1818. 169.84 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1819. 169.84 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1820. 169.84 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1821. 169.84 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1822. 169.85 s [duoids-hedgehog] ✓ 5 succeeded.
  1823. 169.85 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  1824. 169.85 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1825. 169.85 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1826. 169.85 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1827. 169.85 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1828. 169.85 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1829. 169.85 s [duoids-hedgehog] ✓ 5 succeeded.
  1830. 169.85 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  1831. 169.85 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1832. 169.85 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1833. 169.85 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1834. 169.85 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1835. 169.85 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1836. 169.85 s [duoids-hedgehog] ✓ 5 succeeded.
  1837. 169.85 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  1838. 169.85 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1839. 169.85 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1840. 169.85 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1841. 169.85 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1842. 169.85 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1843. 169.85 s [duoids-hedgehog] ✓ 5 succeeded.
  1844. 169.85 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  1845. 169.85 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1846. 169.85 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1847. 169.85 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1848. 169.85 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1849. 169.85 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1850. 169.85 s [duoids-hedgehog] ✓ 5 succeeded.
  1851. 169.85 s [duoids-hedgehog] Test suite laws: PASS
  1852. 169.85 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  1853. 169.86 s [duoids-hedgehog] Test suite doctests: RUNNING...
  1854. 170.74 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  1855. 170.81 s [duoids-hedgehog] NameLib Nothing
  1856. 170.81 s [duoids-hedgehog] ----------------------------------------
  1857. 170.82 s [duoids-hedgehog] Test suite doctests: PASS
  1858. 170.82 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  1859. 170.82 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  1860. 170.83 s [duoids-hedgehog] Phase: haddockPhase
  1861. 171.05 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  1862. 171.05 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  1863. 171.69 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, nothing )
  1864. 171.91 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  1865. 172.40 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, nothing )
  1866. 172.46 s [duoids-hedgehog] Haddock coverage:
  1867. 172.46 s [duoids-hedgehog] 100% ( 3 / 3) in 'Test.Duoid'
  1868. 172.46 s [duoids-hedgehog] 100% ( 2 / 2) in 'Test.Duoidal'
  1869. 175.13 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  1870. 175.75 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  1871. 179.37 s [duoidal-transformers] Documentation created: dist/doc/html/duoidal-transformers/,
  1872. 179.37 s [duoidal-transformers] dist/doc/html/duoidal-transformers/duoidal-transformers.txt
  1873. 179.43 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1874. 179.44 s [duoidal-transformers] Phase: installPhase
  1875. 179.49 s [duoidal-transformers] Installing library in /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/duoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP
  1876. 179.76 s [duoidal-transformers] Phase: fixupPhase
  1877. 179.78 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0
  1878. 179.78 s [duoidal-transformers] shrinking /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSduoidal-transformers-0.0.1.0-H0kJBAf9kQs9Vih31Q7tuP-ghc9.10.3.so
  1879. 179.79 s [duoidal-transformers] checking for references to /build/ in /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0...
  1880. 179.81 s [duoidal-transformers] patching script interpreter paths in /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0
  1881. 179.81 s [duoidal-transformers] stripping (with command strip and flags -S -p) in /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/lib
  1882. 179.84 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc
  1883. 179.85 s [duoidal-transformers] checking for references to /build/ in /nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc...
  1884. 179.87 s [duoidal-transformers] patching script interpreter paths in /nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc
  1885. 180.01 s [duoidal-transformers:post-build] Uploading to cachix cache "sellout": /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0 /nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc
  1886. 180.49 s [duoidal-transformers:post-build] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
  1887. 180.49 s [duoidal-transformers:post-build]
  1888. 180.86 s [duoidal-transformers:post-build] Pushing /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0 (672.15 KiB)
  1889. 180.92 s [duoidal-transformers:post-build] Pushing /nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc (347.32 KiB)
  1890. 181.96 s [duoidal-transformers:post-build]
  1891. 181.96 s [duoidal-transformers:post-build] All done.
  1892. 181.98 s [duoidal-transformers:post-build] Uploading to the NixCI cache: /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0 /nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc
  1893. 182.13 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1894. 182.14 s [duoidal-transformers:post-build] copying 2 paths...
  1895. 182.14 s [duoidal-transformers:post-build] copying path '/nix/store/fd8w5cy238pxw9b8ncrjn69xdk9hv7mb-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1896. 182.59 s [duoidal-transformers:post-build] copying path '/nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...
  1897. 183.01 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1898. 183.30 s [duoidal-transformers:post-build] copying 1 paths...
  1899. 183.30 s [duoidal-transformers:post-build] copying path '/nix/store/wpals71jdqjq2fbnyagaz6kr6f7gp6m5-duoidal-transformers-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1900. 184.20 s Progress: 3 of 17 built (2 building), 36 of 36 downloaded from cache
  1901. 184.21 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog/,
  1902. 184.21 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  1903. 184.21 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1904. 184.21 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1905. 184.21 s [duoids-hedgehog] Phase: installPhase
  1906. 184.21 s [duoids-hedgehog] Installing library in /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  1907. 184.21 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  1908. 184.21 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  1909. 184.49 s [duoids-hedgehog] Phase: fixupPhase
  1910. 184.51 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0
  1911. 184.55 s [duoids-hedgehog] shrinking /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSduoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27-ghc9.10.3.so
  1912. 184.55 s [duoids-hedgehog] checking for references to /build/ in /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0...
  1913. 184.55 s [duoids-hedgehog] patching script interpreter paths in /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0
  1914. 184.55 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/lib
  1915. 184.58 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc
  1916. 184.58 s [duoids-hedgehog] checking for references to /build/ in /nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc...
  1917. 184.60 s [duoids-hedgehog] patching script interpreter paths in /nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc
  1918. 184.74 s [duoids-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0 /nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc
  1919. 185.29 s [duoids-hedgehog:post-build] Pushing 2 paths (136 are already present) using zstd to cache sellout ⏳
  1920. 185.29 s [duoids-hedgehog:post-build]
  1921. 185.66 s [duoids-hedgehog:post-build] Pushing /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0 (536.99 KiB)
  1922. 185.74 s [duoids-hedgehog:post-build] Pushing /nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc (306.56 KiB)
  1923. 186.85 s [duoids-hedgehog:post-build]
  1924. 186.85 s [duoids-hedgehog:post-build] All done.
  1925. 186.87 s [duoids-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0 /nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc
  1926. 186.92 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1927. 186.94 s [duoids-hedgehog:post-build] copying 2 paths...
  1928. 186.94 s [duoids-hedgehog:post-build] copying path '/nix/store/wzvw46dkagm3l8i65lfssxpdqlhch72v-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1929. 187.32 s [duoids-hedgehog:post-build] copying path '/nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  1930. 187.71 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1931. 187.96 s [duoids-hedgehog:post-build] copying 1 paths...
  1932. 187.96 s [duoids-hedgehog:post-build] copying path '/nix/store/3jbnk7arvcxgrhycawb0z88850xvvhb7-duoids-hedgehog-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1933. 188.19 s Progress: 4 of 16 built (1 building), 36 of 36 downloaded from cache
  1934. 191.15 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  1935. 191.19 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  1936. 191.19 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  1937. 191.19 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  1938. 191.19 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  1939. 191.41 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  1940. 191.41 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  1941. 196.92 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  1942. 201.52 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  1943. 206.83 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  1944. 207.84 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0...
  1945. 207.85 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0...
  1946. 207.93 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 )
  1947. 208.04 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 )
  1948. 209.13 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 )
  1949. 209.13 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  1950. 209.14 s [vector] In the use of ‘tail’
  1951. 209.14 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1952. 209.14 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1953. 209.14 s [vector] |
  1954. 209.14 s [vector] 244 | postscanl f z = tail . scanl f z
  1955. 209.14 s [vector] | ^^^^
  1956. 209.14 s [vector]
  1957. 209.14 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  1958. 209.14 s [vector] In the use of ‘tail’
  1959. 209.14 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1960. 209.14 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1961. 209.14 s [vector] |
  1962. 209.14 s [vector] 245 | prescanr f z = tail . scanr f z
  1963. 209.14 s [vector] | ^^^^
  1964. 209.14 s [vector]
  1965. 209.14 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 )
  1966. 209.14 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  1967. 209.14 s [vector] In the use of ‘head’
  1968. 209.14 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1969. 209.14 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1970. 209.14 s [vector] |
  1971. 209.14 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  1972. 209.14 s [vector] | ^^^^
  1973. 209.14 s [vector]
  1974. 209.14 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  1975. 209.14 s [vector] In the use of ‘head’
  1976. 209.14 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1977. 209.14 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1978. 209.14 s [vector] |
  1979. 209.14 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  1980. 209.14 s [vector] | ^^^^
  1981. 209.14 s [vector]
  1982. 209.14 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  1983. 209.14 s [vector] In the use of ‘tail’
  1984. 209.14 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1985. 209.14 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1986. 209.14 s [vector] |
  1987. 209.14 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  1988. 209.14 s [vector] | ^^^^
  1989. 209.14 s [vector]
  1990. 209.14 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  1991. 209.14 s [vector] In the use of ‘head’
  1992. 209.14 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1993. 209.14 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1994. 209.14 s [vector] |
  1995. 209.14 s [vector] 439 | = V.uniq `eq` (map head . group)
  1996. 209.14 s [vector] | ^^^^
  1997. 209.14 s [vector]
  1998. 209.92 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 )
  1999. 210.03 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 )
  2000. 210.03 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 )
  2001. 210.03 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 )
  2002. 210.03 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 )
  2003. 210.03 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 )
  2004. 210.03 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 )
  2005. 210.03 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  2006. 210.03 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  2007. 210.03 s [vector] |
  2008. 210.03 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  2009. 210.03 s [vector] | ^^^^^^
  2010. 210.03 s [vector]
  2011. 210.03 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  2012. 210.03 s [vector] In the use of ‘head’
  2013. 210.03 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2014. 210.03 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2015. 210.03 s [vector] |
  2016. 210.03 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  2017. 210.03 s [vector] | ^^^^
  2018. 210.03 s [vector]
  2019. 210.03 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  2020. 210.03 s [vector] In the use of ‘tail’
  2021. 210.03 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2022. 210.03 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2023. 210.03 s [vector] |
  2024. 210.03 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  2025. 210.03 s [vector] | ^^^^
  2026. 210.03 s [vector]
  2027. 210.03 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 )
  2028. 210.48 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  2029. 211.56 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0...
  2030. 211.56 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0...
  2031. 211.64 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 )
  2032. 214.09 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 )
  2033. 214.15 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 )
  2034. 214.16 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 )
  2035. 214.16 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 )
  2036. 214.16 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 )
  2037. 214.16 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 )
  2038. 214.16 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 )
  2039. 214.16 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 )
  2040. 214.16 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 )
  2041. 214.16 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 )
  2042. 214.16 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 )
  2043. 214.16 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 )
  2044. 214.16 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 )
  2045. 214.37 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 )
  2046. 215.94 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 )
  2047. 215.94 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 )
  2048. 216.15 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 )
  2049. 216.15 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 )
  2050. 216.15 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 )
  2051. 216.15 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 )
  2052. 216.15 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 )
  2053. 216.15 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 )
  2054. 216.15 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 )
  2055. 216.15 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 )
  2056. 216.15 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  2057. 216.15 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 )
  2058. 216.15 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 )
  2059. 217.73 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0...
  2060. 217.73 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0...
  2061. 217.80 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  2062. 218.18 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  2063. 222.48 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0...
  2064. 222.48 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0...
  2065. 222.59 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 )
  2066. 222.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 )
  2067. 229.94 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 )
  2068. 229.98 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  2069. 229.98 s [vector] In the use of ‘tail’
  2070. 229.98 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2071. 229.98 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2072. 229.98 s [vector] |
  2073. 229.98 s [vector] 244 | postscanl f z = tail . scanl f z
  2074. 229.98 s [vector] | ^^^^
  2075. 229.98 s [vector]
  2076. 229.98 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  2077. 229.98 s [vector] In the use of ‘tail’
  2078. 229.98 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2079. 229.98 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2080. 229.98 s [vector] |
  2081. 229.98 s [vector] 245 | prescanr f z = tail . scanr f z
  2082. 229.98 s [vector] | ^^^^
  2083. 229.98 s [vector]
  2084. 229.98 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 )
  2085. 229.98 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  2086. 229.98 s [vector] In the use of ‘head’
  2087. 229.98 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2088. 229.98 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2089. 229.98 s [vector] |
  2090. 229.98 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  2091. 229.98 s [vector] | ^^^^
  2092. 229.98 s [vector]
  2093. 229.98 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  2094. 229.98 s [vector] In the use of ‘head’
  2095. 229.98 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2096. 229.98 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2097. 229.98 s [vector] |
  2098. 229.98 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  2099. 229.98 s [vector] | ^^^^
  2100. 229.98 s [vector]
  2101. 229.98 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  2102. 229.98 s [vector] In the use of ‘tail’
  2103. 229.98 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2104. 229.98 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2105. 229.98 s [vector] |
  2106. 229.98 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  2107. 229.98 s [vector] | ^^^^
  2108. 229.98 s [vector]
  2109. 229.98 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  2110. 229.98 s [vector] In the use of ‘head’
  2111. 229.98 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2112. 229.98 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2113. 229.98 s [vector] |
  2114. 229.98 s [vector] 439 | = V.uniq `eq` (map head . group)
  2115. 229.98 s [vector] | ^^^^
  2116. 229.98 s [vector]
  2117. 236.85 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 )
  2118. 255.88 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 )
  2119. 255.91 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 )
  2120. 255.91 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 )
  2121. 255.91 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 )
  2122. 255.91 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 )
  2123. 255.91 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 )
  2124. 255.91 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  2125. 255.91 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  2126. 255.91 s [vector] |
  2127. 255.91 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  2128. 255.91 s [vector] | ^^^^^^
  2129. 255.91 s [vector]
  2130. 255.91 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  2131. 255.91 s [vector] In the use of ‘head’
  2132. 255.91 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2133. 255.91 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2134. 255.91 s [vector] |
  2135. 255.91 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  2136. 255.91 s [vector] | ^^^^
  2137. 255.91 s [vector]
  2138. 255.91 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  2139. 255.91 s [vector] In the use of ‘tail’
  2140. 255.91 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2141. 255.91 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2142. 255.91 s [vector] |
  2143. 255.91 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  2144. 255.91 s [vector] | ^^^^
  2145. 255.91 s [vector]
  2146. 255.91 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 )
  2147. 256.48 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  2148. 257.57 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0...
  2149. 257.57 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0...
  2150. 257.72 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  2151. 258.42 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 )
  2152. 258.42 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  2153. 259.24 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  2154. 259.93 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  2155. 260.83 s [vector] buildPhase completed in 2 minutes 41 seconds
  2156. 260.83 s [vector] Phase: checkPhase
  2157. 261.05 s [vector] Running 2 test suites...
  2158. 261.05 s [vector] Test suite vector-tests-O0: RUNNING...
  2159. 261.24 s [vector] toplevel
  2160. 261.24 s [vector] Data.Vector.Fusion.Bundle
  2161. 261.24 s [vector] fromList.toList == id: OK
  2162. 261.24 s [vector] +++ OK, passed 100 tests.
  2163. 261.24 s [vector] toList.fromList == id: OK
  2164. 261.24 s [vector] +++ OK, passed 100 tests.
  2165. 261.24 s [vector] eq: OK
  2166. 261.24 s [vector] +++ OK, passed 100 tests.
  2167. 261.24 s [vector] length: OK
  2168. 261.24 s [vector] +++ OK, passed 100 tests.
  2169. 261.24 s [vector] null: OK
  2170. 261.24 s [vector] +++ OK, passed 100 tests.
  2171. 261.24 s [vector] empty: OK
  2172. 261.24 s [vector] +++ OK, passed 100 tests.
  2173. 261.25 s [vector] singleton: OK
  2174. 261.25 s [vector] +++ OK, passed 100 tests.
  2175. 261.25 s [vector] replicate: OK
  2176. 261.25 s [vector] +++ OK, passed 100 tests.
  2177. 261.25 s [vector] cons: OK
  2178. 261.25 s [vector] +++ OK, passed 100 tests.
  2179. 261.25 s [vector] snoc: OK
  2180. 261.25 s [vector] +++ OK, passed 100 tests.
  2181. 261.25 s [vector] append: OK
  2182. 261.25 s [vector] +++ OK, passed 100 tests.
  2183. 261.25 s [vector] head: OK
  2184. 261.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2185. 261.25 s [vector] last: OK
  2186. 261.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2187. 261.25 s [vector] index: OK
  2188. 261.25 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2189. 261.25 s [vector] extract: OK
  2190. 261.25 s [vector] +++ OK, passed 100 tests.
  2191. 261.25 s [vector] init: OK
  2192. 261.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2193. 261.25 s [vector] tail: OK
  2194. 261.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2195. 261.25 s [vector] take: OK
  2196. 261.25 s [vector] +++ OK, passed 100 tests.
  2197. 261.26 s [vector] drop: OK
  2198. 261.26 s [vector] +++ OK, passed 100 tests.
  2199. 261.26 s [vector] map: OK
  2200. 261.26 s [vector] +++ OK, passed 100 tests.
  2201. 261.26 s [vector] zipWith: OK
  2202. 261.26 s [vector] +++ OK, passed 100 tests.
  2203. 261.26 s [vector] zipWith3: OK
  2204. 261.26 s [vector] +++ OK, passed 100 tests.
  2205. 261.26 s [vector] filter: OK
  2206. 261.26 s [vector] +++ OK, passed 100 tests.
  2207. 261.26 s [vector] takeWhile: OK
  2208. 261.26 s [vector] +++ OK, passed 100 tests.
  2209. 261.26 s [vector] dropWhile: OK
  2210. 261.26 s [vector] +++ OK, passed 100 tests.
  2211. 261.26 s [vector] elem: OK
  2212. 261.26 s [vector] +++ OK, passed 100 tests.
  2213. 261.26 s [vector] notElem: OK
  2214. 261.26 s [vector] +++ OK, passed 100 tests.
  2215. 261.26 s [vector] find: OK
  2216. 261.27 s [vector] +++ OK, passed 100 tests.
  2217. 261.27 s [vector] findIndex: OK
  2218. 261.27 s [vector] +++ OK, passed 100 tests.
  2219. 261.27 s [vector] foldl: OK
  2220. 261.27 s [vector] +++ OK, passed 100 tests.
  2221. 261.27 s [vector] foldl1: OK
  2222. 261.27 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2223. 261.27 s [vector] foldl': OK
  2224. 261.27 s [vector] +++ OK, passed 100 tests.
  2225. 261.27 s [vector] foldl1': OK
  2226. 261.27 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2227. 261.27 s [vector] foldr: OK
  2228. 261.27 s [vector] +++ OK, passed 100 tests.
  2229. 261.27 s [vector] foldr1: OK
  2230. 261.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2231. 261.27 s [vector] prescanl: OK
  2232. 261.27 s [vector] +++ OK, passed 100 tests.
  2233. 261.27 s [vector] prescanl': OK
  2234. 261.27 s [vector] +++ OK, passed 100 tests.
  2235. 261.28 s [vector] postscanl: OK
  2236. 261.28 s [vector] +++ OK, passed 100 tests.
  2237. 261.28 s [vector] postscanl': OK
  2238. 261.28 s [vector] +++ OK, passed 100 tests.
  2239. 261.28 s [vector] scanl: OK
  2240. 261.28 s [vector] +++ OK, passed 100 tests.
  2241. 261.28 s [vector] scanl': OK
  2242. 261.28 s [vector] +++ OK, passed 100 tests.
  2243. 261.28 s [vector] scanl1: OK
  2244. 261.28 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2245. 261.28 s [vector] scanl1': OK
  2246. 261.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2247. 261.28 s [vector] concatMap: OK
  2248. 261.28 s [vector] +++ OK, passed 100 tests.
  2249. 261.28 s [vector] unfoldr: OK
  2250. 261.28 s [vector] +++ OK, passed 100 tests.
  2251. 261.28 s [vector] and: OK
  2252. 261.28 s [vector] +++ OK, passed 100 tests.
  2253. 261.28 s [vector] or: OK
  2254. 261.28 s [vector] +++ OK, passed 100 tests.
  2255. 261.28 s [vector] Tests.Vector.Boxed
  2256. 261.28 s [vector] Bool
  2257. 261.28 s [vector] fromList.toList == id: OK
  2258. 261.28 s [vector] +++ OK, passed 100 tests.
  2259. 261.28 s [vector] toList.fromList == id: OK
  2260. 261.28 s [vector] +++ OK, passed 100 tests.
  2261. 261.28 s [vector] unstream.stream == id: OK
  2262. 261.28 s [vector] +++ OK, passed 100 tests.
  2263. 261.28 s [vector] stream.unstream == id: OK
  2264. 261.28 s [vector] +++ OK, passed 100 tests.
  2265. 261.28 s [vector] eq: OK
  2266. 261.28 s [vector] +++ OK, passed 100 tests.
  2267. 261.28 s [vector] length: OK
  2268. 261.28 s [vector] +++ OK, passed 100 tests.
  2269. 261.28 s [vector] null: OK
  2270. 261.28 s [vector] +++ OK, passed 100 tests.
  2271. 261.28 s [vector] index: OK
  2272. 261.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2273. 261.28 s [vector] safeIndex: OK
  2274. 261.28 s [vector] +++ OK, passed 100 tests.
  2275. 261.28 s [vector] head: OK
  2276. 261.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2277. 261.28 s [vector] last: OK
  2278. 261.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2279. 261.28 s [vector] unsafeIndex: OK
  2280. 261.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2281. 261.28 s [vector] unsafeHead: OK
  2282. 261.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2283. 261.28 s [vector] unsafeLast: OK
  2284. 261.28 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2285. 261.28 s [vector] slice: OK
  2286. 261.28 s [vector] +++ OK, passed 100 tests.
  2287. 261.28 s [vector] init: OK
  2288. 261.28 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2289. 261.28 s [vector] tail: OK
  2290. 261.29 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2291. 261.29 s [vector] take: OK
  2292. 261.29 s [vector] +++ OK, passed 100 tests.
  2293. 261.29 s [vector] drop: OK
  2294. 261.29 s [vector] +++ OK, passed 100 tests.
  2295. 261.29 s [vector] splitAt: OK
  2296. 261.29 s [vector] +++ OK, passed 100 tests.
  2297. 261.29 s [vector] empty: OK
  2298. 261.29 s [vector] +++ OK, passed 100 tests.
  2299. 261.29 s [vector] singleton: OK
  2300. 261.29 s [vector] +++ OK, passed 100 tests.
  2301. 261.29 s [vector] replicate: OK
  2302. 261.29 s [vector] +++ OK, passed 100 tests.
  2303. 261.30 s [vector] generate: OK
  2304. 261.30 s [vector] +++ OK, passed 100 tests.
  2305. 261.30 s [vector] iterateN: OK
  2306. 261.30 s [vector] +++ OK, passed 100 tests.
  2307. 261.30 s [vector] iterateNM: OK (0.04s)
  2308. 261.30 s [vector] +++ OK, passed 100 tests.
  2309. 261.30 s [vector] generateM: OK (0.01s)
  2310. 261.30 s [vector] +++ OK, passed 100 tests.
  2311. 261.30 s [vector] replicateM: OK
  2312. 261.30 s [vector] +++ OK, passed 100 tests.
  2313. 261.30 s [vector] create: OK
  2314. 261.30 s [vector] +++ OK, passed 100 tests.
  2315. 261.30 s [vector] createT: OK
  2316. 261.30 s [vector] +++ OK, passed 100 tests.
  2317. 261.30 s [vector] unfoldr: OK
  2318. 261.30 s [vector] +++ OK, passed 100 tests.
  2319. 261.30 s [vector] unfoldrN: OK
  2320. 261.30 s [vector] +++ OK, passed 100 tests.
  2321. 261.30 s [vector] unfoldrExactN: OK
  2322. 261.30 s [vector] +++ OK, passed 100 tests.
  2323. 261.30 s [vector] unfoldrM: OK
  2324. 261.30 s [vector] +++ OK, passed 100 tests.
  2325. 261.30 s [vector] unfoldrNM: OK
  2326. 261.30 s [vector] +++ OK, passed 100 tests.
  2327. 261.30 s [vector] unfoldrExactNM: OK (0.05s)
  2328. 261.30 s [vector] +++ OK, passed 100 tests.
  2329. 261.30 s [vector] constructN: OK
  2330. 261.30 s [vector] +++ OK, passed 100 tests.
  2331. 261.30 s [vector] constructrN: OK
  2332. 261.30 s [vector] +++ OK, passed 100 tests.
  2333. 261.30 s [vector] cons: OK
  2334. 261.30 s [vector] +++ OK, passed 100 tests.
  2335. 261.30 s [vector] snoc: OK
  2336. 261.30 s [vector] +++ OK, passed 100 tests.
  2337. 261.30 s [vector] append: OK
  2338. 261.30 s [vector] +++ OK, passed 100 tests.
  2339. 261.30 s [vector] concat: OK (0.01s)
  2340. 261.30 s [vector] +++ OK, passed 100 tests.
  2341. 261.30 s [vector] force: OK
  2342. 261.30 s [vector] +++ OK, passed 100 tests.
  2343. 261.30 s [vector] upd: OK
  2344. 261.30 s [vector] +++ OK, passed 100 tests.
  2345. 261.30 s [vector] accum: OK
  2346. 261.30 s [vector] +++ OK, passed 100 tests.
  2347. 261.30 s [vector] reverse: OK
  2348. 261.30 s [vector] +++ OK, passed 100 tests.
  2349. 261.30 s [vector] backpermute: OK
  2350. 261.30 s [vector] +++ OK, passed 100 tests.
  2351. 261.31 s [vector] map: OK
  2352. 261.31 s [vector] +++ OK, passed 100 tests.
  2353. 261.31 s [vector] imap: OK
  2354. 261.31 s [vector] +++ OK, passed 100 tests.
  2355. 261.31 s [vector] concatMap: OK
  2356. 261.31 s [vector] +++ OK, passed 100 tests.
  2357. 261.32 s [vector] mapM: OK
  2358. 261.32 s [vector] +++ OK, passed 100 tests.
  2359. 261.32 s [vector] mapM_: OK (0.01s)
  2360. 261.32 s [vector] +++ OK, passed 100 tests.
  2361. 261.32 s [vector] forM: OK
  2362. 261.34 s [vector] +++ OK, passed 100 tests.
  2363. 261.34 s [vector] forM_: OK (0.01s)
  2364. 261.34 s [vector] +++ OK, passed 100 tests.
  2365. 261.34 s [vector] imapM: OK
  2366. 261.34 s [vector] +++ OK, passed 100 tests.
  2367. 261.35 s [vector] imapM_: OK
  2368. 261.35 s [vector] +++ OK, passed 100 tests.
  2369. 261.36 s [vector] zipWith: OK
  2370. 261.36 s [vector] +++ OK, passed 100 tests.
  2371. 261.36 s [vector] zipWith3: OK
  2372. 261.36 s [vector] +++ OK, passed 100 tests.
  2373. 261.36 s [vector] izipWith: OK
  2374. 261.36 s [vector] +++ OK, passed 100 tests.
  2375. 261.36 s [vector] izipWith3: OK
  2376. 261.36 s [vector] +++ OK, passed 100 tests.
  2377. 261.36 s [vector] izipWithM: OK
  2378. 261.36 s [vector] +++ OK, passed 100 tests.
  2379. 261.37 s [vector] izipWithM_: OK (0.01s)
  2380. 261.38 s [vector] +++ OK, passed 100 tests.
  2381. 261.38 s [vector] zipWithM: OK
  2382. 261.38 s [vector] +++ OK, passed 100 tests.
  2383. 261.38 s [vector] zipWithM_: OK
  2384. 261.38 s [vector] +++ OK, passed 100 tests.
  2385. 261.38 s [vector] filter: OK
  2386. 261.38 s [vector] +++ OK, passed 100 tests.
  2387. 261.40 s [vector] ifilter: OK
  2388. 261.40 s [vector] +++ OK, passed 100 tests.
  2389. 261.40 s [vector] filterM: OK (0.02s)
  2390. 261.40 s [vector] +++ OK, passed 100 tests.
  2391. 261.40 s [vector] uniq: OK
  2392. 261.40 s [vector] +++ OK, passed 100 tests.
  2393. 261.40 s [vector] mapMaybe: OK
  2394. 261.40 s [vector] +++ OK, passed 100 tests.
  2395. 261.40 s [vector] imapMaybe: OK
  2396. 261.40 s [vector] +++ OK, passed 100 tests.
  2397. 261.40 s [vector] takeWhile: OK
  2398. 261.40 s [vector] +++ OK, passed 100 tests.
  2399. 261.40 s [vector] dropWhile: OK
  2400. 261.41 s [vector] +++ OK, passed 100 tests.
  2401. 261.41 s [vector] partition: OK
  2402. 261.41 s [vector] +++ OK, passed 100 tests.
  2403. 261.41 s [vector] partitionWith: OK
  2404. 261.41 s [vector] +++ OK, passed 100 tests.
  2405. 261.41 s [vector] span: OK
  2406. 261.41 s [vector] +++ OK, passed 100 tests.
  2407. 261.41 s [vector] break: OK
  2408. 261.41 s [vector] +++ OK, passed 100 tests.
  2409. 261.41 s [vector] spanR: OK
  2410. 261.41 s [vector] +++ OK, passed 100 tests.
  2411. 261.41 s [vector] breakR: OK
  2412. 261.41 s [vector] +++ OK, passed 100 tests.
  2413. 261.41 s [vector] groupBy: OK
  2414. 261.41 s [vector] +++ OK, passed 100 tests.
  2415. 261.41 s [vector] elem: OK
  2416. 261.41 s [vector] +++ OK, passed 100 tests.
  2417. 261.41 s [vector] notElem: OK
  2418. 261.41 s [vector] +++ OK, passed 100 tests.
  2419. 261.41 s [vector] find: OK
  2420. 261.41 s [vector] +++ OK, passed 100 tests.
  2421. 261.41 s [vector] findIndex: OK
  2422. 261.41 s [vector] +++ OK, passed 100 tests.
  2423. 261.41 s [vector] findIndexR: OK
  2424. 261.41 s [vector] +++ OK, passed 100 tests.
  2425. 261.41 s [vector] findIndices: OK
  2426. 261.41 s [vector] +++ OK, passed 100 tests.
  2427. 261.41 s [vector] elemIndex: OK
  2428. 261.41 s [vector] +++ OK, passed 100 tests.
  2429. 261.42 s [vector] elemIndices: OK
  2430. 261.42 s [vector] +++ OK, passed 100 tests.
  2431. 261.42 s [vector] foldl: OK
  2432. 261.42 s [vector] +++ OK, passed 100 tests.
  2433. 261.42 s [vector] foldl1: OK
  2434. 261.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2435. 261.42 s [vector] foldl': OK
  2436. 261.42 s [vector] +++ OK, passed 100 tests.
  2437. 261.42 s [vector] foldl1': OK
  2438. 261.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2439. 261.42 s [vector] foldr: OK
  2440. 261.42 s [vector] +++ OK, passed 100 tests.
  2441. 261.42 s [vector] foldr1: OK
  2442. 261.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2443. 261.43 s [vector] foldr': OK
  2444. 261.43 s [vector] +++ OK, passed 100 tests.
  2445. 261.43 s [vector] foldr1': OK
  2446. 261.43 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2447. 261.43 s [vector] ifoldl: OK
  2448. 261.43 s [vector] +++ OK, passed 100 tests.
  2449. 261.44 s [vector] ifoldl': OK
  2450. 261.44 s [vector] +++ OK, passed 100 tests.
  2451. 261.44 s [vector] ifoldr: OK
  2452. 261.44 s [vector] +++ OK, passed 100 tests.
  2453. 261.44 s [vector] ifoldr': OK
  2454. 261.44 s [vector] +++ OK, passed 100 tests.
  2455. 261.44 s [vector] ifoldM: OK
  2456. 261.44 s [vector] +++ OK, passed 100 tests.
  2457. 261.46 s [vector] ifoldM': OK
  2458. 261.46 s [vector] +++ OK, passed 100 tests.
  2459. 261.46 s [vector] ifoldM_: OK (0.01s)
  2460. 261.46 s [vector] +++ OK, passed 100 tests.
  2461. 261.47 s [vector] ifoldM'_: OK (0.01s)
  2462. 261.47 s [vector] +++ OK, passed 100 tests.
  2463. 261.47 s [vector] all: OK
  2464. 261.47 s [vector] +++ OK, passed 100 tests.
  2465. 261.47 s [vector] any: OK
  2466. 261.47 s [vector] +++ OK, passed 100 tests.
  2467. 261.47 s [vector] prescanl: OK
  2468. 261.47 s [vector] +++ OK, passed 100 tests.
  2469. 261.48 s [vector] prescanl': OK
  2470. 261.48 s [vector] +++ OK, passed 100 tests.
  2471. 261.48 s [vector] postscanl: OK
  2472. 261.48 s [vector] +++ OK, passed 100 tests.
  2473. 261.48 s [vector] postscanl': OK
  2474. 261.48 s [vector] +++ OK, passed 100 tests.
  2475. 261.48 s [vector] scanl: OK
  2476. 261.48 s [vector] +++ OK, passed 100 tests.
  2477. 261.48 s [vector] scanl': OK
  2478. 261.48 s [vector] +++ OK, passed 100 tests.
  2479. 261.48 s [vector] scanl1: OK
  2480. 261.48 s [vector] +++ OK, passed 100 tests.
  2481. 261.49 s [vector] scanl1': OK
  2482. 261.49 s [vector] +++ OK, passed 100 tests.
  2483. 261.49 s [vector] iscanl: OK
  2484. 261.49 s [vector] +++ OK, passed 100 tests.
  2485. 261.49 s [vector] iscanl': OK
  2486. 261.49 s [vector] +++ OK, passed 100 tests.
  2487. 261.49 s [vector] prescanr: OK
  2488. 261.49 s [vector] +++ OK, passed 100 tests.
  2489. 261.49 s [vector] prescanr': OK
  2490. 261.49 s [vector] +++ OK, passed 100 tests.
  2491. 261.49 s [vector] postscanr: OK
  2492. 261.49 s [vector] +++ OK, passed 100 tests.
  2493. 261.50 s [vector] postscanr': OK
  2494. 261.50 s [vector] +++ OK, passed 100 tests.
  2495. 261.50 s [vector] scanr: OK
  2496. 261.50 s [vector] +++ OK, passed 100 tests.
  2497. 261.50 s [vector] scanr': OK
  2498. 261.50 s [vector] +++ OK, passed 100 tests.
  2499. 261.50 s [vector] scanr1: OK
  2500. 261.50 s [vector] +++ OK, passed 100 tests.
  2501. 261.50 s [vector] scanr1': OK
  2502. 261.50 s [vector] +++ OK, passed 100 tests.
  2503. 261.50 s [vector] iscanr: OK
  2504. 261.50 s [vector] +++ OK, passed 100 tests.
  2505. 261.50 s [vector] iscanr': OK
  2506. 261.51 s [vector] +++ OK, passed 100 tests.
  2507. 261.51 s [vector] mut_read: OK
  2508. 261.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2509. 261.51 s [vector] mut_write: OK
  2510. 261.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2511. 261.51 s [vector] mut_modify: OK
  2512. 261.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2513. 261.52 s [vector] mut_generate: OK
  2514. 261.52 s [vector] +++ OK, passed 100 tests.
  2515. 261.52 s [vector] mut_generateM: OK
  2516. 261.52 s [vector] +++ OK, passed 100 tests.
  2517. 261.54 s [vector] mut_mapM_: OK
  2518. 261.54 s [vector] +++ OK, passed 100 tests.
  2519. 261.54 s [vector] mut_imapM_: OK (0.01s)
  2520. 261.54 s [vector] +++ OK, passed 100 tests.
  2521. 261.56 s [vector] mut_forM_: OK
  2522. 261.56 s [vector] +++ OK, passed 100 tests.
  2523. 261.56 s [vector] mut_iforM_: OK (0.01s)
  2524. 261.56 s [vector] +++ OK, passed 100 tests.
  2525. 261.56 s [vector] mut_foldr: OK
  2526. 261.56 s [vector] +++ OK, passed 100 tests.
  2527. 261.56 s [vector] mut_foldr': OK
  2528. 261.56 s [vector] +++ OK, passed 100 tests.
  2529. 261.56 s [vector] mut_foldl: OK
  2530. 261.56 s [vector] +++ OK, passed 100 tests.
  2531. 261.56 s [vector] mut_foldl': OK
  2532. 261.57 s [vector] +++ OK, passed 100 tests.
  2533. 261.57 s [vector] mut_ifoldr: OK
  2534. 261.57 s [vector] +++ OK, passed 100 tests.
  2535. 261.57 s [vector] mut_ifoldr': OK
  2536. 261.57 s [vector] +++ OK, passed 100 tests.
  2537. 261.57 s [vector] mut_ifoldl: OK
  2538. 261.57 s [vector] +++ OK, passed 100 tests.
  2539. 261.57 s [vector] mut_ifoldl': OK
  2540. 261.57 s [vector] +++ OK, passed 100 tests.
  2541. 261.57 s [vector] mut_foldM: OK
  2542. 261.57 s [vector] +++ OK, passed 100 tests.
  2543. 261.57 s [vector] mut_foldM': OK
  2544. 261.58 s [vector] +++ OK, passed 100 tests.
  2545. 261.58 s [vector] mut_foldrM: OK
  2546. 261.58 s [vector] +++ OK, passed 100 tests.
  2547. 261.58 s [vector] mut_foldrM': OK
  2548. 261.58 s [vector] +++ OK, passed 100 tests.
  2549. 261.58 s [vector] mut_ifoldM: OK
  2550. 261.58 s [vector] +++ OK, passed 100 tests.
  2551. 261.58 s [vector] mut_ifoldM': OK
  2552. 261.58 s [vector] +++ OK, passed 100 tests.
  2553. 261.59 s [vector] mut_ifoldrM: OK
  2554. 261.59 s [vector] +++ OK, passed 100 tests.
  2555. 261.59 s [vector] mut_ifoldrM': OK
  2556. 261.59 s [vector] +++ OK, passed 100 tests.
  2557. 261.59 s [vector] compare: OK
  2558. 261.59 s [vector] +++ OK, passed 100 tests.
  2559. 261.59 s [vector] maximum: OK
  2560. 261.59 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2561. 261.59 s [vector] minimum: OK
  2562. 261.59 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2563. 261.59 s [vector] minIndex: OK
  2564. 261.59 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2565. 261.59 s [vector] maxIndex: OK
  2566. 261.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2567. 261.59 s [vector] maximumBy: OK
  2568. 261.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2569. 261.59 s [vector] minimumBy: OK
  2570. 261.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2571. 261.59 s [vector] maximumOn: OK
  2572. 261.59 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2573. 261.59 s [vector] minimumOn: OK
  2574. 261.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2575. 261.59 s [vector] maxIndexBy: OK
  2576. 261.59 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2577. 261.59 s [vector] minIndexBy: OK
  2578. 261.59 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2579. 261.59 s [vector] ListFirstMaxIndexWins: OK
  2580. 261.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2581. 261.59 s [vector] FalseListFirstMaxIndexWins: OK
  2582. 261.59 s [vector] +++ OK, failed as expected. (after 1 test):
  2583. 261.59 s [vector] Exception:
  2584. 261.59 s [vector] Prelude.foldr1: empty list
  2585. 261.59 s [vector] CallStack (from HasCallStack):
  2586. 261.59 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  2587. 261.59 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  2588. 261.59 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  2589. 261.59 s [vector] []
  2590. 261.60 s [vector] zip: OK
  2591. 261.60 s [vector] +++ OK, passed 100 tests.
  2592. 261.60 s [vector] zip3: OK
  2593. 261.60 s [vector] +++ OK, passed 100 tests.
  2594. 261.60 s [vector] unzip: OK
  2595. 261.60 s [vector] +++ OK, passed 100 tests.
  2596. 261.60 s [vector] unzip3: OK
  2597. 261.60 s [vector] +++ OK, passed 100 tests.
  2598. 261.60 s [vector] indexed: OK
  2599. 261.60 s [vector] +++ OK, passed 100 tests.
  2600. 261.60 s [vector] update: OK
  2601. 261.60 s [vector] +++ OK, passed 100 tests.
  2602. 261.61 s [vector] concat: OK
  2603. 261.61 s [vector] +++ OK, passed 100 tests.
  2604. 261.61 s [vector] mempty: OK
  2605. 261.61 s [vector] +++ OK, passed 100 tests.
  2606. 261.61 s [vector] mappend: OK
  2607. 261.62 s [vector] +++ OK, passed 100 tests.
  2608. 261.62 s [vector] mconcat: OK
  2609. 261.62 s [vector] +++ OK, passed 100 tests.
  2610. 261.62 s [vector] fmap: OK
  2611. 261.62 s [vector] +++ OK, passed 100 tests.
  2612. 261.62 s [vector] return: OK
  2613. 261.62 s [vector] +++ OK, passed 100 tests.
  2614. 261.63 s [vector] bind: OK (0.01s)
  2615. 261.63 s [vector] +++ OK, passed 100 tests.
  2616. 261.63 s [vector] mzip: OK
  2617. 261.63 s [vector] +++ OK, passed 100 tests.
  2618. 261.63 s [vector] munzip: OK
  2619. 261.63 s [vector] +++ OK, passed 100 tests.
  2620. 261.64 s [vector] applicative_pure: OK
  2621. 261.64 s [vector] +++ OK, passed 100 tests.
  2622. 261.65 s [vector] applicative_appl: OK (0.02s)
  2623. 261.65 s [vector] +++ OK, passed 100 tests.
  2624. 261.66 s [vector] alternative_empty: OK
  2625. 261.66 s [vector] +++ OK, passed 100 tests.
  2626. 261.66 s [vector] alternative_or: OK
  2627. 261.66 s [vector] +++ OK, passed 100 tests.
  2628. 261.68 s [vector] sequence: OK (0.02s)
  2629. 261.68 s [vector] +++ OK, passed 100 tests.
  2630. 261.69 s [vector] sequence_: OK (0.01s)
  2631. 261.69 s [vector] +++ OK, passed 100 tests.
  2632. 261.69 s [vector] glength: OK
  2633. 261.69 s [vector] +++ OK, passed 100 tests.
  2634. 261.69 s [vector] and: OK
  2635. 261.69 s [vector] +++ OK, passed 100 tests.
  2636. 261.69 s [vector] or: OK
  2637. 261.69 s [vector] +++ OK, passed 100 tests.
  2638. 261.69 s [vector] Int
  2639. 261.69 s [vector] fromList.toList == id: OK
  2640. 261.69 s [vector] +++ OK, passed 100 tests.
  2641. 261.69 s [vector] toList.fromList == id: OK
  2642. 261.69 s [vector] +++ OK, passed 100 tests.
  2643. 261.69 s [vector] unstream.stream == id: OK
  2644. 261.69 s [vector] +++ OK, passed 100 tests.
  2645. 261.69 s [vector] stream.unstream == id: OK
  2646. 261.69 s [vector] +++ OK, passed 100 tests.
  2647. 261.69 s [vector] eq: OK
  2648. 261.69 s [vector] +++ OK, passed 100 tests.
  2649. 261.69 s [vector] length: OK
  2650. 261.69 s [vector] +++ OK, passed 100 tests.
  2651. 261.69 s [vector] null: OK
  2652. 261.69 s [vector] +++ OK, passed 100 tests.
  2653. 261.69 s [vector] index: OK
  2654. 261.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2655. 261.69 s [vector] safeIndex: OK
  2656. 261.69 s [vector] +++ OK, passed 100 tests.
  2657. 261.69 s [vector] head: OK
  2658. 261.69 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2659. 261.69 s [vector] last: OK
  2660. 261.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2661. 261.69 s [vector] unsafeIndex: OK
  2662. 261.69 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2663. 261.69 s [vector] unsafeHead: OK
  2664. 261.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2665. 261.69 s [vector] unsafeLast: OK
  2666. 261.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2667. 261.69 s [vector] slice: OK
  2668. 261.69 s [vector] +++ OK, passed 100 tests.
  2669. 261.69 s [vector] init: OK
  2670. 261.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2671. 261.70 s [vector] tail: OK
  2672. 261.70 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2673. 261.70 s [vector] take: OK
  2674. 261.70 s [vector] +++ OK, passed 100 tests.
  2675. 261.70 s [vector] drop: OK
  2676. 261.70 s [vector] +++ OK, passed 100 tests.
  2677. 261.70 s [vector] splitAt: OK
  2678. 261.70 s [vector] +++ OK, passed 100 tests.
  2679. 261.70 s [vector] empty: OK
  2680. 261.70 s [vector] +++ OK, passed 100 tests.
  2681. 261.70 s [vector] singleton: OK
  2682. 261.70 s [vector] +++ OK, passed 100 tests.
  2683. 261.70 s [vector] replicate: OK
  2684. 261.70 s [vector] +++ OK, passed 100 tests.
  2685. 261.70 s [vector] generate: OK
  2686. 261.70 s [vector] +++ OK, passed 100 tests.
  2687. 261.70 s [vector] iterateN: OK
  2688. 261.70 s [vector] +++ OK, passed 100 tests.
  2689. 261.73 s [vector] iterateNM: OK (0.03s)
  2690. 261.73 s [vector] +++ OK, passed 100 tests.
  2691. 261.74 s [vector] generateM: OK
  2692. 261.74 s [vector] +++ OK, passed 100 tests.
  2693. 261.76 s [vector] replicateM: OK (0.02s)
  2694. 261.76 s [vector] +++ OK, passed 100 tests.
  2695. 261.76 s [vector] create: OK
  2696. 261.76 s [vector] +++ OK, passed 100 tests.
  2697. 261.76 s [vector] createT: OK
  2698. 261.76 s [vector] +++ OK, passed 100 tests.
  2699. 261.76 s [vector] unfoldr: OK
  2700. 261.76 s [vector] +++ OK, passed 100 tests.
  2701. 261.76 s [vector] unfoldrN: OK
  2702. 261.76 s [vector] +++ OK, passed 100 tests.
  2703. 261.76 s [vector] unfoldrExactN: OK
  2704. 261.77 s [vector] +++ OK, passed 100 tests.
  2705. 261.78 s [vector] unfoldrM: OK (0.01s)
  2706. 261.78 s [vector] +++ OK, passed 100 tests.
  2707. 261.78 s [vector] unfoldrNM: OK
  2708. 261.78 s [vector] +++ OK, passed 100 tests.
  2709. 261.82 s [vector] unfoldrExactNM: OK (0.04s)
  2710. 261.82 s [vector] +++ OK, passed 100 tests.
  2711. 261.82 s [vector] constructN: OK
  2712. 261.82 s [vector] +++ OK, passed 100 tests.
  2713. 261.82 s [vector] constructrN: OK
  2714. 261.82 s [vector] +++ OK, passed 100 tests.
  2715. 261.82 s [vector] cons: OK
  2716. 261.82 s [vector] +++ OK, passed 100 tests.
  2717. 261.83 s [vector] snoc: OK
  2718. 261.83 s [vector] +++ OK, passed 100 tests.
  2719. 261.83 s [vector] append: OK
  2720. 261.83 s [vector] +++ OK, passed 100 tests.
  2721. 261.84 s [vector] concat: OK (0.01s)
  2722. 261.84 s [vector] +++ OK, passed 100 tests.
  2723. 261.84 s [vector] force: OK
  2724. 261.84 s [vector] +++ OK, passed 100 tests.
  2725. 261.84 s [vector] upd: OK
  2726. 261.84 s [vector] +++ OK, passed 100 tests.
  2727. 261.84 s [vector] accum: OK
  2728. 261.84 s [vector] +++ OK, passed 100 tests.
  2729. 261.84 s [vector] reverse: OK
  2730. 261.84 s [vector] +++ OK, passed 100 tests.
  2731. 261.84 s [vector] backpermute: OK
  2732. 261.84 s [vector] +++ OK, passed 100 tests.
  2733. 261.85 s [vector] map: OK
  2734. 261.85 s [vector] +++ OK, passed 100 tests.
  2735. 261.85 s [vector] imap: OK
  2736. 261.85 s [vector] +++ OK, passed 100 tests.
  2737. 261.85 s [vector] concatMap: OK
  2738. 261.86 s [vector] +++ OK, passed 100 tests.
  2739. 261.86 s [vector] mapM: OK
  2740. 261.86 s [vector] +++ OK, passed 100 tests.
  2741. 261.87 s [vector] mapM_: OK (0.02s)
  2742. 261.87 s [vector] +++ OK, passed 100 tests.
  2743. 261.87 s [vector] forM: OK
  2744. 261.87 s [vector] +++ OK, passed 100 tests.
  2745. 261.89 s [vector] forM_: OK
  2746. 261.89 s [vector] +++ OK, passed 100 tests.
  2747. 261.89 s [vector] imapM: OK
  2748. 261.89 s [vector] +++ OK, passed 100 tests.
  2749. 261.91 s [vector] imapM_: OK
  2750. 261.91 s [vector] +++ OK, passed 100 tests.
  2751. 261.91 s [vector] zipWith: OK
  2752. 261.91 s [vector] +++ OK, passed 100 tests.
  2753. 261.91 s [vector] zipWith3: OK
  2754. 261.91 s [vector] +++ OK, passed 100 tests.
  2755. 261.92 s [vector] izipWith: OK
  2756. 261.92 s [vector] +++ OK, passed 100 tests.
  2757. 261.92 s [vector] izipWith3: OK
  2758. 261.92 s [vector] +++ OK, passed 100 tests.
  2759. 261.92 s [vector] izipWithM: OK
  2760. 261.92 s [vector] +++ OK, passed 100 tests.
  2761. 261.94 s [vector] izipWithM_: OK (0.01s)
  2762. 261.94 s [vector] +++ OK, passed 100 tests.
  2763. 261.94 s [vector] zipWithM: OK
  2764. 261.94 s [vector] +++ OK, passed 100 tests.
  2765. 261.95 s [vector] zipWithM_: OK (0.01s)
  2766. 261.95 s [vector] +++ OK, passed 100 tests.
  2767. 261.95 s [vector] filter: OK
  2768. 261.95 s [vector] +++ OK, passed 100 tests.
  2769. 261.96 s [vector] ifilter: OK
  2770. 261.96 s [vector] +++ OK, passed 100 tests.
  2771. 261.98 s [vector] filterM: OK (0.03s)
  2772. 261.98 s [vector] +++ OK, passed 100 tests.
  2773. 261.98 s [vector] uniq: OK
  2774. 261.98 s [vector] +++ OK, passed 100 tests.
  2775. 261.98 s [vector] mapMaybe: OK
  2776. 261.98 s [vector] +++ OK, passed 100 tests.
  2777. 261.98 s [vector] imapMaybe: OK
  2778. 261.99 s [vector] +++ OK, passed 100 tests.
  2779. 261.99 s [vector] takeWhile: OK
  2780. 261.99 s [vector] +++ OK, passed 100 tests.
  2781. 261.99 s [vector] dropWhile: OK
  2782. 261.99 s [vector] +++ OK, passed 100 tests.
  2783. 261.99 s [vector] partition: OK
  2784. 261.99 s [vector] +++ OK, passed 100 tests.
  2785. 261.99 s [vector] partitionWith: OK
  2786. 261.99 s [vector] +++ OK, passed 100 tests.
  2787. 261.99 s [vector] span: OK
  2788. 261.99 s [vector] +++ OK, passed 100 tests.
  2789. 261.99 s [vector] break: OK
  2790. 261.99 s [vector] +++ OK, passed 100 tests.
  2791. 261.99 s [vector] spanR: OK
  2792. 261.99 s [vector] +++ OK, passed 100 tests.
  2793. 261.99 s [vector] breakR: OK
  2794. 261.99 s [vector] +++ OK, passed 100 tests.
  2795. 261.99 s [vector] groupBy: OK
  2796. 262.00 s [vector] +++ OK, passed 100 tests.
  2797. 262.00 s [vector] elem: OK
  2798. 262.00 s [vector] +++ OK, passed 100 tests.
  2799. 262.00 s [vector] notElem: OK
  2800. 262.00 s [vector] +++ OK, passed 100 tests.
  2801. 262.00 s [vector] find: OK
  2802. 262.00 s [vector] +++ OK, passed 100 tests.
  2803. 262.00 s [vector] findIndex: OK
  2804. 262.00 s [vector] +++ OK, passed 100 tests.
  2805. 262.00 s [vector] findIndexR: OK
  2806. 262.00 s [vector] +++ OK, passed 100 tests.
  2807. 262.00 s [vector] findIndices: OK
  2808. 262.00 s [vector] +++ OK, passed 100 tests.
  2809. 262.00 s [vector] elemIndex: OK
  2810. 262.00 s [vector] +++ OK, passed 100 tests.
  2811. 262.00 s [vector] elemIndices: OK
  2812. 262.00 s [vector] +++ OK, passed 100 tests.
  2813. 262.00 s [vector] foldl: OK
  2814. 262.00 s [vector] +++ OK, passed 100 tests.
  2815. 262.01 s [vector] foldl1: OK
  2816. 262.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2817. 262.01 s [vector] foldl': OK
  2818. 262.01 s [vector] +++ OK, passed 100 tests.
  2819. 262.01 s [vector] foldl1': OK
  2820. 262.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2821. 262.01 s [vector] foldr: OK
  2822. 262.01 s [vector] +++ OK, passed 100 tests.
  2823. 262.02 s [vector] foldr1: OK
  2824. 262.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2825. 262.02 s [vector] foldr': OK
  2826. 262.02 s [vector] +++ OK, passed 100 tests.
  2827. 262.02 s [vector] foldr1': OK
  2828. 262.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2829. 262.03 s [vector] ifoldl: OK
  2830. 262.03 s [vector] +++ OK, passed 100 tests.
  2831. 262.03 s [vector] ifoldl': OK
  2832. 262.03 s [vector] +++ OK, passed 100 tests.
  2833. 262.03 s [vector] ifoldr: OK
  2834. 262.03 s [vector] +++ OK, passed 100 tests.
  2835. 262.04 s [vector] ifoldr': OK
  2836. 262.04 s [vector] +++ OK, passed 100 tests.
  2837. 262.04 s [vector] ifoldM: OK
  2838. 262.04 s [vector] +++ OK, passed 100 tests.
  2839. 262.04 s [vector] ifoldM': OK
  2840. 262.05 s [vector] +++ OK, passed 100 tests.
  2841. 262.06 s [vector] ifoldM_: OK (0.02s)
  2842. 262.06 s [vector] +++ OK, passed 100 tests.
  2843. 262.08 s [vector] ifoldM'_: OK (0.02s)
  2844. 262.08 s [vector] +++ OK, passed 100 tests.
  2845. 262.08 s [vector] all: OK
  2846. 262.08 s [vector] +++ OK, passed 100 tests.
  2847. 262.08 s [vector] any: OK
  2848. 262.08 s [vector] +++ OK, passed 100 tests.
  2849. 262.08 s [vector] prescanl: OK
  2850. 262.08 s [vector] +++ OK, passed 100 tests.
  2851. 262.09 s [vector] prescanl': OK
  2852. 262.09 s [vector] +++ OK, passed 100 tests.
  2853. 262.09 s [vector] postscanl: OK
  2854. 262.09 s [vector] +++ OK, passed 100 tests.
  2855. 262.09 s [vector] postscanl': OK
  2856. 262.10 s [vector] +++ OK, passed 100 tests.
  2857. 262.10 s [vector] scanl: OK
  2858. 262.10 s [vector] +++ OK, passed 100 tests.
  2859. 262.10 s [vector] scanl': OK
  2860. 262.10 s [vector] +++ OK, passed 100 tests.
  2861. 262.10 s [vector] scanl1: OK
  2862. 262.10 s [vector] +++ OK, passed 100 tests.
  2863. 262.10 s [vector] scanl1': OK
  2864. 262.10 s [vector] +++ OK, passed 100 tests.
  2865. 262.11 s [vector] iscanl: OK
  2866. 262.11 s [vector] +++ OK, passed 100 tests.
  2867. 262.12 s [vector] iscanl': OK
  2868. 262.12 s [vector] +++ OK, passed 100 tests.
  2869. 262.12 s [vector] prescanr: OK
  2870. 262.12 s [vector] +++ OK, passed 100 tests.
  2871. 262.12 s [vector] prescanr': OK
  2872. 262.13 s [vector] +++ OK, passed 100 tests.
  2873. 262.13 s [vector] postscanr: OK
  2874. 262.13 s [vector] +++ OK, passed 100 tests.
  2875. 262.13 s [vector] postscanr': OK
  2876. 262.14 s [vector] +++ OK, passed 100 tests.
  2877. 262.14 s [vector] scanr: OK
  2878. 262.14 s [vector] +++ OK, passed 100 tests.
  2879. 262.14 s [vector] scanr': OK
  2880. 262.14 s [vector] +++ OK, passed 100 tests.
  2881. 262.14 s [vector] scanr1: OK
  2882. 262.14 s [vector] +++ OK, passed 100 tests.
  2883. 262.14 s [vector] scanr1': OK
  2884. 262.14 s [vector] +++ OK, passed 100 tests.
  2885. 262.14 s [vector] iscanr: OK
  2886. 262.14 s [vector] +++ OK, passed 100 tests.
  2887. 262.14 s [vector] iscanr': OK
  2888. 262.14 s [vector] +++ OK, passed 100 tests.
  2889. 262.14 s [vector] mut_read: OK
  2890. 262.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2891. 262.14 s [vector] mut_write: OK
  2892. 262.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2893. 262.14 s [vector] mut_modify: OK
  2894. 262.14 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2895. 262.14 s [vector] mut_generate: OK
  2896. 262.14 s [vector] +++ OK, passed 100 tests.
  2897. 262.15 s [vector] mut_generateM: OK
  2898. 262.15 s [vector] +++ OK, passed 100 tests.
  2899. 262.18 s [vector] mut_mapM_: OK (0.03s)
  2900. 262.18 s [vector] +++ OK, passed 100 tests.
  2901. 262.20 s [vector] mut_imapM_: OK (0.02s)
  2902. 262.20 s [vector] +++ OK, passed 100 tests.
  2903. 262.22 s [vector] mut_forM_: OK (0.02s)
  2904. 262.22 s [vector] +++ OK, passed 100 tests.
  2905. 262.23 s [vector] mut_iforM_: OK (0.02s)
  2906. 262.23 s [vector] +++ OK, passed 100 tests.
  2907. 262.23 s [vector] mut_foldr: OK
  2908. 262.23 s [vector] +++ OK, passed 100 tests.
  2909. 262.24 s [vector] mut_foldr': OK
  2910. 262.24 s [vector] +++ OK, passed 100 tests.
  2911. 262.24 s [vector] mut_foldl: OK
  2912. 262.24 s [vector] +++ OK, passed 100 tests.
  2913. 262.25 s [vector] mut_foldl': OK
  2914. 262.25 s [vector] +++ OK, passed 100 tests.
  2915. 262.26 s [vector] mut_ifoldr: OK
  2916. 262.26 s [vector] +++ OK, passed 100 tests.
  2917. 262.26 s [vector] mut_ifoldr': OK
  2918. 262.26 s [vector] +++ OK, passed 100 tests.
  2919. 262.26 s [vector] mut_ifoldl: OK
  2920. 262.26 s [vector] +++ OK, passed 100 tests.
  2921. 262.26 s [vector] mut_ifoldl': OK
  2922. 262.27 s [vector] +++ OK, passed 100 tests.
  2923. 262.27 s [vector] mut_foldM: OK
  2924. 262.28 s [vector] +++ OK, passed 100 tests.
  2925. 262.28 s [vector] mut_foldM': OK
  2926. 262.28 s [vector] +++ OK, passed 100 tests.
  2927. 262.28 s [vector] mut_foldrM: OK
  2928. 262.28 s [vector] +++ OK, passed 100 tests.
  2929. 262.28 s [vector] mut_foldrM': OK
  2930. 262.28 s [vector] +++ OK, passed 100 tests.
  2931. 262.28 s [vector] mut_ifoldM: OK
  2932. 262.28 s [vector] +++ OK, passed 100 tests.
  2933. 262.28 s [vector] mut_ifoldM': OK
  2934. 262.28 s [vector] +++ OK, passed 100 tests.
  2935. 262.29 s [vector] mut_ifoldrM: OK
  2936. 262.29 s [vector] +++ OK, passed 100 tests.
  2937. 262.29 s [vector] mut_ifoldrM': OK
  2938. 262.29 s [vector] +++ OK, passed 100 tests.
  2939. 262.29 s [vector] compare: OK
  2940. 262.29 s [vector] +++ OK, passed 100 tests.
  2941. 262.29 s [vector] maximum: OK
  2942. 262.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2943. 262.29 s [vector] minimum: OK
  2944. 262.29 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2945. 262.29 s [vector] minIndex: OK
  2946. 262.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2947. 262.30 s [vector] maxIndex: OK
  2948. 262.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2949. 262.30 s [vector] maximumBy: OK
  2950. 262.30 s [vector] +++ OK, passed 100 tests; 11 discarded.
  2951. 262.30 s [vector] minimumBy: OK
  2952. 262.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2953. 262.30 s [vector] maximumOn: OK
  2954. 262.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2955. 262.30 s [vector] minimumOn: OK
  2956. 262.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2957. 262.30 s [vector] maxIndexBy: OK
  2958. 262.30 s [vector] +++ OK, passed 100 tests; 22 discarded.
  2959. 262.30 s [vector] minIndexBy: OK
  2960. 262.30 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2961. 262.30 s [vector] ListFirstMaxIndexWins: OK
  2962. 262.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2963. 262.30 s [vector] FalseListFirstMaxIndexWins: OK
  2964. 262.30 s [vector] +++ OK, failed as expected. (after 1 test):
  2965. 262.30 s [vector] Exception:
  2966. 262.30 s [vector] Prelude.foldr1: empty list
  2967. 262.30 s [vector] CallStack (from HasCallStack):
  2968. 262.30 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  2969. 262.30 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  2970. 262.30 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  2971. 262.30 s [vector] []
  2972. 262.30 s [vector] zip: OK
  2973. 262.30 s [vector] +++ OK, passed 100 tests.
  2974. 262.30 s [vector] zip3: OK
  2975. 262.30 s [vector] +++ OK, passed 100 tests.
  2976. 262.30 s [vector] unzip: OK
  2977. 262.30 s [vector] +++ OK, passed 100 tests.
  2978. 262.31 s [vector] unzip3: OK
  2979. 262.31 s [vector] +++ OK, passed 100 tests.
  2980. 262.31 s [vector] indexed: OK
  2981. 262.31 s [vector] +++ OK, passed 100 tests.
  2982. 262.32 s [vector] update: OK
  2983. 262.32 s [vector] +++ OK, passed 100 tests.
  2984. 262.32 s [vector] concat: OK (0.01s)
  2985. 262.32 s [vector] +++ OK, passed 100 tests.
  2986. 262.32 s [vector] mempty: OK
  2987. 262.32 s [vector] +++ OK, passed 100 tests.
  2988. 262.32 s [vector] mappend: OK
  2989. 262.34 s [vector] +++ OK, passed 100 tests.
  2990. 262.34 s [vector] mconcat: OK (0.01s)
  2991. 262.34 s [vector] +++ OK, passed 100 tests.
  2992. 262.34 s [vector] fmap: OK
  2993. 262.34 s [vector] +++ OK, passed 100 tests.
  2994. 262.34 s [vector] return: OK
  2995. 262.34 s [vector] +++ OK, passed 100 tests.
  2996. 262.36 s [vector] bind: OK (0.02s)
  2997. 262.36 s [vector] +++ OK, passed 100 tests.
  2998. 262.36 s [vector] mzip: OK
  2999. 262.36 s [vector] +++ OK, passed 100 tests.
  3000. 262.36 s [vector] munzip: OK
  3001. 262.36 s [vector] +++ OK, passed 100 tests.
  3002. 262.38 s [vector] applicative_pure: OK
  3003. 262.38 s [vector] +++ OK, passed 100 tests.
  3004. 262.41 s [vector] applicative_appl: OK (0.05s)
  3005. 262.42 s [vector] +++ OK, passed 100 tests.
  3006. 262.42 s [vector] alternative_empty: OK
  3007. 262.42 s [vector] +++ OK, passed 100 tests.
  3008. 262.42 s [vector] alternative_or: OK
  3009. 262.42 s [vector] +++ OK, passed 100 tests.
  3010. 262.46 s [vector] sequence: OK (0.03s)
  3011. 262.46 s [vector] +++ OK, passed 100 tests.
  3012. 262.47 s [vector] sequence_: OK (0.01s)
  3013. 262.47 s [vector] +++ OK, passed 100 tests.
  3014. 262.47 s [vector] glength: OK
  3015. 262.47 s [vector] +++ OK, passed 100 tests.
  3016. 262.47 s [vector] sum: OK
  3017. 262.47 s [vector] +++ OK, passed 100 tests.
  3018. 262.47 s [vector] product: OK
  3019. 262.47 s [vector] +++ OK, passed 100 tests.
  3020. 262.47 s [vector] enumFromN: OK
  3021. 262.47 s [vector] +++ OK, passed 100 tests.
  3022. 262.47 s [vector] enumFromThenN: OK
  3023. 262.47 s [vector] +++ OK, passed 100 tests.
  3024. 262.48 s [vector] enumFromTo: OK
  3025. 262.48 s [vector] +++ OK, passed 100 tests.
  3026. 262.48 s [vector] enumFromThenTo: OK
  3027. 262.48 s [vector] +++ OK, passed 100 tests; 10 discarded.
  3028. 262.48 s [vector] unstream
  3029. 262.48 s [vector] unstream == vunstream (exact): OK
  3030. 262.48 s [vector] +++ OK, passed 100 tests.
  3031. 262.48 s [vector] unstream == vunstream (unknown): OK
  3032. 262.48 s [vector] +++ OK, passed 100 tests.
  3033. 262.48 s [vector] unstreamR ~= vunstream (exact): OK
  3034. 262.48 s [vector] +++ OK, passed 100 tests.
  3035. 262.48 s [vector] unstreamR ~= vunstream (unknown): OK
  3036. 262.48 s [vector] +++ OK, passed 100 tests.
  3037. 262.48 s [vector] Tests.Vector.Primitive
  3038. 262.48 s [vector] Int
  3039. 262.48 s [vector] fromList.toList == id: OK
  3040. 262.48 s [vector] +++ OK, passed 100 tests.
  3041. 262.48 s [vector] toList.fromList == id: OK
  3042. 262.48 s [vector] +++ OK, passed 100 tests.
  3043. 262.48 s [vector] unstream.stream == id: OK
  3044. 262.48 s [vector] +++ OK, passed 100 tests.
  3045. 262.48 s [vector] stream.unstream == id: OK
  3046. 262.48 s [vector] +++ OK, passed 100 tests.
  3047. 262.48 s [vector] eq: OK
  3048. 262.48 s [vector] +++ OK, passed 100 tests.
  3049. 262.48 s [vector] length: OK
  3050. 262.49 s [vector] +++ OK, passed 100 tests.
  3051. 262.49 s [vector] null: OK
  3052. 262.49 s [vector] +++ OK, passed 100 tests.
  3053. 262.49 s [vector] index: OK
  3054. 262.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3055. 262.49 s [vector] safeIndex: OK
  3056. 262.49 s [vector] +++ OK, passed 100 tests.
  3057. 262.49 s [vector] head: OK
  3058. 262.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3059. 262.49 s [vector] last: OK
  3060. 262.49 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3061. 262.49 s [vector] unsafeIndex: OK
  3062. 262.49 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3063. 262.49 s [vector] unsafeHead: OK
  3064. 262.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3065. 262.49 s [vector] unsafeLast: OK
  3066. 262.49 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3067. 262.49 s [vector] slice: OK
  3068. 262.49 s [vector] +++ OK, passed 100 tests.
  3069. 262.49 s [vector] init: OK
  3070. 262.49 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3071. 262.49 s [vector] tail: OK
  3072. 262.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3073. 262.49 s [vector] take: OK
  3074. 262.49 s [vector] +++ OK, passed 100 tests.
  3075. 262.49 s [vector] drop: OK
  3076. 262.49 s [vector] +++ OK, passed 100 tests.
  3077. 262.49 s [vector] splitAt: OK
  3078. 262.49 s [vector] +++ OK, passed 100 tests.
  3079. 262.49 s [vector] empty: OK
  3080. 262.49 s [vector] +++ OK, passed 100 tests.
  3081. 262.49 s [vector] singleton: OK
  3082. 262.49 s [vector] +++ OK, passed 100 tests.
  3083. 262.49 s [vector] replicate: OK
  3084. 262.49 s [vector] +++ OK, passed 100 tests.
  3085. 262.50 s [vector] generate: OK
  3086. 262.50 s [vector] +++ OK, passed 100 tests.
  3087. 262.50 s [vector] iterateN: OK
  3088. 262.50 s [vector] +++ OK, passed 100 tests.
  3089. 262.54 s [vector] iterateNM: OK (0.04s)
  3090. 262.54 s [vector] +++ OK, passed 100 tests.
  3091. 262.56 s [vector] generateM: OK (0.01s)
  3092. 262.56 s [vector] +++ OK, passed 100 tests.
  3093. 262.57 s [vector] replicateM: OK (0.02s)
  3094. 262.57 s [vector] +++ OK, passed 100 tests.
  3095. 262.57 s [vector] create: OK
  3096. 262.57 s [vector] +++ OK, passed 100 tests.
  3097. 262.57 s [vector] createT: OK
  3098. 262.57 s [vector] +++ OK, passed 100 tests.
  3099. 262.58 s [vector] unfoldr: OK
  3100. 262.58 s [vector] +++ OK, passed 100 tests.
  3101. 262.58 s [vector] unfoldrN: OK
  3102. 262.58 s [vector] +++ OK, passed 100 tests.
  3103. 262.58 s [vector] unfoldrExactN: OK
  3104. 262.58 s [vector] +++ OK, passed 100 tests.
  3105. 262.58 s [vector] unfoldrM: OK
  3106. 262.58 s [vector] +++ OK, passed 100 tests.
  3107. 262.60 s [vector] unfoldrNM: OK (0.02s)
  3108. 262.60 s [vector] +++ OK, passed 100 tests.
  3109. 262.64 s [vector] unfoldrExactNM: OK (0.03s)
  3110. 262.64 s [vector] +++ OK, passed 100 tests.
  3111. 262.64 s [vector] constructN: OK (0.01s)
  3112. 262.64 s [vector] +++ OK, passed 100 tests.
  3113. 262.65 s [vector] constructrN: OK
  3114. 262.65 s [vector] +++ OK, passed 100 tests.
  3115. 262.65 s [vector] cons: OK
  3116. 262.65 s [vector] +++ OK, passed 100 tests.
  3117. 262.65 s [vector] snoc: OK
  3118. 262.66 s [vector] +++ OK, passed 100 tests.
  3119. 262.66 s [vector] append: OK
  3120. 262.66 s [vector] +++ OK, passed 100 tests.
  3121. 262.67 s [vector] concat: OK (0.02s)
  3122. 262.67 s [vector] +++ OK, passed 100 tests.
  3123. 262.67 s [vector] force: OK
  3124. 262.67 s [vector] +++ OK, passed 100 tests.
  3125. 262.68 s [vector] upd: OK
  3126. 262.68 s [vector] +++ OK, passed 100 tests.
  3127. 262.68 s [vector] accum: OK
  3128. 262.68 s [vector] +++ OK, passed 100 tests.
  3129. 262.68 s [vector] reverse: OK
  3130. 262.68 s [vector] +++ OK, passed 100 tests.
  3131. 262.68 s [vector] backpermute: OK
  3132. 262.68 s [vector] +++ OK, passed 100 tests.
  3133. 262.69 s [vector] map: OK
  3134. 262.69 s [vector] +++ OK, passed 100 tests.
  3135. 262.69 s [vector] imap: OK
  3136. 262.69 s [vector] +++ OK, passed 100 tests.
  3137. 262.69 s [vector] concatMap: OK
  3138. 262.69 s [vector] +++ OK, passed 100 tests.
  3139. 262.70 s [vector] mapM: OK
  3140. 262.70 s [vector] +++ OK, passed 100 tests.
  3141. 262.72 s [vector] mapM_: OK (0.02s)
  3142. 262.72 s [vector] +++ OK, passed 100 tests.
  3143. 262.72 s [vector] forM: OK
  3144. 262.72 s [vector] +++ OK, passed 100 tests.
  3145. 262.74 s [vector] forM_: OK (0.02s)
  3146. 262.74 s [vector] +++ OK, passed 100 tests.
  3147. 262.74 s [vector] imapM: OK
  3148. 262.74 s [vector] +++ OK, passed 100 tests.
  3149. 262.76 s [vector] imapM_: OK (0.02s)
  3150. 262.76 s [vector] +++ OK, passed 100 tests.
  3151. 262.77 s [vector] zipWith: OK
  3152. 262.77 s [vector] +++ OK, passed 100 tests.
  3153. 262.77 s [vector] zipWith3: OK
  3154. 262.77 s [vector] +++ OK, passed 100 tests.
  3155. 262.77 s [vector] izipWith: OK
  3156. 262.78 s [vector] +++ OK, passed 100 tests.
  3157. 262.78 s [vector] izipWith3: OK
  3158. 262.78 s [vector] +++ OK, passed 100 tests.
  3159. 262.78 s [vector] izipWithM: OK
  3160. 262.78 s [vector] +++ OK, passed 100 tests.
  3161. 262.79 s [vector] izipWithM_: OK (0.01s)
  3162. 262.79 s [vector] +++ OK, passed 100 tests.
  3163. 262.80 s [vector] zipWithM: OK
  3164. 262.80 s [vector] +++ OK, passed 100 tests.
  3165. 262.81 s [vector] zipWithM_: OK (0.01s)
  3166. 262.81 s [vector] +++ OK, passed 100 tests.
  3167. 262.81 s [vector] filter: OK
  3168. 262.81 s [vector] +++ OK, passed 100 tests.
  3169. 262.81 s [vector] ifilter: OK
  3170. 262.82 s [vector] +++ OK, passed 100 tests.
  3171. 262.84 s [vector] filterM: OK (0.03s)
  3172. 262.84 s [vector] +++ OK, passed 100 tests.
  3173. 262.84 s [vector] uniq: OK
  3174. 262.84 s [vector] +++ OK, passed 100 tests.
  3175. 262.84 s [vector] mapMaybe: OK
  3176. 262.85 s [vector] +++ OK, passed 100 tests.
  3177. 262.85 s [vector] imapMaybe: OK
  3178. 262.85 s [vector] +++ OK, passed 100 tests.
  3179. 262.85 s [vector] takeWhile: OK
  3180. 262.85 s [vector] +++ OK, passed 100 tests.
  3181. 262.85 s [vector] dropWhile: OK
  3182. 262.85 s [vector] +++ OK, passed 100 tests.
  3183. 262.85 s [vector] partition: OK
  3184. 262.85 s [vector] +++ OK, passed 100 tests.
  3185. 262.85 s [vector] partitionWith: OK
  3186. 262.85 s [vector] +++ OK, passed 100 tests.
  3187. 262.85 s [vector] span: OK
  3188. 262.85 s [vector] +++ OK, passed 100 tests.
  3189. 262.85 s [vector] break: OK
  3190. 262.85 s [vector] +++ OK, passed 100 tests.
  3191. 262.86 s [vector] spanR: OK
  3192. 262.86 s [vector] +++ OK, passed 100 tests.
  3193. 262.86 s [vector] breakR: OK
  3194. 262.86 s [vector] +++ OK, passed 100 tests.
  3195. 262.86 s [vector] groupBy: OK
  3196. 262.86 s [vector] +++ OK, passed 100 tests.
  3197. 262.86 s [vector] elem: OK
  3198. 262.86 s [vector] +++ OK, passed 100 tests.
  3199. 262.86 s [vector] notElem: OK
  3200. 262.86 s [vector] +++ OK, passed 100 tests.
  3201. 262.86 s [vector] find: OK
  3202. 262.86 s [vector] +++ OK, passed 100 tests.
  3203. 262.86 s [vector] findIndex: OK
  3204. 262.86 s [vector] +++ OK, passed 100 tests.
  3205. 262.86 s [vector] findIndexR: OK
  3206. 262.86 s [vector] +++ OK, passed 100 tests.
  3207. 262.86 s [vector] findIndices: OK
  3208. 262.86 s [vector] +++ OK, passed 100 tests.
  3209. 262.86 s [vector] elemIndex: OK
  3210. 262.86 s [vector] +++ OK, passed 100 tests.
  3211. 262.86 s [vector] elemIndices: OK
  3212. 262.87 s [vector] +++ OK, passed 100 tests.
  3213. 262.87 s [vector] foldl: OK
  3214. 262.87 s [vector] +++ OK, passed 100 tests.
  3215. 262.87 s [vector] foldl1: OK
  3216. 262.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3217. 262.87 s [vector] foldl': OK
  3218. 262.88 s [vector] +++ OK, passed 100 tests.
  3219. 262.88 s [vector] foldl1': OK
  3220. 262.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3221. 262.88 s [vector] foldr: OK
  3222. 262.88 s [vector] +++ OK, passed 100 tests.
  3223. 262.88 s [vector] foldr1: OK
  3224. 262.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3225. 262.89 s [vector] foldr': OK
  3226. 262.89 s [vector] +++ OK, passed 100 tests.
  3227. 262.89 s [vector] foldr1': OK
  3228. 262.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3229. 262.89 s [vector] ifoldl: OK
  3230. 262.90 s [vector] +++ OK, passed 100 tests.
  3231. 262.90 s [vector] ifoldl': OK
  3232. 262.90 s [vector] +++ OK, passed 100 tests.
  3233. 262.90 s [vector] ifoldr: OK
  3234. 262.90 s [vector] +++ OK, passed 100 tests.
  3235. 262.90 s [vector] ifoldr': OK
  3236. 262.90 s [vector] +++ OK, passed 100 tests.
  3237. 262.91 s [vector] ifoldM: OK
  3238. 262.92 s [vector] +++ OK, passed 100 tests.
  3239. 262.92 s [vector] ifoldM': OK
  3240. 262.92 s [vector] +++ OK, passed 100 tests.
  3241. 262.94 s [vector] ifoldM_: OK (0.02s)
  3242. 262.94 s [vector] +++ OK, passed 100 tests.
  3243. 262.95 s [vector] ifoldM'_: OK (0.02s)
  3244. 262.95 s [vector] +++ OK, passed 100 tests.
  3245. 262.95 s [vector] all: OK
  3246. 262.95 s [vector] +++ OK, passed 100 tests.
  3247. 262.95 s [vector] any: OK
  3248. 262.95 s [vector] +++ OK, passed 100 tests.
  3249. 262.96 s [vector] prescanl: OK
  3250. 262.96 s [vector] +++ OK, passed 100 tests.
  3251. 262.96 s [vector] prescanl': OK
  3252. 262.96 s [vector] +++ OK, passed 100 tests.
  3253. 262.96 s [vector] postscanl: OK
  3254. 262.96 s [vector] +++ OK, passed 100 tests.
  3255. 262.96 s [vector] postscanl': OK
  3256. 262.96 s [vector] +++ OK, passed 100 tests.
  3257. 262.97 s [vector] scanl: OK
  3258. 262.97 s [vector] +++ OK, passed 100 tests.
  3259. 262.97 s [vector] scanl': OK
  3260. 262.97 s [vector] +++ OK, passed 100 tests.
  3261. 262.98 s [vector] scanl1: OK
  3262. 262.98 s [vector] +++ OK, passed 100 tests.
  3263. 262.98 s [vector] scanl1': OK
  3264. 262.98 s [vector] +++ OK, passed 100 tests.
  3265. 262.98 s [vector] iscanl: OK
  3266. 262.98 s [vector] +++ OK, passed 100 tests.
  3267. 262.99 s [vector] iscanl': OK
  3268. 262.99 s [vector] +++ OK, passed 100 tests.
  3269. 263.00 s [vector] prescanr: OK
  3270. 263.00 s [vector] +++ OK, passed 100 tests.
  3271. 263.00 s [vector] prescanr': OK
  3272. 263.00 s [vector] +++ OK, passed 100 tests.
  3273. 263.00 s [vector] postscanr: OK
  3274. 263.00 s [vector] +++ OK, passed 100 tests.
  3275. 263.01 s [vector] postscanr': OK
  3276. 263.01 s [vector] +++ OK, passed 100 tests.
  3277. 263.01 s [vector] scanr: OK
  3278. 263.01 s [vector] +++ OK, passed 100 tests.
  3279. 263.01 s [vector] scanr': OK
  3280. 263.01 s [vector] +++ OK, passed 100 tests.
  3281. 263.01 s [vector] scanr1: OK
  3282. 263.01 s [vector] +++ OK, passed 100 tests.
  3283. 263.02 s [vector] scanr1': OK
  3284. 263.02 s [vector] +++ OK, passed 100 tests.
  3285. 263.02 s [vector] iscanr: OK
  3286. 263.03 s [vector] +++ OK, passed 100 tests.
  3287. 263.03 s [vector] iscanr': OK
  3288. 263.03 s [vector] +++ OK, passed 100 tests.
  3289. 263.03 s [vector] mut_read: OK
  3290. 263.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3291. 263.04 s [vector] mut_write: OK
  3292. 263.04 s [vector] +++ OK, passed 100 tests; 27 discarded.
  3293. 263.04 s [vector] mut_modify: OK
  3294. 263.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3295. 263.04 s [vector] mut_generate: OK
  3296. 263.04 s [vector] +++ OK, passed 100 tests.
  3297. 263.04 s [vector] mut_generateM: OK
  3298. 263.04 s [vector] +++ OK, passed 100 tests.
  3299. 263.06 s [vector] mut_mapM_: OK (0.01s)
  3300. 263.06 s [vector] +++ OK, passed 100 tests.
  3301. 263.08 s [vector] mut_imapM_: OK (0.02s)
  3302. 263.08 s [vector] +++ OK, passed 100 tests.
  3303. 263.10 s [vector] mut_forM_: OK (0.01s)
  3304. 263.10 s [vector] +++ OK, passed 100 tests.
  3305. 263.11 s [vector] mut_iforM_: OK (0.02s)
  3306. 263.11 s [vector] +++ OK, passed 100 tests.
  3307. 263.11 s [vector] mut_foldr: OK
  3308. 263.11 s [vector] +++ OK, passed 100 tests.
  3309. 263.12 s [vector] mut_foldr': OK
  3310. 263.12 s [vector] +++ OK, passed 100 tests.
  3311. 263.12 s [vector] mut_foldl: OK
  3312. 263.12 s [vector] +++ OK, passed 100 tests.
  3313. 263.12 s [vector] mut_foldl': OK
  3314. 263.12 s [vector] +++ OK, passed 100 tests.
  3315. 263.12 s [vector] mut_ifoldr: OK
  3316. 263.12 s [vector] +++ OK, passed 100 tests.
  3317. 263.13 s [vector] mut_ifoldr': OK
  3318. 263.14 s [vector] +++ OK, passed 100 tests.
  3319. 263.14 s [vector] mut_ifoldl: OK
  3320. 263.14 s [vector] +++ OK, passed 100 tests.
  3321. 263.14 s [vector] mut_ifoldl': OK
  3322. 263.14 s [vector] +++ OK, passed 100 tests.
  3323. 263.14 s [vector] mut_foldM: OK
  3324. 263.15 s [vector] +++ OK, passed 100 tests.
  3325. 263.15 s [vector] mut_foldM': OK
  3326. 263.15 s [vector] +++ OK, passed 100 tests.
  3327. 263.16 s [vector] mut_foldrM: OK
  3328. 263.16 s [vector] +++ OK, passed 100 tests.
  3329. 263.16 s [vector] mut_foldrM': OK
  3330. 263.16 s [vector] +++ OK, passed 100 tests.
  3331. 263.16 s [vector] mut_ifoldM: OK
  3332. 263.16 s [vector] +++ OK, passed 100 tests.
  3333. 263.16 s [vector] mut_ifoldM': OK
  3334. 263.16 s [vector] +++ OK, passed 100 tests.
  3335. 263.16 s [vector] mut_ifoldrM: OK
  3336. 263.16 s [vector] +++ OK, passed 100 tests.
  3337. 263.17 s [vector] mut_ifoldrM': OK
  3338. 263.17 s [vector] +++ OK, passed 100 tests.
  3339. 263.17 s [vector] compare: OK
  3340. 263.17 s [vector] +++ OK, passed 100 tests.
  3341. 263.17 s [vector] maximum: OK
  3342. 263.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3343. 263.17 s [vector] minimum: OK
  3344. 263.17 s [vector] +++ OK, passed 100 tests; 26 discarded.
  3345. 263.17 s [vector] minIndex: OK
  3346. 263.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3347. 263.17 s [vector] maxIndex: OK
  3348. 263.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3349. 263.17 s [vector] maximumBy: OK
  3350. 263.17 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3351. 263.17 s [vector] minimumBy: OK
  3352. 263.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3353. 263.17 s [vector] maximumOn: OK
  3354. 263.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3355. 263.17 s [vector] minimumOn: OK
  3356. 263.17 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3357. 263.17 s [vector] maxIndexBy: OK
  3358. 263.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3359. 263.17 s [vector] minIndexBy: OK
  3360. 263.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3361. 263.17 s [vector] ListFirstMaxIndexWins: OK
  3362. 263.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3363. 263.17 s [vector] FalseListFirstMaxIndexWins: OK
  3364. 263.17 s [vector] +++ OK, failed as expected. (after 1 test):
  3365. 263.17 s [vector] Exception:
  3366. 263.17 s [vector] Prelude.foldr1: empty list
  3367. 263.17 s [vector] CallStack (from HasCallStack):
  3368. 263.17 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  3369. 263.17 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  3370. 263.17 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  3371. 263.17 s [vector] []
  3372. 263.17 s [vector] mempty: OK
  3373. 263.17 s [vector] +++ OK, passed 100 tests.
  3374. 263.17 s [vector] mappend: OK
  3375. 263.18 s [vector] +++ OK, passed 100 tests.
  3376. 263.19 s [vector] mconcat: OK (0.02s)
  3377. 263.19 s [vector] +++ OK, passed 100 tests.
  3378. 263.19 s [vector] glength: OK
  3379. 263.19 s [vector] +++ OK, passed 100 tests.
  3380. 263.19 s [vector] sum: OK
  3381. 263.19 s [vector] +++ OK, passed 100 tests.
  3382. 263.20 s [vector] product: OK
  3383. 263.20 s [vector] +++ OK, passed 100 tests.
  3384. 263.20 s [vector] enumFromN: OK
  3385. 263.20 s [vector] +++ OK, passed 100 tests.
  3386. 263.20 s [vector] enumFromThenN: OK
  3387. 263.20 s [vector] +++ OK, passed 100 tests.
  3388. 263.20 s [vector] enumFromTo: OK
  3389. 263.20 s [vector] +++ OK, passed 100 tests.
  3390. 263.20 s [vector] enumFromThenTo: OK
  3391. 263.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3392. 263.21 s [vector] Double
  3393. 263.21 s [vector] fromList.toList == id: OK
  3394. 263.21 s [vector] +++ OK, passed 100 tests.
  3395. 263.21 s [vector] toList.fromList == id: OK
  3396. 263.21 s [vector] +++ OK, passed 100 tests.
  3397. 263.21 s [vector] unstream.stream == id: OK
  3398. 263.21 s [vector] +++ OK, passed 100 tests.
  3399. 263.21 s [vector] stream.unstream == id: OK
  3400. 263.22 s [vector] +++ OK, passed 100 tests.
  3401. 263.22 s [vector] eq: OK
  3402. 263.22 s [vector] +++ OK, passed 100 tests.
  3403. 263.22 s [vector] length: OK
  3404. 263.22 s [vector] +++ OK, passed 100 tests.
  3405. 263.22 s [vector] null: OK
  3406. 263.22 s [vector] +++ OK, passed 100 tests.
  3407. 263.22 s [vector] index: OK
  3408. 263.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3409. 263.22 s [vector] safeIndex: OK
  3410. 263.22 s [vector] +++ OK, passed 100 tests.
  3411. 263.22 s [vector] head: OK
  3412. 263.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3413. 263.22 s [vector] last: OK
  3414. 263.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3415. 263.22 s [vector] unsafeIndex: OK
  3416. 263.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3417. 263.22 s [vector] unsafeHead: OK
  3418. 263.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3419. 263.22 s [vector] unsafeLast: OK
  3420. 263.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3421. 263.22 s [vector] slice: OK
  3422. 263.22 s [vector] +++ OK, passed 100 tests.
  3423. 263.22 s [vector] init: OK
  3424. 263.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3425. 263.22 s [vector] tail: OK
  3426. 263.22 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3427. 263.22 s [vector] take: OK
  3428. 263.22 s [vector] +++ OK, passed 100 tests.
  3429. 263.22 s [vector] drop: OK
  3430. 263.22 s [vector] +++ OK, passed 100 tests.
  3431. 263.22 s [vector] splitAt: OK
  3432. 263.22 s [vector] +++ OK, passed 100 tests.
  3433. 263.22 s [vector] empty: OK
  3434. 263.22 s [vector] +++ OK, passed 100 tests.
  3435. 263.22 s [vector] singleton: OK
  3436. 263.22 s [vector] +++ OK, passed 100 tests.
  3437. 263.22 s [vector] replicate: OK
  3438. 263.22 s [vector] +++ OK, passed 100 tests.
  3439. 263.22 s [vector] generate: OK
  3440. 263.22 s [vector] +++ OK, passed 100 tests.
  3441. 263.25 s [vector] iterateN: OK
  3442. 263.25 s [vector] +++ OK, passed 100 tests.
  3443. 263.26 s [vector] iterateNM: OK (0.03s)
  3444. 263.26 s [vector] +++ OK, passed 100 tests.
  3445. 263.30 s [vector] generateM: OK (0.03s)
  3446. 263.30 s [vector] +++ OK, passed 100 tests.
  3447. 263.30 s [vector] replicateM: OK (0.01s)
  3448. 263.30 s [vector] +++ OK, passed 100 tests.
  3449. 263.30 s [vector] create: OK
  3450. 263.30 s [vector] +++ OK, passed 100 tests.
  3451. 263.30 s [vector] createT: OK
  3452. 263.30 s [vector] +++ OK, passed 100 tests.
  3453. 263.30 s [vector] unfoldr: OK
  3454. 263.30 s [vector] +++ OK, passed 100 tests.
  3455. 263.30 s [vector] unfoldrN: OK
  3456. 263.30 s [vector] +++ OK, passed 100 tests.
  3457. 263.31 s [vector] unfoldrExactN: OK
  3458. 263.31 s [vector] +++ OK, passed 100 tests.
  3459. 263.31 s [vector] unfoldrM: OK
  3460. 263.31 s [vector] +++ OK, passed 100 tests.
  3461. 263.31 s [vector] unfoldrNM: OK
  3462. 263.31 s [vector] +++ OK, passed 100 tests.
  3463. 263.36 s [vector] unfoldrExactNM: OK (0.02s)
  3464. 263.36 s [vector] +++ OK, passed 100 tests.
  3465. 263.36 s [vector] constructN: OK (0.02s)
  3466. 263.36 s [vector] +++ OK, passed 100 tests.
  3467. 263.38 s [vector] constructrN: OK (0.01s)
  3468. 263.38 s [vector] +++ OK, passed 100 tests.
  3469. 263.38 s [vector] cons: OK
  3470. 263.38 s [vector] +++ OK, passed 100 tests.
  3471. 263.38 s [vector] snoc: OK
  3472. 263.38 s [vector] +++ OK, passed 100 tests.
  3473. 263.38 s [vector] append: OK
  3474. 263.38 s [vector] +++ OK, passed 100 tests.
  3475. 263.40 s [vector] concat: OK (0.02s)
  3476. 263.40 s [vector] +++ OK, passed 100 tests.
  3477. 263.40 s [vector] force: OK
  3478. 263.41 s [vector] +++ OK, passed 100 tests.
  3479. 263.41 s [vector] upd: OK
  3480. 263.41 s [vector] +++ OK, passed 100 tests.
  3481. 263.42 s [vector] accum: OK (0.01s)
  3482. 263.42 s [vector] +++ OK, passed 100 tests.
  3483. 263.42 s [vector] reverse: OK
  3484. 263.42 s [vector] +++ OK, passed 100 tests.
  3485. 263.42 s [vector] backpermute: OK
  3486. 263.42 s [vector] +++ OK, passed 100 tests.
  3487. 263.44 s [vector] map: OK
  3488. 263.44 s [vector] +++ OK, passed 100 tests.
  3489. 263.44 s [vector] imap: OK (0.01s)
  3490. 263.44 s [vector] +++ OK, passed 100 tests.
  3491. 263.45 s [vector] concatMap: OK
  3492. 263.45 s [vector] +++ OK, passed 100 tests.
  3493. 263.46 s [vector] mapM: OK
  3494. 263.46 s [vector] +++ OK, passed 100 tests.
  3495. 263.50 s [vector] mapM_: OK (0.03s)
  3496. 263.50 s [vector] +++ OK, passed 100 tests.
  3497. 263.50 s [vector] forM: OK
  3498. 263.50 s [vector] +++ OK, passed 100 tests.
  3499. 263.54 s [vector] forM_: OK (0.03s)
  3500. 263.54 s [vector] +++ OK, passed 100 tests.
  3501. 263.54 s [vector] imapM: OK
  3502. 263.54 s [vector] +++ OK, passed 100 tests.
  3503. 263.58 s [vector] imapM_: OK (0.04s)
  3504. 263.58 s [vector] +++ OK, passed 100 tests.
  3505. 263.58 s [vector] zipWith: OK
  3506. 263.58 s [vector] +++ OK, passed 100 tests.
  3507. 263.60 s [vector] zipWith3: OK
  3508. 263.60 s [vector] +++ OK, passed 100 tests.
  3509. 263.60 s [vector] izipWith: OK
  3510. 263.60 s [vector] +++ OK, passed 100 tests.
  3511. 263.62 s [vector] izipWith3: OK (0.01s)
  3512. 263.62 s [vector] +++ OK, passed 100 tests.
  3513. 263.64 s [vector] izipWithM: OK (0.01s)
  3514. 263.64 s [vector] +++ OK, passed 100 tests.
  3515. 263.65 s [vector] izipWithM_: OK (0.03s)
  3516. 263.65 s [vector] +++ OK, passed 100 tests.
  3517. 263.66 s [vector] zipWithM: OK
  3518. 263.66 s [vector] +++ OK, passed 100 tests.
  3519. 263.69 s [vector] zipWithM_: OK (0.03s)
  3520. 263.70 s [vector] +++ OK, passed 100 tests.
  3521. 263.70 s [vector] filter: OK
  3522. 263.70 s [vector] +++ OK, passed 100 tests.
  3523. 263.70 s [vector] ifilter: OK
  3524. 263.70 s [vector] +++ OK, passed 100 tests.
  3525. 263.74 s [vector] filterM: OK (0.04s)
  3526. 263.74 s [vector] +++ OK, passed 100 tests.
  3527. 263.74 s [vector] uniq: OK
  3528. 263.74 s [vector] +++ OK, passed 100 tests.
  3529. 263.75 s [vector] mapMaybe: OK
  3530. 263.75 s [vector] +++ OK, passed 100 tests.
  3531. 263.75 s [vector] imapMaybe: OK
  3532. 263.76 s [vector] +++ OK, passed 100 tests.
  3533. 263.76 s [vector] takeWhile: OK
  3534. 263.76 s [vector] +++ OK, passed 100 tests.
  3535. 263.77 s [vector] dropWhile: OK
  3536. 263.77 s [vector] +++ OK, passed 100 tests.
  3537. 263.77 s [vector] partition: OK
  3538. 263.77 s [vector] +++ OK, passed 100 tests.
  3539. 263.77 s [vector] partitionWith: OK
  3540. 263.77 s [vector] +++ OK, passed 100 tests.
  3541. 263.77 s [vector] span: OK
  3542. 263.77 s [vector] +++ OK, passed 100 tests.
  3543. 263.77 s [vector] break: OK
  3544. 263.77 s [vector] +++ OK, passed 100 tests.
  3545. 263.78 s [vector] spanR: OK
  3546. 263.78 s [vector] +++ OK, passed 100 tests.
  3547. 263.78 s [vector] breakR: OK
  3548. 263.78 s [vector] +++ OK, passed 100 tests.
  3549. 263.78 s [vector] groupBy: OK
  3550. 263.78 s [vector] +++ OK, passed 100 tests.
  3551. 263.78 s [vector] elem: OK
  3552. 263.78 s [vector] +++ OK, passed 100 tests.
  3553. 263.79 s [vector] notElem: OK
  3554. 263.79 s [vector] +++ OK, passed 100 tests.
  3555. 263.79 s [vector] find: OK
  3556. 263.79 s [vector] +++ OK, passed 100 tests.
  3557. 263.80 s [vector] findIndex: OK
  3558. 263.80 s [vector] +++ OK, passed 100 tests.
  3559. 263.80 s [vector] findIndexR: OK
  3560. 263.80 s [vector] +++ OK, passed 100 tests.
  3561. 263.80 s [vector] findIndices: OK
  3562. 263.80 s [vector] +++ OK, passed 100 tests.
  3563. 263.81 s [vector] elemIndex: OK
  3564. 263.81 s [vector] +++ OK, passed 100 tests.
  3565. 263.81 s [vector] elemIndices: OK
  3566. 263.82 s [vector] +++ OK, passed 100 tests.
  3567. 263.82 s [vector] foldl: OK (0.01s)
  3568. 263.82 s [vector] +++ OK, passed 100 tests.
  3569. 263.84 s [vector] foldl1: OK (0.01s)
  3570. 263.84 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3571. 263.85 s [vector] foldl': OK (0.01s)
  3572. 263.85 s [vector] +++ OK, passed 100 tests.
  3573. 263.86 s [vector] foldl1': OK (0.01s)
  3574. 263.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3575. 263.87 s [vector] foldr: OK (0.01s)
  3576. 263.87 s [vector] +++ OK, passed 100 tests.
  3577. 263.88 s [vector] foldr1: OK
  3578. 263.88 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3579. 263.90 s [vector] foldr': OK (0.01s)
  3580. 263.90 s [vector] +++ OK, passed 100 tests.
  3581. 263.90 s [vector] foldr1': OK (0.01s)
  3582. 263.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3583. 263.92 s [vector] ifoldl: OK (0.01s)
  3584. 263.92 s [vector] +++ OK, passed 100 tests.
  3585. 263.94 s [vector] ifoldl': OK (0.01s)
  3586. 263.94 s [vector] +++ OK, passed 100 tests.
  3587. 263.94 s [vector] ifoldr: OK (0.01s)
  3588. 263.95 s [vector] +++ OK, passed 100 tests.
  3589. 263.96 s [vector] ifoldr': OK (0.01s)
  3590. 263.96 s [vector] +++ OK, passed 100 tests.
  3591. 263.97 s [vector] ifoldM: OK (0.01s)
  3592. 263.97 s [vector] +++ OK, passed 100 tests.
  3593. 263.98 s [vector] ifoldM': OK
  3594. 263.98 s [vector] +++ OK, passed 100 tests.
  3595. 264.02 s [vector] ifoldM_: OK (0.03s)
  3596. 264.02 s [vector] +++ OK, passed 100 tests.
  3597. 264.06 s [vector] ifoldM'_: OK (0.04s)
  3598. 264.06 s [vector] +++ OK, passed 100 tests.
  3599. 264.06 s [vector] all: OK
  3600. 264.06 s [vector] +++ OK, passed 100 tests.
  3601. 264.08 s [vector] any: OK
  3602. 264.08 s [vector] +++ OK, passed 100 tests.
  3603. 264.09 s [vector] prescanl: OK (0.01s)
  3604. 264.09 s [vector] +++ OK, passed 100 tests.
  3605. 264.10 s [vector] prescanl': OK (0.01s)
  3606. 264.10 s [vector] +++ OK, passed 100 tests.
  3607. 264.11 s [vector] postscanl: OK (0.01s)
  3608. 264.11 s [vector] +++ OK, passed 100 tests.
  3609. 264.12 s [vector] postscanl': OK (0.01s)
  3610. 264.12 s [vector] +++ OK, passed 100 tests.
  3611. 264.14 s [vector] scanl: OK (0.01s)
  3612. 264.14 s [vector] +++ OK, passed 100 tests.
  3613. 264.15 s [vector] scanl': OK (0.01s)
  3614. 264.15 s [vector] +++ OK, passed 100 tests.
  3615. 264.16 s [vector] scanl1: OK (0.01s)
  3616. 264.16 s [vector] +++ OK, passed 100 tests.
  3617. 264.18 s [vector] scanl1': OK (0.02s)
  3618. 264.18 s [vector] +++ OK, passed 100 tests.
  3619. 264.18 s [vector] iscanl: OK (0.01s)
  3620. 264.18 s [vector] +++ OK, passed 100 tests.
  3621. 264.19 s [vector] iscanl': OK (0.01s)
  3622. 264.19 s [vector] +++ OK, passed 100 tests.
  3623. 264.20 s [vector] prescanr: OK
  3624. 264.20 s [vector] +++ OK, passed 100 tests.
  3625. 264.22 s [vector] prescanr': OK (0.01s)
  3626. 264.22 s [vector] +++ OK, passed 100 tests.
  3627. 264.24 s [vector] postscanr: OK (0.01s)
  3628. 264.24 s [vector] +++ OK, passed 100 tests.
  3629. 264.25 s [vector] postscanr': OK (0.01s)
  3630. 264.25 s [vector] +++ OK, passed 100 tests.
  3631. 264.26 s [vector] scanr: OK (0.01s)
  3632. 264.26 s [vector] +++ OK, passed 100 tests.
  3633. 264.27 s [vector] scanr': OK (0.01s)
  3634. 264.27 s [vector] +++ OK, passed 100 tests.
  3635. 264.28 s [vector] scanr1: OK (0.01s)
  3636. 264.28 s [vector] +++ OK, passed 100 tests.
  3637. 264.30 s [vector] scanr1': OK (0.01s)
  3638. 264.30 s [vector] +++ OK, passed 100 tests.
  3639. 264.31 s [vector] iscanr: OK (0.01s)
  3640. 264.31 s [vector] +++ OK, passed 100 tests.
  3641. 264.31 s [vector] iscanr': OK (0.01s)
  3642. 264.31 s [vector] +++ OK, passed 100 tests.
  3643. 264.31 s [vector] mut_read: OK
  3644. 264.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3645. 264.31 s [vector] mut_write: OK
  3646. 264.32 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3647. 264.32 s [vector] mut_modify: OK
  3648. 264.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3649. 264.32 s [vector] mut_generate: OK
  3650. 264.32 s [vector] +++ OK, passed 100 tests.
  3651. 264.34 s [vector] mut_generateM: OK (0.02s)
  3652. 264.34 s [vector] +++ OK, passed 100 tests.
  3653. 264.37 s [vector] mut_mapM_: OK (0.04s)
  3654. 264.37 s [vector] +++ OK, passed 100 tests.
  3655. 264.42 s [vector] mut_imapM_: OK (0.02s)
  3656. 264.42 s [vector] +++ OK, passed 100 tests.
  3657. 264.44 s [vector] mut_forM_: OK (0.03s)
  3658. 264.44 s [vector] +++ OK, passed 100 tests.
  3659. 264.48 s [vector] mut_iforM_: OK (0.04s)
  3660. 264.48 s [vector] +++ OK, passed 100 tests.
  3661. 264.48 s [vector] mut_foldr: OK (0.01s)
  3662. 264.48 s [vector] +++ OK, passed 100 tests.
  3663. 264.50 s [vector] mut_foldr': OK (0.01s)
  3664. 264.50 s [vector] +++ OK, passed 100 tests.
  3665. 264.52 s [vector] mut_foldl: OK (0.01s)
  3666. 264.52 s [vector] +++ OK, passed 100 tests.
  3667. 264.52 s [vector] mut_foldl': OK (0.01s)
  3668. 264.52 s [vector] +++ OK, passed 100 tests.
  3669. 264.54 s [vector] mut_ifoldr: OK (0.01s)
  3670. 264.54 s [vector] +++ OK, passed 100 tests.
  3671. 264.56 s [vector] mut_ifoldr': OK (0.01s)
  3672. 264.56 s [vector] +++ OK, passed 100 tests.
  3673. 264.56 s [vector] mut_ifoldl: OK (0.01s)
  3674. 264.56 s [vector] +++ OK, passed 100 tests.
  3675. 264.58 s [vector] mut_ifoldl': OK (0.01s)
  3676. 264.58 s [vector] +++ OK, passed 100 tests.
  3677. 264.60 s [vector] mut_foldM: OK (0.02s)
  3678. 264.60 s [vector] +++ OK, passed 100 tests.
  3679. 264.60 s [vector] mut_foldM': OK (0.01s)
  3680. 264.60 s [vector] +++ OK, passed 100 tests.
  3681. 264.62 s [vector] mut_foldrM: OK (0.01s)
  3682. 264.62 s [vector] +++ OK, passed 100 tests.
  3683. 264.64 s [vector] mut_foldrM': OK (0.01s)
  3684. 264.64 s [vector] +++ OK, passed 100 tests.
  3685. 264.64 s [vector] mut_ifoldM: OK (0.01s)
  3686. 264.64 s [vector] +++ OK, passed 100 tests.
  3687. 264.66 s [vector] mut_ifoldM': OK (0.01s)
  3688. 264.66 s [vector] +++ OK, passed 100 tests.
  3689. 264.66 s [vector] mut_ifoldrM: OK (0.01s)
  3690. 264.66 s [vector] +++ OK, passed 100 tests.
  3691. 264.68 s [vector] mut_ifoldrM': OK (0.01s)
  3692. 264.68 s [vector] +++ OK, passed 100 tests.
  3693. 264.68 s [vector] compare: OK
  3694. 264.68 s [vector] +++ OK, passed 100 tests.
  3695. 264.68 s [vector] maximum: OK
  3696. 264.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3697. 264.68 s [vector] minimum: OK
  3698. 264.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3699. 264.68 s [vector] minIndex: OK
  3700. 264.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3701. 264.68 s [vector] maxIndex: OK
  3702. 264.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3703. 264.68 s [vector] maximumBy: OK
  3704. 264.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3705. 264.68 s [vector] minimumBy: OK
  3706. 264.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3707. 264.68 s [vector] maximumOn: OK
  3708. 264.68 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3709. 264.68 s [vector] minimumOn: OK
  3710. 264.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3711. 264.68 s [vector] maxIndexBy: OK
  3712. 264.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3713. 264.68 s [vector] minIndexBy: OK
  3714. 264.69 s [vector] +++ OK, passed 100 tests; 25 discarded.
  3715. 264.69 s [vector] ListFirstMaxIndexWins: OK
  3716. 264.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3717. 264.69 s [vector] FalseListFirstMaxIndexWins: OK
  3718. 264.69 s [vector] +++ OK, failed as expected. (after 1 test):
  3719. 264.69 s [vector] Exception:
  3720. 264.69 s [vector] Prelude.foldr1: empty list
  3721. 264.69 s [vector] CallStack (from HasCallStack):
  3722. 264.69 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  3723. 264.69 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  3724. 264.69 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  3725. 264.69 s [vector] []
  3726. 264.69 s [vector] mempty: OK
  3727. 264.69 s [vector] +++ OK, passed 100 tests.
  3728. 264.69 s [vector] mappend: OK
  3729. 264.70 s [vector] +++ OK, passed 100 tests.
  3730. 264.71 s [vector] mconcat: OK (0.02s)
  3731. 264.72 s [vector] +++ OK, passed 100 tests.
  3732. 264.72 s [vector] glength: OK
  3733. 264.72 s [vector] +++ OK, passed 100 tests.
  3734. 264.72 s [vector] sum: OK
  3735. 264.72 s [vector] +++ OK, passed 100 tests.
  3736. 264.72 s [vector] product: OK
  3737. 264.72 s [vector] +++ OK, passed 100 tests.
  3738. 264.72 s [vector] enumFromN: OK
  3739. 264.72 s [vector] +++ OK, passed 100 tests.
  3740. 264.72 s [vector] enumFromThenN: OK
  3741. 264.72 s [vector] +++ OK, passed 100 tests.
  3742. 264.72 s [vector] enumFromTo: OK
  3743. 264.72 s [vector] +++ OK, passed 100 tests.
  3744. 264.72 s [vector] enumFromThenTo: OK
  3745. 264.72 s [vector] +++ OK, passed 100 tests; 2 discarded.
  3746. 264.72 s [vector] unstream
  3747. 264.72 s [vector] unstream == vunstream (exact): OK
  3748. 264.72 s [vector] +++ OK, passed 100 tests.
  3749. 264.72 s [vector] unstream == vunstream (unknown): OK
  3750. 264.72 s [vector] +++ OK, passed 100 tests.
  3751. 264.72 s [vector] unstreamR ~= vunstream (exact): OK
  3752. 264.72 s [vector] +++ OK, passed 100 tests.
  3753. 264.73 s [vector] unstreamR ~= vunstream (unknown): OK
  3754. 264.73 s [vector] +++ OK, passed 100 tests.
  3755. 264.73 s [vector] Tests.Vector.Storable
  3756. 264.73 s [vector] Data.Vector.Storable.Vector (Int)
  3757. 264.73 s [vector] fromList.toList == id: OK
  3758. 264.73 s [vector] +++ OK, passed 100 tests.
  3759. 264.73 s [vector] toList.fromList == id: OK
  3760. 264.73 s [vector] +++ OK, passed 100 tests.
  3761. 264.73 s [vector] unstream.stream == id: OK
  3762. 264.73 s [vector] +++ OK, passed 100 tests.
  3763. 264.73 s [vector] stream.unstream == id: OK
  3764. 264.73 s [vector] +++ OK, passed 100 tests.
  3765. 264.73 s [vector] eq: OK
  3766. 264.73 s [vector] +++ OK, passed 100 tests.
  3767. 264.73 s [vector] length: OK
  3768. 264.73 s [vector] +++ OK, passed 100 tests.
  3769. 264.73 s [vector] null: OK
  3770. 264.73 s [vector] +++ OK, passed 100 tests.
  3771. 264.73 s [vector] index: OK
  3772. 264.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3773. 264.73 s [vector] safeIndex: OK
  3774. 264.73 s [vector] +++ OK, passed 100 tests.
  3775. 264.73 s [vector] head: OK
  3776. 264.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3777. 264.73 s [vector] last: OK
  3778. 264.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3779. 264.73 s [vector] unsafeIndex: OK
  3780. 264.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3781. 264.73 s [vector] unsafeHead: OK
  3782. 264.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3783. 264.73 s [vector] unsafeLast: OK
  3784. 264.74 s [vector] +++ OK, passed 100 tests; 10 discarded.
  3785. 264.74 s [vector] slice: OK
  3786. 264.74 s [vector] +++ OK, passed 100 tests.
  3787. 264.74 s [vector] init: OK
  3788. 264.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3789. 264.74 s [vector] tail: OK
  3790. 264.74 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3791. 264.74 s [vector] take: OK
  3792. 264.74 s [vector] +++ OK, passed 100 tests.
  3793. 264.74 s [vector] drop: OK
  3794. 264.74 s [vector] +++ OK, passed 100 tests.
  3795. 264.74 s [vector] splitAt: OK
  3796. 264.74 s [vector] +++ OK, passed 100 tests.
  3797. 264.74 s [vector] empty: OK
  3798. 264.74 s [vector] +++ OK, passed 100 tests.
  3799. 264.74 s [vector] singleton: OK
  3800. 264.74 s [vector] +++ OK, passed 100 tests.
  3801. 264.74 s [vector] replicate: OK
  3802. 264.74 s [vector] +++ OK, passed 100 tests.
  3803. 264.74 s [vector] generate: OK
  3804. 264.76 s [vector] +++ OK, passed 100 tests.
  3805. 264.76 s [vector] iterateN: OK
  3806. 264.76 s [vector] +++ OK, passed 100 tests.
  3807. 264.81 s [vector] iterateNM: OK (0.04s)
  3808. 264.81 s [vector] +++ OK, passed 100 tests.
  3809. 264.82 s [vector] generateM: OK (0.03s)
  3810. 264.82 s [vector] +++ OK, passed 100 tests.
  3811. 264.82 s [vector] replicateM: OK
  3812. 264.82 s [vector] +++ OK, passed 100 tests.
  3813. 264.82 s [vector] create: OK
  3814. 264.82 s [vector] +++ OK, passed 100 tests.
  3815. 264.82 s [vector] createT: OK
  3816. 264.82 s [vector] +++ OK, passed 100 tests.
  3817. 264.82 s [vector] unfoldr: OK
  3818. 264.82 s [vector] +++ OK, passed 100 tests.
  3819. 264.83 s [vector] unfoldrN: OK
  3820. 264.83 s [vector] +++ OK, passed 100 tests.
  3821. 264.83 s [vector] unfoldrExactN: OK
  3822. 264.83 s [vector] +++ OK, passed 100 tests.
  3823. 264.83 s [vector] unfoldrM: OK
  3824. 264.83 s [vector] +++ OK, passed 100 tests.
  3825. 264.83 s [vector] unfoldrNM: OK
  3826. 264.84 s [vector] +++ OK, passed 100 tests.
  3827. 264.88 s [vector] unfoldrExactNM: OK (0.04s)
  3828. 264.88 s [vector] +++ OK, passed 100 tests.
  3829. 264.88 s [vector] constructN: OK
  3830. 264.88 s [vector] +++ OK, passed 100 tests.
  3831. 264.88 s [vector] constructrN: OK
  3832. 264.88 s [vector] +++ OK, passed 100 tests.
  3833. 264.88 s [vector] cons: OK
  3834. 264.88 s [vector] +++ OK, passed 100 tests.
  3835. 264.89 s [vector] snoc: OK
  3836. 264.90 s [vector] +++ OK, passed 100 tests.
  3837. 264.90 s [vector] append: OK
  3838. 264.90 s [vector] +++ OK, passed 100 tests.
  3839. 264.90 s [vector] concat: OK (0.01s)
  3840. 264.90 s [vector] +++ OK, passed 100 tests.
  3841. 264.90 s [vector] force: OK
  3842. 264.90 s [vector] +++ OK, passed 100 tests.
  3843. 264.91 s [vector] upd: OK
  3844. 264.91 s [vector] +++ OK, passed 100 tests.
  3845. 264.91 s [vector] accum: OK
  3846. 264.91 s [vector] +++ OK, passed 100 tests.
  3847. 264.91 s [vector] reverse: OK
  3848. 264.91 s [vector] +++ OK, passed 100 tests.
  3849. 264.91 s [vector] backpermute: OK
  3850. 264.91 s [vector] +++ OK, passed 100 tests.
  3851. 264.92 s [vector] map: OK
  3852. 264.92 s [vector] +++ OK, passed 100 tests.
  3853. 264.92 s [vector] imap: OK
  3854. 264.92 s [vector] +++ OK, passed 100 tests.
  3855. 264.92 s [vector] concatMap: OK
  3856. 264.92 s [vector] +++ OK, passed 100 tests.
  3857. 264.92 s [vector] mapM: OK
  3858. 264.92 s [vector] +++ OK, passed 100 tests.
  3859. 264.94 s [vector] mapM_: OK (0.02s)
  3860. 264.94 s [vector] +++ OK, passed 100 tests.
  3861. 264.94 s [vector] forM: OK
  3862. 264.94 s [vector] +++ OK, passed 100 tests.
  3863. 264.96 s [vector] forM_: OK (0.02s)
  3864. 264.96 s [vector] +++ OK, passed 100 tests.
  3865. 264.96 s [vector] imapM: OK
  3866. 264.96 s [vector] +++ OK, passed 100 tests.
  3867. 264.98 s [vector] imapM_: OK (0.02s)
  3868. 264.98 s [vector] +++ OK, passed 100 tests.
  3869. 264.98 s [vector] zipWith: OK
  3870. 264.98 s [vector] +++ OK, passed 100 tests.
  3871. 264.99 s [vector] zipWith3: OK
  3872. 264.99 s [vector] +++ OK, passed 100 tests.
  3873. 264.99 s [vector] izipWith: OK
  3874. 264.99 s [vector] +++ OK, passed 100 tests.
  3875. 264.99 s [vector] izipWith3: OK
  3876. 265.00 s [vector] +++ OK, passed 100 tests.
  3877. 265.00 s [vector] izipWithM: OK
  3878. 265.00 s [vector] +++ OK, passed 100 tests.
  3879. 265.01 s [vector] izipWithM_: OK (0.01s)
  3880. 265.02 s [vector] +++ OK, passed 100 tests.
  3881. 265.02 s [vector] zipWithM: OK
  3882. 265.02 s [vector] +++ OK, passed 100 tests.
  3883. 265.02 s [vector] zipWithM_: OK (0.01s)
  3884. 265.02 s [vector] +++ OK, passed 100 tests.
  3885. 265.02 s [vector] filter: OK
  3886. 265.02 s [vector] +++ OK, passed 100 tests.
  3887. 265.04 s [vector] ifilter: OK
  3888. 265.04 s [vector] +++ OK, passed 100 tests.
  3889. 265.05 s [vector] filterM: OK (0.03s)
  3890. 265.05 s [vector] +++ OK, passed 100 tests.
  3891. 265.05 s [vector] uniq: OK
  3892. 265.05 s [vector] +++ OK, passed 100 tests.
  3893. 265.06 s [vector] mapMaybe: OK
  3894. 265.06 s [vector] +++ OK, passed 100 tests.
  3895. 265.06 s [vector] imapMaybe: OK
  3896. 265.06 s [vector] +++ OK, passed 100 tests.
  3897. 265.06 s [vector] takeWhile: OK
  3898. 265.06 s [vector] +++ OK, passed 100 tests.
  3899. 265.06 s [vector] dropWhile: OK
  3900. 265.06 s [vector] +++ OK, passed 100 tests.
  3901. 265.06 s [vector] partition: OK
  3902. 265.06 s [vector] +++ OK, passed 100 tests.
  3903. 265.06 s [vector] partitionWith: OK
  3904. 265.06 s [vector] +++ OK, passed 100 tests.
  3905. 265.06 s [vector] span: OK
  3906. 265.06 s [vector] +++ OK, passed 100 tests.
  3907. 265.07 s [vector] break: OK
  3908. 265.07 s [vector] +++ OK, passed 100 tests.
  3909. 265.07 s [vector] spanR: OK
  3910. 265.07 s [vector] +++ OK, passed 100 tests.
  3911. 265.07 s [vector] breakR: OK
  3912. 265.07 s [vector] +++ OK, passed 100 tests.
  3913. 265.07 s [vector] groupBy: OK
  3914. 265.07 s [vector] +++ OK, passed 100 tests.
  3915. 265.07 s [vector] elem: OK
  3916. 265.07 s [vector] +++ OK, passed 100 tests.
  3917. 265.07 s [vector] notElem: OK
  3918. 265.07 s [vector] +++ OK, passed 100 tests.
  3919. 265.07 s [vector] find: OK
  3920. 265.07 s [vector] +++ OK, passed 100 tests.
  3921. 265.08 s [vector] findIndex: OK
  3922. 265.08 s [vector] +++ OK, passed 100 tests.
  3923. 265.08 s [vector] findIndexR: OK
  3924. 265.08 s [vector] +++ OK, passed 100 tests.
  3925. 265.08 s [vector] findIndices: OK
  3926. 265.08 s [vector] +++ OK, passed 100 tests.
  3927. 265.08 s [vector] elemIndex: OK
  3928. 265.08 s [vector] +++ OK, passed 100 tests.
  3929. 265.08 s [vector] elemIndices: OK
  3930. 265.08 s [vector] +++ OK, passed 100 tests.
  3931. 265.08 s [vector] foldl: OK
  3932. 265.08 s [vector] +++ OK, passed 100 tests.
  3933. 265.09 s [vector] foldl1: OK
  3934. 265.09 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3935. 265.09 s [vector] foldl': OK
  3936. 265.09 s [vector] +++ OK, passed 100 tests.
  3937. 265.10 s [vector] foldl1': OK
  3938. 265.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3939. 265.10 s [vector] foldr: OK
  3940. 265.10 s [vector] +++ OK, passed 100 tests.
  3941. 265.10 s [vector] foldr1: OK
  3942. 265.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3943. 265.11 s [vector] foldr': OK
  3944. 265.11 s [vector] +++ OK, passed 100 tests.
  3945. 265.12 s [vector] foldr1': OK
  3946. 265.12 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3947. 265.13 s [vector] ifoldl: OK
  3948. 265.13 s [vector] +++ OK, passed 100 tests.
  3949. 265.13 s [vector] ifoldl': OK
  3950. 265.13 s [vector] +++ OK, passed 100 tests.
  3951. 265.13 s [vector] ifoldr: OK
  3952. 265.13 s [vector] +++ OK, passed 100 tests.
  3953. 265.14 s [vector] ifoldr': OK
  3954. 265.14 s [vector] +++ OK, passed 100 tests.
  3955. 265.14 s [vector] ifoldM: OK
  3956. 265.14 s [vector] +++ OK, passed 100 tests.
  3957. 265.16 s [vector] ifoldM': OK
  3958. 265.16 s [vector] +++ OK, passed 100 tests.
  3959. 265.16 s [vector] ifoldM_: OK (0.02s)
  3960. 265.16 s [vector] +++ OK, passed 100 tests.
  3961. 265.19 s [vector] ifoldM'_: OK (0.03s)
  3962. 265.19 s [vector] +++ OK, passed 100 tests.
  3963. 265.19 s [vector] all: OK
  3964. 265.19 s [vector] +++ OK, passed 100 tests.
  3965. 265.19 s [vector] any: OK
  3966. 265.19 s [vector] +++ OK, passed 100 tests.
  3967. 265.19 s [vector] prescanl: OK
  3968. 265.19 s [vector] +++ OK, passed 100 tests.
  3969. 265.20 s [vector] prescanl': OK
  3970. 265.20 s [vector] +++ OK, passed 100 tests.
  3971. 265.20 s [vector] postscanl: OK
  3972. 265.20 s [vector] +++ OK, passed 100 tests.
  3973. 265.20 s [vector] postscanl': OK
  3974. 265.20 s [vector] +++ OK, passed 100 tests.
  3975. 265.20 s [vector] scanl: OK
  3976. 265.20 s [vector] +++ OK, passed 100 tests.
  3977. 265.21 s [vector] scanl': OK
  3978. 265.21 s [vector] +++ OK, passed 100 tests.
  3979. 265.21 s [vector] scanl1: OK
  3980. 265.21 s [vector] +++ OK, passed 100 tests.
  3981. 265.21 s [vector] scanl1': OK
  3982. 265.21 s [vector] +++ OK, passed 100 tests.
  3983. 265.22 s [vector] iscanl: OK
  3984. 265.22 s [vector] +++ OK, passed 100 tests.
  3985. 265.22 s [vector] iscanl': OK
  3986. 265.22 s [vector] +++ OK, passed 100 tests.
  3987. 265.22 s [vector] prescanr: OK
  3988. 265.22 s [vector] +++ OK, passed 100 tests.
  3989. 265.23 s [vector] prescanr': OK
  3990. 265.23 s [vector] +++ OK, passed 100 tests.
  3991. 265.23 s [vector] postscanr: OK
  3992. 265.23 s [vector] +++ OK, passed 100 tests.
  3993. 265.23 s [vector] postscanr': OK
  3994. 265.23 s [vector] +++ OK, passed 100 tests.
  3995. 265.23 s [vector] scanr: OK
  3996. 265.24 s [vector] +++ OK, passed 100 tests.
  3997. 265.24 s [vector] scanr': OK
  3998. 265.24 s [vector] +++ OK, passed 100 tests.
  3999. 265.24 s [vector] scanr1: OK
  4000. 265.24 s [vector] +++ OK, passed 100 tests.
  4001. 265.24 s [vector] scanr1': OK
  4002. 265.24 s [vector] +++ OK, passed 100 tests.
  4003. 265.25 s [vector] iscanr: OK
  4004. 265.25 s [vector] +++ OK, passed 100 tests.
  4005. 265.25 s [vector] iscanr': OK
  4006. 265.25 s [vector] +++ OK, passed 100 tests.
  4007. 265.25 s [vector] mut_read: OK
  4008. 265.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4009. 265.26 s [vector] mut_write: OK
  4010. 265.26 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4011. 265.26 s [vector] mut_modify: OK
  4012. 265.26 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4013. 265.26 s [vector] mut_generate: OK
  4014. 265.26 s [vector] +++ OK, passed 100 tests.
  4015. 265.28 s [vector] mut_generateM: OK
  4016. 265.28 s [vector] +++ OK, passed 100 tests.
  4017. 265.30 s [vector] mut_mapM_: OK (0.02s)
  4018. 265.30 s [vector] +++ OK, passed 100 tests.
  4019. 265.32 s [vector] mut_imapM_: OK (0.02s)
  4020. 265.32 s [vector] +++ OK, passed 100 tests.
  4021. 265.34 s [vector] mut_forM_: OK (0.02s)
  4022. 265.34 s [vector] +++ OK, passed 100 tests.
  4023. 265.35 s [vector] mut_iforM_: OK (0.02s)
  4024. 265.35 s [vector] +++ OK, passed 100 tests.
  4025. 265.35 s [vector] mut_foldr: OK
  4026. 265.36 s [vector] +++ OK, passed 100 tests.
  4027. 265.36 s [vector] mut_foldr': OK
  4028. 265.36 s [vector] +++ OK, passed 100 tests.
  4029. 265.36 s [vector] mut_foldl: OK
  4030. 265.36 s [vector] +++ OK, passed 100 tests.
  4031. 265.37 s [vector] mut_foldl': OK
  4032. 265.37 s [vector] +++ OK, passed 100 tests.
  4033. 265.37 s [vector] mut_ifoldr: OK
  4034. 265.37 s [vector] +++ OK, passed 100 tests.
  4035. 265.38 s [vector] mut_ifoldr': OK
  4036. 265.38 s [vector] +++ OK, passed 100 tests.
  4037. 265.38 s [vector] mut_ifoldl: OK
  4038. 265.38 s [vector] +++ OK, passed 100 tests.
  4039. 265.38 s [vector] mut_ifoldl': OK
  4040. 265.38 s [vector] +++ OK, passed 100 tests.
  4041. 265.38 s [vector] mut_foldM: OK
  4042. 265.38 s [vector] +++ OK, passed 100 tests.
  4043. 265.38 s [vector] mut_foldM': OK
  4044. 265.38 s [vector] +++ OK, passed 100 tests.
  4045. 265.38 s [vector] mut_foldrM: OK
  4046. 265.39 s [vector] +++ OK, passed 100 tests.
  4047. 265.39 s [vector] mut_foldrM': OK
  4048. 265.39 s [vector] +++ OK, passed 100 tests.
  4049. 265.39 s [vector] mut_ifoldM: OK
  4050. 265.39 s [vector] +++ OK, passed 100 tests.
  4051. 265.39 s [vector] mut_ifoldM': OK
  4052. 265.40 s [vector] +++ OK, passed 100 tests.
  4053. 265.40 s [vector] mut_ifoldrM: OK
  4054. 265.40 s [vector] +++ OK, passed 100 tests.
  4055. 265.40 s [vector] mut_ifoldrM': OK
  4056. 265.40 s [vector] +++ OK, passed 100 tests.
  4057. 265.40 s [vector] compare: OK
  4058. 265.40 s [vector] +++ OK, passed 100 tests.
  4059. 265.40 s [vector] maximum: OK
  4060. 265.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4061. 265.40 s [vector] minimum: OK
  4062. 265.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4063. 265.41 s [vector] minIndex: OK
  4064. 265.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4065. 265.41 s [vector] maxIndex: OK
  4066. 265.41 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4067. 265.41 s [vector] maximumBy: OK
  4068. 265.41 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4069. 265.41 s [vector] minimumBy: OK
  4070. 265.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4071. 265.41 s [vector] maximumOn: OK
  4072. 265.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4073. 265.41 s [vector] minimumOn: OK
  4074. 265.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4075. 265.41 s [vector] maxIndexBy: OK
  4076. 265.41 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4077. 265.41 s [vector] minIndexBy: OK
  4078. 265.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4079. 265.41 s [vector] ListFirstMaxIndexWins: OK
  4080. 265.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4081. 265.41 s [vector] FalseListFirstMaxIndexWins: OK
  4082. 265.41 s [vector] +++ OK, failed as expected. (after 1 test):
  4083. 265.41 s [vector] Exception:
  4084. 265.41 s [vector] Prelude.foldr1: empty list
  4085. 265.41 s [vector] CallStack (from HasCallStack):
  4086. 265.41 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4087. 265.41 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4088. 265.41 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4089. 265.41 s [vector] []
  4090. 265.41 s [vector] mempty: OK
  4091. 265.41 s [vector] +++ OK, passed 100 tests.
  4092. 265.41 s [vector] mappend: OK
  4093. 265.41 s [vector] +++ OK, passed 100 tests.
  4094. 265.43 s [vector] mconcat: OK (0.02s)
  4095. 265.43 s [vector] +++ OK, passed 100 tests.
  4096. 265.43 s [vector] glength: OK
  4097. 265.43 s [vector] +++ OK, passed 100 tests.
  4098. 265.43 s [vector] sum: OK
  4099. 265.43 s [vector] +++ OK, passed 100 tests.
  4100. 265.43 s [vector] product: OK
  4101. 265.43 s [vector] +++ OK, passed 100 tests.
  4102. 265.43 s [vector] enumFromN: OK
  4103. 265.43 s [vector] +++ OK, passed 100 tests.
  4104. 265.43 s [vector] enumFromThenN: OK
  4105. 265.43 s [vector] +++ OK, passed 100 tests.
  4106. 265.44 s [vector] enumFromTo: OK
  4107. 265.44 s [vector] +++ OK, passed 100 tests.
  4108. 265.44 s [vector] enumFromThenTo: OK
  4109. 265.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4110. 265.44 s [vector] Data.Vector.Storable.Vector (Double)
  4111. 265.44 s [vector] fromList.toList == id: OK
  4112. 265.44 s [vector] +++ OK, passed 100 tests.
  4113. 265.44 s [vector] toList.fromList == id: OK
  4114. 265.44 s [vector] +++ OK, passed 100 tests.
  4115. 265.44 s [vector] unstream.stream == id: OK
  4116. 265.44 s [vector] +++ OK, passed 100 tests.
  4117. 265.44 s [vector] stream.unstream == id: OK
  4118. 265.44 s [vector] +++ OK, passed 100 tests.
  4119. 265.44 s [vector] eq: OK
  4120. 265.44 s [vector] +++ OK, passed 100 tests.
  4121. 265.44 s [vector] length: OK
  4122. 265.44 s [vector] +++ OK, passed 100 tests.
  4123. 265.44 s [vector] null: OK
  4124. 265.44 s [vector] +++ OK, passed 100 tests.
  4125. 265.45 s [vector] index: OK
  4126. 265.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4127. 265.45 s [vector] safeIndex: OK
  4128. 265.45 s [vector] +++ OK, passed 100 tests.
  4129. 265.45 s [vector] head: OK
  4130. 265.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4131. 265.45 s [vector] last: OK
  4132. 265.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4133. 265.45 s [vector] unsafeIndex: OK
  4134. 265.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4135. 265.45 s [vector] unsafeHead: OK
  4136. 265.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4137. 265.45 s [vector] unsafeLast: OK
  4138. 265.45 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4139. 265.45 s [vector] slice: OK
  4140. 265.45 s [vector] +++ OK, passed 100 tests.
  4141. 265.45 s [vector] init: OK
  4142. 265.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4143. 265.45 s [vector] tail: OK
  4144. 265.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4145. 265.45 s [vector] take: OK
  4146. 265.45 s [vector] +++ OK, passed 100 tests.
  4147. 265.45 s [vector] drop: OK
  4148. 265.45 s [vector] +++ OK, passed 100 tests.
  4149. 265.45 s [vector] splitAt: OK
  4150. 265.45 s [vector] +++ OK, passed 100 tests.
  4151. 265.45 s [vector] empty: OK
  4152. 265.45 s [vector] +++ OK, passed 100 tests.
  4153. 265.45 s [vector] singleton: OK
  4154. 265.45 s [vector] +++ OK, passed 100 tests.
  4155. 265.46 s [vector] replicate: OK
  4156. 265.46 s [vector] +++ OK, passed 100 tests.
  4157. 265.46 s [vector] generate: OK
  4158. 265.46 s [vector] +++ OK, passed 100 tests.
  4159. 265.46 s [vector] iterateN: OK
  4160. 265.46 s [vector] +++ OK, passed 100 tests.
  4161. 265.52 s [vector] iterateNM: OK (0.05s)
  4162. 265.52 s [vector] +++ OK, passed 100 tests.
  4163. 265.57 s [vector] generateM: OK (0.05s)
  4164. 265.57 s [vector] +++ OK, passed 100 tests.
  4165. 265.57 s [vector] replicateM: OK (0.02s)
  4166. 265.57 s [vector] +++ OK, passed 100 tests.
  4167. 265.57 s [vector] create: OK
  4168. 265.57 s [vector] +++ OK, passed 100 tests.
  4169. 265.58 s [vector] createT: OK
  4170. 265.58 s [vector] +++ OK, passed 100 tests.
  4171. 265.58 s [vector] unfoldr: OK
  4172. 265.58 s [vector] +++ OK, passed 100 tests.
  4173. 265.58 s [vector] unfoldrN: OK
  4174. 265.58 s [vector] +++ OK, passed 100 tests.
  4175. 265.58 s [vector] unfoldrExactN: OK
  4176. 265.58 s [vector] +++ OK, passed 100 tests.
  4177. 265.59 s [vector] unfoldrM: OK
  4178. 265.60 s [vector] +++ OK, passed 100 tests.
  4179. 265.61 s [vector] unfoldrNM: OK
  4180. 265.61 s [vector] +++ OK, passed 100 tests.
  4181. 265.64 s [vector] unfoldrExactNM: OK (0.05s)
  4182. 265.64 s [vector] +++ OK, passed 100 tests.
  4183. 265.66 s [vector] constructN: OK (0.01s)
  4184. 265.66 s [vector] +++ OK, passed 100 tests.
  4185. 265.68 s [vector] constructrN: OK (0.02s)
  4186. 265.68 s [vector] +++ OK, passed 100 tests.
  4187. 265.68 s [vector] cons: OK
  4188. 265.68 s [vector] +++ OK, passed 100 tests.
  4189. 265.69 s [vector] snoc: OK
  4190. 265.69 s [vector] +++ OK, passed 100 tests.
  4191. 265.69 s [vector] append: OK
  4192. 265.70 s [vector] +++ OK, passed 100 tests.
  4193. 265.71 s [vector] concat: OK (0.03s)
  4194. 265.71 s [vector] +++ OK, passed 100 tests.
  4195. 265.71 s [vector] force: OK
  4196. 265.72 s [vector] +++ OK, passed 100 tests.
  4197. 265.72 s [vector] upd: OK
  4198. 265.72 s [vector] +++ OK, passed 100 tests.
  4199. 265.74 s [vector] accum: OK (0.02s)
  4200. 265.74 s [vector] +++ OK, passed 100 tests.
  4201. 265.74 s [vector] reverse: OK
  4202. 265.74 s [vector] +++ OK, passed 100 tests.
  4203. 265.74 s [vector] backpermute: OK
  4204. 265.74 s [vector] +++ OK, passed 100 tests.
  4205. 265.76 s [vector] map: OK
  4206. 265.76 s [vector] +++ OK, passed 100 tests.
  4207. 265.76 s [vector] imap: OK
  4208. 265.76 s [vector] +++ OK, passed 100 tests.
  4209. 265.78 s [vector] concatMap: OK (0.01s)
  4210. 265.78 s [vector] +++ OK, passed 100 tests.
  4211. 265.78 s [vector] mapM: OK
  4212. 265.78 s [vector] +++ OK, passed 100 tests.
  4213. 265.84 s [vector] mapM_: OK (0.04s)
  4214. 265.84 s [vector] +++ OK, passed 100 tests.
  4215. 265.86 s [vector] forM: OK (0.02s)
  4216. 265.86 s [vector] +++ OK, passed 100 tests.
  4217. 265.89 s [vector] forM_: OK (0.04s)
  4218. 265.89 s [vector] +++ OK, passed 100 tests.
  4219. 265.89 s [vector] imapM: OK
  4220. 265.90 s [vector] +++ OK, passed 100 tests.
  4221. 265.94 s [vector] imapM_: OK (0.05s)
  4222. 265.94 s [vector] +++ OK, passed 100 tests.
  4223. 265.96 s [vector] zipWith: OK (0.01s)
  4224. 265.96 s [vector] +++ OK, passed 100 tests.
  4225. 265.96 s [vector] zipWith3: OK
  4226. 265.96 s [vector] +++ OK, passed 100 tests.
  4227. 265.98 s [vector] izipWith: OK (0.01s)
  4228. 265.98 s [vector] +++ OK, passed 100 tests.
  4229. 265.98 s [vector] izipWith3: OK (0.01s)
  4230. 265.98 s [vector] +++ OK, passed 100 tests.
  4231. 266.00 s [vector] izipWithM: OK (0.01s)
  4232. 266.00 s [vector] +++ OK, passed 100 tests.
  4233. 266.02 s [vector] izipWithM_: OK (0.03s)
  4234. 266.02 s [vector] +++ OK, passed 100 tests.
  4235. 266.04 s [vector] zipWithM: OK
  4236. 266.04 s [vector] +++ OK, passed 100 tests.
  4237. 266.06 s [vector] zipWithM_: OK (0.03s)
  4238. 266.06 s [vector] +++ OK, passed 100 tests.
  4239. 266.46 s [vector] filter: OK
  4240. 266.46 s [vector] +++ OK, passed 100 tests.
  4241. 266.46 s [vector] ifilter: OK
  4242. 266.46 s [vector] +++ OK, passed 100 tests.
  4243. 266.46 s [vector] filterM: OK (0.06s)
  4244. 266.46 s [vector] +++ OK, passed 100 tests.
  4245. 266.46 s [vector] uniq: OK
  4246. 266.46 s [vector] +++ OK, passed 100 tests.
  4247. 266.46 s [vector] mapMaybe: OK
  4248. 266.46 s [vector] +++ OK, passed 100 tests.
  4249. 266.46 s [vector] imapMaybe: OK
  4250. 266.46 s [vector] +++ OK, passed 100 tests.
  4251. 266.46 s [vector] takeWhile: OK
  4252. 266.46 s [vector] +++ OK, passed 100 tests.
  4253. 266.46 s [vector] dropWhile: OK
  4254. 266.46 s [vector] +++ OK, passed 100 tests.
  4255. 266.46 s [vector] partition: OK
  4256. 266.46 s [vector] +++ OK, passed 100 tests.
  4257. 266.47 s [vector] partitionWith: OK
  4258. 266.47 s [vector] +++ OK, passed 100 tests.
  4259. 266.47 s [vector] span: OK
  4260. 266.47 s [vector] +++ OK, passed 100 tests.
  4261. 266.47 s [vector] break: OK
  4262. 266.47 s [vector] +++ OK, passed 100 tests.
  4263. 266.47 s [vector] spanR: OK
  4264. 266.47 s [vector] +++ OK, passed 100 tests.
  4265. 266.47 s [vector] breakR: OK
  4266. 266.47 s [vector] +++ OK, passed 100 tests.
  4267. 266.47 s [vector] groupBy: OK
  4268. 266.47 s [vector] +++ OK, passed 100 tests.
  4269. 266.47 s [vector] elem: OK
  4270. 266.47 s [vector] +++ OK, passed 100 tests.
  4271. 266.47 s [vector] notElem: OK
  4272. 266.47 s [vector] +++ OK, passed 100 tests.
  4273. 266.47 s [vector] find: OK
  4274. 266.47 s [vector] +++ OK, passed 100 tests.
  4275. 266.47 s [vector] findIndex: OK
  4276. 266.47 s [vector] +++ OK, passed 100 tests.
  4277. 266.47 s [vector] findIndexR: OK
  4278. 266.47 s [vector] +++ OK, passed 100 tests.
  4279. 266.47 s [vector] findIndices: OK
  4280. 266.47 s [vector] +++ OK, passed 100 tests.
  4281. 266.47 s [vector] elemIndex: OK
  4282. 266.47 s [vector] +++ OK, passed 100 tests.
  4283. 266.47 s [vector] elemIndices: OK
  4284. 266.47 s [vector] +++ OK, passed 100 tests.
  4285. 266.47 s [vector] foldl: OK (0.01s)
  4286. 266.47 s [vector] +++ OK, passed 100 tests.
  4287. 266.47 s [vector] foldl1: OK (0.01s)
  4288. 266.47 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4289. 266.47 s [vector] foldl': OK (0.02s)
  4290. 266.47 s [vector] +++ OK, passed 100 tests.
  4291. 266.47 s [vector] foldl1': OK (0.01s)
  4292. 266.47 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4293. 266.47 s [vector] foldr: OK (0.01s)
  4294. 266.47 s [vector] +++ OK, passed 100 tests.
  4295. 266.47 s [vector] foldr1: OK (0.02s)
  4296. 266.47 s [vector] +++ OK, passed 100 tests; 23 discarded.
  4297. 266.47 s [vector] foldr': OK (0.01s)
  4298. 266.47 s [vector] +++ OK, passed 100 tests.
  4299. 266.47 s [vector] foldr1': OK (0.01s)
  4300. 266.47 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4301. 266.47 s [vector] ifoldl: OK (0.02s)
  4302. 266.47 s [vector] +++ OK, passed 100 tests.
  4303. 266.47 s [vector] ifoldl': OK (0.01s)
  4304. 266.47 s [vector] +++ OK, passed 100 tests.
  4305. 266.47 s [vector] ifoldr: OK (0.01s)
  4306. 266.47 s [vector] +++ OK, passed 100 tests.
  4307. 266.47 s [vector] ifoldr': OK (0.01s)
  4308. 266.47 s [vector] +++ OK, passed 100 tests.
  4309. 266.47 s [vector] ifoldM: OK (0.01s)
  4310. 266.47 s [vector] +++ OK, passed 100 tests.
  4311. 266.47 s [vector] ifoldM': OK (0.01s)
  4312. 266.47 s [vector] +++ OK, passed 100 tests.
  4313. 266.47 s [vector] ifoldM_: OK (0.04s)
  4314. 266.47 s [vector] +++ OK, passed 100 tests.
  4315. 266.48 s [vector] ifoldM'_: OK (0.04s)
  4316. 266.48 s [vector] +++ OK, passed 100 tests.
  4317. 266.48 s [vector] all: OK
  4318. 266.48 s [vector] +++ OK, passed 100 tests.
  4319. 266.48 s [vector] any: OK
  4320. 266.48 s [vector] +++ OK, passed 100 tests.
  4321. 266.50 s [vector] prescanl: OK (0.01s)
  4322. 266.50 s [vector] +++ OK, passed 100 tests.
  4323. 266.52 s [vector] prescanl': OK (0.01s)
  4324. 266.52 s [vector] +++ OK, passed 100 tests.
  4325. 266.52 s [vector] postscanl: OK (0.01s)
  4326. 266.52 s [vector] +++ OK, passed 100 tests.
  4327. 266.53 s [vector] postscanl': OK (0.01s)
  4328. 266.53 s [vector] +++ OK, passed 100 tests.
  4329. 266.56 s [vector] scanl: OK
  4330. 266.56 s [vector] +++ OK, passed 100 tests.
  4331. 266.56 s [vector] scanl': OK (0.01s)
  4332. 266.56 s [vector] +++ OK, passed 100 tests.
  4333. 266.58 s [vector] scanl1: OK (0.02s)
  4334. 266.58 s [vector] +++ OK, passed 100 tests.
  4335. 266.60 s [vector] scanl1': OK (0.01s)
  4336. 266.60 s [vector] +++ OK, passed 100 tests.
  4337. 266.62 s [vector] iscanl: OK (0.02s)
  4338. 266.62 s [vector] +++ OK, passed 100 tests.
  4339. 266.64 s [vector] iscanl': OK (0.02s)
  4340. 266.64 s [vector] +++ OK, passed 100 tests.
  4341. 266.64 s [vector] prescanr: OK (0.01s)
  4342. 266.64 s [vector] +++ OK, passed 100 tests.
  4343. 266.66 s [vector] prescanr': OK (0.01s)
  4344. 266.66 s [vector] +++ OK, passed 100 tests.
  4345. 266.68 s [vector] postscanr: OK (0.01s)
  4346. 266.68 s [vector] +++ OK, passed 100 tests.
  4347. 266.68 s [vector] postscanr': OK (0.01s)
  4348. 266.68 s [vector] +++ OK, passed 100 tests.
  4349. 266.70 s [vector] scanr: OK (0.01s)
  4350. 266.70 s [vector] +++ OK, passed 100 tests.
  4351. 266.72 s [vector] scanr': OK (0.01s)
  4352. 266.72 s [vector] +++ OK, passed 100 tests.
  4353. 266.72 s [vector] scanr1: OK (0.02s)
  4354. 266.72 s [vector] +++ OK, passed 100 tests.
  4355. 266.74 s [vector] scanr1': OK (0.01s)
  4356. 266.74 s [vector] +++ OK, passed 100 tests.
  4357. 266.76 s [vector] iscanr: OK (0.01s)
  4358. 266.76 s [vector] +++ OK, passed 100 tests.
  4359. 266.76 s [vector] iscanr': OK (0.02s)
  4360. 266.76 s [vector] +++ OK, passed 100 tests.
  4361. 266.76 s [vector] mut_read: OK
  4362. 266.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4363. 266.77 s [vector] mut_write: OK
  4364. 266.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4365. 266.77 s [vector] mut_modify: OK
  4366. 266.77 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4367. 266.78 s [vector] mut_generate: OK
  4368. 266.78 s [vector] +++ OK, passed 100 tests.
  4369. 266.80 s [vector] mut_generateM: OK (0.02s)
  4370. 266.80 s [vector] +++ OK, passed 100 tests.
  4371. 266.84 s [vector] mut_mapM_: OK (0.04s)
  4372. 266.84 s [vector] +++ OK, passed 100 tests.
  4373. 266.86 s [vector] mut_imapM_: OK (0.04s)
  4374. 266.86 s [vector] +++ OK, passed 100 tests.
  4375. 266.90 s [vector] mut_forM_: OK (0.02s)
  4376. 266.90 s [vector] +++ OK, passed 100 tests.
  4377. 266.94 s [vector] mut_iforM_: OK (0.03s)
  4378. 266.94 s [vector] +++ OK, passed 100 tests.
  4379. 266.94 s [vector] mut_foldr: OK (0.01s)
  4380. 266.94 s [vector] +++ OK, passed 100 tests.
  4381. 266.96 s [vector] mut_foldr': OK
  4382. 266.96 s [vector] +++ OK, passed 100 tests.
  4383. 266.98 s [vector] mut_foldl: OK (0.01s)
  4384. 266.98 s [vector] +++ OK, passed 100 tests.
  4385. 266.99 s [vector] mut_foldl': OK (0.01s)
  4386. 266.99 s [vector] +++ OK, passed 100 tests.
  4387. 267.00 s [vector] mut_ifoldr: OK (0.02s)
  4388. 267.00 s [vector] +++ OK, passed 100 tests.
  4389. 267.02 s [vector] mut_ifoldr': OK (0.01s)
  4390. 267.02 s [vector] +++ OK, passed 100 tests.
  4391. 267.02 s [vector] mut_ifoldl: OK (0.01s)
  4392. 267.02 s [vector] +++ OK, passed 100 tests.
  4393. 267.04 s [vector] mut_ifoldl': OK
  4394. 267.04 s [vector] +++ OK, passed 100 tests.
  4395. 267.06 s [vector] mut_foldM: OK (0.01s)
  4396. 267.06 s [vector] +++ OK, passed 100 tests.
  4397. 267.07 s [vector] mut_foldM': OK (0.01s)
  4398. 267.07 s [vector] +++ OK, passed 100 tests.
  4399. 267.08 s [vector] mut_foldrM: OK (0.01s)
  4400. 267.08 s [vector] +++ OK, passed 100 tests.
  4401. 267.09 s [vector] mut_foldrM': OK (0.01s)
  4402. 267.09 s [vector] +++ OK, passed 100 tests.
  4403. 267.10 s [vector] mut_ifoldM: OK (0.01s)
  4404. 267.10 s [vector] +++ OK, passed 100 tests.
  4405. 267.12 s [vector] mut_ifoldM': OK (0.01s)
  4406. 267.12 s [vector] +++ OK, passed 100 tests.
  4407. 267.14 s [vector] mut_ifoldrM: OK (0.02s)
  4408. 267.14 s [vector] +++ OK, passed 100 tests.
  4409. 267.14 s [vector] mut_ifoldrM': OK (0.01s)
  4410. 267.14 s [vector] +++ OK, passed 100 tests.
  4411. 267.14 s [vector] compare: OK
  4412. 267.14 s [vector] +++ OK, passed 100 tests.
  4413. 267.14 s [vector] maximum: OK
  4414. 267.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4415. 267.14 s [vector] minimum: OK
  4416. 267.14 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4417. 267.14 s [vector] minIndex: OK
  4418. 267.14 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4419. 267.14 s [vector] maxIndex: OK
  4420. 267.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4421. 267.14 s [vector] maximumBy: OK
  4422. 267.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4423. 267.14 s [vector] minimumBy: OK
  4424. 267.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4425. 267.14 s [vector] maximumOn: OK
  4426. 267.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4427. 267.14 s [vector] minimumOn: OK
  4428. 267.14 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4429. 267.14 s [vector] maxIndexBy: OK
  4430. 267.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4431. 267.15 s [vector] minIndexBy: OK
  4432. 267.15 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4433. 267.15 s [vector] ListFirstMaxIndexWins: OK
  4434. 267.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4435. 267.15 s [vector] FalseListFirstMaxIndexWins: OK
  4436. 267.15 s [vector] +++ OK, failed as expected. (after 1 test):
  4437. 267.15 s [vector] Exception:
  4438. 267.15 s [vector] Prelude.foldr1: empty list
  4439. 267.16 s [vector] CallStack (from HasCallStack):
  4440. 267.16 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4441. 267.16 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4442. 267.16 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4443. 267.16 s [vector] []
  4444. 267.16 s [vector] mempty: OK
  4445. 267.16 s [vector] +++ OK, passed 100 tests.
  4446. 267.16 s [vector] mappend: OK
  4447. 267.17 s [vector] +++ OK, passed 100 tests.
  4448. 267.17 s [vector] mconcat: OK (0.02s)
  4449. 267.17 s [vector] +++ OK, passed 100 tests.
  4450. 267.17 s [vector] glength: OK
  4451. 267.17 s [vector] +++ OK, passed 100 tests.
  4452. 267.17 s [vector] sum: OK
  4453. 267.17 s [vector] +++ OK, passed 100 tests.
  4454. 267.18 s [vector] product: OK
  4455. 267.18 s [vector] +++ OK, passed 100 tests.
  4456. 267.18 s [vector] enumFromN: OK
  4457. 267.18 s [vector] +++ OK, passed 100 tests.
  4458. 267.18 s [vector] enumFromThenN: OK
  4459. 267.18 s [vector] +++ OK, passed 100 tests.
  4460. 267.18 s [vector] enumFromTo: OK
  4461. 267.18 s [vector] +++ OK, passed 100 tests.
  4462. 267.18 s [vector] enumFromThenTo: OK
  4463. 267.18 s [vector] +++ OK, passed 100 tests; 3 discarded.
  4464. 267.18 s [vector] unstream
  4465. 267.18 s [vector] unstream == vunstream (exact): OK
  4466. 267.18 s [vector] +++ OK, passed 100 tests.
  4467. 267.18 s [vector] unstream == vunstream (unknown): OK
  4468. 267.18 s [vector] +++ OK, passed 100 tests.
  4469. 267.18 s [vector] unstreamR ~= vunstream (exact): OK
  4470. 267.18 s [vector] +++ OK, passed 100 tests.
  4471. 267.19 s [vector] unstreamR ~= vunstream (unknown): OK
  4472. 267.19 s [vector] +++ OK, passed 100 tests.
  4473. 267.19 s [vector] Tests.Vector.Strict
  4474. 267.19 s [vector] Bool
  4475. 267.19 s [vector] fromList.toList == id: OK
  4476. 267.19 s [vector] +++ OK, passed 100 tests.
  4477. 267.19 s [vector] toList.fromList == id: OK
  4478. 267.19 s [vector] +++ OK, passed 100 tests.
  4479. 267.19 s [vector] unstream.stream == id: OK
  4480. 267.19 s [vector] +++ OK, passed 100 tests.
  4481. 267.19 s [vector] stream.unstream == id: OK
  4482. 267.19 s [vector] +++ OK, passed 100 tests.
  4483. 267.19 s [vector] eq: OK
  4484. 267.19 s [vector] +++ OK, passed 100 tests.
  4485. 267.19 s [vector] length: OK
  4486. 267.19 s [vector] +++ OK, passed 100 tests.
  4487. 267.19 s [vector] null: OK
  4488. 267.19 s [vector] +++ OK, passed 100 tests.
  4489. 267.19 s [vector] index: OK
  4490. 267.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4491. 267.19 s [vector] safeIndex: OK
  4492. 267.19 s [vector] +++ OK, passed 100 tests.
  4493. 267.19 s [vector] head: OK
  4494. 267.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4495. 267.19 s [vector] last: OK
  4496. 267.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4497. 267.19 s [vector] unsafeIndex: OK
  4498. 267.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4499. 267.19 s [vector] unsafeHead: OK
  4500. 267.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4501. 267.19 s [vector] unsafeLast: OK
  4502. 267.19 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4503. 267.19 s [vector] slice: OK
  4504. 267.19 s [vector] +++ OK, passed 100 tests.
  4505. 267.19 s [vector] init: OK
  4506. 267.19 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4507. 267.19 s [vector] tail: OK
  4508. 267.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4509. 267.19 s [vector] take: OK
  4510. 267.19 s [vector] +++ OK, passed 100 tests.
  4511. 267.19 s [vector] drop: OK
  4512. 267.19 s [vector] +++ OK, passed 100 tests.
  4513. 267.19 s [vector] splitAt: OK
  4514. 267.19 s [vector] +++ OK, passed 100 tests.
  4515. 267.19 s [vector] empty: OK
  4516. 267.19 s [vector] +++ OK, passed 100 tests.
  4517. 267.19 s [vector] singleton: OK
  4518. 267.19 s [vector] +++ OK, passed 100 tests.
  4519. 267.19 s [vector] replicate: OK
  4520. 267.20 s [vector] +++ OK, passed 100 tests.
  4521. 267.20 s [vector] generate: OK
  4522. 267.20 s [vector] +++ OK, passed 100 tests.
  4523. 267.20 s [vector] iterateN: OK
  4524. 267.20 s [vector] +++ OK, passed 100 tests.
  4525. 267.24 s [vector] iterateNM: OK (0.04s)
  4526. 267.24 s [vector] +++ OK, passed 100 tests.
  4527. 267.26 s [vector] generateM: OK (0.02s)
  4528. 267.26 s [vector] +++ OK, passed 100 tests.
  4529. 267.27 s [vector] replicateM: OK (0.01s)
  4530. 267.27 s [vector] +++ OK, passed 100 tests.
  4531. 267.27 s [vector] create: OK
  4532. 267.27 s [vector] +++ OK, passed 100 tests.
  4533. 267.27 s [vector] createT: OK
  4534. 267.27 s [vector] +++ OK, passed 100 tests.
  4535. 267.27 s [vector] unfoldr: OK
  4536. 267.27 s [vector] +++ OK, passed 100 tests.
  4537. 267.27 s [vector] unfoldrN: OK
  4538. 267.28 s [vector] +++ OK, passed 100 tests.
  4539. 267.28 s [vector] unfoldrExactN: OK
  4540. 267.28 s [vector] +++ OK, passed 100 tests.
  4541. 267.29 s [vector] unfoldrM: OK
  4542. 267.29 s [vector] +++ OK, passed 100 tests.
  4543. 267.29 s [vector] unfoldrNM: OK
  4544. 267.29 s [vector] +++ OK, passed 100 tests.
  4545. 267.33 s [vector] unfoldrExactNM: OK (0.06s)
  4546. 267.33 s [vector] +++ OK, passed 100 tests.
  4547. 267.34 s [vector] constructN: OK
  4548. 267.34 s [vector] +++ OK, passed 100 tests.
  4549. 267.34 s [vector] constructrN: OK
  4550. 267.34 s [vector] +++ OK, passed 100 tests.
  4551. 267.34 s [vector] cons: OK
  4552. 267.35 s [vector] +++ OK, passed 100 tests.
  4553. 267.35 s [vector] snoc: OK
  4554. 267.35 s [vector] +++ OK, passed 100 tests.
  4555. 267.35 s [vector] append: OK
  4556. 267.35 s [vector] +++ OK, passed 100 tests.
  4557. 267.35 s [vector] concat: OK
  4558. 267.35 s [vector] +++ OK, passed 100 tests.
  4559. 267.36 s [vector] force: OK
  4560. 267.36 s [vector] +++ OK, passed 100 tests.
  4561. 267.36 s [vector] upd: OK
  4562. 267.36 s [vector] +++ OK, passed 100 tests.
  4563. 267.36 s [vector] accum: OK
  4564. 267.36 s [vector] +++ OK, passed 100 tests.
  4565. 267.36 s [vector] reverse: OK
  4566. 267.36 s [vector] +++ OK, passed 100 tests.
  4567. 267.36 s [vector] backpermute: OK
  4568. 267.36 s [vector] +++ OK, passed 100 tests.
  4569. 267.36 s [vector] map: OK
  4570. 267.36 s [vector] +++ OK, passed 100 tests.
  4571. 267.37 s [vector] imap: OK
  4572. 267.37 s [vector] +++ OK, passed 100 tests.
  4573. 267.37 s [vector] concatMap: OK
  4574. 267.38 s [vector] +++ OK, passed 100 tests.
  4575. 267.38 s [vector] mapM: OK
  4576. 267.38 s [vector] +++ OK, passed 100 tests.
  4577. 267.38 s [vector] mapM_: OK
  4578. 267.38 s [vector] +++ OK, passed 100 tests.
  4579. 267.38 s [vector] forM: OK
  4580. 267.38 s [vector] +++ OK, passed 100 tests.
  4581. 267.39 s [vector] forM_: OK (0.01s)
  4582. 267.40 s [vector] +++ OK, passed 100 tests.
  4583. 267.40 s [vector] imapM: OK
  4584. 267.40 s [vector] +++ OK, passed 100 tests.
  4585. 267.40 s [vector] imapM_: OK (0.01s)
  4586. 267.40 s [vector] +++ OK, passed 100 tests.
  4587. 267.41 s [vector] zipWith: OK
  4588. 267.41 s [vector] +++ OK, passed 100 tests.
  4589. 267.42 s [vector] zipWith3: OK
  4590. 267.42 s [vector] +++ OK, passed 100 tests.
  4591. 267.42 s [vector] izipWith: OK
  4592. 267.42 s [vector] +++ OK, passed 100 tests.
  4593. 267.42 s [vector] izipWith3: OK
  4594. 267.42 s [vector] +++ OK, passed 100 tests.
  4595. 267.42 s [vector] izipWithM: OK
  4596. 267.42 s [vector] +++ OK, passed 100 tests.
  4597. 267.43 s [vector] izipWithM_: OK
  4598. 267.44 s [vector] +++ OK, passed 100 tests.
  4599. 267.44 s [vector] zipWithM: OK
  4600. 267.44 s [vector] +++ OK, passed 100 tests.
  4601. 267.44 s [vector] zipWithM_: OK
  4602. 267.44 s [vector] +++ OK, passed 100 tests.
  4603. 267.44 s [vector] filter: OK
  4604. 267.44 s [vector] +++ OK, passed 100 tests.
  4605. 267.44 s [vector] ifilter: OK
  4606. 267.44 s [vector] +++ OK, passed 100 tests.
  4607. 267.47 s [vector] filterM: OK (0.02s)
  4608. 267.47 s [vector] +++ OK, passed 100 tests.
  4609. 267.47 s [vector] uniq: OK
  4610. 267.47 s [vector] +++ OK, passed 100 tests.
  4611. 267.47 s [vector] mapMaybe: OK
  4612. 267.47 s [vector] +++ OK, passed 100 tests.
  4613. 267.47 s [vector] imapMaybe: OK
  4614. 267.47 s [vector] +++ OK, passed 100 tests.
  4615. 267.47 s [vector] takeWhile: OK
  4616. 267.47 s [vector] +++ OK, passed 100 tests.
  4617. 267.47 s [vector] dropWhile: OK
  4618. 267.47 s [vector] +++ OK, passed 100 tests.
  4619. 267.47 s [vector] partition: OK
  4620. 267.47 s [vector] +++ OK, passed 100 tests.
  4621. 267.47 s [vector] partitionWith: OK
  4622. 267.47 s [vector] +++ OK, passed 100 tests.
  4623. 267.48 s [vector] span: OK
  4624. 267.48 s [vector] +++ OK, passed 100 tests.
  4625. 267.48 s [vector] break: OK
  4626. 267.48 s [vector] +++ OK, passed 100 tests.
  4627. 267.48 s [vector] spanR: OK
  4628. 267.48 s [vector] +++ OK, passed 100 tests.
  4629. 267.48 s [vector] breakR: OK
  4630. 267.48 s [vector] +++ OK, passed 100 tests.
  4631. 267.48 s [vector] groupBy: OK
  4632. 267.48 s [vector] +++ OK, passed 100 tests.
  4633. 267.48 s [vector] elem: OK
  4634. 267.48 s [vector] +++ OK, passed 100 tests.
  4635. 267.48 s [vector] notElem: OK
  4636. 267.48 s [vector] +++ OK, passed 100 tests.
  4637. 267.48 s [vector] find: OK
  4638. 267.48 s [vector] +++ OK, passed 100 tests.
  4639. 267.48 s [vector] findIndex: OK
  4640. 267.48 s [vector] +++ OK, passed 100 tests.
  4641. 267.48 s [vector] findIndexR: OK
  4642. 267.48 s [vector] +++ OK, passed 100 tests.
  4643. 267.48 s [vector] findIndices: OK
  4644. 267.48 s [vector] +++ OK, passed 100 tests.
  4645. 267.48 s [vector] elemIndex: OK
  4646. 267.48 s [vector] +++ OK, passed 100 tests.
  4647. 267.48 s [vector] elemIndices: OK
  4648. 267.48 s [vector] +++ OK, passed 100 tests.
  4649. 267.48 s [vector] foldl: OK
  4650. 267.49 s [vector] +++ OK, passed 100 tests.
  4651. 267.49 s [vector] foldl1: OK
  4652. 267.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4653. 267.49 s [vector] foldl': OK
  4654. 267.49 s [vector] +++ OK, passed 100 tests.
  4655. 267.49 s [vector] foldl1': OK
  4656. 267.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4657. 267.49 s [vector] foldr: OK
  4658. 267.49 s [vector] +++ OK, passed 100 tests.
  4659. 267.49 s [vector] foldr1: OK
  4660. 267.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4661. 267.49 s [vector] foldr': OK
  4662. 267.49 s [vector] +++ OK, passed 100 tests.
  4663. 267.50 s [vector] foldr1': OK
  4664. 267.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4665. 267.50 s [vector] ifoldl: OK
  4666. 267.50 s [vector] +++ OK, passed 100 tests.
  4667. 267.50 s [vector] ifoldl': OK
  4668. 267.50 s [vector] +++ OK, passed 100 tests.
  4669. 267.52 s [vector] ifoldr: OK
  4670. 267.52 s [vector] +++ OK, passed 100 tests.
  4671. 267.52 s [vector] ifoldr': OK
  4672. 267.52 s [vector] +++ OK, passed 100 tests.
  4673. 267.52 s [vector] ifoldM: OK
  4674. 267.52 s [vector] +++ OK, passed 100 tests.
  4675. 267.52 s [vector] ifoldM': OK
  4676. 267.52 s [vector] +++ OK, passed 100 tests.
  4677. 267.52 s [vector] ifoldM_: OK (0.01s)
  4678. 267.53 s [vector] +++ OK, passed 100 tests.
  4679. 267.54 s [vector] ifoldM'_: OK (0.02s)
  4680. 267.54 s [vector] +++ OK, passed 100 tests.
  4681. 267.54 s [vector] all: OK
  4682. 267.54 s [vector] +++ OK, passed 100 tests.
  4683. 267.54 s [vector] any: OK
  4684. 267.54 s [vector] +++ OK, passed 100 tests.
  4685. 267.54 s [vector] prescanl: OK
  4686. 267.54 s [vector] +++ OK, passed 100 tests.
  4687. 267.54 s [vector] prescanl': OK
  4688. 267.54 s [vector] +++ OK, passed 100 tests.
  4689. 267.54 s [vector] postscanl: OK
  4690. 267.54 s [vector] +++ OK, passed 100 tests.
  4691. 267.55 s [vector] postscanl': OK
  4692. 267.55 s [vector] +++ OK, passed 100 tests.
  4693. 267.55 s [vector] scanl: OK
  4694. 267.55 s [vector] +++ OK, passed 100 tests.
  4695. 267.55 s [vector] scanl': OK
  4696. 267.55 s [vector] +++ OK, passed 100 tests.
  4697. 267.55 s [vector] scanl1: OK
  4698. 267.55 s [vector] +++ OK, passed 100 tests.
  4699. 267.55 s [vector] scanl1': OK
  4700. 267.55 s [vector] +++ OK, passed 100 tests.
  4701. 267.55 s [vector] iscanl: OK
  4702. 267.55 s [vector] +++ OK, passed 100 tests.
  4703. 267.56 s [vector] iscanl': OK
  4704. 267.56 s [vector] +++ OK, passed 100 tests.
  4705. 267.56 s [vector] prescanr: OK
  4706. 267.56 s [vector] +++ OK, passed 100 tests.
  4707. 267.56 s [vector] prescanr': OK
  4708. 267.56 s [vector] +++ OK, passed 100 tests.
  4709. 267.56 s [vector] postscanr: OK
  4710. 267.56 s [vector] +++ OK, passed 100 tests.
  4711. 267.56 s [vector] postscanr': OK
  4712. 267.56 s [vector] +++ OK, passed 100 tests.
  4713. 267.57 s [vector] scanr: OK
  4714. 267.57 s [vector] +++ OK, passed 100 tests.
  4715. 267.57 s [vector] scanr': OK
  4716. 267.57 s [vector] +++ OK, passed 100 tests.
  4717. 267.57 s [vector] scanr1: OK
  4718. 267.58 s [vector] +++ OK, passed 100 tests.
  4719. 267.58 s [vector] scanr1': OK
  4720. 267.58 s [vector] +++ OK, passed 100 tests.
  4721. 267.58 s [vector] iscanr: OK
  4722. 267.58 s [vector] +++ OK, passed 100 tests.
  4723. 267.58 s [vector] iscanr': OK
  4724. 267.58 s [vector] +++ OK, passed 100 tests.
  4725. 267.58 s [vector] mut_read: OK
  4726. 267.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4727. 267.58 s [vector] mut_write: OK
  4728. 267.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4729. 267.58 s [vector] mut_modify: OK
  4730. 267.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4731. 267.59 s [vector] mut_generate: OK
  4732. 267.60 s [vector] +++ OK, passed 100 tests.
  4733. 267.60 s [vector] mut_generateM: OK
  4734. 267.60 s [vector] +++ OK, passed 100 tests.
  4735. 267.60 s [vector] mut_mapM_: OK
  4736. 267.61 s [vector] +++ OK, passed 100 tests.
  4737. 267.62 s [vector] mut_imapM_: OK (0.01s)
  4738. 267.62 s [vector] +++ OK, passed 100 tests.
  4739. 267.62 s [vector] mut_forM_: OK
  4740. 267.62 s [vector] +++ OK, passed 100 tests.
  4741. 267.63 s [vector] mut_iforM_: OK (0.01s)
  4742. 267.63 s [vector] +++ OK, passed 100 tests.
  4743. 267.63 s [vector] mut_foldr: OK
  4744. 267.63 s [vector] +++ OK, passed 100 tests.
  4745. 267.63 s [vector] mut_foldr': OK
  4746. 267.63 s [vector] +++ OK, passed 100 tests.
  4747. 267.63 s [vector] mut_foldl: OK
  4748. 267.63 s [vector] +++ OK, passed 100 tests.
  4749. 267.63 s [vector] mut_foldl': OK
  4750. 267.63 s [vector] +++ OK, passed 100 tests.
  4751. 267.63 s [vector] mut_ifoldr: OK
  4752. 267.64 s [vector] +++ OK, passed 100 tests.
  4753. 267.64 s [vector] mut_ifoldr': OK
  4754. 267.64 s [vector] +++ OK, passed 100 tests.
  4755. 267.64 s [vector] mut_ifoldl: OK
  4756. 267.64 s [vector] +++ OK, passed 100 tests.
  4757. 267.64 s [vector] mut_ifoldl': OK
  4758. 267.64 s [vector] +++ OK, passed 100 tests.
  4759. 267.64 s [vector] mut_foldM: OK
  4760. 267.64 s [vector] +++ OK, passed 100 tests.
  4761. 267.64 s [vector] mut_foldM': OK
  4762. 267.64 s [vector] +++ OK, passed 100 tests.
  4763. 267.65 s [vector] mut_foldrM: OK
  4764. 267.65 s [vector] +++ OK, passed 100 tests.
  4765. 267.65 s [vector] mut_foldrM': OK
  4766. 267.66 s [vector] +++ OK, passed 100 tests.
  4767. 267.66 s [vector] mut_ifoldM: OK
  4768. 267.66 s [vector] +++ OK, passed 100 tests.
  4769. 267.66 s [vector] mut_ifoldM': OK
  4770. 267.66 s [vector] +++ OK, passed 100 tests.
  4771. 267.66 s [vector] mut_ifoldrM: OK
  4772. 267.66 s [vector] +++ OK, passed 100 tests.
  4773. 267.66 s [vector] mut_ifoldrM': OK
  4774. 267.66 s [vector] +++ OK, passed 100 tests.
  4775. 267.66 s [vector] compare: OK
  4776. 267.66 s [vector] +++ OK, passed 100 tests.
  4777. 267.66 s [vector] maximum: OK
  4778. 267.67 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4779. 267.67 s [vector] minimum: OK
  4780. 267.67 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4781. 267.67 s [vector] minIndex: OK
  4782. 267.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4783. 267.67 s [vector] maxIndex: OK
  4784. 267.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4785. 267.67 s [vector] maximumBy: OK
  4786. 267.67 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4787. 267.67 s [vector] minimumBy: OK
  4788. 267.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4789. 267.67 s [vector] maximumOn: OK
  4790. 267.67 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4791. 267.67 s [vector] minimumOn: OK
  4792. 267.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4793. 267.67 s [vector] maxIndexBy: OK
  4794. 267.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4795. 267.67 s [vector] minIndexBy: OK
  4796. 267.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4797. 267.67 s [vector] ListFirstMaxIndexWins: OK
  4798. 267.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4799. 267.67 s [vector] FalseListFirstMaxIndexWins: OK
  4800. 267.68 s [vector] +++ OK, failed as expected. (after 1 test):
  4801. 267.68 s [vector] Exception:
  4802. 267.68 s [vector] Prelude.foldr1: empty list
  4803. 267.68 s [vector] CallStack (from HasCallStack):
  4804. 267.68 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4805. 267.68 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4806. 267.68 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4807. 267.68 s [vector] []
  4808. 267.68 s [vector] zip: OK
  4809. 267.68 s [vector] +++ OK, passed 100 tests.
  4810. 267.68 s [vector] zip3: OK
  4811. 267.68 s [vector] +++ OK, passed 100 tests.
  4812. 267.68 s [vector] unzip: OK
  4813. 267.68 s [vector] +++ OK, passed 100 tests.
  4814. 267.68 s [vector] unzip3: OK
  4815. 267.68 s [vector] +++ OK, passed 100 tests.
  4816. 267.69 s [vector] indexed: OK
  4817. 267.69 s [vector] +++ OK, passed 100 tests.
  4818. 267.69 s [vector] update: OK
  4819. 267.69 s [vector] +++ OK, passed 100 tests.
  4820. 267.70 s [vector] concat: OK
  4821. 267.70 s [vector] +++ OK, passed 100 tests.
  4822. 267.70 s [vector] mempty: OK
  4823. 267.70 s [vector] +++ OK, passed 100 tests.
  4824. 267.70 s [vector] mappend: OK
  4825. 267.70 s [vector] +++ OK, passed 100 tests.
  4826. 267.71 s [vector] mconcat: OK
  4827. 267.71 s [vector] +++ OK, passed 100 tests.
  4828. 267.71 s [vector] fmap: OK
  4829. 267.71 s [vector] +++ OK, passed 100 tests.
  4830. 267.71 s [vector] return: OK
  4831. 267.71 s [vector] +++ OK, passed 100 tests.
  4832. 267.72 s [vector] bind: OK
  4833. 267.72 s [vector] +++ OK, passed 100 tests.
  4834. 267.72 s [vector] mzip: OK
  4835. 267.72 s [vector] +++ OK, passed 100 tests.
  4836. 267.72 s [vector] munzip: OK
  4837. 267.72 s [vector] +++ OK, passed 100 tests.
  4838. 267.72 s [vector] applicative_pure: OK
  4839. 267.72 s [vector] +++ OK, passed 100 tests.
  4840. 267.74 s [vector] applicative_appl: OK (0.02s)
  4841. 267.74 s [vector] +++ OK, passed 100 tests.
  4842. 267.74 s [vector] alternative_empty: OK
  4843. 267.74 s [vector] +++ OK, passed 100 tests.
  4844. 267.74 s [vector] alternative_or: OK
  4845. 267.74 s [vector] +++ OK, passed 100 tests.
  4846. 267.78 s [vector] sequence: OK (0.03s)
  4847. 267.78 s [vector] +++ OK, passed 100 tests.
  4848. 267.78 s [vector] sequence_: OK
  4849. 267.78 s [vector] +++ OK, passed 100 tests.
  4850. 267.78 s [vector] glength: OK
  4851. 267.78 s [vector] +++ OK, passed 100 tests.
  4852. 267.78 s [vector] and: OK
  4853. 267.78 s [vector] +++ OK, passed 100 tests.
  4854. 267.78 s [vector] or: OK
  4855. 267.78 s [vector] +++ OK, passed 100 tests.
  4856. 267.78 s [vector] Int
  4857. 267.78 s [vector] fromList.toList == id: OK
  4858. 267.78 s [vector] +++ OK, passed 100 tests.
  4859. 267.78 s [vector] toList.fromList == id: OK
  4860. 267.78 s [vector] +++ OK, passed 100 tests.
  4861. 267.78 s [vector] unstream.stream == id: OK
  4862. 267.78 s [vector] +++ OK, passed 100 tests.
  4863. 267.78 s [vector] stream.unstream == id: OK
  4864. 267.78 s [vector] +++ OK, passed 100 tests.
  4865. 267.78 s [vector] eq: OK
  4866. 267.78 s [vector] +++ OK, passed 100 tests.
  4867. 267.78 s [vector] length: OK
  4868. 267.78 s [vector] +++ OK, passed 100 tests.
  4869. 267.78 s [vector] null: OK
  4870. 267.78 s [vector] +++ OK, passed 100 tests.
  4871. 267.78 s [vector] index: OK
  4872. 267.78 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4873. 267.78 s [vector] safeIndex: OK
  4874. 267.78 s [vector] +++ OK, passed 100 tests.
  4875. 267.78 s [vector] head: OK
  4876. 267.78 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4877. 267.78 s [vector] last: OK
  4878. 267.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4879. 267.79 s [vector] unsafeIndex: OK
  4880. 267.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4881. 267.79 s [vector] unsafeHead: OK
  4882. 267.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4883. 267.79 s [vector] unsafeLast: OK
  4884. 267.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4885. 267.79 s [vector] slice: OK
  4886. 267.79 s [vector] +++ OK, passed 100 tests.
  4887. 267.79 s [vector] init: OK
  4888. 267.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4889. 267.79 s [vector] tail: OK
  4890. 267.79 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4891. 267.79 s [vector] take: OK
  4892. 267.79 s [vector] +++ OK, passed 100 tests.
  4893. 267.79 s [vector] drop: OK
  4894. 267.79 s [vector] +++ OK, passed 100 tests.
  4895. 267.79 s [vector] splitAt: OK
  4896. 267.79 s [vector] +++ OK, passed 100 tests.
  4897. 267.79 s [vector] empty: OK
  4898. 267.79 s [vector] +++ OK, passed 100 tests.
  4899. 267.79 s [vector] singleton: OK
  4900. 267.79 s [vector] +++ OK, passed 100 tests.
  4901. 267.79 s [vector] replicate: OK
  4902. 267.79 s [vector] +++ OK, passed 100 tests.
  4903. 267.79 s [vector] generate: OK
  4904. 267.79 s [vector] +++ OK, passed 100 tests.
  4905. 267.80 s [vector] iterateN: OK
  4906. 267.80 s [vector] +++ OK, passed 100 tests.
  4907. 267.85 s [vector] iterateNM: OK (0.06s)
  4908. 267.85 s [vector] +++ OK, passed 100 tests.
  4909. 267.88 s [vector] generateM: OK (0.02s)
  4910. 267.88 s [vector] +++ OK, passed 100 tests.
  4911. 267.90 s [vector] replicateM: OK (0.02s)
  4912. 267.90 s [vector] +++ OK, passed 100 tests.
  4913. 267.90 s [vector] create: OK
  4914. 267.90 s [vector] +++ OK, passed 100 tests.
  4915. 267.90 s [vector] createT: OK
  4916. 267.90 s [vector] +++ OK, passed 100 tests.
  4917. 267.90 s [vector] unfoldr: OK
  4918. 267.90 s [vector] +++ OK, passed 100 tests.
  4919. 267.90 s [vector] unfoldrN: OK
  4920. 267.90 s [vector] +++ OK, passed 100 tests.
  4921. 267.90 s [vector] unfoldrExactN: OK
  4922. 267.90 s [vector] +++ OK, passed 100 tests.
  4923. 267.91 s [vector] unfoldrM: OK
  4924. 267.91 s [vector] +++ OK, passed 100 tests.
  4925. 267.92 s [vector] unfoldrNM: OK
  4926. 267.92 s [vector] +++ OK, passed 100 tests.
  4927. 267.97 s [vector] unfoldrExactNM: OK (0.05s)
  4928. 267.97 s [vector] +++ OK, passed 100 tests.
  4929. 267.98 s [vector] constructN: OK
  4930. 267.98 s [vector] +++ OK, passed 100 tests.
  4931. 267.98 s [vector] constructrN: OK
  4932. 267.98 s [vector] +++ OK, passed 100 tests.
  4933. 267.98 s [vector] cons: OK
  4934. 267.98 s [vector] +++ OK, passed 100 tests.
  4935. 267.98 s [vector] snoc: OK
  4936. 267.98 s [vector] +++ OK, passed 100 tests.
  4937. 267.98 s [vector] append: OK
  4938. 267.98 s [vector] +++ OK, passed 100 tests.
  4939. 267.99 s [vector] concat: OK (0.01s)
  4940. 267.99 s [vector] +++ OK, passed 100 tests.
  4941. 267.99 s [vector] force: OK
  4942. 267.99 s [vector] +++ OK, passed 100 tests.
  4943. 268.00 s [vector] upd: OK
  4944. 268.00 s [vector] +++ OK, passed 100 tests.
  4945. 268.00 s [vector] accum: OK
  4946. 268.00 s [vector] +++ OK, passed 100 tests.
  4947. 268.00 s [vector] reverse: OK
  4948. 268.00 s [vector] +++ OK, passed 100 tests.
  4949. 268.00 s [vector] backpermute: OK
  4950. 268.01 s [vector] +++ OK, passed 100 tests.
  4951. 268.01 s [vector] map: OK
  4952. 268.01 s [vector] +++ OK, passed 100 tests.
  4953. 268.01 s [vector] imap: OK
  4954. 268.01 s [vector] +++ OK, passed 100 tests.
  4955. 268.02 s [vector] concatMap: OK
  4956. 268.02 s [vector] +++ OK, passed 100 tests.
  4957. 268.02 s [vector] mapM: OK
  4958. 268.02 s [vector] +++ OK, passed 100 tests.
  4959. 268.03 s [vector] mapM_: OK (0.02s)
  4960. 268.03 s [vector] +++ OK, passed 100 tests.
  4961. 268.03 s [vector] forM: OK
  4962. 268.04 s [vector] +++ OK, passed 100 tests.
  4963. 268.07 s [vector] forM_: OK (0.03s)
  4964. 268.08 s [vector] +++ OK, passed 100 tests.
  4965. 268.08 s [vector] imapM: OK
  4966. 268.08 s [vector] +++ OK, passed 100 tests.
  4967. 268.09 s [vector] imapM_: OK (0.02s)
  4968. 268.09 s [vector] +++ OK, passed 100 tests.
  4969. 268.09 s [vector] zipWith: OK
  4970. 268.10 s [vector] +++ OK, passed 100 tests.
  4971. 268.10 s [vector] zipWith3: OK
  4972. 268.10 s [vector] +++ OK, passed 100 tests.
  4973. 268.10 s [vector] izipWith: OK
  4974. 268.11 s [vector] +++ OK, passed 100 tests.
  4975. 268.12 s [vector] izipWith3: OK
  4976. 268.12 s [vector] +++ OK, passed 100 tests.
  4977. 268.12 s [vector] izipWithM: OK
  4978. 268.12 s [vector] +++ OK, passed 100 tests.
  4979. 268.12 s [vector] izipWithM_: OK (0.01s)
  4980. 268.12 s [vector] +++ OK, passed 100 tests.
  4981. 268.12 s [vector] zipWithM: OK
  4982. 268.14 s [vector] +++ OK, passed 100 tests.
  4983. 268.14 s [vector] zipWithM_: OK (0.01s)
  4984. 268.14 s [vector] +++ OK, passed 100 tests.
  4985. 268.14 s [vector] filter: OK
  4986. 268.14 s [vector] +++ OK, passed 100 tests.
  4987. 268.14 s [vector] ifilter: OK
  4988. 268.14 s [vector] +++ OK, passed 100 tests.
  4989. 268.17 s [vector] filterM: OK (0.03s)
  4990. 268.17 s [vector] +++ OK, passed 100 tests.
  4991. 268.17 s [vector] uniq: OK
  4992. 268.17 s [vector] +++ OK, passed 100 tests.
  4993. 268.18 s [vector] mapMaybe: OK
  4994. 268.18 s [vector] +++ OK, passed 100 tests.
  4995. 268.18 s [vector] imapMaybe: OK
  4996. 268.18 s [vector] +++ OK, passed 100 tests.
  4997. 268.18 s [vector] takeWhile: OK
  4998. 268.18 s [vector] +++ OK, passed 100 tests.
  4999. 268.18 s [vector] dropWhile: OK
  5000. 268.18 s [vector] +++ OK, passed 100 tests.
  5001. 268.18 s [vector] partition: OK
  5002. 268.18 s [vector] +++ OK, passed 100 tests.
  5003. 268.18 s [vector] partitionWith: OK
  5004. 268.18 s [vector] +++ OK, passed 100 tests.
  5005. 268.18 s [vector] span: OK
  5006. 268.18 s [vector] +++ OK, passed 100 tests.
  5007. 268.18 s [vector] break: OK
  5008. 268.18 s [vector] +++ OK, passed 100 tests.
  5009. 268.18 s [vector] spanR: OK
  5010. 268.18 s [vector] +++ OK, passed 100 tests.
  5011. 268.18 s [vector] breakR: OK
  5012. 268.18 s [vector] +++ OK, passed 100 tests.
  5013. 268.18 s [vector] groupBy: OK
  5014. 268.18 s [vector] +++ OK, passed 100 tests.
  5015. 268.18 s [vector] elem: OK
  5016. 268.18 s [vector] +++ OK, passed 100 tests.
  5017. 268.18 s [vector] notElem: OK
  5018. 268.18 s [vector] +++ OK, passed 100 tests.
  5019. 268.18 s [vector] find: OK
  5020. 268.18 s [vector] +++ OK, passed 100 tests.
  5021. 268.18 s [vector] findIndex: OK
  5022. 268.18 s [vector] +++ OK, passed 100 tests.
  5023. 268.19 s [vector] findIndexR: OK
  5024. 268.19 s [vector] +++ OK, passed 100 tests.
  5025. 268.19 s [vector] findIndices: OK
  5026. 268.19 s [vector] +++ OK, passed 100 tests.
  5027. 268.19 s [vector] elemIndex: OK
  5028. 268.19 s [vector] +++ OK, passed 100 tests.
  5029. 268.19 s [vector] elemIndices: OK
  5030. 268.19 s [vector] +++ OK, passed 100 tests.
  5031. 268.19 s [vector] foldl: OK
  5032. 268.19 s [vector] +++ OK, passed 100 tests.
  5033. 268.19 s [vector] foldl1: OK
  5034. 268.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5035. 268.20 s [vector] foldl': OK
  5036. 268.20 s [vector] +++ OK, passed 100 tests.
  5037. 268.20 s [vector] foldl1': OK
  5038. 268.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5039. 268.20 s [vector] foldr: OK
  5040. 268.21 s [vector] +++ OK, passed 100 tests.
  5041. 268.21 s [vector] foldr1: OK
  5042. 268.21 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5043. 268.21 s [vector] foldr': OK
  5044. 268.21 s [vector] +++ OK, passed 100 tests.
  5045. 268.21 s [vector] foldr1': OK
  5046. 268.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5047. 268.22 s [vector] ifoldl: OK
  5048. 268.22 s [vector] +++ OK, passed 100 tests.
  5049. 268.22 s [vector] ifoldl': OK
  5050. 268.22 s [vector] +++ OK, passed 100 tests.
  5051. 268.23 s [vector] ifoldr: OK
  5052. 268.23 s [vector] +++ OK, passed 100 tests.
  5053. 268.23 s [vector] ifoldr': OK
  5054. 268.23 s [vector] +++ OK, passed 100 tests.
  5055. 268.23 s [vector] ifoldM: OK
  5056. 268.24 s [vector] +++ OK, passed 100 tests.
  5057. 268.24 s [vector] ifoldM': OK
  5058. 268.24 s [vector] +++ OK, passed 100 tests.
  5059. 268.26 s [vector] ifoldM_: OK (0.02s)
  5060. 268.26 s [vector] +++ OK, passed 100 tests.
  5061. 268.28 s [vector] ifoldM'_: OK (0.02s)
  5062. 268.28 s [vector] +++ OK, passed 100 tests.
  5063. 268.28 s [vector] all: OK
  5064. 268.28 s [vector] +++ OK, passed 100 tests.
  5065. 268.28 s [vector] any: OK
  5066. 268.28 s [vector] +++ OK, passed 100 tests.
  5067. 268.28 s [vector] prescanl: OK
  5068. 268.28 s [vector] +++ OK, passed 100 tests.
  5069. 268.29 s [vector] prescanl': OK
  5070. 268.29 s [vector] +++ OK, passed 100 tests.
  5071. 268.29 s [vector] postscanl: OK
  5072. 268.29 s [vector] +++ OK, passed 100 tests.
  5073. 268.29 s [vector] postscanl': OK
  5074. 268.30 s [vector] +++ OK, passed 100 tests.
  5075. 268.30 s [vector] scanl: OK
  5076. 268.30 s [vector] +++ OK, passed 100 tests.
  5077. 268.30 s [vector] scanl': OK
  5078. 268.30 s [vector] +++ OK, passed 100 tests.
  5079. 268.30 s [vector] scanl1: OK
  5080. 268.30 s [vector] +++ OK, passed 100 tests.
  5081. 268.30 s [vector] scanl1': OK
  5082. 268.30 s [vector] +++ OK, passed 100 tests.
  5083. 268.31 s [vector] iscanl: OK
  5084. 268.31 s [vector] +++ OK, passed 100 tests.
  5085. 268.32 s [vector] iscanl': OK
  5086. 268.32 s [vector] +++ OK, passed 100 tests.
  5087. 268.32 s [vector] prescanr: OK
  5088. 268.32 s [vector] +++ OK, passed 100 tests.
  5089. 268.32 s [vector] prescanr': OK
  5090. 268.32 s [vector] +++ OK, passed 100 tests.
  5091. 268.32 s [vector] postscanr: OK
  5092. 268.32 s [vector] +++ OK, passed 100 tests.
  5093. 268.32 s [vector] postscanr': OK
  5094. 268.33 s [vector] +++ OK, passed 100 tests.
  5095. 268.33 s [vector] scanr: OK
  5096. 268.33 s [vector] +++ OK, passed 100 tests.
  5097. 268.33 s [vector] scanr': OK
  5098. 268.33 s [vector] +++ OK, passed 100 tests.
  5099. 268.34 s [vector] scanr1: OK
  5100. 268.34 s [vector] +++ OK, passed 100 tests.
  5101. 268.34 s [vector] scanr1': OK
  5102. 268.34 s [vector] +++ OK, passed 100 tests.
  5103. 268.34 s [vector] iscanr: OK
  5104. 268.34 s [vector] +++ OK, passed 100 tests.
  5105. 268.34 s [vector] iscanr': OK
  5106. 268.35 s [vector] +++ OK, passed 100 tests.
  5107. 268.35 s [vector] mut_read: OK
  5108. 268.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5109. 268.35 s [vector] mut_write: OK
  5110. 268.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5111. 268.35 s [vector] mut_modify: OK
  5112. 268.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5113. 268.36 s [vector] mut_generate: OK
  5114. 268.36 s [vector] +++ OK, passed 100 tests.
  5115. 268.36 s [vector] mut_generateM: OK (0.01s)
  5116. 268.36 s [vector] +++ OK, passed 100 tests.
  5117. 268.38 s [vector] mut_mapM_: OK (0.02s)
  5118. 268.38 s [vector] +++ OK, passed 100 tests.
  5119. 268.40 s [vector] mut_imapM_: OK (0.02s)
  5120. 268.40 s [vector] +++ OK, passed 100 tests.
  5121. 268.42 s [vector] mut_forM_: OK (0.02s)
  5122. 268.42 s [vector] +++ OK, passed 100 tests.
  5123. 268.44 s [vector] mut_iforM_: OK (0.02s)
  5124. 268.44 s [vector] +++ OK, passed 100 tests.
  5125. 268.44 s [vector] mut_foldr: OK
  5126. 268.44 s [vector] +++ OK, passed 100 tests.
  5127. 268.45 s [vector] mut_foldr': OK
  5128. 268.46 s [vector] +++ OK, passed 100 tests.
  5129. 268.47 s [vector] mut_foldl: OK
  5130. 268.47 s [vector] +++ OK, passed 100 tests.
  5131. 268.48 s [vector] mut_foldl': OK
  5132. 268.48 s [vector] +++ OK, passed 100 tests.
  5133. 268.48 s [vector] mut_ifoldr: OK
  5134. 268.48 s [vector] +++ OK, passed 100 tests.
  5135. 268.49 s [vector] mut_ifoldr': OK
  5136. 268.49 s [vector] +++ OK, passed 100 tests.
  5137. 268.50 s [vector] mut_ifoldl: OK
  5138. 268.50 s [vector] +++ OK, passed 100 tests.
  5139. 268.50 s [vector] mut_ifoldl': OK
  5140. 268.50 s [vector] +++ OK, passed 100 tests.
  5141. 268.50 s [vector] mut_foldM: OK
  5142. 268.50 s [vector] +++ OK, passed 100 tests.
  5143. 268.50 s [vector] mut_foldM': OK
  5144. 268.50 s [vector] +++ OK, passed 100 tests.
  5145. 268.50 s [vector] mut_foldrM: OK
  5146. 268.50 s [vector] +++ OK, passed 100 tests.
  5147. 268.50 s [vector] mut_foldrM': OK
  5148. 268.50 s [vector] +++ OK, passed 100 tests.
  5149. 268.50 s [vector] mut_ifoldM: OK
  5150. 268.50 s [vector] +++ OK, passed 100 tests.
  5151. 268.50 s [vector] mut_ifoldM': OK
  5152. 268.50 s [vector] +++ OK, passed 100 tests.
  5153. 268.50 s [vector] mut_ifoldrM: OK
  5154. 268.50 s [vector] +++ OK, passed 100 tests.
  5155. 268.50 s [vector] mut_ifoldrM': OK
  5156. 268.50 s [vector] +++ OK, passed 100 tests.
  5157. 268.50 s [vector] compare: OK
  5158. 268.50 s [vector] +++ OK, passed 100 tests.
  5159. 268.50 s [vector] maximum: OK
  5160. 268.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5161. 268.50 s [vector] minimum: OK
  5162. 268.50 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5163. 268.51 s [vector] minIndex: OK
  5164. 268.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5165. 268.51 s [vector] maxIndex: OK
  5166. 268.51 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5167. 268.51 s [vector] maximumBy: OK
  5168. 268.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5169. 268.51 s [vector] minimumBy: OK
  5170. 268.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5171. 268.51 s [vector] maximumOn: OK
  5172. 268.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5173. 268.51 s [vector] minimumOn: OK
  5174. 268.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5175. 268.51 s [vector] maxIndexBy: OK
  5176. 268.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5177. 268.51 s [vector] minIndexBy: OK
  5178. 268.51 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5179. 268.51 s [vector] ListFirstMaxIndexWins: OK
  5180. 268.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5181. 268.51 s [vector] FalseListFirstMaxIndexWins: OK
  5182. 268.51 s [vector] +++ OK, failed as expected. (after 1 test):
  5183. 268.51 s [vector] Exception:
  5184. 268.51 s [vector] Prelude.foldr1: empty list
  5185. 268.51 s [vector] CallStack (from HasCallStack):
  5186. 268.51 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5187. 268.51 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5188. 268.51 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5189. 268.51 s [vector] []
  5190. 268.51 s [vector] zip: OK
  5191. 268.52 s [vector] +++ OK, passed 100 tests.
  5192. 268.52 s [vector] zip3: OK
  5193. 268.52 s [vector] +++ OK, passed 100 tests.
  5194. 268.52 s [vector] unzip: OK
  5195. 268.52 s [vector] +++ OK, passed 100 tests.
  5196. 268.52 s [vector] unzip3: OK
  5197. 268.52 s [vector] +++ OK, passed 100 tests.
  5198. 268.52 s [vector] indexed: OK
  5199. 268.52 s [vector] +++ OK, passed 100 tests.
  5200. 268.52 s [vector] update: OK
  5201. 268.52 s [vector] +++ OK, passed 100 tests.
  5202. 268.53 s [vector] concat: OK (0.01s)
  5203. 268.53 s [vector] +++ OK, passed 100 tests.
  5204. 268.53 s [vector] mempty: OK
  5205. 268.54 s [vector] +++ OK, passed 100 tests.
  5206. 268.54 s [vector] mappend: OK
  5207. 268.54 s [vector] +++ OK, passed 100 tests.
  5208. 268.55 s [vector] mconcat: OK (0.01s)
  5209. 268.55 s [vector] +++ OK, passed 100 tests.
  5210. 268.56 s [vector] fmap: OK
  5211. 268.56 s [vector] +++ OK, passed 100 tests.
  5212. 268.56 s [vector] return: OK
  5213. 268.56 s [vector] +++ OK, passed 100 tests.
  5214. 268.57 s [vector] bind: OK (0.02s)
  5215. 268.57 s [vector] +++ OK, passed 100 tests.
  5216. 268.57 s [vector] mzip: OK
  5217. 268.57 s [vector] +++ OK, passed 100 tests.
  5218. 268.57 s [vector] munzip: OK
  5219. 268.57 s [vector] +++ OK, passed 100 tests.
  5220. 268.57 s [vector] applicative_pure: OK
  5221. 268.58 s [vector] +++ OK, passed 100 tests.
  5222. 268.60 s [vector] applicative_appl: OK (0.03s)
  5223. 268.60 s [vector] +++ OK, passed 100 tests.
  5224. 268.60 s [vector] alternative_empty: OK
  5225. 268.60 s [vector] +++ OK, passed 100 tests.
  5226. 268.60 s [vector] alternative_or: OK
  5227. 268.60 s [vector] +++ OK, passed 100 tests.
  5228. 268.64 s [vector] sequence: OK (0.04s)
  5229. 268.64 s [vector] +++ OK, passed 100 tests.
  5230. 268.65 s [vector] sequence_: OK
  5231. 268.65 s [vector] +++ OK, passed 100 tests.
  5232. 268.65 s [vector] glength: OK
  5233. 268.65 s [vector] +++ OK, passed 100 tests.
  5234. 268.65 s [vector] sum: OK
  5235. 268.65 s [vector] +++ OK, passed 100 tests.
  5236. 268.65 s [vector] product: OK
  5237. 268.65 s [vector] +++ OK, passed 100 tests.
  5238. 268.65 s [vector] enumFromN: OK
  5239. 268.65 s [vector] +++ OK, passed 100 tests.
  5240. 268.65 s [vector] enumFromThenN: OK
  5241. 268.65 s [vector] +++ OK, passed 100 tests.
  5242. 268.65 s [vector] enumFromTo: OK
  5243. 268.65 s [vector] +++ OK, passed 100 tests.
  5244. 268.65 s [vector] enumFromThenTo: OK
  5245. 268.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5246. 268.66 s [vector] unstream
  5247. 268.66 s [vector] unstream == vunstream (exact): OK
  5248. 268.66 s [vector] +++ OK, passed 100 tests.
  5249. 268.66 s [vector] unstream == vunstream (unknown): OK
  5250. 268.66 s [vector] +++ OK, passed 100 tests.
  5251. 268.66 s [vector] unstreamR ~= vunstream (exact): OK
  5252. 268.66 s [vector] +++ OK, passed 100 tests.
  5253. 268.66 s [vector] unstreamR ~= vunstream (unknown): OK
  5254. 268.66 s [vector] +++ OK, passed 100 tests.
  5255. 268.66 s [vector] Tests.Vector.Unboxed
  5256. 268.66 s [vector] ()
  5257. 268.66 s [vector] fromList.toList == id: OK
  5258. 268.66 s [vector] +++ OK, passed 100 tests.
  5259. 268.66 s [vector] toList.fromList == id: OK
  5260. 268.66 s [vector] +++ OK, passed 100 tests.
  5261. 268.66 s [vector] unstream.stream == id: OK
  5262. 268.66 s [vector] +++ OK, passed 100 tests.
  5263. 268.66 s [vector] stream.unstream == id: OK
  5264. 268.66 s [vector] +++ OK, passed 100 tests.
  5265. 268.66 s [vector] eq: OK
  5266. 268.66 s [vector] +++ OK, passed 100 tests.
  5267. 268.66 s [vector] length: OK
  5268. 268.66 s [vector] +++ OK, passed 100 tests.
  5269. 268.66 s [vector] null: OK
  5270. 268.66 s [vector] +++ OK, passed 100 tests.
  5271. 268.66 s [vector] index: OK
  5272. 268.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5273. 268.66 s [vector] safeIndex: OK
  5274. 268.66 s [vector] +++ OK, passed 100 tests.
  5275. 268.66 s [vector] head: OK
  5276. 268.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5277. 268.66 s [vector] last: OK
  5278. 268.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5279. 268.66 s [vector] unsafeIndex: OK
  5280. 268.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5281. 268.67 s [vector] unsafeHead: OK
  5282. 268.67 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5283. 268.67 s [vector] unsafeLast: OK
  5284. 268.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5285. 268.67 s [vector] slice: OK
  5286. 268.67 s [vector] +++ OK, passed 100 tests.
  5287. 268.67 s [vector] init: OK
  5288. 268.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5289. 268.67 s [vector] tail: OK
  5290. 268.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5291. 268.67 s [vector] take: OK
  5292. 268.67 s [vector] +++ OK, passed 100 tests.
  5293. 268.67 s [vector] drop: OK
  5294. 268.67 s [vector] +++ OK, passed 100 tests.
  5295. 268.67 s [vector] splitAt: OK
  5296. 268.67 s [vector] +++ OK, passed 100 tests.
  5297. 268.67 s [vector] empty: OK
  5298. 268.67 s [vector] +++ OK, passed 100 tests.
  5299. 268.67 s [vector] singleton: OK
  5300. 268.67 s [vector] +++ OK, passed 100 tests.
  5301. 268.67 s [vector] replicate: OK
  5302. 268.67 s [vector] +++ OK, passed 100 tests.
  5303. 268.67 s [vector] generate: OK
  5304. 268.67 s [vector] +++ OK, passed 100 tests.
  5305. 268.68 s [vector] iterateN: OK
  5306. 268.68 s [vector] +++ OK, passed 100 tests.
  5307. 268.72 s [vector] iterateNM: OK (0.04s)
  5308. 268.72 s [vector] +++ OK, passed 100 tests.
  5309. 268.75 s [vector] generateM: OK (0.03s)
  5310. 268.75 s [vector] +++ OK, passed 100 tests.
  5311. 268.75 s [vector] replicateM: OK
  5312. 268.75 s [vector] +++ OK, passed 100 tests.
  5313. 268.75 s [vector] create: OK
  5314. 268.75 s [vector] +++ OK, passed 100 tests.
  5315. 268.75 s [vector] createT: OK
  5316. 268.75 s [vector] +++ OK, passed 100 tests.
  5317. 268.75 s [vector] unfoldr: OK
  5318. 268.75 s [vector] +++ OK, passed 100 tests.
  5319. 268.75 s [vector] unfoldrN: OK
  5320. 268.75 s [vector] +++ OK, passed 100 tests.
  5321. 268.75 s [vector] unfoldrExactN: OK
  5322. 268.75 s [vector] +++ OK, passed 100 tests.
  5323. 268.78 s [vector] unfoldrM: OK (0.02s)
  5324. 268.78 s [vector] +++ OK, passed 100 tests.
  5325. 268.78 s [vector] unfoldrNM: OK
  5326. 268.78 s [vector] +++ OK, passed 100 tests.
  5327. 268.81 s [vector] unfoldrExactNM: OK (0.03s)
  5328. 268.81 s [vector] +++ OK, passed 100 tests.
  5329. 268.81 s [vector] constructN: OK
  5330. 268.81 s [vector] +++ OK, passed 100 tests.
  5331. 268.82 s [vector] constructrN: OK
  5332. 268.82 s [vector] +++ OK, passed 100 tests.
  5333. 268.82 s [vector] cons: OK
  5334. 268.82 s [vector] +++ OK, passed 100 tests.
  5335. 268.82 s [vector] snoc: OK
  5336. 268.82 s [vector] +++ OK, passed 100 tests.
  5337. 268.82 s [vector] append: OK
  5338. 268.82 s [vector] +++ OK, passed 100 tests.
  5339. 268.82 s [vector] concat: OK
  5340. 268.82 s [vector] +++ OK, passed 100 tests.
  5341. 268.83 s [vector] force: OK
  5342. 268.83 s [vector] +++ OK, passed 100 tests.
  5343. 268.83 s [vector] upd: OK
  5344. 268.83 s [vector] +++ OK, passed 100 tests.
  5345. 268.83 s [vector] accum: OK
  5346. 268.83 s [vector] +++ OK, passed 100 tests.
  5347. 268.83 s [vector] reverse: OK
  5348. 268.83 s [vector] +++ OK, passed 100 tests.
  5349. 268.83 s [vector] backpermute: OK
  5350. 268.83 s [vector] +++ OK, passed 100 tests.
  5351. 268.83 s [vector] map: OK
  5352. 268.83 s [vector] +++ OK, passed 100 tests.
  5353. 268.83 s [vector] imap: OK
  5354. 268.84 s [vector] +++ OK, passed 100 tests.
  5355. 268.84 s [vector] concatMap: OK
  5356. 268.84 s [vector] +++ OK, passed 100 tests.
  5357. 268.84 s [vector] mapM: OK
  5358. 268.84 s [vector] +++ OK, passed 100 tests.
  5359. 268.84 s [vector] mapM_: OK
  5360. 268.84 s [vector] +++ OK, passed 100 tests.
  5361. 268.85 s [vector] forM: OK
  5362. 268.85 s [vector] +++ OK, passed 100 tests.
  5363. 268.86 s [vector] forM_: OK (0.01s)
  5364. 268.86 s [vector] +++ OK, passed 100 tests.
  5365. 268.86 s [vector] imapM: OK
  5366. 268.86 s [vector] +++ OK, passed 100 tests.
  5367. 268.87 s [vector] imapM_: OK (0.01s)
  5368. 268.88 s [vector] +++ OK, passed 100 tests.
  5369. 268.88 s [vector] zipWith: OK
  5370. 268.88 s [vector] +++ OK, passed 100 tests.
  5371. 268.88 s [vector] zipWith3: OK
  5372. 268.88 s [vector] +++ OK, passed 100 tests.
  5373. 268.88 s [vector] izipWith: OK
  5374. 268.88 s [vector] +++ OK, passed 100 tests.
  5375. 268.88 s [vector] izipWith3: OK
  5376. 268.89 s [vector] +++ OK, passed 100 tests.
  5377. 268.89 s [vector] izipWithM: OK
  5378. 268.89 s [vector] +++ OK, passed 100 tests.
  5379. 268.89 s [vector] izipWithM_: OK
  5380. 268.89 s [vector] +++ OK, passed 100 tests.
  5381. 268.90 s [vector] zipWithM: OK
  5382. 268.90 s [vector] +++ OK, passed 100 tests.
  5383. 268.90 s [vector] zipWithM_: OK
  5384. 268.90 s [vector] +++ OK, passed 100 tests.
  5385. 268.90 s [vector] filter: OK
  5386. 268.90 s [vector] +++ OK, passed 100 tests.
  5387. 268.92 s [vector] ifilter: OK
  5388. 268.92 s [vector] +++ OK, passed 100 tests.
  5389. 268.92 s [vector] filterM: OK (0.02s)
  5390. 268.92 s [vector] +++ OK, passed 100 tests.
  5391. 268.93 s [vector] uniq: OK
  5392. 268.93 s [vector] +++ OK, passed 100 tests.
  5393. 268.93 s [vector] mapMaybe: OK
  5394. 268.93 s [vector] +++ OK, passed 100 tests.
  5395. 268.93 s [vector] imapMaybe: OK
  5396. 268.93 s [vector] +++ OK, passed 100 tests.
  5397. 268.93 s [vector] takeWhile: OK
  5398. 268.93 s [vector] +++ OK, passed 100 tests.
  5399. 268.93 s [vector] dropWhile: OK
  5400. 268.93 s [vector] +++ OK, passed 100 tests.
  5401. 268.93 s [vector] partition: OK
  5402. 268.93 s [vector] +++ OK, passed 100 tests.
  5403. 268.93 s [vector] partitionWith: OK
  5404. 268.93 s [vector] +++ OK, passed 100 tests.
  5405. 268.93 s [vector] span: OK
  5406. 268.93 s [vector] +++ OK, passed 100 tests.
  5407. 268.93 s [vector] break: OK
  5408. 268.93 s [vector] +++ OK, passed 100 tests.
  5409. 268.93 s [vector] spanR: OK
  5410. 268.93 s [vector] +++ OK, passed 100 tests.
  5411. 268.93 s [vector] breakR: OK
  5412. 268.93 s [vector] +++ OK, passed 100 tests.
  5413. 268.94 s [vector] groupBy: OK
  5414. 268.94 s [vector] +++ OK, passed 100 tests.
  5415. 268.94 s [vector] elem: OK
  5416. 268.94 s [vector] +++ OK, passed 100 tests.
  5417. 268.94 s [vector] notElem: OK
  5418. 268.94 s [vector] +++ OK, passed 100 tests.
  5419. 268.94 s [vector] find: OK
  5420. 268.94 s [vector] +++ OK, passed 100 tests.
  5421. 268.94 s [vector] findIndex: OK
  5422. 268.94 s [vector] +++ OK, passed 100 tests.
  5423. 268.94 s [vector] findIndexR: OK
  5424. 268.94 s [vector] +++ OK, passed 100 tests.
  5425. 268.94 s [vector] findIndices: OK
  5426. 268.94 s [vector] +++ OK, passed 100 tests.
  5427. 268.94 s [vector] elemIndex: OK
  5428. 268.94 s [vector] +++ OK, passed 100 tests.
  5429. 268.94 s [vector] elemIndices: OK
  5430. 268.94 s [vector] +++ OK, passed 100 tests.
  5431. 268.94 s [vector] foldl: OK
  5432. 268.94 s [vector] +++ OK, passed 100 tests.
  5433. 268.94 s [vector] foldl1: OK
  5434. 268.94 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5435. 268.95 s [vector] foldl': OK
  5436. 268.95 s [vector] +++ OK, passed 100 tests.
  5437. 268.95 s [vector] foldl1': OK
  5438. 268.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5439. 268.95 s [vector] foldr: OK
  5440. 268.95 s [vector] +++ OK, passed 100 tests.
  5441. 268.95 s [vector] foldr1: OK
  5442. 268.95 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5443. 268.95 s [vector] foldr': OK
  5444. 268.95 s [vector] +++ OK, passed 100 tests.
  5445. 268.95 s [vector] foldr1': OK
  5446. 268.95 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5447. 268.95 s [vector] ifoldl: OK
  5448. 268.95 s [vector] +++ OK, passed 100 tests.
  5449. 268.95 s [vector] ifoldl': OK
  5450. 268.95 s [vector] +++ OK, passed 100 tests.
  5451. 268.95 s [vector] ifoldr: OK
  5452. 268.95 s [vector] +++ OK, passed 100 tests.
  5453. 268.95 s [vector] ifoldr': OK
  5454. 268.95 s [vector] +++ OK, passed 100 tests.
  5455. 268.95 s [vector] ifoldM: OK
  5456. 268.95 s [vector] +++ OK, passed 100 tests.
  5457. 268.96 s [vector] ifoldM': OK
  5458. 268.96 s [vector] +++ OK, passed 100 tests.
  5459. 268.98 s [vector] ifoldM_: OK (0.01s)
  5460. 268.98 s [vector] +++ OK, passed 100 tests.
  5461. 268.98 s [vector] ifoldM'_: OK (0.01s)
  5462. 268.98 s [vector] +++ OK, passed 100 tests.
  5463. 268.98 s [vector] all: OK
  5464. 268.98 s [vector] +++ OK, passed 100 tests.
  5465. 268.98 s [vector] any: OK
  5466. 268.98 s [vector] +++ OK, passed 100 tests.
  5467. 268.98 s [vector] prescanl: OK
  5468. 268.98 s [vector] +++ OK, passed 100 tests.
  5469. 268.98 s [vector] prescanl': OK
  5470. 268.98 s [vector] +++ OK, passed 100 tests.
  5471. 268.98 s [vector] postscanl: OK
  5472. 268.98 s [vector] +++ OK, passed 100 tests.
  5473. 268.98 s [vector] postscanl': OK
  5474. 268.98 s [vector] +++ OK, passed 100 tests.
  5475. 268.98 s [vector] scanl: OK
  5476. 268.98 s [vector] +++ OK, passed 100 tests.
  5477. 268.98 s [vector] scanl': OK
  5478. 268.98 s [vector] +++ OK, passed 100 tests.
  5479. 268.98 s [vector] scanl1: OK
  5480. 268.98 s [vector] +++ OK, passed 100 tests.
  5481. 268.98 s [vector] scanl1': OK
  5482. 268.99 s [vector] +++ OK, passed 100 tests.
  5483. 268.99 s [vector] iscanl: OK
  5484. 268.99 s [vector] +++ OK, passed 100 tests.
  5485. 268.99 s [vector] iscanl': OK
  5486. 268.99 s [vector] +++ OK, passed 100 tests.
  5487. 268.99 s [vector] prescanr: OK
  5488. 268.99 s [vector] +++ OK, passed 100 tests.
  5489. 268.99 s [vector] prescanr': OK
  5490. 268.99 s [vector] +++ OK, passed 100 tests.
  5491. 268.99 s [vector] postscanr: OK
  5492. 268.99 s [vector] +++ OK, passed 100 tests.
  5493. 268.99 s [vector] postscanr': OK
  5494. 268.99 s [vector] +++ OK, passed 100 tests.
  5495. 269.00 s [vector] scanr: OK
  5496. 269.00 s [vector] +++ OK, passed 100 tests.
  5497. 269.00 s [vector] scanr': OK
  5498. 269.00 s [vector] +++ OK, passed 100 tests.
  5499. 269.00 s [vector] scanr1: OK
  5500. 269.00 s [vector] +++ OK, passed 100 tests.
  5501. 269.00 s [vector] scanr1': OK
  5502. 269.00 s [vector] +++ OK, passed 100 tests.
  5503. 269.00 s [vector] iscanr: OK
  5504. 269.00 s [vector] +++ OK, passed 100 tests.
  5505. 269.00 s [vector] iscanr': OK
  5506. 269.00 s [vector] +++ OK, passed 100 tests.
  5507. 269.01 s [vector] mut_read: OK
  5508. 269.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5509. 269.02 s [vector] mut_write: OK
  5510. 269.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5511. 269.02 s [vector] mut_modify: OK
  5512. 269.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5513. 269.03 s [vector] mut_generate: OK
  5514. 269.03 s [vector] +++ OK, passed 100 tests.
  5515. 269.03 s [vector] mut_generateM: OK (0.01s)
  5516. 269.03 s [vector] +++ OK, passed 100 tests.
  5517. 269.04 s [vector] mut_mapM_: OK (0.01s)
  5518. 269.04 s [vector] +++ OK, passed 100 tests.
  5519. 269.04 s [vector] mut_imapM_: OK
  5520. 269.04 s [vector] +++ OK, passed 100 tests.
  5521. 269.06 s [vector] mut_forM_: OK (0.01s)
  5522. 269.06 s [vector] +++ OK, passed 100 tests.
  5523. 269.06 s [vector] mut_iforM_: OK (0.01s)
  5524. 269.06 s [vector] +++ OK, passed 100 tests.
  5525. 269.07 s [vector] mut_foldr: OK
  5526. 269.07 s [vector] +++ OK, passed 100 tests.
  5527. 269.07 s [vector] mut_foldr': OK
  5528. 269.07 s [vector] +++ OK, passed 100 tests.
  5529. 269.07 s [vector] mut_foldl: OK
  5530. 269.07 s [vector] +++ OK, passed 100 tests.
  5531. 269.07 s [vector] mut_foldl': OK
  5532. 269.07 s [vector] +++ OK, passed 100 tests.
  5533. 269.07 s [vector] mut_ifoldr: OK
  5534. 269.07 s [vector] +++ OK, passed 100 tests.
  5535. 269.07 s [vector] mut_ifoldr': OK
  5536. 269.07 s [vector] +++ OK, passed 100 tests.
  5537. 269.07 s [vector] mut_ifoldl: OK
  5538. 269.07 s [vector] +++ OK, passed 100 tests.
  5539. 269.07 s [vector] mut_ifoldl': OK
  5540. 269.07 s [vector] +++ OK, passed 100 tests.
  5541. 269.07 s [vector] mut_foldM: OK
  5542. 269.07 s [vector] +++ OK, passed 100 tests.
  5543. 269.07 s [vector] mut_foldM': OK
  5544. 269.07 s [vector] +++ OK, passed 100 tests.
  5545. 269.07 s [vector] mut_foldrM: OK
  5546. 269.07 s [vector] +++ OK, passed 100 tests.
  5547. 269.07 s [vector] mut_foldrM': OK
  5548. 269.08 s [vector] +++ OK, passed 100 tests.
  5549. 269.08 s [vector] mut_ifoldM: OK
  5550. 269.08 s [vector] +++ OK, passed 100 tests.
  5551. 269.08 s [vector] mut_ifoldM': OK
  5552. 269.08 s [vector] +++ OK, passed 100 tests.
  5553. 269.08 s [vector] mut_ifoldrM: OK
  5554. 269.08 s [vector] +++ OK, passed 100 tests.
  5555. 269.08 s [vector] mut_ifoldrM': OK
  5556. 269.08 s [vector] +++ OK, passed 100 tests.
  5557. 269.08 s [vector] compare: OK
  5558. 269.08 s [vector] +++ OK, passed 100 tests.
  5559. 269.08 s [vector] maximum: OK
  5560. 269.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5561. 269.08 s [vector] minimum: OK
  5562. 269.08 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5563. 269.08 s [vector] minIndex: OK
  5564. 269.08 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5565. 269.08 s [vector] maxIndex: OK
  5566. 269.08 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5567. 269.08 s [vector] maximumBy: OK
  5568. 269.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5569. 269.08 s [vector] minimumBy: OK
  5570. 269.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5571. 269.08 s [vector] maximumOn: OK
  5572. 269.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5573. 269.09 s [vector] minimumOn: OK
  5574. 269.09 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5575. 269.09 s [vector] maxIndexBy: OK
  5576. 269.09 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5577. 269.09 s [vector] minIndexBy: OK
  5578. 269.09 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5579. 269.09 s [vector] ListFirstMaxIndexWins: OK
  5580. 269.09 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5581. 269.09 s [vector] FalseListFirstMaxIndexWins: OK
  5582. 269.09 s [vector] +++ OK, failed as expected. (after 1 test):
  5583. 269.09 s [vector] Exception:
  5584. 269.09 s [vector] Prelude.foldr1: empty list
  5585. 269.09 s [vector] CallStack (from HasCallStack):
  5586. 269.09 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5587. 269.09 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5588. 269.09 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5589. 269.09 s [vector] []
  5590. 269.09 s [vector] zip: OK
  5591. 269.09 s [vector] +++ OK, passed 100 tests.
  5592. 269.09 s [vector] zip3: OK
  5593. 269.09 s [vector] +++ OK, passed 100 tests.
  5594. 269.09 s [vector] unzip: OK
  5595. 269.09 s [vector] +++ OK, passed 100 tests.
  5596. 269.09 s [vector] unzip3: OK
  5597. 269.09 s [vector] +++ OK, passed 100 tests.
  5598. 269.09 s [vector] indexed: OK
  5599. 269.09 s [vector] +++ OK, passed 100 tests.
  5600. 269.09 s [vector] update: OK
  5601. 269.10 s [vector] +++ OK, passed 100 tests.
  5602. 269.10 s [vector] mempty: OK
  5603. 269.10 s [vector] +++ OK, passed 100 tests.
  5604. 269.10 s [vector] mappend: OK
  5605. 269.10 s [vector] +++ OK, passed 100 tests.
  5606. 269.10 s [vector] mconcat: OK
  5607. 269.11 s [vector] +++ OK, passed 100 tests.
  5608. 269.11 s [vector] glength: OK
  5609. 269.11 s [vector] +++ OK, passed 100 tests.
  5610. 269.11 s [vector] (Bool)
  5611. 269.11 s [vector] fromList.toList == id: OK
  5612. 269.11 s [vector] +++ OK, passed 100 tests.
  5613. 269.11 s [vector] toList.fromList == id: OK
  5614. 269.11 s [vector] +++ OK, passed 100 tests.
  5615. 269.11 s [vector] unstream.stream == id: OK
  5616. 269.11 s [vector] +++ OK, passed 100 tests.
  5617. 269.11 s [vector] stream.unstream == id: OK
  5618. 269.11 s [vector] +++ OK, passed 100 tests.
  5619. 269.11 s [vector] eq: OK
  5620. 269.11 s [vector] +++ OK, passed 100 tests.
  5621. 269.11 s [vector] length: OK
  5622. 269.11 s [vector] +++ OK, passed 100 tests.
  5623. 269.11 s [vector] null: OK
  5624. 269.11 s [vector] +++ OK, passed 100 tests.
  5625. 269.11 s [vector] index: OK
  5626. 269.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5627. 269.11 s [vector] safeIndex: OK
  5628. 269.11 s [vector] +++ OK, passed 100 tests.
  5629. 269.11 s [vector] head: OK
  5630. 269.11 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5631. 269.11 s [vector] last: OK
  5632. 269.11 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5633. 269.11 s [vector] unsafeIndex: OK
  5634. 269.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5635. 269.11 s [vector] unsafeHead: OK
  5636. 269.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5637. 269.11 s [vector] unsafeLast: OK
  5638. 269.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5639. 269.11 s [vector] slice: OK
  5640. 269.11 s [vector] +++ OK, passed 100 tests.
  5641. 269.11 s [vector] init: OK
  5642. 269.12 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5643. 269.12 s [vector] tail: OK
  5644. 269.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5645. 269.12 s [vector] take: OK
  5646. 269.12 s [vector] +++ OK, passed 100 tests.
  5647. 269.12 s [vector] drop: OK
  5648. 269.12 s [vector] +++ OK, passed 100 tests.
  5649. 269.12 s [vector] splitAt: OK
  5650. 269.12 s [vector] +++ OK, passed 100 tests.
  5651. 269.12 s [vector] empty: OK
  5652. 269.12 s [vector] +++ OK, passed 100 tests.
  5653. 269.12 s [vector] singleton: OK
  5654. 269.12 s [vector] +++ OK, passed 100 tests.
  5655. 269.12 s [vector] replicate: OK
  5656. 269.12 s [vector] +++ OK, passed 100 tests.
  5657. 269.12 s [vector] generate: OK
  5658. 269.12 s [vector] +++ OK, passed 100 tests.
  5659. 269.12 s [vector] iterateN: OK
  5660. 269.12 s [vector] +++ OK, passed 100 tests.
  5661. 269.16 s [vector] iterateNM: OK (0.02s)
  5662. 269.16 s [vector] +++ OK, passed 100 tests.
  5663. 269.16 s [vector] generateM: OK (0.02s)
  5664. 269.16 s [vector] +++ OK, passed 100 tests.
  5665. 269.17 s [vector] replicateM: OK
  5666. 269.17 s [vector] +++ OK, passed 100 tests.
  5667. 269.17 s [vector] create: OK
  5668. 269.17 s [vector] +++ OK, passed 100 tests.
  5669. 269.18 s [vector] createT: OK
  5670. 269.18 s [vector] +++ OK, passed 100 tests.
  5671. 269.18 s [vector] unfoldr: OK
  5672. 269.18 s [vector] +++ OK, passed 100 tests.
  5673. 269.18 s [vector] unfoldrN: OK
  5674. 269.18 s [vector] +++ OK, passed 100 tests.
  5675. 269.18 s [vector] unfoldrExactN: OK
  5676. 269.18 s [vector] +++ OK, passed 100 tests.
  5677. 269.18 s [vector] unfoldrM: OK
  5678. 269.18 s [vector] +++ OK, passed 100 tests.
  5679. 269.18 s [vector] unfoldrNM: OK
  5680. 269.18 s [vector] +++ OK, passed 100 tests.
  5681. 269.20 s [vector] unfoldrExactNM: OK (0.02s)
  5682. 269.20 s [vector] +++ OK, passed 100 tests.
  5683. 269.20 s [vector] constructN: OK
  5684. 269.20 s [vector] +++ OK, passed 100 tests.
  5685. 269.20 s [vector] constructrN: OK
  5686. 269.20 s [vector] +++ OK, passed 100 tests.
  5687. 269.20 s [vector] cons: OK
  5688. 269.20 s [vector] +++ OK, passed 100 tests.
  5689. 269.20 s [vector] snoc: OK
  5690. 269.21 s [vector] +++ OK, passed 100 tests.
  5691. 269.21 s [vector] append: OK
  5692. 269.22 s [vector] +++ OK, passed 100 tests.
  5693. 269.22 s [vector] concat: OK (0.01s)
  5694. 269.22 s [vector] +++ OK, passed 100 tests.
  5695. 269.22 s [vector] force: OK
  5696. 269.22 s [vector] +++ OK, passed 100 tests.
  5697. 269.22 s [vector] upd: OK
  5698. 269.22 s [vector] +++ OK, passed 100 tests.
  5699. 269.23 s [vector] accum: OK
  5700. 269.23 s [vector] +++ OK, passed 100 tests.
  5701. 269.23 s [vector] reverse: OK
  5702. 269.23 s [vector] +++ OK, passed 100 tests.
  5703. 269.23 s [vector] backpermute: OK
  5704. 269.23 s [vector] +++ OK, passed 100 tests.
  5705. 269.23 s [vector] map: OK
  5706. 269.23 s [vector] +++ OK, passed 100 tests.
  5707. 269.23 s [vector] imap: OK
  5708. 269.23 s [vector] +++ OK, passed 100 tests.
  5709. 269.23 s [vector] concatMap: OK
  5710. 269.23 s [vector] +++ OK, passed 100 tests.
  5711. 269.24 s [vector] mapM: OK
  5712. 269.24 s [vector] +++ OK, passed 100 tests.
  5713. 269.25 s [vector] mapM_: OK (0.01s)
  5714. 269.26 s [vector] +++ OK, passed 100 tests.
  5715. 269.26 s [vector] forM: OK
  5716. 269.26 s [vector] +++ OK, passed 100 tests.
  5717. 269.26 s [vector] forM_: OK
  5718. 269.26 s [vector] +++ OK, passed 100 tests.
  5719. 269.26 s [vector] imapM: OK
  5720. 269.26 s [vector] +++ OK, passed 100 tests.
  5721. 269.28 s [vector] imapM_: OK (0.02s)
  5722. 269.28 s [vector] +++ OK, passed 100 tests.
  5723. 269.28 s [vector] zipWith: OK
  5724. 269.28 s [vector] +++ OK, passed 100 tests.
  5725. 269.28 s [vector] zipWith3: OK
  5726. 269.28 s [vector] +++ OK, passed 100 tests.
  5727. 269.28 s [vector] izipWith: OK
  5728. 269.28 s [vector] +++ OK, passed 100 tests.
  5729. 269.29 s [vector] izipWith3: OK
  5730. 269.29 s [vector] +++ OK, passed 100 tests.
  5731. 269.30 s [vector] izipWithM: OK
  5732. 269.30 s [vector] +++ OK, passed 100 tests.
  5733. 269.31 s [vector] izipWithM_: OK (0.01s)
  5734. 269.31 s [vector] +++ OK, passed 100 tests.
  5735. 269.31 s [vector] zipWithM: OK
  5736. 269.32 s [vector] +++ OK, passed 100 tests.
  5737. 269.32 s [vector] zipWithM_: OK (0.01s)
  5738. 269.32 s [vector] +++ OK, passed 100 tests.
  5739. 269.32 s [vector] filter: OK
  5740. 269.32 s [vector] +++ OK, passed 100 tests.
  5741. 269.32 s [vector] ifilter: OK
  5742. 269.32 s [vector] +++ OK, passed 100 tests.
  5743. 269.35 s [vector] filterM: OK (0.03s)
  5744. 269.35 s [vector] +++ OK, passed 100 tests.
  5745. 269.35 s [vector] uniq: OK
  5746. 269.36 s [vector] +++ OK, passed 100 tests.
  5747. 269.36 s [vector] mapMaybe: OK
  5748. 269.36 s [vector] +++ OK, passed 100 tests.
  5749. 269.36 s [vector] imapMaybe: OK
  5750. 269.36 s [vector] +++ OK, passed 100 tests.
  5751. 269.36 s [vector] takeWhile: OK
  5752. 269.36 s [vector] +++ OK, passed 100 tests.
  5753. 269.36 s [vector] dropWhile: OK
  5754. 269.36 s [vector] +++ OK, passed 100 tests.
  5755. 269.36 s [vector] partition: OK
  5756. 269.36 s [vector] +++ OK, passed 100 tests.
  5757. 269.36 s [vector] partitionWith: OK
  5758. 269.36 s [vector] +++ OK, passed 100 tests.
  5759. 269.36 s [vector] span: OK
  5760. 269.36 s [vector] +++ OK, passed 100 tests.
  5761. 269.36 s [vector] break: OK
  5762. 269.36 s [vector] +++ OK, passed 100 tests.
  5763. 269.36 s [vector] spanR: OK
  5764. 269.36 s [vector] +++ OK, passed 100 tests.
  5765. 269.37 s [vector] breakR: OK
  5766. 269.37 s [vector] +++ OK, passed 100 tests.
  5767. 269.37 s [vector] groupBy: OK
  5768. 269.37 s [vector] +++ OK, passed 100 tests.
  5769. 269.37 s [vector] elem: OK
  5770. 269.37 s [vector] +++ OK, passed 100 tests.
  5771. 269.37 s [vector] notElem: OK
  5772. 269.37 s [vector] +++ OK, passed 100 tests.
  5773. 269.37 s [vector] find: OK
  5774. 269.37 s [vector] +++ OK, passed 100 tests.
  5775. 269.37 s [vector] findIndex: OK
  5776. 269.37 s [vector] +++ OK, passed 100 tests.
  5777. 269.37 s [vector] findIndexR: OK
  5778. 269.37 s [vector] +++ OK, passed 100 tests.
  5779. 269.37 s [vector] findIndices: OK
  5780. 269.37 s [vector] +++ OK, passed 100 tests.
  5781. 269.37 s [vector] elemIndex: OK
  5782. 269.37 s [vector] +++ OK, passed 100 tests.
  5783. 269.37 s [vector] elemIndices: OK
  5784. 269.37 s [vector] +++ OK, passed 100 tests.
  5785. 269.38 s [vector] foldl: OK
  5786. 269.38 s [vector] +++ OK, passed 100 tests.
  5787. 269.38 s [vector] foldl1: OK
  5788. 269.38 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5789. 269.38 s [vector] foldl': OK
  5790. 269.38 s [vector] +++ OK, passed 100 tests.
  5791. 269.38 s [vector] foldl1': OK
  5792. 269.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5793. 269.38 s [vector] foldr: OK
  5794. 269.38 s [vector] +++ OK, passed 100 tests.
  5795. 269.38 s [vector] foldr1: OK
  5796. 269.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5797. 269.38 s [vector] foldr': OK
  5798. 269.38 s [vector] +++ OK, passed 100 tests.
  5799. 269.38 s [vector] foldr1': OK
  5800. 269.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5801. 269.39 s [vector] ifoldl: OK
  5802. 269.39 s [vector] +++ OK, passed 100 tests.
  5803. 269.39 s [vector] ifoldl': OK
  5804. 269.40 s [vector] +++ OK, passed 100 tests.
  5805. 269.40 s [vector] ifoldr: OK
  5806. 269.40 s [vector] +++ OK, passed 100 tests.
  5807. 269.40 s [vector] ifoldr': OK
  5808. 269.40 s [vector] +++ OK, passed 100 tests.
  5809. 269.40 s [vector] ifoldM: OK
  5810. 269.40 s [vector] +++ OK, passed 100 tests.
  5811. 269.40 s [vector] ifoldM': OK
  5812. 269.40 s [vector] +++ OK, passed 100 tests.
  5813. 269.42 s [vector] ifoldM_: OK (0.01s)
  5814. 269.42 s [vector] +++ OK, passed 100 tests.
  5815. 269.42 s [vector] ifoldM'_: OK (0.01s)
  5816. 269.43 s [vector] +++ OK, passed 100 tests.
  5817. 269.43 s [vector] all: OK
  5818. 269.43 s [vector] +++ OK, passed 100 tests.
  5819. 269.43 s [vector] any: OK
  5820. 269.43 s [vector] +++ OK, passed 100 tests.
  5821. 269.43 s [vector] prescanl: OK
  5822. 269.43 s [vector] +++ OK, passed 100 tests.
  5823. 269.44 s [vector] prescanl': OK
  5824. 269.44 s [vector] +++ OK, passed 100 tests.
  5825. 269.44 s [vector] postscanl: OK
  5826. 269.44 s [vector] +++ OK, passed 100 tests.
  5827. 269.44 s [vector] postscanl': OK
  5828. 269.44 s [vector] +++ OK, passed 100 tests.
  5829. 269.44 s [vector] scanl: OK
  5830. 269.44 s [vector] +++ OK, passed 100 tests.
  5831. 269.44 s [vector] scanl': OK
  5832. 269.45 s [vector] +++ OK, passed 100 tests.
  5833. 269.45 s [vector] scanl1: OK
  5834. 269.45 s [vector] +++ OK, passed 100 tests.
  5835. 269.45 s [vector] scanl1': OK
  5836. 269.45 s [vector] +++ OK, passed 100 tests.
  5837. 269.45 s [vector] iscanl: OK
  5838. 269.45 s [vector] +++ OK, passed 100 tests.
  5839. 269.45 s [vector] iscanl': OK
  5840. 269.45 s [vector] +++ OK, passed 100 tests.
  5841. 269.45 s [vector] prescanr: OK
  5842. 269.45 s [vector] +++ OK, passed 100 tests.
  5843. 269.46 s [vector] prescanr': OK
  5844. 269.46 s [vector] +++ OK, passed 100 tests.
  5845. 269.46 s [vector] postscanr: OK
  5846. 269.46 s [vector] +++ OK, passed 100 tests.
  5847. 269.46 s [vector] postscanr': OK
  5848. 269.46 s [vector] +++ OK, passed 100 tests.
  5849. 269.46 s [vector] scanr: OK
  5850. 269.46 s [vector] +++ OK, passed 100 tests.
  5851. 269.46 s [vector] scanr': OK
  5852. 269.46 s [vector] +++ OK, passed 100 tests.
  5853. 269.47 s [vector] scanr1: OK
  5854. 269.47 s [vector] +++ OK, passed 100 tests.
  5855. 269.47 s [vector] scanr1': OK
  5856. 269.47 s [vector] +++ OK, passed 100 tests.
  5857. 269.47 s [vector] iscanr: OK
  5858. 269.48 s [vector] +++ OK, passed 100 tests.
  5859. 269.48 s [vector] iscanr': OK
  5860. 269.48 s [vector] +++ OK, passed 100 tests.
  5861. 269.48 s [vector] mut_read: OK
  5862. 269.48 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5863. 269.48 s [vector] mut_write: OK
  5864. 269.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5865. 269.48 s [vector] mut_modify: OK
  5866. 269.48 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5867. 269.48 s [vector] mut_generate: OK
  5868. 269.48 s [vector] +++ OK, passed 100 tests.
  5869. 269.50 s [vector] mut_generateM: OK
  5870. 269.50 s [vector] +++ OK, passed 100 tests.
  5871. 269.50 s [vector] mut_mapM_: OK
  5872. 269.50 s [vector] +++ OK, passed 100 tests.
  5873. 269.52 s [vector] mut_imapM_: OK
  5874. 269.52 s [vector] +++ OK, passed 100 tests.
  5875. 269.52 s [vector] mut_forM_: OK (0.01s)
  5876. 269.52 s [vector] +++ OK, passed 100 tests.
  5877. 269.53 s [vector] mut_iforM_: OK (0.01s)
  5878. 269.53 s [vector] +++ OK, passed 100 tests.
  5879. 269.53 s [vector] mut_foldr: OK
  5880. 269.53 s [vector] +++ OK, passed 100 tests.
  5881. 269.54 s [vector] mut_foldr': OK
  5882. 269.54 s [vector] +++ OK, passed 100 tests.
  5883. 269.54 s [vector] mut_foldl: OK
  5884. 269.54 s [vector] +++ OK, passed 100 tests.
  5885. 269.54 s [vector] mut_foldl': OK
  5886. 269.54 s [vector] +++ OK, passed 100 tests.
  5887. 269.54 s [vector] mut_ifoldr: OK
  5888. 269.54 s [vector] +++ OK, passed 100 tests.
  5889. 269.54 s [vector] mut_ifoldr': OK
  5890. 269.54 s [vector] +++ OK, passed 100 tests.
  5891. 269.54 s [vector] mut_ifoldl: OK
  5892. 269.55 s [vector] +++ OK, passed 100 tests.
  5893. 269.55 s [vector] mut_ifoldl': OK
  5894. 269.55 s [vector] +++ OK, passed 100 tests.
  5895. 269.55 s [vector] mut_foldM: OK
  5896. 269.55 s [vector] +++ OK, passed 100 tests.
  5897. 269.55 s [vector] mut_foldM': OK
  5898. 269.56 s [vector] +++ OK, passed 100 tests.
  5899. 269.56 s [vector] mut_foldrM: OK
  5900. 269.56 s [vector] +++ OK, passed 100 tests.
  5901. 269.56 s [vector] mut_foldrM': OK
  5902. 269.56 s [vector] +++ OK, passed 100 tests.
  5903. 269.56 s [vector] mut_ifoldM: OK
  5904. 269.56 s [vector] +++ OK, passed 100 tests.
  5905. 269.57 s [vector] mut_ifoldM': OK
  5906. 269.57 s [vector] +++ OK, passed 100 tests.
  5907. 269.57 s [vector] mut_ifoldrM: OK
  5908. 269.57 s [vector] +++ OK, passed 100 tests.
  5909. 269.57 s [vector] mut_ifoldrM': OK
  5910. 269.57 s [vector] +++ OK, passed 100 tests.
  5911. 269.57 s [vector] compare: OK
  5912. 269.57 s [vector] +++ OK, passed 100 tests.
  5913. 269.57 s [vector] maximum: OK
  5914. 269.57 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5915. 269.57 s [vector] minimum: OK
  5916. 269.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5917. 269.57 s [vector] minIndex: OK
  5918. 269.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5919. 269.57 s [vector] maxIndex: OK
  5920. 269.57 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5921. 269.57 s [vector] maximumBy: OK
  5922. 269.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5923. 269.57 s [vector] minimumBy: OK
  5924. 269.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5925. 269.57 s [vector] maximumOn: OK
  5926. 269.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5927. 269.57 s [vector] minimumOn: OK
  5928. 269.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5929. 269.57 s [vector] maxIndexBy: OK
  5930. 269.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5931. 269.57 s [vector] minIndexBy: OK
  5932. 269.57 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5933. 269.57 s [vector] ListFirstMaxIndexWins: OK
  5934. 269.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5935. 269.57 s [vector] FalseListFirstMaxIndexWins: OK
  5936. 269.58 s [vector] +++ OK, failed as expected. (after 1 test):
  5937. 269.58 s [vector] Exception:
  5938. 269.58 s [vector] Prelude.foldr1: empty list
  5939. 269.58 s [vector] CallStack (from HasCallStack):
  5940. 269.58 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5941. 269.58 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5942. 269.58 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5943. 269.58 s [vector] []
  5944. 269.58 s [vector] zip: OK
  5945. 269.58 s [vector] +++ OK, passed 100 tests.
  5946. 269.58 s [vector] zip3: OK
  5947. 269.58 s [vector] +++ OK, passed 100 tests.
  5948. 269.58 s [vector] unzip: OK
  5949. 269.58 s [vector] +++ OK, passed 100 tests.
  5950. 269.58 s [vector] unzip3: OK
  5951. 269.58 s [vector] +++ OK, passed 100 tests.
  5952. 269.59 s [vector] indexed: OK
  5953. 269.59 s [vector] +++ OK, passed 100 tests.
  5954. 269.59 s [vector] update: OK
  5955. 269.59 s [vector] +++ OK, passed 100 tests.
  5956. 269.59 s [vector] mempty: OK
  5957. 269.59 s [vector] +++ OK, passed 100 tests.
  5958. 269.60 s [vector] mappend: OK
  5959. 269.60 s [vector] +++ OK, passed 100 tests.
  5960. 269.60 s [vector] mconcat: OK (0.01s)
  5961. 269.60 s [vector] +++ OK, passed 100 tests.
  5962. 269.60 s [vector] glength: OK
  5963. 269.60 s [vector] +++ OK, passed 100 tests.
  5964. 269.60 s [vector] and: OK
  5965. 269.60 s [vector] +++ OK, passed 100 tests.
  5966. 269.60 s [vector] or: OK
  5967. 269.60 s [vector] +++ OK, passed 100 tests.
  5968. 269.60 s [vector] (Int)
  5969. 269.60 s [vector] fromList.toList == id: OK
  5970. 269.60 s [vector] +++ OK, passed 100 tests.
  5971. 269.60 s [vector] toList.fromList == id: OK
  5972. 269.60 s [vector] +++ OK, passed 100 tests.
  5973. 269.60 s [vector] unstream.stream == id: OK
  5974. 269.61 s [vector] +++ OK, passed 100 tests.
  5975. 269.61 s [vector] stream.unstream == id: OK
  5976. 269.61 s [vector] +++ OK, passed 100 tests.
  5977. 269.61 s [vector] eq: OK
  5978. 269.61 s [vector] +++ OK, passed 100 tests.
  5979. 269.61 s [vector] length: OK
  5980. 269.61 s [vector] +++ OK, passed 100 tests.
  5981. 269.61 s [vector] null: OK
  5982. 269.61 s [vector] +++ OK, passed 100 tests.
  5983. 269.61 s [vector] index: OK
  5984. 269.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5985. 269.61 s [vector] safeIndex: OK
  5986. 269.61 s [vector] +++ OK, passed 100 tests.
  5987. 269.61 s [vector] head: OK
  5988. 269.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5989. 269.61 s [vector] last: OK
  5990. 269.61 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5991. 269.61 s [vector] unsafeIndex: OK
  5992. 269.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5993. 269.61 s [vector] unsafeHead: OK
  5994. 269.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5995. 269.61 s [vector] unsafeLast: OK
  5996. 269.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5997. 269.61 s [vector] slice: OK
  5998. 269.61 s [vector] +++ OK, passed 100 tests.
  5999. 269.61 s [vector] init: OK
  6000. 269.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6001. 269.61 s [vector] tail: OK
  6002. 269.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6003. 269.61 s [vector] take: OK
  6004. 269.61 s [vector] +++ OK, passed 100 tests.
  6005. 269.62 s [vector] drop: OK
  6006. 269.62 s [vector] +++ OK, passed 100 tests.
  6007. 269.62 s [vector] splitAt: OK
  6008. 269.62 s [vector] +++ OK, passed 100 tests.
  6009. 269.62 s [vector] empty: OK
  6010. 269.62 s [vector] +++ OK, passed 100 tests.
  6011. 269.62 s [vector] singleton: OK
  6012. 269.62 s [vector] +++ OK, passed 100 tests.
  6013. 269.62 s [vector] replicate: OK
  6014. 269.62 s [vector] +++ OK, passed 100 tests.
  6015. 269.62 s [vector] generate: OK
  6016. 269.62 s [vector] +++ OK, passed 100 tests.
  6017. 269.62 s [vector] iterateN: OK
  6018. 269.62 s [vector] +++ OK, passed 100 tests.
  6019. 269.64 s [vector] iterateNM: OK (0.01s)
  6020. 269.64 s [vector] +++ OK, passed 100 tests.
  6021. 269.65 s [vector] generateM: OK (0.02s)
  6022. 269.65 s [vector] +++ OK, passed 100 tests.
  6023. 269.65 s [vector] replicateM: OK
  6024. 269.65 s [vector] +++ OK, passed 100 tests.
  6025. 269.66 s [vector] create: OK
  6026. 269.66 s [vector] +++ OK, passed 100 tests.
  6027. 269.66 s [vector] createT: OK
  6028. 269.66 s [vector] +++ OK, passed 100 tests.
  6029. 269.66 s [vector] unfoldr: OK
  6030. 269.66 s [vector] +++ OK, passed 100 tests.
  6031. 269.66 s [vector] unfoldrN: OK
  6032. 269.66 s [vector] +++ OK, passed 100 tests.
  6033. 269.66 s [vector] unfoldrExactN: OK
  6034. 269.66 s [vector] +++ OK, passed 100 tests.
  6035. 269.66 s [vector] unfoldrM: OK
  6036. 269.66 s [vector] +++ OK, passed 100 tests.
  6037. 269.66 s [vector] unfoldrNM: OK
  6038. 269.66 s [vector] +++ OK, passed 100 tests.
  6039. 269.71 s [vector] unfoldrExactNM: OK (0.05s)
  6040. 269.71 s [vector] +++ OK, passed 100 tests.
  6041. 269.72 s [vector] constructN: OK
  6042. 269.72 s [vector] +++ OK, passed 100 tests.
  6043. 269.72 s [vector] constructrN: OK
  6044. 269.72 s [vector] +++ OK, passed 100 tests.
  6045. 269.72 s [vector] cons: OK
  6046. 269.72 s [vector] +++ OK, passed 100 tests.
  6047. 269.72 s [vector] snoc: OK
  6048. 269.72 s [vector] +++ OK, passed 100 tests.
  6049. 269.72 s [vector] append: OK
  6050. 269.72 s [vector] +++ OK, passed 100 tests.
  6051. 269.73 s [vector] concat: OK (0.02s)
  6052. 269.74 s [vector] +++ OK, passed 100 tests.
  6053. 269.74 s [vector] force: OK
  6054. 269.74 s [vector] +++ OK, passed 100 tests.
  6055. 269.74 s [vector] upd: OK
  6056. 269.74 s [vector] +++ OK, passed 100 tests.
  6057. 269.74 s [vector] accum: OK
  6058. 269.74 s [vector] +++ OK, passed 100 tests.
  6059. 269.75 s [vector] reverse: OK
  6060. 269.75 s [vector] +++ OK, passed 100 tests.
  6061. 269.75 s [vector] backpermute: OK
  6062. 269.75 s [vector] +++ OK, passed 100 tests.
  6063. 269.75 s [vector] map: OK
  6064. 269.75 s [vector] +++ OK, passed 100 tests.
  6065. 269.75 s [vector] imap: OK
  6066. 269.75 s [vector] +++ OK, passed 100 tests.
  6067. 269.75 s [vector] concatMap: OK
  6068. 269.75 s [vector] +++ OK, passed 100 tests.
  6069. 269.76 s [vector] mapM: OK
  6070. 269.76 s [vector] +++ OK, passed 100 tests.
  6071. 269.77 s [vector] mapM_: OK (0.02s)
  6072. 269.78 s [vector] +++ OK, passed 100 tests.
  6073. 269.78 s [vector] forM: OK
  6074. 269.78 s [vector] +++ OK, passed 100 tests.
  6075. 269.79 s [vector] forM_: OK (0.02s)
  6076. 269.80 s [vector] +++ OK, passed 100 tests.
  6077. 269.80 s [vector] imapM: OK
  6078. 269.80 s [vector] +++ OK, passed 100 tests.
  6079. 269.81 s [vector] imapM_: OK (0.02s)
  6080. 269.81 s [vector] +++ OK, passed 100 tests.
  6081. 269.81 s [vector] zipWith: OK
  6082. 269.81 s [vector] +++ OK, passed 100 tests.
  6083. 269.81 s [vector] zipWith3: OK
  6084. 269.81 s [vector] +++ OK, passed 100 tests.
  6085. 269.82 s [vector] izipWith: OK
  6086. 269.82 s [vector] +++ OK, passed 100 tests.
  6087. 269.82 s [vector] izipWith3: OK
  6088. 269.82 s [vector] +++ OK, passed 100 tests.
  6089. 269.84 s [vector] izipWithM: OK
  6090. 269.84 s [vector] +++ OK, passed 100 tests.
  6091. 269.84 s [vector] izipWithM_: OK (0.01s)
  6092. 269.84 s [vector] +++ OK, passed 100 tests.
  6093. 269.84 s [vector] zipWithM: OK
  6094. 269.84 s [vector] +++ OK, passed 100 tests.
  6095. 269.85 s [vector] zipWithM_: OK (0.01s)
  6096. 269.85 s [vector] +++ OK, passed 100 tests.
  6097. 269.86 s [vector] filter: OK
  6098. 269.86 s [vector] +++ OK, passed 100 tests.
  6099. 269.86 s [vector] ifilter: OK
  6100. 269.86 s [vector] +++ OK, passed 100 tests.
  6101. 269.88 s [vector] filterM: OK (0.02s)
  6102. 269.88 s [vector] +++ OK, passed 100 tests.
  6103. 269.88 s [vector] uniq: OK
  6104. 269.88 s [vector] +++ OK, passed 100 tests.
  6105. 269.88 s [vector] mapMaybe: OK
  6106. 269.88 s [vector] +++ OK, passed 100 tests.
  6107. 269.88 s [vector] imapMaybe: OK
  6108. 269.88 s [vector] +++ OK, passed 100 tests.
  6109. 269.88 s [vector] takeWhile: OK
  6110. 269.88 s [vector] +++ OK, passed 100 tests.
  6111. 269.88 s [vector] dropWhile: OK
  6112. 269.88 s [vector] +++ OK, passed 100 tests.
  6113. 269.89 s [vector] partition: OK
  6114. 269.89 s [vector] +++ OK, passed 100 tests.
  6115. 269.89 s [vector] partitionWith: OK
  6116. 269.89 s [vector] +++ OK, passed 100 tests.
  6117. 269.89 s [vector] span: OK
  6118. 269.89 s [vector] +++ OK, passed 100 tests.
  6119. 269.89 s [vector] break: OK
  6120. 269.89 s [vector] +++ OK, passed 100 tests.
  6121. 269.89 s [vector] spanR: OK
  6122. 269.89 s [vector] +++ OK, passed 100 tests.
  6123. 269.89 s [vector] breakR: OK
  6124. 269.89 s [vector] +++ OK, passed 100 tests.
  6125. 269.89 s [vector] groupBy: OK
  6126. 269.89 s [vector] +++ OK, passed 100 tests.
  6127. 269.89 s [vector] elem: OK
  6128. 269.89 s [vector] +++ OK, passed 100 tests.
  6129. 269.90 s [vector] notElem: OK
  6130. 269.90 s [vector] +++ OK, passed 100 tests.
  6131. 269.90 s [vector] find: OK
  6132. 269.90 s [vector] +++ OK, passed 100 tests.
  6133. 269.90 s [vector] findIndex: OK
  6134. 269.90 s [vector] +++ OK, passed 100 tests.
  6135. 269.90 s [vector] findIndexR: OK
  6136. 269.90 s [vector] +++ OK, passed 100 tests.
  6137. 269.90 s [vector] findIndices: OK
  6138. 269.90 s [vector] +++ OK, passed 100 tests.
  6139. 269.90 s [vector] elemIndex: OK
  6140. 269.90 s [vector] +++ OK, passed 100 tests.
  6141. 269.90 s [vector] elemIndices: OK
  6142. 269.90 s [vector] +++ OK, passed 100 tests.
  6143. 269.90 s [vector] foldl: OK
  6144. 269.90 s [vector] +++ OK, passed 100 tests.
  6145. 269.90 s [vector] foldl1: OK
  6146. 269.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6147. 269.91 s [vector] foldl': OK
  6148. 269.91 s [vector] +++ OK, passed 100 tests.
  6149. 269.92 s [vector] foldl1': OK
  6150. 269.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6151. 269.92 s [vector] foldr: OK
  6152. 269.92 s [vector] +++ OK, passed 100 tests.
  6153. 269.92 s [vector] foldr1: OK
  6154. 269.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6155. 269.92 s [vector] foldr': OK
  6156. 269.92 s [vector] +++ OK, passed 100 tests.
  6157. 269.92 s [vector] foldr1': OK
  6158. 269.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6159. 269.92 s [vector] ifoldl: OK
  6160. 269.92 s [vector] +++ OK, passed 100 tests.
  6161. 269.92 s [vector] ifoldl': OK
  6162. 269.93 s [vector] +++ OK, passed 100 tests.
  6163. 269.93 s [vector] ifoldr: OK
  6164. 269.93 s [vector] +++ OK, passed 100 tests.
  6165. 269.93 s [vector] ifoldr': OK
  6166. 269.93 s [vector] +++ OK, passed 100 tests.
  6167. 269.93 s [vector] ifoldM: OK
  6168. 269.94 s [vector] +++ OK, passed 100 tests.
  6169. 269.94 s [vector] ifoldM': OK
  6170. 269.94 s [vector] +++ OK, passed 100 tests.
  6171. 269.96 s [vector] ifoldM_: OK (0.02s)
  6172. 269.96 s [vector] +++ OK, passed 100 tests.
  6173. 269.98 s [vector] ifoldM'_: OK (0.02s)
  6174. 269.98 s [vector] +++ OK, passed 100 tests.
  6175. 269.98 s [vector] all: OK
  6176. 269.98 s [vector] +++ OK, passed 100 tests.
  6177. 269.98 s [vector] any: OK
  6178. 269.98 s [vector] +++ OK, passed 100 tests.
  6179. 269.98 s [vector] prescanl: OK
  6180. 269.98 s [vector] +++ OK, passed 100 tests.
  6181. 269.98 s [vector] prescanl': OK
  6182. 269.99 s [vector] +++ OK, passed 100 tests.
  6183. 269.99 s [vector] postscanl: OK
  6184. 269.99 s [vector] +++ OK, passed 100 tests.
  6185. 270.00 s [vector] postscanl': OK
  6186. 270.00 s [vector] +++ OK, passed 100 tests.
  6187. 270.00 s [vector] scanl: OK
  6188. 270.00 s [vector] +++ OK, passed 100 tests.
  6189. 270.00 s [vector] scanl': OK
  6190. 270.00 s [vector] +++ OK, passed 100 tests.
  6191. 270.01 s [vector] scanl1: OK
  6192. 270.01 s [vector] +++ OK, passed 100 tests.
  6193. 270.01 s [vector] scanl1': OK
  6194. 270.01 s [vector] +++ OK, passed 100 tests.
  6195. 270.01 s [vector] iscanl: OK
  6196. 270.01 s [vector] +++ OK, passed 100 tests.
  6197. 270.01 s [vector] iscanl': OK
  6198. 270.02 s [vector] +++ OK, passed 100 tests.
  6199. 270.02 s [vector] prescanr: OK
  6200. 270.02 s [vector] +++ OK, passed 100 tests.
  6201. 270.02 s [vector] prescanr': OK
  6202. 270.02 s [vector] +++ OK, passed 100 tests.
  6203. 270.02 s [vector] postscanr: OK
  6204. 270.02 s [vector] +++ OK, passed 100 tests.
  6205. 270.03 s [vector] postscanr': OK
  6206. 270.03 s [vector] +++ OK, passed 100 tests.
  6207. 270.03 s [vector] scanr: OK
  6208. 270.03 s [vector] +++ OK, passed 100 tests.
  6209. 270.03 s [vector] scanr': OK
  6210. 270.03 s [vector] +++ OK, passed 100 tests.
  6211. 270.04 s [vector] scanr1: OK
  6212. 270.04 s [vector] +++ OK, passed 100 tests.
  6213. 270.04 s [vector] scanr1': OK
  6214. 270.04 s [vector] +++ OK, passed 100 tests.
  6215. 270.04 s [vector] iscanr: OK
  6216. 270.04 s [vector] +++ OK, passed 100 tests.
  6217. 270.04 s [vector] iscanr': OK
  6218. 270.04 s [vector] +++ OK, passed 100 tests.
  6219. 270.04 s [vector] mut_read: OK
  6220. 270.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6221. 270.04 s [vector] mut_write: OK
  6222. 270.05 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6223. 270.05 s [vector] mut_modify: OK
  6224. 270.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6225. 270.05 s [vector] mut_generate: OK
  6226. 270.06 s [vector] +++ OK, passed 100 tests.
  6227. 270.06 s [vector] mut_generateM: OK (0.01s)
  6228. 270.06 s [vector] +++ OK, passed 100 tests.
  6229. 270.08 s [vector] mut_mapM_: OK (0.02s)
  6230. 270.08 s [vector] +++ OK, passed 100 tests.
  6231. 270.10 s [vector] mut_imapM_: OK (0.02s)
  6232. 270.10 s [vector] +++ OK, passed 100 tests.
  6233. 270.12 s [vector] mut_forM_: OK (0.02s)
  6234. 270.12 s [vector] +++ OK, passed 100 tests.
  6235. 270.14 s [vector] mut_iforM_: OK (0.02s)
  6236. 270.14 s [vector] +++ OK, passed 100 tests.
  6237. 270.14 s [vector] mut_foldr: OK
  6238. 270.14 s [vector] +++ OK, passed 100 tests.
  6239. 270.14 s [vector] mut_foldr': OK
  6240. 270.14 s [vector] +++ OK, passed 100 tests.
  6241. 270.14 s [vector] mut_foldl: OK
  6242. 270.14 s [vector] +++ OK, passed 100 tests.
  6243. 270.15 s [vector] mut_foldl': OK
  6244. 270.15 s [vector] +++ OK, passed 100 tests.
  6245. 270.16 s [vector] mut_ifoldr: OK
  6246. 270.16 s [vector] +++ OK, passed 100 tests.
  6247. 270.16 s [vector] mut_ifoldr': OK
  6248. 270.16 s [vector] +++ OK, passed 100 tests.
  6249. 270.16 s [vector] mut_ifoldl: OK
  6250. 270.16 s [vector] +++ OK, passed 100 tests.
  6251. 270.16 s [vector] mut_ifoldl': OK
  6252. 270.16 s [vector] +++ OK, passed 100 tests.
  6253. 270.16 s [vector] mut_foldM: OK
  6254. 270.16 s [vector] +++ OK, passed 100 tests.
  6255. 270.17 s [vector] mut_foldM': OK
  6256. 270.17 s [vector] +++ OK, passed 100 tests.
  6257. 270.17 s [vector] mut_foldrM: OK
  6258. 270.17 s [vector] +++ OK, passed 100 tests.
  6259. 270.18 s [vector] mut_foldrM': OK
  6260. 270.18 s [vector] +++ OK, passed 100 tests.
  6261. 270.18 s [vector] mut_ifoldM: OK
  6262. 270.18 s [vector] +++ OK, passed 100 tests.
  6263. 270.18 s [vector] mut_ifoldM': OK
  6264. 270.18 s [vector] +++ OK, passed 100 tests.
  6265. 270.18 s [vector] mut_ifoldrM: OK
  6266. 270.18 s [vector] +++ OK, passed 100 tests.
  6267. 270.19 s [vector] mut_ifoldrM': OK
  6268. 270.19 s [vector] +++ OK, passed 100 tests.
  6269. 270.19 s [vector] compare: OK
  6270. 270.19 s [vector] +++ OK, passed 100 tests.
  6271. 270.19 s [vector] maximum: OK
  6272. 270.19 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6273. 270.19 s [vector] minimum: OK
  6274. 270.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6275. 270.19 s [vector] minIndex: OK
  6276. 270.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6277. 270.19 s [vector] maxIndex: OK
  6278. 270.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6279. 270.19 s [vector] maximumBy: OK
  6280. 270.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6281. 270.19 s [vector] minimumBy: OK
  6282. 270.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6283. 270.19 s [vector] maximumOn: OK
  6284. 270.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6285. 270.19 s [vector] minimumOn: OK
  6286. 270.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6287. 270.19 s [vector] maxIndexBy: OK
  6288. 270.19 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6289. 270.19 s [vector] minIndexBy: OK
  6290. 270.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6291. 270.20 s [vector] ListFirstMaxIndexWins: OK
  6292. 270.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6293. 270.20 s [vector] FalseListFirstMaxIndexWins: OK
  6294. 270.20 s [vector] +++ OK, failed as expected. (after 1 test):
  6295. 270.20 s [vector] Exception:
  6296. 270.20 s [vector] Prelude.foldr1: empty list
  6297. 270.20 s [vector] CallStack (from HasCallStack):
  6298. 270.20 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6299. 270.20 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6300. 270.20 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6301. 270.20 s [vector] []
  6302. 270.20 s [vector] zip: OK
  6303. 270.20 s [vector] +++ OK, passed 100 tests.
  6304. 270.20 s [vector] zip3: OK
  6305. 270.20 s [vector] +++ OK, passed 100 tests.
  6306. 270.20 s [vector] unzip: OK
  6307. 270.20 s [vector] +++ OK, passed 100 tests.
  6308. 270.20 s [vector] unzip3: OK
  6309. 270.20 s [vector] +++ OK, passed 100 tests.
  6310. 270.21 s [vector] indexed: OK
  6311. 270.21 s [vector] +++ OK, passed 100 tests.
  6312. 270.21 s [vector] update: OK
  6313. 270.21 s [vector] +++ OK, passed 100 tests.
  6314. 270.22 s [vector] mempty: OK
  6315. 270.22 s [vector] +++ OK, passed 100 tests.
  6316. 270.22 s [vector] mappend: OK
  6317. 270.22 s [vector] +++ OK, passed 100 tests.
  6318. 270.23 s [vector] mconcat: OK (0.01s)
  6319. 270.23 s [vector] +++ OK, passed 100 tests.
  6320. 270.23 s [vector] glength: OK
  6321. 270.23 s [vector] +++ OK, passed 100 tests.
  6322. 270.23 s [vector] sum: OK
  6323. 270.23 s [vector] +++ OK, passed 100 tests.
  6324. 270.23 s [vector] product: OK
  6325. 270.23 s [vector] +++ OK, passed 100 tests.
  6326. 270.23 s [vector] enumFromN: OK
  6327. 270.23 s [vector] +++ OK, passed 100 tests.
  6328. 270.23 s [vector] enumFromThenN: OK
  6329. 270.23 s [vector] +++ OK, passed 100 tests.
  6330. 270.23 s [vector] enumFromTo: OK
  6331. 270.23 s [vector] +++ OK, passed 100 tests.
  6332. 270.23 s [vector] enumFromThenTo: OK
  6333. 270.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6334. 270.23 s [vector] (Float)
  6335. 270.23 s [vector] fromList.toList == id: OK
  6336. 270.23 s [vector] +++ OK, passed 100 tests.
  6337. 270.23 s [vector] toList.fromList == id: OK
  6338. 270.23 s [vector] +++ OK, passed 100 tests.
  6339. 270.23 s [vector] unstream.stream == id: OK
  6340. 270.23 s [vector] +++ OK, passed 100 tests.
  6341. 270.23 s [vector] stream.unstream == id: OK
  6342. 270.23 s [vector] +++ OK, passed 100 tests.
  6343. 270.23 s [vector] eq: OK
  6344. 270.23 s [vector] +++ OK, passed 100 tests.
  6345. 270.23 s [vector] length: OK
  6346. 270.23 s [vector] +++ OK, passed 100 tests.
  6347. 270.24 s [vector] null: OK
  6348. 270.24 s [vector] +++ OK, passed 100 tests.
  6349. 270.24 s [vector] index: OK
  6350. 270.24 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6351. 270.24 s [vector] safeIndex: OK
  6352. 270.24 s [vector] +++ OK, passed 100 tests.
  6353. 270.24 s [vector] head: OK
  6354. 270.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6355. 270.24 s [vector] last: OK
  6356. 270.24 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6357. 270.24 s [vector] unsafeIndex: OK
  6358. 270.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6359. 270.24 s [vector] unsafeHead: OK
  6360. 270.24 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6361. 270.24 s [vector] unsafeLast: OK
  6362. 270.24 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6363. 270.24 s [vector] slice: OK
  6364. 270.24 s [vector] +++ OK, passed 100 tests.
  6365. 270.24 s [vector] init: OK
  6366. 270.24 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6367. 270.24 s [vector] tail: OK
  6368. 270.24 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6369. 270.24 s [vector] take: OK
  6370. 270.24 s [vector] +++ OK, passed 100 tests.
  6371. 270.25 s [vector] drop: OK
  6372. 270.25 s [vector] +++ OK, passed 100 tests.
  6373. 270.25 s [vector] splitAt: OK
  6374. 270.25 s [vector] +++ OK, passed 100 tests.
  6375. 270.25 s [vector] empty: OK
  6376. 270.25 s [vector] +++ OK, passed 100 tests.
  6377. 270.25 s [vector] singleton: OK
  6378. 270.25 s [vector] +++ OK, passed 100 tests.
  6379. 270.25 s [vector] replicate: OK
  6380. 270.25 s [vector] +++ OK, passed 100 tests.
  6381. 270.25 s [vector] generate: OK
  6382. 270.25 s [vector] +++ OK, passed 100 tests.
  6383. 270.25 s [vector] iterateN: OK
  6384. 270.25 s [vector] +++ OK, passed 100 tests.
  6385. 270.30 s [vector] iterateNM: OK (0.03s)
  6386. 270.30 s [vector] +++ OK, passed 100 tests.
  6387. 270.30 s [vector] generateM: OK (0.01s)
  6388. 270.30 s [vector] +++ OK, passed 100 tests.
  6389. 270.32 s [vector] replicateM: OK (0.02s)
  6390. 270.33 s [vector] +++ OK, passed 100 tests.
  6391. 270.33 s [vector] create: OK
  6392. 270.33 s [vector] +++ OK, passed 100 tests.
  6393. 270.33 s [vector] createT: OK
  6394. 270.33 s [vector] +++ OK, passed 100 tests.
  6395. 270.33 s [vector] unfoldr: OK
  6396. 270.33 s [vector] +++ OK, passed 100 tests.
  6397. 270.33 s [vector] unfoldrN: OK
  6398. 270.33 s [vector] +++ OK, passed 100 tests.
  6399. 270.33 s [vector] unfoldrExactN: OK
  6400. 270.33 s [vector] +++ OK, passed 100 tests.
  6401. 270.35 s [vector] unfoldrM: OK (0.01s)
  6402. 270.35 s [vector] +++ OK, passed 100 tests.
  6403. 270.35 s [vector] unfoldrNM: OK
  6404. 270.36 s [vector] +++ OK, passed 100 tests.
  6405. 270.38 s [vector] unfoldrExactNM: OK (0.02s)
  6406. 270.38 s [vector] +++ OK, passed 100 tests.
  6407. 270.38 s [vector] constructN: OK
  6408. 270.39 s [vector] +++ OK, passed 100 tests.
  6409. 270.39 s [vector] constructrN: OK
  6410. 270.39 s [vector] +++ OK, passed 100 tests.
  6411. 270.39 s [vector] cons: OK
  6412. 270.39 s [vector] +++ OK, passed 100 tests.
  6413. 270.39 s [vector] snoc: OK
  6414. 270.39 s [vector] +++ OK, passed 100 tests.
  6415. 270.40 s [vector] append: OK
  6416. 270.40 s [vector] +++ OK, passed 100 tests.
  6417. 270.41 s [vector] concat: OK (0.02s)
  6418. 270.41 s [vector] +++ OK, passed 100 tests.
  6419. 270.42 s [vector] force: OK
  6420. 270.42 s [vector] +++ OK, passed 100 tests.
  6421. 270.42 s [vector] upd: OK
  6422. 270.42 s [vector] +++ OK, passed 100 tests.
  6423. 270.42 s [vector] accum: OK (0.01s)
  6424. 270.42 s [vector] +++ OK, passed 100 tests.
  6425. 270.43 s [vector] reverse: OK
  6426. 270.43 s [vector] +++ OK, passed 100 tests.
  6427. 270.43 s [vector] backpermute: OK
  6428. 270.43 s [vector] +++ OK, passed 100 tests.
  6429. 270.44 s [vector] map: OK
  6430. 270.44 s [vector] +++ OK, passed 100 tests.
  6431. 270.44 s [vector] imap: OK
  6432. 270.44 s [vector] +++ OK, passed 100 tests.
  6433. 270.45 s [vector] concatMap: OK
  6434. 270.46 s [vector] +++ OK, passed 100 tests.
  6435. 270.46 s [vector] mapM: OK
  6436. 270.46 s [vector] +++ OK, passed 100 tests.
  6437. 270.49 s [vector] mapM_: OK (0.03s)
  6438. 270.50 s [vector] +++ OK, passed 100 tests.
  6439. 270.50 s [vector] forM: OK
  6440. 270.50 s [vector] +++ OK, passed 100 tests.
  6441. 270.52 s [vector] forM_: OK (0.03s)
  6442. 270.52 s [vector] +++ OK, passed 100 tests.
  6443. 270.54 s [vector] imapM: OK
  6444. 270.54 s [vector] +++ OK, passed 100 tests.
  6445. 270.56 s [vector] imapM_: OK (0.03s)
  6446. 270.56 s [vector] +++ OK, passed 100 tests.
  6447. 270.57 s [vector] zipWith: OK
  6448. 270.57 s [vector] +++ OK, passed 100 tests.
  6449. 270.57 s [vector] zipWith3: OK
  6450. 270.58 s [vector] +++ OK, passed 100 tests.
  6451. 270.58 s [vector] izipWith: OK
  6452. 270.58 s [vector] +++ OK, passed 100 tests.
  6453. 270.59 s [vector] izipWith3: OK
  6454. 270.59 s [vector] +++ OK, passed 100 tests.
  6455. 270.60 s [vector] izipWithM: OK
  6456. 270.60 s [vector] +++ OK, passed 100 tests.
  6457. 270.62 s [vector] izipWithM_: OK (0.03s)
  6458. 270.62 s [vector] +++ OK, passed 100 tests.
  6459. 270.63 s [vector] zipWithM: OK
  6460. 270.63 s [vector] +++ OK, passed 100 tests.
  6461. 270.65 s [vector] zipWithM_: OK
  6462. 270.66 s [vector] +++ OK, passed 100 tests.
  6463. 270.66 s [vector] filter: OK
  6464. 270.66 s [vector] +++ OK, passed 100 tests.
  6465. 270.66 s [vector] ifilter: OK
  6466. 270.66 s [vector] +++ OK, passed 100 tests.
  6467. 270.71 s [vector] filterM: OK (0.05s)
  6468. 270.72 s [vector] +++ OK, passed 100 tests.
  6469. 270.73 s [vector] uniq: OK
  6470. 270.73 s [vector] +++ OK, passed 100 tests.
  6471. 270.73 s [vector] mapMaybe: OK
  6472. 270.73 s [vector] +++ OK, passed 100 tests.
  6473. 270.73 s [vector] imapMaybe: OK
  6474. 270.74 s [vector] +++ OK, passed 100 tests.
  6475. 270.74 s [vector] takeWhile: OK
  6476. 270.74 s [vector] +++ OK, passed 100 tests.
  6477. 270.74 s [vector] dropWhile: OK
  6478. 270.74 s [vector] +++ OK, passed 100 tests.
  6479. 270.74 s [vector] partition: OK
  6480. 270.74 s [vector] +++ OK, passed 100 tests.
  6481. 270.74 s [vector] partitionWith: OK
  6482. 270.74 s [vector] +++ OK, passed 100 tests.
  6483. 270.74 s [vector] span: OK
  6484. 270.74 s [vector] +++ OK, passed 100 tests.
  6485. 270.75 s [vector] break: OK
  6486. 270.75 s [vector] +++ OK, passed 100 tests.
  6487. 270.75 s [vector] spanR: OK
  6488. 270.75 s [vector] +++ OK, passed 100 tests.
  6489. 270.75 s [vector] breakR: OK
  6490. 270.75 s [vector] +++ OK, passed 100 tests.
  6491. 270.75 s [vector] groupBy: OK
  6492. 270.75 s [vector] +++ OK, passed 100 tests.
  6493. 270.75 s [vector] elem: OK
  6494. 270.75 s [vector] +++ OK, passed 100 tests.
  6495. 270.75 s [vector] notElem: OK
  6496. 270.75 s [vector] +++ OK, passed 100 tests.
  6497. 270.75 s [vector] find: OK
  6498. 270.75 s [vector] +++ OK, passed 100 tests.
  6499. 270.75 s [vector] findIndex: OK
  6500. 270.76 s [vector] +++ OK, passed 100 tests.
  6501. 270.76 s [vector] findIndexR: OK
  6502. 270.76 s [vector] +++ OK, passed 100 tests.
  6503. 270.76 s [vector] findIndices: OK
  6504. 270.76 s [vector] +++ OK, passed 100 tests.
  6505. 270.76 s [vector] elemIndex: OK
  6506. 270.76 s [vector] +++ OK, passed 100 tests.
  6507. 270.76 s [vector] elemIndices: OK
  6508. 270.76 s [vector] +++ OK, passed 100 tests.
  6509. 270.77 s [vector] foldl: OK
  6510. 270.77 s [vector] +++ OK, passed 100 tests.
  6511. 270.78 s [vector] foldl1: OK
  6512. 270.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6513. 270.78 s [vector] foldl': OK
  6514. 270.78 s [vector] +++ OK, passed 100 tests.
  6515. 270.80 s [vector] foldl1': OK
  6516. 270.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6517. 270.80 s [vector] foldr: OK (0.01s)
  6518. 270.80 s [vector] +++ OK, passed 100 tests.
  6519. 270.80 s [vector] foldr1: OK
  6520. 270.81 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6521. 270.82 s [vector] foldr': OK
  6522. 270.83 s [vector] +++ OK, passed 100 tests.
  6523. 270.83 s [vector] foldr1': OK (0.01s)
  6524. 270.83 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6525. 270.83 s [vector] ifoldl: OK
  6526. 270.83 s [vector] +++ OK, passed 100 tests.
  6527. 270.84 s [vector] ifoldl': OK
  6528. 270.84 s [vector] +++ OK, passed 100 tests.
  6529. 270.86 s [vector] ifoldr: OK
  6530. 270.86 s [vector] +++ OK, passed 100 tests.
  6531. 270.87 s [vector] ifoldr': OK
  6532. 270.87 s [vector] +++ OK, passed 100 tests.
  6533. 270.87 s [vector] ifoldM: OK
  6534. 270.88 s [vector] +++ OK, passed 100 tests.
  6535. 270.88 s [vector] ifoldM': OK
  6536. 270.88 s [vector] +++ OK, passed 100 tests.
  6537. 270.92 s [vector] ifoldM_: OK (0.04s)
  6538. 270.92 s [vector] +++ OK, passed 100 tests.
  6539. 270.95 s [vector] ifoldM'_: OK (0.04s)
  6540. 270.95 s [vector] +++ OK, passed 100 tests.
  6541. 270.95 s [vector] all: OK
  6542. 270.95 s [vector] +++ OK, passed 100 tests.
  6543. 270.95 s [vector] any: OK
  6544. 270.95 s [vector] +++ OK, passed 100 tests.
  6545. 270.96 s [vector] prescanl: OK
  6546. 270.96 s [vector] +++ OK, passed 100 tests.
  6547. 270.97 s [vector] prescanl': OK
  6548. 270.97 s [vector] +++ OK, passed 100 tests.
  6549. 270.98 s [vector] postscanl: OK
  6550. 270.98 s [vector] +++ OK, passed 100 tests.
  6551. 270.99 s [vector] postscanl': OK
  6552. 270.99 s [vector] +++ OK, passed 100 tests.
  6553. 270.99 s [vector] scanl: OK
  6554. 271.00 s [vector] +++ OK, passed 100 tests.
  6555. 271.00 s [vector] scanl': OK
  6556. 271.00 s [vector] +++ OK, passed 100 tests.
  6557. 271.01 s [vector] scanl1: OK
  6558. 271.02 s [vector] +++ OK, passed 100 tests.
  6559. 271.02 s [vector] scanl1': OK
  6560. 271.03 s [vector] +++ OK, passed 100 tests.
  6561. 271.04 s [vector] iscanl: OK
  6562. 271.04 s [vector] +++ OK, passed 100 tests.
  6563. 271.04 s [vector] iscanl': OK
  6564. 271.04 s [vector] +++ OK, passed 100 tests.
  6565. 271.04 s [vector] prescanr: OK
  6566. 271.04 s [vector] +++ OK, passed 100 tests.
  6567. 271.04 s [vector] prescanr': OK
  6568. 271.04 s [vector] +++ OK, passed 100 tests.
  6569. 271.06 s [vector] postscanr: OK
  6570. 271.06 s [vector] +++ OK, passed 100 tests.
  6571. 271.06 s [vector] postscanr': OK
  6572. 271.06 s [vector] +++ OK, passed 100 tests.
  6573. 271.07 s [vector] scanr: OK
  6574. 271.07 s [vector] +++ OK, passed 100 tests.
  6575. 271.08 s [vector] scanr': OK
  6576. 271.45 s [vector] +++ OK, passed 100 tests.
  6577. 271.45 s [vector] scanr1: OK
  6578. 271.45 s [vector] +++ OK, passed 100 tests.
  6579. 271.45 s [vector] scanr1': OK
  6580. 271.45 s [vector] +++ OK, passed 100 tests.
  6581. 271.45 s [vector] iscanr: OK (0.01s)
  6582. 271.45 s [vector] +++ OK, passed 100 tests.
  6583. 271.45 s [vector] iscanr': OK
  6584. 271.45 s [vector] +++ OK, passed 100 tests.
  6585. 271.45 s [vector] mut_read: OK
  6586. 271.45 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6587. 271.45 s [vector] mut_write: OK
  6588. 271.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6589. 271.45 s [vector] mut_modify: OK
  6590. 271.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6591. 271.45 s [vector] mut_generate: OK
  6592. 271.45 s [vector] +++ OK, passed 100 tests.
  6593. 271.45 s [vector] mut_generateM: OK (0.02s)
  6594. 271.45 s [vector] +++ OK, passed 100 tests.
  6595. 271.45 s [vector] mut_mapM_: OK (0.03s)
  6596. 271.45 s [vector] +++ OK, passed 100 tests.
  6597. 271.45 s [vector] mut_imapM_: OK (0.03s)
  6598. 271.45 s [vector] +++ OK, passed 100 tests.
  6599. 271.45 s [vector] mut_forM_: OK (0.03s)
  6600. 271.45 s [vector] +++ OK, passed 100 tests.
  6601. 271.45 s [vector] mut_iforM_: OK (0.03s)
  6602. 271.45 s [vector] +++ OK, passed 100 tests.
  6603. 271.45 s [vector] mut_foldr: OK
  6604. 271.45 s [vector] +++ OK, passed 100 tests.
  6605. 271.45 s [vector] mut_foldr': OK
  6606. 271.45 s [vector] +++ OK, passed 100 tests.
  6607. 271.45 s [vector] mut_foldl: OK
  6608. 271.45 s [vector] +++ OK, passed 100 tests.
  6609. 271.45 s [vector] mut_foldl': OK
  6610. 271.45 s [vector] +++ OK, passed 100 tests.
  6611. 271.45 s [vector] mut_ifoldr: OK
  6612. 271.45 s [vector] +++ OK, passed 100 tests.
  6613. 271.45 s [vector] mut_ifoldr': OK
  6614. 271.45 s [vector] +++ OK, passed 100 tests.
  6615. 271.45 s [vector] mut_ifoldl: OK
  6616. 271.45 s [vector] +++ OK, passed 100 tests.
  6617. 271.45 s [vector] mut_ifoldl': OK
  6618. 271.45 s [vector] +++ OK, passed 100 tests.
  6619. 271.45 s [vector] mut_foldM: OK
  6620. 271.45 s [vector] +++ OK, passed 100 tests.
  6621. 271.45 s [vector] mut_foldM': OK
  6622. 271.45 s [vector] +++ OK, passed 100 tests.
  6623. 271.45 s [vector] mut_foldrM: OK
  6624. 271.45 s [vector] +++ OK, passed 100 tests.
  6625. 271.45 s [vector] mut_foldrM': OK
  6626. 271.45 s [vector] +++ OK, passed 100 tests.
  6627. 271.45 s [vector] mut_ifoldM: OK
  6628. 271.45 s [vector] +++ OK, passed 100 tests.
  6629. 271.45 s [vector] mut_ifoldM': OK
  6630. 271.45 s [vector] +++ OK, passed 100 tests.
  6631. 271.45 s [vector] mut_ifoldrM: OK
  6632. 271.45 s [vector] +++ OK, passed 100 tests.
  6633. 271.45 s [vector] mut_ifoldrM': OK
  6634. 271.45 s [vector] +++ OK, passed 100 tests.
  6635. 271.45 s [vector] compare: OK
  6636. 271.45 s [vector] +++ OK, passed 100 tests.
  6637. 271.45 s [vector] maximum: OK
  6638. 271.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6639. 271.45 s [vector] minimum: OK
  6640. 271.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6641. 271.45 s [vector] minIndex: OK
  6642. 271.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6643. 271.45 s [vector] maxIndex: OK
  6644. 271.45 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6645. 271.45 s [vector] maximumBy: OK
  6646. 271.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6647. 271.45 s [vector] minimumBy: OK
  6648. 271.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6649. 271.45 s [vector] maximumOn: OK
  6650. 271.45 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6651. 271.45 s [vector] minimumOn: OK
  6652. 271.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6653. 271.45 s [vector] maxIndexBy: OK
  6654. 271.45 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6655. 271.45 s [vector] minIndexBy: OK
  6656. 271.45 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6657. 271.45 s [vector] ListFirstMaxIndexWins: OK
  6658. 271.45 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6659. 271.45 s [vector] FalseListFirstMaxIndexWins: OK
  6660. 271.45 s [vector] +++ OK, failed as expected. (after 1 test):
  6661. 271.45 s [vector] Exception:
  6662. 271.45 s [vector] Prelude.foldr1: empty list
  6663. 271.45 s [vector] CallStack (from HasCallStack):
  6664. 271.45 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6665. 271.45 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6666. 271.45 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6667. 271.45 s [vector] []
  6668. 271.45 s [vector] zip: OK
  6669. 271.45 s [vector] +++ OK, passed 100 tests.
  6670. 271.45 s [vector] zip3: OK
  6671. 271.45 s [vector] +++ OK, passed 100 tests.
  6672. 271.45 s [vector] unzip: OK
  6673. 271.45 s [vector] +++ OK, passed 100 tests.
  6674. 271.45 s [vector] unzip3: OK
  6675. 271.45 s [vector] +++ OK, passed 100 tests.
  6676. 271.45 s [vector] indexed: OK
  6677. 271.45 s [vector] +++ OK, passed 100 tests.
  6678. 271.46 s [vector] update: OK
  6679. 271.46 s [vector] +++ OK, passed 100 tests.
  6680. 271.46 s [vector] mempty: OK
  6681. 271.46 s [vector] +++ OK, passed 100 tests.
  6682. 271.46 s [vector] mappend: OK
  6683. 271.46 s [vector] +++ OK, passed 100 tests.
  6684. 271.46 s [vector] mconcat: OK (0.02s)
  6685. 271.46 s [vector] +++ OK, passed 100 tests.
  6686. 271.46 s [vector] glength: OK
  6687. 271.46 s [vector] +++ OK, passed 100 tests.
  6688. 271.46 s [vector] sum: OK
  6689. 271.46 s [vector] +++ OK, passed 100 tests.
  6690. 271.46 s [vector] product: OK
  6691. 271.46 s [vector] +++ OK, passed 100 tests.
  6692. 271.46 s [vector] enumFromN: OK
  6693. 271.46 s [vector] +++ OK, passed 100 tests.
  6694. 271.46 s [vector] enumFromThenN: OK
  6695. 271.46 s [vector] +++ OK, passed 100 tests.
  6696. 271.46 s [vector] enumFromTo: OK
  6697. 271.46 s [vector] +++ OK, passed 100 tests.
  6698. 271.46 s [vector] enumFromThenTo: OK
  6699. 271.46 s [vector] +++ OK, passed 100 tests; 2 discarded.
  6700. 271.46 s [vector] (Double)
  6701. 271.46 s [vector] fromList.toList == id: OK
  6702. 271.46 s [vector] +++ OK, passed 100 tests.
  6703. 271.46 s [vector] toList.fromList == id: OK
  6704. 271.46 s [vector] +++ OK, passed 100 tests.
  6705. 271.46 s [vector] unstream.stream == id: OK
  6706. 271.46 s [vector] +++ OK, passed 100 tests.
  6707. 271.46 s [vector] stream.unstream == id: OK
  6708. 271.46 s [vector] +++ OK, passed 100 tests.
  6709. 271.46 s [vector] eq: OK
  6710. 271.46 s [vector] +++ OK, passed 100 tests.
  6711. 271.46 s [vector] length: OK
  6712. 271.46 s [vector] +++ OK, passed 100 tests.
  6713. 271.46 s [vector] null: OK
  6714. 271.46 s [vector] +++ OK, passed 100 tests.
  6715. 271.46 s [vector] index: OK
  6716. 271.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6717. 271.46 s [vector] safeIndex: OK
  6718. 271.46 s [vector] +++ OK, passed 100 tests.
  6719. 271.46 s [vector] head: OK
  6720. 271.46 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6721. 271.46 s [vector] last: OK
  6722. 271.46 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6723. 271.46 s [vector] unsafeIndex: OK
  6724. 271.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6725. 271.46 s [vector] unsafeHead: OK
  6726. 271.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6727. 271.46 s [vector] unsafeLast: OK
  6728. 271.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6729. 271.46 s [vector] slice: OK
  6730. 271.46 s [vector] +++ OK, passed 100 tests.
  6731. 271.46 s [vector] init: OK
  6732. 271.46 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6733. 271.46 s [vector] tail: OK
  6734. 271.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6735. 271.46 s [vector] take: OK
  6736. 271.47 s [vector] +++ OK, passed 100 tests.
  6737. 271.47 s [vector] drop: OK
  6738. 271.47 s [vector] +++ OK, passed 100 tests.
  6739. 271.47 s [vector] splitAt: OK
  6740. 271.47 s [vector] +++ OK, passed 100 tests.
  6741. 271.47 s [vector] empty: OK
  6742. 271.47 s [vector] +++ OK, passed 100 tests.
  6743. 271.47 s [vector] singleton: OK
  6744. 271.47 s [vector] +++ OK, passed 100 tests.
  6745. 271.47 s [vector] replicate: OK
  6746. 271.48 s [vector] +++ OK, passed 100 tests.
  6747. 271.48 s [vector] generate: OK
  6748. 271.48 s [vector] +++ OK, passed 100 tests.
  6749. 271.48 s [vector] iterateN: OK
  6750. 271.48 s [vector] +++ OK, passed 100 tests.
  6751. 271.50 s [vector] iterateNM: OK (0.03s)
  6752. 271.50 s [vector] +++ OK, passed 100 tests.
  6753. 271.52 s [vector] generateM: OK (0.01s)
  6754. 271.52 s [vector] +++ OK, passed 100 tests.
  6755. 271.52 s [vector] replicateM: OK
  6756. 271.52 s [vector] +++ OK, passed 100 tests.
  6757. 271.53 s [vector] create: OK
  6758. 271.53 s [vector] +++ OK, passed 100 tests.
  6759. 271.53 s [vector] createT: OK
  6760. 271.53 s [vector] +++ OK, passed 100 tests.
  6761. 271.53 s [vector] unfoldr: OK
  6762. 271.53 s [vector] +++ OK, passed 100 tests.
  6763. 271.53 s [vector] unfoldrN: OK
  6764. 271.53 s [vector] +++ OK, passed 100 tests.
  6765. 271.53 s [vector] unfoldrExactN: OK
  6766. 271.53 s [vector] +++ OK, passed 100 tests.
  6767. 271.54 s [vector] unfoldrM: OK
  6768. 271.54 s [vector] +++ OK, passed 100 tests.
  6769. 271.54 s [vector] unfoldrNM: OK
  6770. 271.54 s [vector] +++ OK, passed 100 tests.
  6771. 271.58 s [vector] unfoldrExactNM: OK (0.02s)
  6772. 271.58 s [vector] +++ OK, passed 100 tests.
  6773. 271.60 s [vector] constructN: OK (0.02s)
  6774. 271.60 s [vector] +++ OK, passed 100 tests.
  6775. 271.60 s [vector] constructrN: OK (0.02s)
  6776. 271.60 s [vector] +++ OK, passed 100 tests.
  6777. 271.60 s [vector] cons: OK
  6778. 271.60 s [vector] +++ OK, passed 100 tests.
  6779. 271.60 s [vector] snoc: OK
  6780. 271.60 s [vector] +++ OK, passed 100 tests.
  6781. 271.60 s [vector] append: OK
  6782. 271.60 s [vector] +++ OK, passed 100 tests.
  6783. 271.63 s [vector] concat: OK (0.02s)
  6784. 271.63 s [vector] +++ OK, passed 100 tests.
  6785. 271.63 s [vector] force: OK
  6786. 271.63 s [vector] +++ OK, passed 100 tests.
  6787. 271.63 s [vector] upd: OK
  6788. 271.64 s [vector] +++ OK, passed 100 tests.
  6789. 271.65 s [vector] accum: OK (0.02s)
  6790. 271.65 s [vector] +++ OK, passed 100 tests.
  6791. 271.65 s [vector] reverse: OK
  6792. 271.65 s [vector] +++ OK, passed 100 tests.
  6793. 271.65 s [vector] backpermute: OK
  6794. 271.65 s [vector] +++ OK, passed 100 tests.
  6795. 271.66 s [vector] map: OK
  6796. 271.66 s [vector] +++ OK, passed 100 tests.
  6797. 271.66 s [vector] imap: OK
  6798. 271.66 s [vector] +++ OK, passed 100 tests.
  6799. 271.68 s [vector] concatMap: OK
  6800. 271.68 s [vector] +++ OK, passed 100 tests.
  6801. 271.68 s [vector] mapM: OK
  6802. 271.68 s [vector] +++ OK, passed 100 tests.
  6803. 271.71 s [vector] mapM_: OK (0.03s)
  6804. 271.72 s [vector] +++ OK, passed 100 tests.
  6805. 271.72 s [vector] forM: OK
  6806. 271.73 s [vector] +++ OK, passed 100 tests.
  6807. 271.76 s [vector] forM_: OK (0.04s)
  6808. 271.76 s [vector] +++ OK, passed 100 tests.
  6809. 271.76 s [vector] imapM: OK
  6810. 271.76 s [vector] +++ OK, passed 100 tests.
  6811. 271.80 s [vector] imapM_: OK (0.03s)
  6812. 271.80 s [vector] +++ OK, passed 100 tests.
  6813. 271.80 s [vector] zipWith: OK
  6814. 271.82 s [vector] +++ OK, passed 100 tests.
  6815. 271.82 s [vector] zipWith3: OK (0.01s)
  6816. 271.83 s [vector] +++ OK, passed 100 tests.
  6817. 271.84 s [vector] izipWith: OK (0.01s)
  6818. 271.84 s [vector] +++ OK, passed 100 tests.
  6819. 271.84 s [vector] izipWith3: OK (0.01s)
  6820. 271.84 s [vector] +++ OK, passed 100 tests.
  6821. 271.86 s [vector] izipWithM: OK
  6822. 271.86 s [vector] +++ OK, passed 100 tests.
  6823. 271.88 s [vector] izipWithM_: OK (0.03s)
  6824. 271.88 s [vector] +++ OK, passed 100 tests.
  6825. 271.90 s [vector] zipWithM: OK (0.01s)
  6826. 271.90 s [vector] +++ OK, passed 100 tests.
  6827. 271.92 s [vector] zipWithM_: OK (0.03s)
  6828. 271.92 s [vector] +++ OK, passed 100 tests.
  6829. 271.92 s [vector] filter: OK
  6830. 271.93 s [vector] +++ OK, passed 100 tests.
  6831. 271.94 s [vector] ifilter: OK
  6832. 271.94 s [vector] +++ OK, passed 100 tests.
  6833. 271.97 s [vector] filterM: OK (0.05s)
  6834. 271.97 s [vector] +++ OK, passed 100 tests.
  6835. 271.97 s [vector] uniq: OK
  6836. 271.97 s [vector] +++ OK, passed 100 tests.
  6837. 271.98 s [vector] mapMaybe: OK
  6838. 271.98 s [vector] +++ OK, passed 100 tests.
  6839. 271.99 s [vector] imapMaybe: OK
  6840. 271.99 s [vector] +++ OK, passed 100 tests.
  6841. 271.99 s [vector] takeWhile: OK
  6842. 271.99 s [vector] +++ OK, passed 100 tests.
  6843. 272.00 s [vector] dropWhile: OK
  6844. 272.00 s [vector] +++ OK, passed 100 tests.
  6845. 272.00 s [vector] partition: OK
  6846. 272.00 s [vector] +++ OK, passed 100 tests.
  6847. 272.00 s [vector] partitionWith: OK
  6848. 272.00 s [vector] +++ OK, passed 100 tests.
  6849. 272.00 s [vector] span: OK
  6850. 272.01 s [vector] +++ OK, passed 100 tests.
  6851. 272.01 s [vector] break: OK
  6852. 272.02 s [vector] +++ OK, passed 100 tests.
  6853. 272.02 s [vector] spanR: OK
  6854. 272.02 s [vector] +++ OK, passed 100 tests.
  6855. 272.02 s [vector] breakR: OK
  6856. 272.02 s [vector] +++ OK, passed 100 tests.
  6857. 272.02 s [vector] groupBy: OK (0.01s)
  6858. 272.02 s [vector] +++ OK, passed 100 tests.
  6859. 272.02 s [vector] elem: OK
  6860. 272.02 s [vector] +++ OK, passed 100 tests.
  6861. 272.02 s [vector] notElem: OK
  6862. 272.02 s [vector] +++ OK, passed 100 tests.
  6863. 272.02 s [vector] find: OK
  6864. 272.02 s [vector] +++ OK, passed 100 tests.
  6865. 272.02 s [vector] findIndex: OK
  6866. 272.03 s [vector] +++ OK, passed 100 tests.
  6867. 272.03 s [vector] findIndexR: OK
  6868. 272.03 s [vector] +++ OK, passed 100 tests.
  6869. 272.03 s [vector] findIndices: OK
  6870. 272.03 s [vector] +++ OK, passed 100 tests.
  6871. 272.03 s [vector] elemIndex: OK
  6872. 272.03 s [vector] +++ OK, passed 100 tests.
  6873. 272.04 s [vector] elemIndices: OK
  6874. 272.04 s [vector] +++ OK, passed 100 tests.
  6875. 272.06 s [vector] foldl: OK (0.01s)
  6876. 272.06 s [vector] +++ OK, passed 100 tests.
  6877. 272.06 s [vector] foldl1: OK (0.01s)
  6878. 272.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6879. 272.08 s [vector] foldl': OK (0.01s)
  6880. 272.08 s [vector] +++ OK, passed 100 tests.
  6881. 272.08 s [vector] foldl1': OK (0.01s)
  6882. 272.08 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6883. 272.10 s [vector] foldr: OK (0.01s)
  6884. 272.10 s [vector] +++ OK, passed 100 tests.
  6885. 272.12 s [vector] foldr1: OK (0.01s)
  6886. 272.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6887. 272.13 s [vector] foldr': OK (0.01s)
  6888. 272.13 s [vector] +++ OK, passed 100 tests.
  6889. 272.14 s [vector] foldr1': OK (0.01s)
  6890. 272.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6891. 272.16 s [vector] ifoldl: OK (0.02s)
  6892. 272.16 s [vector] +++ OK, passed 100 tests.
  6893. 272.16 s [vector] ifoldl': OK (0.01s)
  6894. 272.16 s [vector] +++ OK, passed 100 tests.
  6895. 272.18 s [vector] ifoldr: OK (0.01s)
  6896. 272.18 s [vector] +++ OK, passed 100 tests.
  6897. 272.18 s [vector] ifoldr': OK (0.01s)
  6898. 272.18 s [vector] +++ OK, passed 100 tests.
  6899. 272.19 s [vector] ifoldM: OK (0.01s)
  6900. 272.20 s [vector] +++ OK, passed 100 tests.
  6901. 272.21 s [vector] ifoldM': OK
  6902. 272.21 s [vector] +++ OK, passed 100 tests.
  6903. 272.26 s [vector] ifoldM_: OK (0.03s)
  6904. 272.26 s [vector] +++ OK, passed 100 tests.
  6905. 272.28 s [vector] ifoldM'_: OK (0.03s)
  6906. 272.28 s [vector] +++ OK, passed 100 tests.
  6907. 272.28 s [vector] all: OK
  6908. 272.28 s [vector] +++ OK, passed 100 tests.
  6909. 272.28 s [vector] any: OK
  6910. 272.28 s [vector] +++ OK, passed 100 tests.
  6911. 272.30 s [vector] prescanl: OK (0.01s)
  6912. 272.30 s [vector] +++ OK, passed 100 tests.
  6913. 272.30 s [vector] prescanl': OK (0.01s)
  6914. 272.30 s [vector] +++ OK, passed 100 tests.
  6915. 272.32 s [vector] postscanl: OK (0.01s)
  6916. 272.32 s [vector] +++ OK, passed 100 tests.
  6917. 272.34 s [vector] postscanl': OK (0.01s)
  6918. 272.34 s [vector] +++ OK, passed 100 tests.
  6919. 272.34 s [vector] scanl: OK (0.01s)
  6920. 272.34 s [vector] +++ OK, passed 100 tests.
  6921. 272.36 s [vector] scanl': OK (0.01s)
  6922. 272.36 s [vector] +++ OK, passed 100 tests.
  6923. 272.36 s [vector] scanl1: OK (0.01s)
  6924. 272.36 s [vector] +++ OK, passed 100 tests.
  6925. 272.38 s [vector] scanl1': OK (0.01s)
  6926. 272.38 s [vector] +++ OK, passed 100 tests.
  6927. 272.40 s [vector] iscanl: OK (0.01s)
  6928. 272.40 s [vector] +++ OK, passed 100 tests.
  6929. 272.41 s [vector] iscanl': OK (0.01s)
  6930. 272.41 s [vector] +++ OK, passed 100 tests.
  6931. 272.41 s [vector] prescanr: OK (0.01s)
  6932. 272.41 s [vector] +++ OK, passed 100 tests.
  6933. 272.42 s [vector] prescanr': OK
  6934. 272.42 s [vector] +++ OK, passed 100 tests.
  6935. 272.44 s [vector] postscanr: OK (0.01s)
  6936. 272.44 s [vector] +++ OK, passed 100 tests.
  6937. 272.45 s [vector] postscanr': OK (0.01s)
  6938. 272.45 s [vector] +++ OK, passed 100 tests.
  6939. 272.46 s [vector] scanr: OK (0.01s)
  6940. 272.46 s [vector] +++ OK, passed 100 tests.
  6941. 272.47 s [vector] scanr': OK (0.01s)
  6942. 272.47 s [vector] +++ OK, passed 100 tests.
  6943. 272.48 s [vector] scanr1: OK
  6944. 272.48 s [vector] +++ OK, passed 100 tests.
  6945. 272.50 s [vector] scanr1': OK (0.01s)
  6946. 272.50 s [vector] +++ OK, passed 100 tests.
  6947. 272.51 s [vector] iscanr: OK (0.01s)
  6948. 272.51 s [vector] +++ OK, passed 100 tests.
  6949. 272.51 s [vector] iscanr': OK (0.01s)
  6950. 272.51 s [vector] +++ OK, passed 100 tests.
  6951. 272.51 s [vector] mut_read: OK
  6952. 272.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6953. 272.51 s [vector] mut_write: OK
  6954. 272.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6955. 272.52 s [vector] mut_modify: OK
  6956. 272.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6957. 272.52 s [vector] mut_generate: OK
  6958. 272.52 s [vector] +++ OK, passed 100 tests.
  6959. 272.54 s [vector] mut_generateM: OK (0.02s)
  6960. 272.54 s [vector] +++ OK, passed 100 tests.
  6961. 272.58 s [vector] mut_mapM_: OK (0.04s)
  6962. 272.58 s [vector] +++ OK, passed 100 tests.
  6963. 272.62 s [vector] mut_imapM_: OK (0.04s)
  6964. 272.62 s [vector] +++ OK, passed 100 tests.
  6965. 272.66 s [vector] mut_forM_: OK (0.04s)
  6966. 272.66 s [vector] +++ OK, passed 100 tests.
  6967. 272.70 s [vector] mut_iforM_: OK (0.03s)
  6968. 272.70 s [vector] +++ OK, passed 100 tests.
  6969. 272.70 s [vector] mut_foldr: OK (0.01s)
  6970. 272.70 s [vector] +++ OK, passed 100 tests.
  6971. 272.72 s [vector] mut_foldr': OK (0.01s)
  6972. 272.72 s [vector] +++ OK, passed 100 tests.
  6973. 272.74 s [vector] mut_foldl: OK (0.01s)
  6974. 272.74 s [vector] +++ OK, passed 100 tests.
  6975. 272.75 s [vector] mut_foldl': OK (0.01s)
  6976. 272.75 s [vector] +++ OK, passed 100 tests.
  6977. 272.76 s [vector] mut_ifoldr: OK (0.02s)
  6978. 272.78 s [vector] +++ OK, passed 100 tests.
  6979. 272.78 s [vector] mut_ifoldr': OK (0.01s)
  6980. 272.78 s [vector] +++ OK, passed 100 tests.
  6981. 272.78 s [vector] mut_ifoldl: OK (0.01s)
  6982. 272.78 s [vector] +++ OK, passed 100 tests.
  6983. 272.80 s [vector] mut_ifoldl': OK (0.02s)
  6984. 272.80 s [vector] +++ OK, passed 100 tests.
  6985. 272.80 s [vector] mut_foldM: OK (0.01s)
  6986. 272.81 s [vector] +++ OK, passed 100 tests.
  6987. 272.82 s [vector] mut_foldM': OK
  6988. 272.82 s [vector] +++ OK, passed 100 tests.
  6989. 272.84 s [vector] mut_foldrM: OK (0.01s)
  6990. 272.84 s [vector] +++ OK, passed 100 tests.
  6991. 272.86 s [vector] mut_foldrM': OK (0.02s)
  6992. 272.86 s [vector] +++ OK, passed 100 tests.
  6993. 272.87 s [vector] mut_ifoldM: OK (0.01s)
  6994. 272.87 s [vector] +++ OK, passed 100 tests.
  6995. 272.87 s [vector] mut_ifoldM': OK (0.01s)
  6996. 272.87 s [vector] +++ OK, passed 100 tests.
  6997. 272.90 s [vector] mut_ifoldrM: OK
  6998. 272.90 s [vector] +++ OK, passed 100 tests.
  6999. 272.90 s [vector] mut_ifoldrM': OK (0.01s)
  7000. 272.90 s [vector] +++ OK, passed 100 tests.
  7001. 272.90 s [vector] compare: OK
  7002. 272.90 s [vector] +++ OK, passed 100 tests.
  7003. 272.90 s [vector] maximum: OK
  7004. 272.90 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7005. 272.90 s [vector] minimum: OK
  7006. 272.90 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7007. 272.91 s [vector] minIndex: OK
  7008. 272.91 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7009. 272.91 s [vector] maxIndex: OK
  7010. 272.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7011. 272.91 s [vector] maximumBy: OK
  7012. 272.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7013. 272.91 s [vector] minimumBy: OK
  7014. 272.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7015. 272.91 s [vector] maximumOn: OK
  7016. 272.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7017. 272.91 s [vector] minimumOn: OK
  7018. 272.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7019. 272.91 s [vector] maxIndexBy: OK
  7020. 272.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7021. 272.91 s [vector] minIndexBy: OK
  7022. 272.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7023. 272.91 s [vector] ListFirstMaxIndexWins: OK
  7024. 272.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7025. 272.91 s [vector] FalseListFirstMaxIndexWins: OK
  7026. 272.91 s [vector] +++ OK, failed as expected. (after 1 test):
  7027. 272.91 s [vector] Exception:
  7028. 272.91 s [vector] Prelude.foldr1: empty list
  7029. 272.91 s [vector] CallStack (from HasCallStack):
  7030. 272.91 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7031. 272.92 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7032. 272.92 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7033. 272.92 s [vector] []
  7034. 272.92 s [vector] zip: OK
  7035. 272.92 s [vector] +++ OK, passed 100 tests.
  7036. 272.92 s [vector] zip3: OK
  7037. 272.92 s [vector] +++ OK, passed 100 tests.
  7038. 272.92 s [vector] unzip: OK
  7039. 272.92 s [vector] +++ OK, passed 100 tests.
  7040. 272.92 s [vector] unzip3: OK
  7041. 272.93 s [vector] +++ OK, passed 100 tests.
  7042. 272.93 s [vector] indexed: OK
  7043. 272.93 s [vector] +++ OK, passed 100 tests.
  7044. 272.93 s [vector] update: OK
  7045. 272.93 s [vector] +++ OK, passed 100 tests.
  7046. 272.93 s [vector] mempty: OK
  7047. 272.93 s [vector] +++ OK, passed 100 tests.
  7048. 272.94 s [vector] mappend: OK
  7049. 272.94 s [vector] +++ OK, passed 100 tests.
  7050. 272.95 s [vector] mconcat: OK (0.02s)
  7051. 272.95 s [vector] +++ OK, passed 100 tests.
  7052. 272.95 s [vector] glength: OK
  7053. 272.95 s [vector] +++ OK, passed 100 tests.
  7054. 272.95 s [vector] sum: OK
  7055. 272.95 s [vector] +++ OK, passed 100 tests.
  7056. 272.95 s [vector] product: OK
  7057. 272.95 s [vector] +++ OK, passed 100 tests.
  7058. 272.95 s [vector] enumFromN: OK
  7059. 272.95 s [vector] +++ OK, passed 100 tests.
  7060. 272.96 s [vector] enumFromThenN: OK
  7061. 272.96 s [vector] +++ OK, passed 100 tests.
  7062. 272.96 s [vector] enumFromTo: OK
  7063. 272.96 s [vector] +++ OK, passed 100 tests.
  7064. 272.96 s [vector] enumFromThenTo: OK
  7065. 272.96 s [vector] +++ OK, passed 100 tests; 2 discarded.
  7066. 272.96 s [vector] (Int,Bool)
  7067. 272.96 s [vector] fromList.toList == id: OK
  7068. 272.96 s [vector] +++ OK, passed 100 tests.
  7069. 272.96 s [vector] toList.fromList == id: OK
  7070. 272.96 s [vector] +++ OK, passed 100 tests.
  7071. 272.96 s [vector] unstream.stream == id: OK
  7072. 272.96 s [vector] +++ OK, passed 100 tests.
  7073. 272.96 s [vector] stream.unstream == id: OK
  7074. 272.96 s [vector] +++ OK, passed 100 tests.
  7075. 272.96 s [vector] eq: OK
  7076. 272.96 s [vector] +++ OK, passed 100 tests.
  7077. 272.96 s [vector] length: OK
  7078. 272.97 s [vector] +++ OK, passed 100 tests.
  7079. 272.97 s [vector] null: OK
  7080. 272.97 s [vector] +++ OK, passed 100 tests.
  7081. 272.97 s [vector] index: OK
  7082. 272.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7083. 272.97 s [vector] safeIndex: OK
  7084. 272.97 s [vector] +++ OK, passed 100 tests.
  7085. 272.97 s [vector] head: OK
  7086. 272.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7087. 272.97 s [vector] last: OK
  7088. 272.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7089. 272.97 s [vector] unsafeIndex: OK
  7090. 272.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7091. 272.97 s [vector] unsafeHead: OK
  7092. 272.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7093. 272.98 s [vector] unsafeLast: OK
  7094. 272.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7095. 272.98 s [vector] slice: OK
  7096. 272.98 s [vector] +++ OK, passed 100 tests.
  7097. 272.98 s [vector] init: OK
  7098. 272.98 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7099. 272.98 s [vector] tail: OK
  7100. 272.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7101. 272.98 s [vector] take: OK
  7102. 272.98 s [vector] +++ OK, passed 100 tests.
  7103. 272.99 s [vector] drop: OK
  7104. 272.99 s [vector] +++ OK, passed 100 tests.
  7105. 272.99 s [vector] splitAt: OK
  7106. 272.99 s [vector] +++ OK, passed 100 tests.
  7107. 272.99 s [vector] empty: OK
  7108. 272.99 s [vector] +++ OK, passed 100 tests.
  7109. 272.99 s [vector] singleton: OK
  7110. 272.99 s [vector] +++ OK, passed 100 tests.
  7111. 272.99 s [vector] replicate: OK
  7112. 272.99 s [vector] +++ OK, passed 100 tests.
  7113. 272.99 s [vector] generate: OK
  7114. 273.00 s [vector] +++ OK, passed 100 tests.
  7115. 273.00 s [vector] iterateN: OK
  7116. 273.00 s [vector] +++ OK, passed 100 tests.
  7117. 273.06 s [vector] iterateNM: OK (0.05s)
  7118. 273.06 s [vector] +++ OK, passed 100 tests.
  7119. 273.08 s [vector] generateM: OK (0.03s)
  7120. 273.08 s [vector] +++ OK, passed 100 tests.
  7121. 273.09 s [vector] replicateM: OK (0.02s)
  7122. 273.09 s [vector] +++ OK, passed 100 tests.
  7123. 273.09 s [vector] create: OK
  7124. 273.09 s [vector] +++ OK, passed 100 tests.
  7125. 273.10 s [vector] createT: OK
  7126. 273.10 s [vector] +++ OK, passed 100 tests.
  7127. 273.10 s [vector] unfoldr: OK
  7128. 273.10 s [vector] +++ OK, passed 100 tests.
  7129. 273.10 s [vector] unfoldrN: OK
  7130. 273.10 s [vector] +++ OK, passed 100 tests.
  7131. 273.10 s [vector] unfoldrExactN: OK
  7132. 273.10 s [vector] +++ OK, passed 100 tests.
  7133. 273.10 s [vector] unfoldrM: OK
  7134. 273.11 s [vector] +++ OK, passed 100 tests.
  7135. 273.12 s [vector] unfoldrNM: OK
  7136. 273.12 s [vector] +++ OK, passed 100 tests.
  7137. 273.15 s [vector] unfoldrExactNM: OK (0.04s)
  7138. 273.15 s [vector] +++ OK, passed 100 tests.
  7139. 273.15 s [vector] constructN: OK
  7140. 273.16 s [vector] +++ OK, passed 100 tests.
  7141. 273.16 s [vector] constructrN: OK
  7142. 273.16 s [vector] +++ OK, passed 100 tests.
  7143. 273.17 s [vector] cons: OK
  7144. 273.17 s [vector] +++ OK, passed 100 tests.
  7145. 273.17 s [vector] snoc: OK
  7146. 273.18 s [vector] +++ OK, passed 100 tests.
  7147. 273.18 s [vector] append: OK
  7148. 273.18 s [vector] +++ OK, passed 100 tests.
  7149. 273.21 s [vector] concat: OK (0.04s)
  7150. 273.22 s [vector] +++ OK, passed 100 tests.
  7151. 273.22 s [vector] force: OK
  7152. 273.22 s [vector] +++ OK, passed 100 tests.
  7153. 273.22 s [vector] upd: OK
  7154. 273.22 s [vector] +++ OK, passed 100 tests.
  7155. 273.22 s [vector] accum: OK
  7156. 273.23 s [vector] +++ OK, passed 100 tests.
  7157. 273.23 s [vector] reverse: OK
  7158. 273.23 s [vector] +++ OK, passed 100 tests.
  7159. 273.23 s [vector] backpermute: OK
  7160. 273.23 s [vector] +++ OK, passed 100 tests.
  7161. 273.24 s [vector] map: OK
  7162. 273.24 s [vector] +++ OK, passed 100 tests.
  7163. 273.24 s [vector] imap: OK
  7164. 273.25 s [vector] +++ OK, passed 100 tests.
  7165. 273.26 s [vector] concatMap: OK
  7166. 273.26 s [vector] +++ OK, passed 100 tests.
  7167. 273.26 s [vector] mapM: OK
  7168. 273.26 s [vector] +++ OK, passed 100 tests.
  7169. 273.28 s [vector] mapM_: OK (0.03s)
  7170. 273.28 s [vector] +++ OK, passed 100 tests.
  7171. 273.28 s [vector] forM: OK
  7172. 273.28 s [vector] +++ OK, passed 100 tests.
  7173. 273.31 s [vector] forM_: OK (0.03s)
  7174. 273.31 s [vector] +++ OK, passed 100 tests.
  7175. 273.31 s [vector] imapM: OK
  7176. 273.31 s [vector] +++ OK, passed 100 tests.
  7177. 273.35 s [vector] imapM_: OK (0.03s)
  7178. 273.36 s [vector] +++ OK, passed 100 tests.
  7179. 273.36 s [vector] zipWith: OK
  7180. 273.36 s [vector] +++ OK, passed 100 tests.
  7181. 273.36 s [vector] zipWith3: OK
  7182. 273.36 s [vector] +++ OK, passed 100 tests.
  7183. 273.36 s [vector] izipWith: OK
  7184. 273.37 s [vector] +++ OK, passed 100 tests.
  7185. 273.37 s [vector] izipWith3: OK
  7186. 273.38 s [vector] +++ OK, passed 100 tests.
  7187. 273.38 s [vector] izipWithM: OK
  7188. 273.38 s [vector] +++ OK, passed 100 tests.
  7189. 273.40 s [vector] izipWithM_: OK (0.02s)
  7190. 273.40 s [vector] +++ OK, passed 100 tests.
  7191. 273.40 s [vector] zipWithM: OK
  7192. 273.40 s [vector] +++ OK, passed 100 tests.
  7193. 273.43 s [vector] zipWithM_: OK (0.02s)
  7194. 273.43 s [vector] +++ OK, passed 100 tests.
  7195. 273.43 s [vector] filter: OK
  7196. 273.43 s [vector] +++ OK, passed 100 tests.
  7197. 273.43 s [vector] ifilter: OK
  7198. 273.44 s [vector] +++ OK, passed 100 tests.
  7199. 273.49 s [vector] filterM: OK (0.05s)
  7200. 273.49 s [vector] +++ OK, passed 100 tests.
  7201. 273.49 s [vector] uniq: OK
  7202. 273.50 s [vector] +++ OK, passed 100 tests.
  7203. 273.50 s [vector] mapMaybe: OK
  7204. 273.50 s [vector] +++ OK, passed 100 tests.
  7205. 273.50 s [vector] imapMaybe: OK
  7206. 273.50 s [vector] +++ OK, passed 100 tests.
  7207. 273.50 s [vector] takeWhile: OK
  7208. 273.50 s [vector] +++ OK, passed 100 tests.
  7209. 273.50 s [vector] dropWhile: OK
  7210. 273.50 s [vector] +++ OK, passed 100 tests.
  7211. 273.50 s [vector] partition: OK
  7212. 273.50 s [vector] +++ OK, passed 100 tests.
  7213. 273.51 s [vector] partitionWith: OK
  7214. 273.51 s [vector] +++ OK, passed 100 tests.
  7215. 273.51 s [vector] span: OK
  7216. 273.51 s [vector] +++ OK, passed 100 tests.
  7217. 273.51 s [vector] break: OK
  7218. 273.51 s [vector] +++ OK, passed 100 tests.
  7219. 273.51 s [vector] spanR: OK
  7220. 273.52 s [vector] +++ OK, passed 100 tests.
  7221. 273.52 s [vector] breakR: OK
  7222. 273.52 s [vector] +++ OK, passed 100 tests.
  7223. 273.52 s [vector] groupBy: OK
  7224. 273.52 s [vector] +++ OK, passed 100 tests.
  7225. 273.52 s [vector] elem: OK
  7226. 273.53 s [vector] +++ OK, passed 100 tests.
  7227. 273.53 s [vector] notElem: OK
  7228. 273.53 s [vector] +++ OK, passed 100 tests.
  7229. 273.53 s [vector] find: OK
  7230. 273.53 s [vector] +++ OK, passed 100 tests.
  7231. 273.53 s [vector] findIndex: OK
  7232. 273.53 s [vector] +++ OK, passed 100 tests.
  7233. 273.53 s [vector] findIndexR: OK
  7234. 273.53 s [vector] +++ OK, passed 100 tests.
  7235. 273.53 s [vector] findIndices: OK
  7236. 273.53 s [vector] +++ OK, passed 100 tests.
  7237. 273.53 s [vector] elemIndex: OK
  7238. 273.53 s [vector] +++ OK, passed 100 tests.
  7239. 273.53 s [vector] elemIndices: OK
  7240. 273.53 s [vector] +++ OK, passed 100 tests.
  7241. 273.54 s [vector] foldl: OK
  7242. 273.54 s [vector] +++ OK, passed 100 tests.
  7243. 273.55 s [vector] foldl1: OK
  7244. 273.56 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7245. 273.56 s [vector] foldl': OK
  7246. 273.56 s [vector] +++ OK, passed 100 tests.
  7247. 273.56 s [vector] foldl1': OK
  7248. 273.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7249. 273.56 s [vector] foldr: OK
  7250. 273.56 s [vector] +++ OK, passed 100 tests.
  7251. 273.57 s [vector] foldr1: OK
  7252. 273.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7253. 273.57 s [vector] foldr': OK
  7254. 273.57 s [vector] +++ OK, passed 100 tests.
  7255. 273.58 s [vector] foldr1': OK
  7256. 273.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7257. 273.58 s [vector] ifoldl: OK
  7258. 273.58 s [vector] +++ OK, passed 100 tests.
  7259. 273.59 s [vector] ifoldl': OK
  7260. 273.59 s [vector] +++ OK, passed 100 tests.
  7261. 273.59 s [vector] ifoldr: OK
  7262. 273.59 s [vector] +++ OK, passed 100 tests.
  7263. 273.60 s [vector] ifoldr': OK
  7264. 273.60 s [vector] +++ OK, passed 100 tests.
  7265. 273.60 s [vector] ifoldM: OK
  7266. 273.61 s [vector] +++ OK, passed 100 tests.
  7267. 273.62 s [vector] ifoldM': OK
  7268. 273.62 s [vector] +++ OK, passed 100 tests.
  7269. 273.66 s [vector] ifoldM_: OK (0.04s)
  7270. 273.66 s [vector] +++ OK, passed 100 tests.
  7271. 273.68 s [vector] ifoldM'_: OK (0.03s)
  7272. 273.68 s [vector] +++ OK, passed 100 tests.
  7273. 273.68 s [vector] all: OK
  7274. 273.68 s [vector] +++ OK, passed 100 tests.
  7275. 273.68 s [vector] any: OK
  7276. 273.68 s [vector] +++ OK, passed 100 tests.
  7277. 273.69 s [vector] prescanl: OK
  7278. 273.70 s [vector] +++ OK, passed 100 tests.
  7279. 273.70 s [vector] prescanl': OK
  7280. 273.70 s [vector] +++ OK, passed 100 tests.
  7281. 273.70 s [vector] postscanl: OK
  7282. 273.70 s [vector] +++ OK, passed 100 tests.
  7283. 273.71 s [vector] postscanl': OK
  7284. 273.71 s [vector] +++ OK, passed 100 tests.
  7285. 273.71 s [vector] scanl: OK
  7286. 273.71 s [vector] +++ OK, passed 100 tests.
  7287. 273.72 s [vector] scanl': OK
  7288. 273.72 s [vector] +++ OK, passed 100 tests.
  7289. 273.73 s [vector] scanl1: OK
  7290. 273.73 s [vector] +++ OK, passed 100 tests.
  7291. 273.74 s [vector] scanl1': OK
  7292. 273.74 s [vector] +++ OK, passed 100 tests.
  7293. 273.74 s [vector] iscanl: OK
  7294. 273.74 s [vector] +++ OK, passed 100 tests.
  7295. 273.74 s [vector] iscanl': OK
  7296. 273.74 s [vector] +++ OK, passed 100 tests.
  7297. 273.74 s [vector] prescanr: OK
  7298. 273.74 s [vector] +++ OK, passed 100 tests.
  7299. 273.75 s [vector] prescanr': OK
  7300. 273.75 s [vector] +++ OK, passed 100 tests.
  7301. 273.75 s [vector] postscanr: OK
  7302. 273.75 s [vector] +++ OK, passed 100 tests.
  7303. 273.76 s [vector] postscanr': OK
  7304. 273.76 s [vector] +++ OK, passed 100 tests.
  7305. 273.77 s [vector] scanr: OK
  7306. 273.77 s [vector] +++ OK, passed 100 tests.
  7307. 273.77 s [vector] scanr': OK
  7308. 273.78 s [vector] +++ OK, passed 100 tests.
  7309. 273.78 s [vector] scanr1: OK
  7310. 273.78 s [vector] +++ OK, passed 100 tests.
  7311. 273.78 s [vector] scanr1': OK
  7312. 273.78 s [vector] +++ OK, passed 100 tests.
  7313. 273.79 s [vector] iscanr: OK
  7314. 273.79 s [vector] +++ OK, passed 100 tests.
  7315. 273.79 s [vector] iscanr': OK
  7316. 273.79 s [vector] +++ OK, passed 100 tests.
  7317. 273.80 s [vector] mut_read: OK
  7318. 273.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7319. 273.80 s [vector] mut_write: OK
  7320. 273.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7321. 273.80 s [vector] mut_modify: OK
  7322. 273.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7323. 273.80 s [vector] mut_generate: OK
  7324. 273.80 s [vector] +++ OK, passed 100 tests.
  7325. 273.82 s [vector] mut_generateM: OK (0.01s)
  7326. 273.82 s [vector] +++ OK, passed 100 tests.
  7327. 273.86 s [vector] mut_mapM_: OK (0.03s)
  7328. 273.86 s [vector] +++ OK, passed 100 tests.
  7329. 273.90 s [vector] mut_imapM_: OK (0.04s)
  7330. 273.90 s [vector] +++ OK, passed 100 tests.
  7331. 273.92 s [vector] mut_forM_: OK (0.03s)
  7332. 273.92 s [vector] +++ OK, passed 100 tests.
  7333. 273.95 s [vector] mut_iforM_: OK (0.03s)
  7334. 273.96 s [vector] +++ OK, passed 100 tests.
  7335. 273.96 s [vector] mut_foldr: OK
  7336. 273.96 s [vector] +++ OK, passed 100 tests.
  7337. 273.96 s [vector] mut_foldr': OK
  7338. 273.96 s [vector] +++ OK, passed 100 tests.
  7339. 273.96 s [vector] mut_foldl: OK
  7340. 273.96 s [vector] +++ OK, passed 100 tests.
  7341. 273.97 s [vector] mut_foldl': OK
  7342. 273.97 s [vector] +++ OK, passed 100 tests.
  7343. 273.97 s [vector] mut_ifoldr: OK
  7344. 273.97 s [vector] +++ OK, passed 100 tests.
  7345. 273.98 s [vector] mut_ifoldr': OK
  7346. 273.98 s [vector] +++ OK, passed 100 tests.
  7347. 273.99 s [vector] mut_ifoldl: OK
  7348. 274.00 s [vector] +++ OK, passed 100 tests.
  7349. 274.00 s [vector] mut_ifoldl': OK
  7350. 274.00 s [vector] +++ OK, passed 100 tests.
  7351. 274.00 s [vector] mut_foldM: OK
  7352. 274.00 s [vector] +++ OK, passed 100 tests.
  7353. 274.00 s [vector] mut_foldM': OK
  7354. 274.01 s [vector] +++ OK, passed 100 tests.
  7355. 274.01 s [vector] mut_foldrM: OK
  7356. 274.02 s [vector] +++ OK, passed 100 tests.
  7357. 274.02 s [vector] mut_foldrM': OK
  7358. 274.02 s [vector] +++ OK, passed 100 tests.
  7359. 274.02 s [vector] mut_ifoldM: OK
  7360. 274.03 s [vector] +++ OK, passed 100 tests.
  7361. 274.04 s [vector] mut_ifoldM': OK
  7362. 274.04 s [vector] +++ OK, passed 100 tests.
  7363. 274.04 s [vector] mut_ifoldrM: OK
  7364. 274.04 s [vector] +++ OK, passed 100 tests.
  7365. 274.04 s [vector] mut_ifoldrM': OK
  7366. 274.04 s [vector] +++ OK, passed 100 tests.
  7367. 274.05 s [vector] compare: OK
  7368. 274.05 s [vector] +++ OK, passed 100 tests.
  7369. 274.05 s [vector] maximum: OK
  7370. 274.05 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7371. 274.05 s [vector] minimum: OK
  7372. 274.05 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7373. 274.05 s [vector] minIndex: OK
  7374. 274.05 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7375. 274.05 s [vector] maxIndex: OK
  7376. 274.05 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7377. 274.05 s [vector] maximumBy: OK
  7378. 274.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7379. 274.05 s [vector] minimumBy: OK
  7380. 274.05 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7381. 274.05 s [vector] maximumOn: OK
  7382. 274.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7383. 274.05 s [vector] minimumOn: OK
  7384. 274.06 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7385. 274.06 s [vector] maxIndexBy: OK
  7386. 274.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7387. 274.06 s [vector] minIndexBy: OK
  7388. 274.06 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7389. 274.06 s [vector] ListFirstMaxIndexWins: OK
  7390. 274.06 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7391. 274.06 s [vector] FalseListFirstMaxIndexWins: OK
  7392. 274.06 s [vector] +++ OK, failed as expected. (after 1 test):
  7393. 274.06 s [vector] Exception:
  7394. 274.06 s [vector] Prelude.foldr1: empty list
  7395. 274.06 s [vector] CallStack (from HasCallStack):
  7396. 274.06 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7397. 274.06 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7398. 274.06 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7399. 274.06 s [vector] []
  7400. 274.06 s [vector] zip: OK
  7401. 274.06 s [vector] +++ OK, passed 100 tests.
  7402. 274.07 s [vector] zip3: OK
  7403. 274.07 s [vector] +++ OK, passed 100 tests.
  7404. 274.07 s [vector] unzip: OK
  7405. 274.07 s [vector] +++ OK, passed 100 tests.
  7406. 274.08 s [vector] unzip3: OK
  7407. 274.08 s [vector] +++ OK, passed 100 tests.
  7408. 274.08 s [vector] indexed: OK
  7409. 274.08 s [vector] +++ OK, passed 100 tests.
  7410. 274.08 s [vector] update: OK
  7411. 274.08 s [vector] +++ OK, passed 100 tests.
  7412. 274.09 s [vector] mempty: OK
  7413. 274.09 s [vector] +++ OK, passed 100 tests.
  7414. 274.10 s [vector] mappend: OK
  7415. 274.10 s [vector] +++ OK, passed 100 tests.
  7416. 274.15 s [vector] mconcat: OK (0.06s)
  7417. 274.15 s [vector] +++ OK, passed 100 tests.
  7418. 274.15 s [vector] glength: OK
  7419. 274.15 s [vector] +++ OK, passed 100 tests.
  7420. 274.15 s [vector] (Int,Bool,Int)
  7421. 274.15 s [vector] fromList.toList == id: OK
  7422. 274.15 s [vector] +++ OK, passed 100 tests.
  7423. 274.15 s [vector] toList.fromList == id: OK
  7424. 274.15 s [vector] +++ OK, passed 100 tests.
  7425. 274.15 s [vector] unstream.stream == id: OK
  7426. 274.15 s [vector] +++ OK, passed 100 tests.
  7427. 274.15 s [vector] stream.unstream == id: OK
  7428. 274.15 s [vector] +++ OK, passed 100 tests.
  7429. 274.16 s [vector] eq: OK
  7430. 274.16 s [vector] +++ OK, passed 100 tests.
  7431. 274.16 s [vector] length: OK
  7432. 274.16 s [vector] +++ OK, passed 100 tests.
  7433. 274.16 s [vector] null: OK
  7434. 274.16 s [vector] +++ OK, passed 100 tests.
  7435. 274.16 s [vector] index: OK
  7436. 274.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7437. 274.16 s [vector] safeIndex: OK
  7438. 274.16 s [vector] +++ OK, passed 100 tests.
  7439. 274.16 s [vector] head: OK
  7440. 274.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7441. 274.16 s [vector] last: OK
  7442. 274.16 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7443. 274.16 s [vector] unsafeIndex: OK
  7444. 274.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7445. 274.16 s [vector] unsafeHead: OK
  7446. 274.16 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7447. 274.16 s [vector] unsafeLast: OK
  7448. 274.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7449. 274.17 s [vector] slice: OK
  7450. 274.17 s [vector] +++ OK, passed 100 tests.
  7451. 274.17 s [vector] init: OK
  7452. 274.17 s [vector] +++ OK, passed 100 tests; 10 discarded.
  7453. 274.17 s [vector] tail: OK
  7454. 274.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7455. 274.18 s [vector] take: OK
  7456. 274.18 s [vector] +++ OK, passed 100 tests.
  7457. 274.18 s [vector] drop: OK
  7458. 274.18 s [vector] +++ OK, passed 100 tests.
  7459. 274.18 s [vector] splitAt: OK
  7460. 274.18 s [vector] +++ OK, passed 100 tests.
  7461. 274.18 s [vector] empty: OK
  7462. 274.18 s [vector] +++ OK, passed 100 tests.
  7463. 274.18 s [vector] singleton: OK
  7464. 274.18 s [vector] +++ OK, passed 100 tests.
  7465. 274.18 s [vector] replicate: OK
  7466. 274.18 s [vector] +++ OK, passed 100 tests.
  7467. 274.18 s [vector] generate: OK
  7468. 274.18 s [vector] +++ OK, passed 100 tests.
  7469. 274.18 s [vector] iterateN: OK
  7470. 274.18 s [vector] +++ OK, passed 100 tests.
  7471. 274.22 s [vector] iterateNM: OK (0.02s)
  7472. 274.22 s [vector] +++ OK, passed 100 tests.
  7473. 274.26 s [vector] generateM: OK (0.04s)
  7474. 274.26 s [vector] +++ OK, passed 100 tests.
  7475. 274.27 s [vector] replicateM: OK (0.02s)
  7476. 274.27 s [vector] +++ OK, passed 100 tests.
  7477. 274.27 s [vector] create: OK
  7478. 274.28 s [vector] +++ OK, passed 100 tests.
  7479. 274.28 s [vector] createT: OK
  7480. 274.28 s [vector] +++ OK, passed 100 tests.
  7481. 274.28 s [vector] unfoldr: OK
  7482. 274.28 s [vector] +++ OK, passed 100 tests.
  7483. 274.28 s [vector] unfoldrN: OK
  7484. 274.28 s [vector] +++ OK, passed 100 tests.
  7485. 274.28 s [vector] unfoldrExactN: OK
  7486. 274.28 s [vector] +++ OK, passed 100 tests.
  7487. 274.29 s [vector] unfoldrM: OK (0.01s)
  7488. 274.30 s [vector] +++ OK, passed 100 tests.
  7489. 274.30 s [vector] unfoldrNM: OK
  7490. 274.30 s [vector] +++ OK, passed 100 tests.
  7491. 274.36 s [vector] unfoldrExactNM: OK (0.06s)
  7492. 274.36 s [vector] +++ OK, passed 100 tests.
  7493. 274.36 s [vector] constructN: OK
  7494. 274.37 s [vector] +++ OK, passed 100 tests.
  7495. 274.37 s [vector] constructrN: OK
  7496. 274.38 s [vector] +++ OK, passed 100 tests.
  7497. 274.38 s [vector] cons: OK
  7498. 274.38 s [vector] +++ OK, passed 100 tests.
  7499. 274.38 s [vector] snoc: OK
  7500. 274.38 s [vector] +++ OK, passed 100 tests.
  7501. 274.38 s [vector] append: OK
  7502. 274.38 s [vector] +++ OK, passed 100 tests.
  7503. 274.44 s [vector] concat: OK (0.06s)
  7504. 274.44 s [vector] +++ OK, passed 100 tests.
  7505. 274.44 s [vector] force: OK
  7506. 274.44 s [vector] +++ OK, passed 100 tests.
  7507. 274.44 s [vector] upd: OK
  7508. 274.45 s [vector] +++ OK, passed 100 tests.
  7509. 274.45 s [vector] accum: OK (0.01s)
  7510. 274.45 s [vector] +++ OK, passed 100 tests.
  7511. 274.45 s [vector] reverse: OK
  7512. 274.46 s [vector] +++ OK, passed 100 tests.
  7513. 274.46 s [vector] backpermute: OK
  7514. 274.46 s [vector] +++ OK, passed 100 tests.
  7515. 274.47 s [vector] map: OK
  7516. 274.47 s [vector] +++ OK, passed 100 tests.
  7517. 274.47 s [vector] imap: OK
  7518. 274.47 s [vector] +++ OK, passed 100 tests.
  7519. 274.48 s [vector] concatMap: OK
  7520. 274.48 s [vector] +++ OK, passed 100 tests.
  7521. 274.49 s [vector] mapM: OK
  7522. 274.49 s [vector] +++ OK, passed 100 tests.
  7523. 274.54 s [vector] mapM_: OK (0.04s)
  7524. 274.54 s [vector] +++ OK, passed 100 tests.
  7525. 274.56 s [vector] forM: OK (0.01s)
  7526. 274.56 s [vector] +++ OK, passed 100 tests.
  7527. 274.59 s [vector] forM_: OK (0.04s)
  7528. 274.60 s [vector] +++ OK, passed 100 tests.
  7529. 274.60 s [vector] imapM: OK
  7530. 274.60 s [vector] +++ OK, passed 100 tests.
  7531. 274.64 s [vector] imapM_: OK (0.04s)
  7532. 274.64 s [vector] +++ OK, passed 100 tests.
  7533. 274.65 s [vector] zipWith: OK
  7534. 274.65 s [vector] +++ OK, passed 100 tests.
  7535. 274.65 s [vector] zipWith3: OK
  7536. 274.66 s [vector] +++ OK, passed 100 tests.
  7537. 274.66 s [vector] izipWith: OK
  7538. 274.66 s [vector] +++ OK, passed 100 tests.
  7539. 274.68 s [vector] izipWith3: OK
  7540. 274.68 s [vector] +++ OK, passed 100 tests.
  7541. 274.68 s [vector] izipWithM: OK
  7542. 274.68 s [vector] +++ OK, passed 100 tests.
  7543. 274.72 s [vector] izipWithM_: OK (0.04s)
  7544. 274.72 s [vector] +++ OK, passed 100 tests.
  7545. 274.72 s [vector] zipWithM: OK
  7546. 274.72 s [vector] +++ OK, passed 100 tests.
  7547. 274.75 s [vector] zipWithM_: OK (0.03s)
  7548. 274.75 s [vector] +++ OK, passed 100 tests.
  7549. 274.75 s [vector] filter: OK
  7550. 274.75 s [vector] +++ OK, passed 100 tests.
  7551. 274.76 s [vector] ifilter: OK
  7552. 274.76 s [vector] +++ OK, passed 100 tests.
  7553. 274.82 s [vector] filterM: OK (0.06s)
  7554. 274.82 s [vector] +++ OK, passed 100 tests.
  7555. 274.83 s [vector] uniq: OK
  7556. 274.83 s [vector] +++ OK, passed 100 tests.
  7557. 274.83 s [vector] mapMaybe: OK
  7558. 274.84 s [vector] +++ OK, passed 100 tests.
  7559. 274.84 s [vector] imapMaybe: OK
  7560. 274.84 s [vector] +++ OK, passed 100 tests.
  7561. 274.85 s [vector] takeWhile: OK
  7562. 274.85 s [vector] +++ OK, passed 100 tests.
  7563. 274.85 s [vector] dropWhile: OK
  7564. 274.85 s [vector] +++ OK, passed 100 tests.
  7565. 274.85 s [vector] partition: OK
  7566. 274.85 s [vector] +++ OK, passed 100 tests.
  7567. 274.85 s [vector] partitionWith: OK
  7568. 274.85 s [vector] +++ OK, passed 100 tests.
  7569. 274.86 s [vector] span: OK
  7570. 274.86 s [vector] +++ OK, passed 100 tests.
  7571. 274.86 s [vector] break: OK
  7572. 274.86 s [vector] +++ OK, passed 100 tests.
  7573. 274.86 s [vector] spanR: OK
  7574. 274.86 s [vector] +++ OK, passed 100 tests.
  7575. 274.86 s [vector] breakR: OK
  7576. 274.86 s [vector] +++ OK, passed 100 tests.
  7577. 274.87 s [vector] groupBy: OK
  7578. 274.87 s [vector] +++ OK, passed 100 tests.
  7579. 274.87 s [vector] elem: OK
  7580. 274.87 s [vector] +++ OK, passed 100 tests.
  7581. 274.87 s [vector] notElem: OK
  7582. 274.87 s [vector] +++ OK, passed 100 tests.
  7583. 274.87 s [vector] find: OK
  7584. 274.87 s [vector] +++ OK, passed 100 tests.
  7585. 274.87 s [vector] findIndex: OK
  7586. 274.87 s [vector] +++ OK, passed 100 tests.
  7587. 274.87 s [vector] findIndexR: OK
  7588. 274.88 s [vector] +++ OK, passed 100 tests.
  7589. 274.88 s [vector] findIndices: OK
  7590. 274.88 s [vector] +++ OK, passed 100 tests.
  7591. 274.88 s [vector] elemIndex: OK
  7592. 274.88 s [vector] +++ OK, passed 100 tests.
  7593. 274.88 s [vector] elemIndices: OK
  7594. 274.88 s [vector] +++ OK, passed 100 tests.
  7595. 274.89 s [vector] foldl: OK
  7596. 274.89 s [vector] +++ OK, passed 100 tests.
  7597. 274.90 s [vector] foldl1: OK
  7598. 274.90 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7599. 274.90 s [vector] foldl': OK
  7600. 274.91 s [vector] +++ OK, passed 100 tests.
  7601. 274.91 s [vector] foldl1': OK
  7602. 274.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7603. 274.92 s [vector] foldr: OK
  7604. 274.92 s [vector] +++ OK, passed 100 tests.
  7605. 274.92 s [vector] foldr1: OK
  7606. 274.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7607. 274.93 s [vector] foldr': OK
  7608. 274.94 s [vector] +++ OK, passed 100 tests.
  7609. 274.94 s [vector] foldr1': OK
  7610. 274.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7611. 274.95 s [vector] ifoldl: OK
  7612. 274.95 s [vector] +++ OK, passed 100 tests.
  7613. 274.96 s [vector] ifoldl': OK
  7614. 274.96 s [vector] +++ OK, passed 100 tests.
  7615. 274.96 s [vector] ifoldr: OK
  7616. 274.96 s [vector] +++ OK, passed 100 tests.
  7617. 274.97 s [vector] ifoldr': OK
  7618. 274.97 s [vector] +++ OK, passed 100 tests.
  7619. 274.98 s [vector] ifoldM: OK
  7620. 274.98 s [vector] +++ OK, passed 100 tests.
  7621. 275.00 s [vector] ifoldM': OK
  7622. 275.00 s [vector] +++ OK, passed 100 tests.
  7623. 275.04 s [vector] ifoldM_: OK (0.05s)
  7624. 275.04 s [vector] +++ OK, passed 100 tests.
  7625. 275.07 s [vector] ifoldM'_: OK (0.04s)
  7626. 275.08 s [vector] +++ OK, passed 100 tests.
  7627. 275.08 s [vector] all: OK
  7628. 275.08 s [vector] +++ OK, passed 100 tests.
  7629. 275.08 s [vector] any: OK
  7630. 275.08 s [vector] +++ OK, passed 100 tests.
  7631. 275.08 s [vector] prescanl: OK
  7632. 275.09 s [vector] +++ OK, passed 100 tests.
  7633. 275.09 s [vector] prescanl': OK
  7634. 275.10 s [vector] +++ OK, passed 100 tests.
  7635. 275.10 s [vector] postscanl: OK
  7636. 275.10 s [vector] +++ OK, passed 100 tests.
  7637. 275.12 s [vector] postscanl': OK
  7638. 275.12 s [vector] +++ OK, passed 100 tests.
  7639. 275.12 s [vector] scanl: OK
  7640. 275.13 s [vector] +++ OK, passed 100 tests.
  7641. 275.14 s [vector] scanl': OK (0.01s)
  7642. 275.14 s [vector] +++ OK, passed 100 tests.
  7643. 275.14 s [vector] scanl1: OK
  7644. 275.14 s [vector] +++ OK, passed 100 tests.
  7645. 275.14 s [vector] scanl1': OK
  7646. 275.14 s [vector] +++ OK, passed 100 tests.
  7647. 275.16 s [vector] iscanl: OK (0.01s)
  7648. 275.16 s [vector] +++ OK, passed 100 tests.
  7649. 275.18 s [vector] iscanl': OK (0.01s)
  7650. 275.18 s [vector] +++ OK, passed 100 tests.
  7651. 275.18 s [vector] prescanr: OK
  7652. 275.18 s [vector] +++ OK, passed 100 tests.
  7653. 275.18 s [vector] prescanr': OK
  7654. 275.18 s [vector] +++ OK, passed 100 tests.
  7655. 275.20 s [vector] postscanr: OK
  7656. 275.20 s [vector] +++ OK, passed 100 tests.
  7657. 275.20 s [vector] postscanr': OK
  7658. 275.21 s [vector] +++ OK, passed 100 tests.
  7659. 275.21 s [vector] scanr: OK
  7660. 275.22 s [vector] +++ OK, passed 100 tests.
  7661. 275.22 s [vector] scanr': OK
  7662. 275.22 s [vector] +++ OK, passed 100 tests.
  7663. 275.23 s [vector] scanr1: OK
  7664. 275.23 s [vector] +++ OK, passed 100 tests.
  7665. 275.24 s [vector] scanr1': OK (0.01s)
  7666. 275.24 s [vector] +++ OK, passed 100 tests.
  7667. 275.26 s [vector] iscanr: OK (0.01s)
  7668. 275.26 s [vector] +++ OK, passed 100 tests.
  7669. 275.26 s [vector] iscanr': OK (0.02s)
  7670. 275.26 s [vector] +++ OK, passed 100 tests.
  7671. 275.26 s [vector] mut_read: OK
  7672. 275.26 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7673. 275.27 s [vector] mut_write: OK
  7674. 275.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7675. 275.27 s [vector] mut_modify: OK
  7676. 275.27 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7677. 275.27 s [vector] mut_generate: OK
  7678. 275.28 s [vector] +++ OK, passed 100 tests.
  7679. 275.30 s [vector] mut_generateM: OK (0.02s)
  7680. 275.30 s [vector] +++ OK, passed 100 tests.
  7681. 275.36 s [vector] mut_mapM_: OK (0.06s)
  7682. 275.36 s [vector] +++ OK, passed 100 tests.
  7683. 275.42 s [vector] mut_imapM_: OK (0.06s)
  7684. 275.42 s [vector] +++ OK, passed 100 tests.
  7685. 275.48 s [vector] mut_forM_: OK (0.05s)
  7686. 275.48 s [vector] +++ OK, passed 100 tests.
  7687. 275.52 s [vector] mut_iforM_: OK (0.05s)
  7688. 275.52 s [vector] +++ OK, passed 100 tests.
  7689. 275.52 s [vector] mut_foldr: OK
  7690. 275.53 s [vector] +++ OK, passed 100 tests.
  7691. 275.54 s [vector] mut_foldr': OK
  7692. 275.54 s [vector] +++ OK, passed 100 tests.
  7693. 275.54 s [vector] mut_foldl: OK
  7694. 275.54 s [vector] +++ OK, passed 100 tests.
  7695. 275.56 s [vector] mut_foldl': OK
  7696. 275.56 s [vector] +++ OK, passed 100 tests.
  7697. 275.56 s [vector] mut_ifoldr: OK
  7698. 275.56 s [vector] +++ OK, passed 100 tests.
  7699. 275.57 s [vector] mut_ifoldr': OK
  7700. 275.57 s [vector] +++ OK, passed 100 tests.
  7701. 275.58 s [vector] mut_ifoldl: OK
  7702. 275.59 s [vector] +++ OK, passed 100 tests.
  7703. 275.60 s [vector] mut_ifoldl': OK
  7704. 275.60 s [vector] +++ OK, passed 100 tests.
  7705. 275.60 s [vector] mut_foldM: OK
  7706. 275.60 s [vector] +++ OK, passed 100 tests.
  7707. 275.60 s [vector] mut_foldM': OK
  7708. 275.60 s [vector] +++ OK, passed 100 tests.
  7709. 275.61 s [vector] mut_foldrM: OK
  7710. 275.62 s [vector] +++ OK, passed 100 tests.
  7711. 275.62 s [vector] mut_foldrM': OK
  7712. 275.62 s [vector] +++ OK, passed 100 tests.
  7713. 275.62 s [vector] mut_ifoldM: OK
  7714. 275.62 s [vector] +++ OK, passed 100 tests.
  7715. 275.64 s [vector] mut_ifoldM': OK
  7716. 275.64 s [vector] +++ OK, passed 100 tests.
  7717. 275.64 s [vector] mut_ifoldrM: OK
  7718. 275.64 s [vector] +++ OK, passed 100 tests.
  7719. 275.64 s [vector] mut_ifoldrM': OK
  7720. 275.65 s [vector] +++ OK, passed 100 tests.
  7721. 275.65 s [vector] compare: OK
  7722. 275.65 s [vector] +++ OK, passed 100 tests.
  7723. 275.65 s [vector] maximum: OK
  7724. 275.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7725. 275.65 s [vector] minimum: OK
  7726. 275.65 s [vector] +++ OK, passed 100 tests; 25 discarded.
  7727. 275.65 s [vector] minIndex: OK
  7728. 275.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7729. 275.65 s [vector] maxIndex: OK
  7730. 275.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7731. 275.65 s [vector] maximumBy: OK
  7732. 275.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7733. 275.66 s [vector] minimumBy: OK
  7734. 275.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7735. 275.66 s [vector] maximumOn: OK
  7736. 275.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7737. 275.66 s [vector] minimumOn: OK
  7738. 275.66 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7739. 275.66 s [vector] maxIndexBy: OK
  7740. 275.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7741. 275.67 s [vector] minIndexBy: OK
  7742. 275.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7743. 275.67 s [vector] ListFirstMaxIndexWins: OK
  7744. 275.67 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7745. 275.67 s [vector] FalseListFirstMaxIndexWins: OK
  7746. 275.67 s [vector] +++ OK, failed as expected. (after 1 test):
  7747. 275.68 s [vector] Exception:
  7748. 275.68 s [vector] Prelude.foldr1: empty list
  7749. 275.68 s [vector] CallStack (from HasCallStack):
  7750. 275.68 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7751. 275.68 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7752. 275.68 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7753. 275.68 s [vector] []
  7754. 275.68 s [vector] zip: OK
  7755. 275.68 s [vector] +++ OK, passed 100 tests.
  7756. 275.68 s [vector] zip3: OK
  7757. 275.68 s [vector] +++ OK, passed 100 tests.
  7758. 275.68 s [vector] unzip: OK
  7759. 275.69 s [vector] +++ OK, passed 100 tests.
  7760. 275.69 s [vector] unzip3: OK
  7761. 275.69 s [vector] +++ OK, passed 100 tests.
  7762. 275.69 s [vector] indexed: OK
  7763. 275.70 s [vector] +++ OK, passed 100 tests.
  7764. 275.70 s [vector] update: OK
  7765. 275.70 s [vector] +++ OK, passed 100 tests.
  7766. 275.70 s [vector] mempty: OK
  7767. 275.70 s [vector] +++ OK, passed 100 tests.
  7768. 275.70 s [vector] mappend: OK
  7769. 275.70 s [vector] +++ OK, passed 100 tests.
  7770. 275.78 s [vector] mconcat: OK (0.05s)
  7771. 275.78 s [vector] +++ OK, passed 100 tests.
  7772. 275.78 s [vector] glength: OK
  7773. 275.79 s [vector] +++ OK, passed 100 tests.
  7774. 275.79 s [vector] unstream
  7775. 275.79 s [vector] unstream == vunstream (exact): OK
  7776. 275.79 s [vector] +++ OK, passed 100 tests.
  7777. 275.79 s [vector] unstream == vunstream (unknown): OK
  7778. 275.79 s [vector] +++ OK, passed 100 tests.
  7779. 275.79 s [vector] unstreamR ~= vunstream (exact): OK
  7780. 275.79 s [vector] +++ OK, passed 100 tests.
  7781. 275.79 s [vector] unstreamR ~= vunstream (unknown): OK
  7782. 275.79 s [vector] +++ OK, passed 100 tests.
  7783. 275.79 s [vector] Data.Vector.Storable.Vector Alignment
  7784. 275.80 s [vector] Aligned Double: OK
  7785. 275.80 s [vector] Aligned Int: OK
  7786. 275.80 s [vector] Regression tests
  7787. 275.80 s [vector] enumFromTo crash #188
  7788. 275.80 s [vector] Word8: OK
  7789. 275.80 s [vector] Word16: OK
  7790. 275.80 s [vector] Word32: OK
  7791. 275.80 s [vector] Word64: OK
  7792. 275.80 s [vector] Word: OK
  7793. 275.80 s [vector] Int8: OK
  7794. 275.80 s [vector] Int16: OK
  7795. 275.80 s [vector] Int32: OK
  7796. 275.80 s [vector] Int64: OK
  7797. 275.80 s [vector] Int: OK
  7798. 275.80 s [vector] Char: OK
  7799. 275.80 s [vector] Negative tests
  7800. 275.80 s [vector] slice out of bounds #257
  7801. 275.80 s [vector] Boxed
  7802. 275.80 s [vector] Negative ix: OK
  7803. 275.80 s [vector] Negative size: OK
  7804. 275.80 s [vector] Negative ix and size: OK
  7805. 275.80 s [vector] Too large ix: OK
  7806. 275.80 s [vector] Too large size: OK
  7807. 275.80 s [vector] Too large ix and size: OK
  7808. 275.80 s [vector] Overflow: OK
  7809. 275.80 s [vector] OutOfMemory: OK
  7810. 275.80 s [vector] Primitive
  7811. 275.80 s [vector] Negative ix: OK
  7812. 275.80 s [vector] Negative size: OK
  7813. 275.80 s [vector] Negative ix and size: OK
  7814. 275.80 s [vector] Too large ix: OK
  7815. 275.80 s [vector] Too large size: OK
  7816. 275.80 s [vector] Too large ix and size: OK
  7817. 275.80 s [vector] Overflow: OK
  7818. 275.80 s [vector] OutOfMemory: OK
  7819. 275.80 s [vector] Storable
  7820. 275.80 s [vector] Negative ix: OK
  7821. 275.80 s [vector] Negative size: OK
  7822. 275.80 s [vector] Negative ix and size: OK
  7823. 275.80 s [vector] Too large ix: OK
  7824. 275.80 s [vector] Too large size: OK
  7825. 275.80 s [vector] Too large ix and size: OK
  7826. 275.80 s [vector] Overflow: OK
  7827. 275.80 s [vector] OutOfMemory: OK
  7828. 275.80 s [vector] Unboxed
  7829. 275.80 s [vector] Negative ix: OK
  7830. 275.80 s [vector] Negative size: OK
  7831. 275.80 s [vector] Negative ix and size: OK
  7832. 275.80 s [vector] Too large ix: OK
  7833. 275.80 s [vector] Too large size: OK
  7834. 275.80 s [vector] Too large ix and size: OK
  7835. 275.80 s [vector] Overflow: OK
  7836. 275.80 s [vector] OutOfMemory: OK
  7837. 275.80 s [vector] take #282
  7838. 275.80 s [vector] Boxed: OK
  7839. 275.80 s [vector] Primitive: OK
  7840. 275.80 s [vector] Storable: OK
  7841. 275.80 s [vector] Unboxed: OK
  7842. 275.80 s [vector] Data.Vector
  7843. 275.80 s [vector] MonadFix: OK
  7844. 275.80 s [vector] toFromArray: OK
  7845. 275.80 s [vector] toFromArraySlice: OK
  7846. 275.80 s [vector] toFromArraySliceUnsafe: OK
  7847. 275.80 s [vector] toFromMutableArray: OK
  7848. 275.80 s [vector] Data.Vector.Mutable (Move): OK
  7849. 275.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7850. 275.80 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  7851. 275.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7852. 275.82 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  7853. 275.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7854. 275.83 s [vector] Data.Vector.Storable.Mutable (Move): OK
  7855. 275.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7856. 275.83 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.01s)
  7857. 275.83 s [vector] +++ OK, passed 100 tests.
  7858. 275.83 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
  7859. 275.83 s [vector] +++ OK, passed 100 tests.
  7860. 275.83 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  7861. 275.83 s [vector] +++ OK, passed 100 tests.
  7862. 275.83 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  7863. 275.83 s [vector] +++ OK, passed 100 tests.
  7864. 275.83 s [vector]
  7865. 275.83 s [vector] All 2808 tests passed (14.77s)
  7866. 275.84 s [vector] Test suite vector-tests-O0: PASS
  7867. 275.84 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  7868. 275.84 s [vector] Test suite vector-tests-O2: RUNNING...
  7869. 275.87 s [vector] toplevel
  7870. 275.87 s [vector] Data.Vector.Fusion.Bundle
  7871. 275.87 s [vector] fromList.toList == id: OK
  7872. 275.87 s [vector] +++ OK, passed 100 tests.
  7873. 275.87 s [vector] toList.fromList == id: OK
  7874. 275.87 s [vector] +++ OK, passed 100 tests.
  7875. 275.87 s [vector] eq: OK
  7876. 275.87 s [vector] +++ OK, passed 100 tests.
  7877. 275.87 s [vector] length: OK
  7878. 275.87 s [vector] +++ OK, passed 100 tests.
  7879. 275.87 s [vector] null: OK (0.01s)
  7880. 275.87 s [vector] +++ OK, passed 100 tests.
  7881. 275.87 s [vector] empty: OK
  7882. 275.88 s [vector] +++ OK, passed 100 tests.
  7883. 275.88 s [vector] singleton: OK
  7884. 275.88 s [vector] +++ OK, passed 100 tests.
  7885. 275.88 s [vector] replicate: OK
  7886. 275.88 s [vector] +++ OK, passed 100 tests.
  7887. 275.88 s [vector] cons: OK
  7888. 275.88 s [vector] +++ OK, passed 100 tests.
  7889. 275.88 s [vector] snoc: OK
  7890. 275.88 s [vector] +++ OK, passed 100 tests.
  7891. 275.88 s [vector] append: OK
  7892. 275.89 s [vector] +++ OK, passed 100 tests.
  7893. 275.89 s [vector] head: OK
  7894. 275.89 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7895. 275.89 s [vector] last: OK
  7896. 275.89 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7897. 275.89 s [vector] index: OK
  7898. 275.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7899. 275.89 s [vector] extract: OK
  7900. 275.89 s [vector] +++ OK, passed 100 tests.
  7901. 275.89 s [vector] init: OK
  7902. 275.89 s [vector] +++ OK, passed 100 tests; 25 discarded.
  7903. 275.89 s [vector] tail: OK
  7904. 275.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7905. 275.89 s [vector] take: OK
  7906. 275.89 s [vector] +++ OK, passed 100 tests.
  7907. 275.89 s [vector] drop: OK
  7908. 275.89 s [vector] +++ OK, passed 100 tests.
  7909. 275.90 s [vector] map: OK
  7910. 275.90 s [vector] +++ OK, passed 100 tests.
  7911. 275.90 s [vector] zipWith: OK
  7912. 275.90 s [vector] +++ OK, passed 100 tests.
  7913. 275.90 s [vector] zipWith3: OK
  7914. 275.90 s [vector] +++ OK, passed 100 tests.
  7915. 275.90 s [vector] filter: OK
  7916. 275.90 s [vector] +++ OK, passed 100 tests.
  7917. 275.90 s [vector] takeWhile: OK
  7918. 275.90 s [vector] +++ OK, passed 100 tests.
  7919. 275.90 s [vector] dropWhile: OK
  7920. 275.90 s [vector] +++ OK, passed 100 tests.
  7921. 275.90 s [vector] elem: OK
  7922. 275.90 s [vector] +++ OK, passed 100 tests.
  7923. 275.90 s [vector] notElem: OK
  7924. 275.90 s [vector] +++ OK, passed 100 tests.
  7925. 275.90 s [vector] find: OK
  7926. 275.90 s [vector] +++ OK, passed 100 tests.
  7927. 275.90 s [vector] findIndex: OK
  7928. 275.90 s [vector] +++ OK, passed 100 tests.
  7929. 275.90 s [vector] foldl: OK
  7930. 275.90 s [vector] +++ OK, passed 100 tests.
  7931. 275.91 s [vector] foldl1: OK
  7932. 275.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7933. 275.91 s [vector] foldl': OK
  7934. 275.91 s [vector] +++ OK, passed 100 tests.
  7935. 275.91 s [vector] foldl1': OK
  7936. 275.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7937. 275.91 s [vector] foldr: OK
  7938. 275.91 s [vector] +++ OK, passed 100 tests.
  7939. 275.91 s [vector] foldr1: OK
  7940. 275.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7941. 275.91 s [vector] prescanl: OK
  7942. 275.92 s [vector] +++ OK, passed 100 tests.
  7943. 275.92 s [vector] prescanl': OK
  7944. 275.92 s [vector] +++ OK, passed 100 tests.
  7945. 275.92 s [vector] postscanl: OK
  7946. 275.92 s [vector] +++ OK, passed 100 tests.
  7947. 275.92 s [vector] postscanl': OK
  7948. 275.92 s [vector] +++ OK, passed 100 tests.
  7949. 275.93 s [vector] scanl: OK
  7950. 275.93 s [vector] +++ OK, passed 100 tests.
  7951. 275.93 s [vector] scanl': OK
  7952. 275.93 s [vector] +++ OK, passed 100 tests.
  7953. 275.93 s [vector] scanl1: OK
  7954. 275.93 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7955. 275.93 s [vector] scanl1': OK
  7956. 275.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7957. 275.93 s [vector] concatMap: OK
  7958. 275.93 s [vector] +++ OK, passed 100 tests.
  7959. 275.93 s [vector] unfoldr: OK
  7960. 275.93 s [vector] +++ OK, passed 100 tests.
  7961. 275.93 s [vector] and: OK
  7962. 275.93 s [vector] +++ OK, passed 100 tests.
  7963. 275.93 s [vector] or: OK
  7964. 275.93 s [vector] +++ OK, passed 100 tests.
  7965. 275.93 s [vector] Tests.Vector.Boxed
  7966. 275.93 s [vector] Bool
  7967. 275.93 s [vector] fromList.toList == id: OK
  7968. 275.93 s [vector] +++ OK, passed 100 tests.
  7969. 275.93 s [vector] toList.fromList == id: OK
  7970. 275.93 s [vector] +++ OK, passed 100 tests.
  7971. 275.93 s [vector] unstream.stream == id: OK
  7972. 275.93 s [vector] +++ OK, passed 100 tests.
  7973. 275.93 s [vector] stream.unstream == id: OK
  7974. 275.93 s [vector] +++ OK, passed 100 tests.
  7975. 275.93 s [vector] eq: OK
  7976. 275.93 s [vector] +++ OK, passed 100 tests.
  7977. 275.93 s [vector] length: OK
  7978. 275.93 s [vector] +++ OK, passed 100 tests.
  7979. 275.93 s [vector] null: OK
  7980. 275.93 s [vector] +++ OK, passed 100 tests.
  7981. 275.93 s [vector] index: OK
  7982. 275.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7983. 275.93 s [vector] safeIndex: OK
  7984. 275.94 s [vector] +++ OK, passed 100 tests.
  7985. 275.94 s [vector] head: OK
  7986. 275.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7987. 275.94 s [vector] last: OK
  7988. 275.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7989. 275.94 s [vector] unsafeIndex: OK
  7990. 275.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7991. 275.94 s [vector] unsafeHead: OK
  7992. 275.94 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7993. 275.94 s [vector] unsafeLast: OK
  7994. 275.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7995. 275.94 s [vector] slice: OK
  7996. 275.94 s [vector] +++ OK, passed 100 tests.
  7997. 275.94 s [vector] init: OK
  7998. 275.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7999. 275.94 s [vector] tail: OK
  8000. 275.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8001. 275.94 s [vector] take: OK
  8002. 275.94 s [vector] +++ OK, passed 100 tests.
  8003. 275.94 s [vector] drop: OK
  8004. 275.94 s [vector] +++ OK, passed 100 tests.
  8005. 275.94 s [vector] splitAt: OK
  8006. 275.94 s [vector] +++ OK, passed 100 tests.
  8007. 275.95 s [vector] empty: OK
  8008. 275.95 s [vector] +++ OK, passed 100 tests.
  8009. 275.96 s [vector] singleton: OK
  8010. 275.96 s [vector] +++ OK, passed 100 tests.
  8011. 275.96 s [vector] replicate: OK
  8012. 275.96 s [vector] +++ OK, passed 100 tests.
  8013. 275.96 s [vector] generate: OK
  8014. 275.96 s [vector] +++ OK, passed 100 tests.
  8015. 275.96 s [vector] iterateN: OK
  8016. 275.96 s [vector] +++ OK, passed 100 tests.
  8017. 275.97 s [vector] iterateNM: OK (0.02s)
  8018. 275.97 s [vector] +++ OK, passed 100 tests.
  8019. 275.97 s [vector] generateM: OK (0.01s)
  8020. 275.97 s [vector] +++ OK, passed 100 tests.
  8021. 275.98 s [vector] replicateM: OK (0.01s)
  8022. 275.98 s [vector] +++ OK, passed 100 tests.
  8023. 275.98 s [vector] create: OK
  8024. 275.98 s [vector] +++ OK, passed 100 tests.
  8025. 275.98 s [vector] createT: OK
  8026. 275.98 s [vector] +++ OK, passed 100 tests.
  8027. 275.98 s [vector] unfoldr: OK
  8028. 275.98 s [vector] +++ OK, passed 100 tests.
  8029. 275.98 s [vector] unfoldrN: OK
  8030. 275.98 s [vector] +++ OK, passed 100 tests.
  8031. 275.98 s [vector] unfoldrExactN: OK
  8032. 275.98 s [vector] +++ OK, passed 100 tests.
  8033. 275.98 s [vector] unfoldrM: OK
  8034. 275.99 s [vector] +++ OK, passed 100 tests.
  8035. 275.99 s [vector] unfoldrNM: OK
  8036. 275.99 s [vector] +++ OK, passed 100 tests.
  8037. 276.01 s [vector] unfoldrExactNM: OK (0.02s)
  8038. 276.01 s [vector] +++ OK, passed 100 tests.
  8039. 276.01 s [vector] constructN: OK
  8040. 276.01 s [vector] +++ OK, passed 100 tests.
  8041. 276.02 s [vector] constructrN: OK
  8042. 276.02 s [vector] +++ OK, passed 100 tests.
  8043. 276.02 s [vector] cons: OK
  8044. 276.02 s [vector] +++ OK, passed 100 tests.
  8045. 276.02 s [vector] snoc: OK
  8046. 276.02 s [vector] +++ OK, passed 100 tests.
  8047. 276.02 s [vector] append: OK
  8048. 276.03 s [vector] +++ OK, passed 100 tests.
  8049. 276.03 s [vector] concat: OK
  8050. 276.03 s [vector] +++ OK, passed 100 tests.
  8051. 276.03 s [vector] force: OK
  8052. 276.03 s [vector] +++ OK, passed 100 tests.
  8053. 276.03 s [vector] upd: OK
  8054. 276.03 s [vector] +++ OK, passed 100 tests.
  8055. 276.03 s [vector] accum: OK
  8056. 276.03 s [vector] +++ OK, passed 100 tests.
  8057. 276.03 s [vector] reverse: OK
  8058. 276.03 s [vector] +++ OK, passed 100 tests.
  8059. 276.03 s [vector] backpermute: OK
  8060. 276.03 s [vector] +++ OK, passed 100 tests.
  8061. 276.03 s [vector] map: OK
  8062. 276.03 s [vector] +++ OK, passed 100 tests.
  8063. 276.03 s [vector] imap: OK
  8064. 276.03 s [vector] +++ OK, passed 100 tests.
  8065. 276.04 s [vector] concatMap: OK
  8066. 276.05 s [vector] +++ OK, passed 100 tests.
  8067. 276.05 s [vector] mapM: OK
  8068. 276.05 s [vector] +++ OK, passed 100 tests.
  8069. 276.05 s [vector] mapM_: OK
  8070. 276.05 s [vector] +++ OK, passed 100 tests.
  8071. 276.05 s [vector] forM: OK
  8072. 276.05 s [vector] +++ OK, passed 100 tests.
  8073. 276.06 s [vector] forM_: OK
  8074. 276.07 s [vector] +++ OK, passed 100 tests.
  8075. 276.07 s [vector] imapM: OK
  8076. 276.07 s [vector] +++ OK, passed 100 tests.
  8077. 276.07 s [vector] imapM_: OK
  8078. 276.07 s [vector] +++ OK, passed 100 tests.
  8079. 276.07 s [vector] zipWith: OK
  8080. 276.07 s [vector] +++ OK, passed 100 tests.
  8081. 276.07 s [vector] zipWith3: OK
  8082. 276.07 s [vector] +++ OK, passed 100 tests.
  8083. 276.07 s [vector] izipWith: OK
  8084. 276.07 s [vector] +++ OK, passed 100 tests.
  8085. 276.07 s [vector] izipWith3: OK
  8086. 276.07 s [vector] +++ OK, passed 100 tests.
  8087. 276.07 s [vector] izipWithM: OK
  8088. 276.08 s [vector] +++ OK, passed 100 tests.
  8089. 276.08 s [vector] izipWithM_: OK
  8090. 276.33 s [vector] +++ OK, passed 100 tests.
  8091. 276.33 s [vector] zipWithM: OK
  8092. 276.33 s [vector] +++ OK, passed 100 tests.
  8093. 276.33 s [vector] zipWithM_: OK
  8094. 276.33 s [vector] +++ OK, passed 100 tests.
  8095. 276.33 s [vector] filter: OK
  8096. 276.33 s [vector] +++ OK, passed 100 tests.
  8097. 276.33 s [vector] ifilter: OK
  8098. 276.33 s [vector] +++ OK, passed 100 tests.
  8099. 276.34 s [vector] filterM: OK (0.02s)
  8100. 276.34 s [vector] +++ OK, passed 100 tests.
  8101. 276.34 s [vector] uniq: OK
  8102. 276.34 s [vector] +++ OK, passed 100 tests.
  8103. 276.34 s [vector] mapMaybe: OK
  8104. 276.34 s [vector] +++ OK, passed 100 tests.
  8105. 276.34 s [vector] imapMaybe: OK
  8106. 276.34 s [vector] +++ OK, passed 100 tests.
  8107. 276.34 s [vector] takeWhile: OK
  8108. 276.34 s [vector] +++ OK, passed 100 tests.
  8109. 276.34 s [vector] dropWhile: OK
  8110. 276.34 s [vector] +++ OK, passed 100 tests.
  8111. 276.34 s [vector] partition: OK
  8112. 276.34 s [vector] +++ OK, passed 100 tests.
  8113. 276.34 s [vector] partitionWith: OK
  8114. 276.34 s [vector] +++ OK, passed 100 tests.
  8115. 276.34 s [vector] span: OK
  8116. 276.34 s [vector] +++ OK, passed 100 tests.
  8117. 276.34 s [vector] break: OK
  8118. 276.34 s [vector] +++ OK, passed 100 tests.
  8119. 276.34 s [vector] spanR: OK
  8120. 276.34 s [vector] +++ OK, passed 100 tests.
  8121. 276.34 s [vector] breakR: OK
  8122. 276.34 s [vector] +++ OK, passed 100 tests.
  8123. 276.34 s [vector] groupBy: OK
  8124. 276.34 s [vector] +++ OK, passed 100 tests.
  8125. 276.34 s [vector] elem: OK
  8126. 276.34 s [vector] +++ OK, passed 100 tests.
  8127. 276.34 s [vector] notElem: OK
  8128. 276.34 s [vector] +++ OK, passed 100 tests.
  8129. 276.34 s [vector] find: OK
  8130. 276.34 s [vector] +++ OK, passed 100 tests.
  8131. 276.34 s [vector] findIndex: OK
  8132. 276.34 s [vector] +++ OK, passed 100 tests.
  8133. 276.34 s [vector] findIndexR: OK
  8134. 276.34 s [vector] +++ OK, passed 100 tests.
  8135. 276.34 s [vector] findIndices: OK
  8136. 276.34 s [vector] +++ OK, passed 100 tests.
  8137. 276.34 s [vector] elemIndex: OK
  8138. 276.34 s [vector] +++ OK, passed 100 tests.
  8139. 276.34 s [vector] elemIndices: OK
  8140. 276.34 s [vector] +++ OK, passed 100 tests.
  8141. 276.34 s [vector] foldl: OK
  8142. 276.34 s [vector] +++ OK, passed 100 tests.
  8143. 276.34 s [vector] foldl1: OK
  8144. 276.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8145. 276.34 s [vector] foldl': OK
  8146. 276.34 s [vector] +++ OK, passed 100 tests.
  8147. 276.34 s [vector] foldl1': OK
  8148. 276.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8149. 276.34 s [vector] foldr: OK
  8150. 276.34 s [vector] +++ OK, passed 100 tests.
  8151. 276.34 s [vector] foldr1: OK
  8152. 276.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8153. 276.34 s [vector] foldr': OK
  8154. 276.34 s [vector] +++ OK, passed 100 tests.
  8155. 276.34 s [vector] foldr1': OK
  8156. 276.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8157. 276.34 s [vector] ifoldl: OK
  8158. 276.34 s [vector] +++ OK, passed 100 tests.
  8159. 276.34 s [vector] ifoldl': OK
  8160. 276.34 s [vector] +++ OK, passed 100 tests.
  8161. 276.34 s [vector] ifoldr: OK
  8162. 276.34 s [vector] +++ OK, passed 100 tests.
  8163. 276.34 s [vector] ifoldr': OK
  8164. 276.34 s [vector] +++ OK, passed 100 tests.
  8165. 276.34 s [vector] ifoldM: OK
  8166. 276.34 s [vector] +++ OK, passed 100 tests.
  8167. 276.34 s [vector] ifoldM': OK
  8168. 276.34 s [vector] +++ OK, passed 100 tests.
  8169. 276.34 s [vector] ifoldM_: OK (0.01s)
  8170. 276.34 s [vector] +++ OK, passed 100 tests.
  8171. 276.34 s [vector] ifoldM'_: OK
  8172. 276.34 s [vector] +++ OK, passed 100 tests.
  8173. 276.34 s [vector] all: OK
  8174. 276.34 s [vector] +++ OK, passed 100 tests.
  8175. 276.34 s [vector] any: OK
  8176. 276.34 s [vector] +++ OK, passed 100 tests.
  8177. 276.34 s [vector] prescanl: OK
  8178. 276.34 s [vector] +++ OK, passed 100 tests.
  8179. 276.34 s [vector] prescanl': OK
  8180. 276.34 s [vector] +++ OK, passed 100 tests.
  8181. 276.34 s [vector] postscanl: OK
  8182. 276.34 s [vector] +++ OK, passed 100 tests.
  8183. 276.34 s [vector] postscanl': OK
  8184. 276.34 s [vector] +++ OK, passed 100 tests.
  8185. 276.34 s [vector] scanl: OK
  8186. 276.34 s [vector] +++ OK, passed 100 tests.
  8187. 276.34 s [vector] scanl': OK
  8188. 276.34 s [vector] +++ OK, passed 100 tests.
  8189. 276.34 s [vector] scanl1: OK
  8190. 276.34 s [vector] +++ OK, passed 100 tests.
  8191. 276.34 s [vector] scanl1': OK
  8192. 276.34 s [vector] +++ OK, passed 100 tests.
  8193. 276.34 s [vector] iscanl: OK
  8194. 276.34 s [vector] +++ OK, passed 100 tests.
  8195. 276.34 s [vector] iscanl': OK
  8196. 276.34 s [vector] +++ OK, passed 100 tests.
  8197. 276.34 s [vector] prescanr: OK
  8198. 276.34 s [vector] +++ OK, passed 100 tests.
  8199. 276.34 s [vector] prescanr': OK
  8200. 276.34 s [vector] +++ OK, passed 100 tests.
  8201. 276.34 s [vector] postscanr: OK
  8202. 276.34 s [vector] +++ OK, passed 100 tests.
  8203. 276.34 s [vector] postscanr': OK
  8204. 276.34 s [vector] +++ OK, passed 100 tests.
  8205. 276.34 s [vector] scanr: OK
  8206. 276.34 s [vector] +++ OK, passed 100 tests.
  8207. 276.34 s [vector] scanr': OK
  8208. 276.34 s [vector] +++ OK, passed 100 tests.
  8209. 276.34 s [vector] scanr1: OK
  8210. 276.34 s [vector] +++ OK, passed 100 tests.
  8211. 276.34 s [vector] scanr1': OK
  8212. 276.34 s [vector] +++ OK, passed 100 tests.
  8213. 276.34 s [vector] iscanr: OK
  8214. 276.34 s [vector] +++ OK, passed 100 tests.
  8215. 276.34 s [vector] iscanr': OK
  8216. 276.34 s [vector] +++ OK, passed 100 tests.
  8217. 276.34 s [vector] mut_read: OK
  8218. 276.34 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8219. 276.34 s [vector] mut_write: OK
  8220. 276.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8221. 276.34 s [vector] mut_modify: OK
  8222. 276.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8223. 276.34 s [vector] mut_generate: OK
  8224. 276.34 s [vector] +++ OK, passed 100 tests.
  8225. 276.34 s [vector] mut_generateM: OK
  8226. 276.34 s [vector] +++ OK, passed 100 tests.
  8227. 276.34 s [vector] mut_mapM_: OK (0.01s)
  8228. 276.34 s [vector] +++ OK, passed 100 tests.
  8229. 276.34 s [vector] mut_imapM_: OK (0.01s)
  8230. 276.34 s [vector] +++ OK, passed 100 tests.
  8231. 276.34 s [vector] mut_forM_: OK
  8232. 276.34 s [vector] +++ OK, passed 100 tests.
  8233. 276.34 s [vector] mut_iforM_: OK (0.01s)
  8234. 276.34 s [vector] +++ OK, passed 100 tests.
  8235. 276.34 s [vector] mut_foldr: OK
  8236. 276.34 s [vector] +++ OK, passed 100 tests.
  8237. 276.34 s [vector] mut_foldr': OK
  8238. 276.34 s [vector] +++ OK, passed 100 tests.
  8239. 276.34 s [vector] mut_foldl: OK
  8240. 276.34 s [vector] +++ OK, passed 100 tests.
  8241. 276.34 s [vector] mut_foldl': OK
  8242. 276.34 s [vector] +++ OK, passed 100 tests.
  8243. 276.34 s [vector] mut_ifoldr: OK
  8244. 276.34 s [vector] +++ OK, passed 100 tests.
  8245. 276.34 s [vector] mut_ifoldr': OK
  8246. 276.34 s [vector] +++ OK, passed 100 tests.
  8247. 276.34 s [vector] mut_ifoldl: OK
  8248. 276.34 s [vector] +++ OK, passed 100 tests.
  8249. 276.34 s [vector] mut_ifoldl': OK
  8250. 276.34 s [vector] +++ OK, passed 100 tests.
  8251. 276.34 s [vector] mut_foldM: OK
  8252. 276.34 s [vector] +++ OK, passed 100 tests.
  8253. 276.34 s [vector] mut_foldM': OK
  8254. 276.34 s [vector] +++ OK, passed 100 tests.
  8255. 276.34 s [vector] mut_foldrM: OK
  8256. 276.34 s [vector] +++ OK, passed 100 tests.
  8257. 276.34 s [vector] mut_foldrM': OK
  8258. 276.34 s [vector] +++ OK, passed 100 tests.
  8259. 276.34 s [vector] mut_ifoldM: OK
  8260. 276.34 s [vector] +++ OK, passed 100 tests.
  8261. 276.34 s [vector] mut_ifoldM': OK
  8262. 276.34 s [vector] +++ OK, passed 100 tests.
  8263. 276.34 s [vector] mut_ifoldrM: OK
  8264. 276.34 s [vector] +++ OK, passed 100 tests.
  8265. 276.34 s [vector] mut_ifoldrM': OK
  8266. 276.34 s [vector] +++ OK, passed 100 tests.
  8267. 276.34 s [vector] compare: OK
  8268. 276.34 s [vector] +++ OK, passed 100 tests.
  8269. 276.34 s [vector] maximum: OK
  8270. 276.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8271. 276.34 s [vector] minimum: OK
  8272. 276.34 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8273. 276.34 s [vector] minIndex: OK
  8274. 276.34 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8275. 276.34 s [vector] maxIndex: OK
  8276. 276.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8277. 276.34 s [vector] maximumBy: OK
  8278. 276.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8279. 276.34 s [vector] minimumBy: OK
  8280. 276.34 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8281. 276.34 s [vector] maximumOn: OK
  8282. 276.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8283. 276.34 s [vector] minimumOn: OK
  8284. 276.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8285. 276.34 s [vector] maxIndexBy: OK
  8286. 276.34 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8287. 276.34 s [vector] minIndexBy: OK
  8288. 276.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8289. 276.34 s [vector] ListFirstMaxIndexWins: OK
  8290. 276.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8291. 276.34 s [vector] FalseListFirstMaxIndexWins: OK
  8292. 276.34 s [vector] +++ OK, failed as expected. (after 1 test):
  8293. 276.34 s [vector] Exception:
  8294. 276.34 s [vector] Prelude.foldr1: empty list
  8295. 276.34 s [vector] CallStack (from HasCallStack):
  8296. 276.34 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8297. 276.34 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8298. 276.34 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8299. 276.34 s [vector] []
  8300. 276.34 s [vector] zip: OK
  8301. 276.34 s [vector] +++ OK, passed 100 tests.
  8302. 276.34 s [vector] zip3: OK
  8303. 276.34 s [vector] +++ OK, passed 100 tests.
  8304. 276.34 s [vector] unzip: OK
  8305. 276.34 s [vector] +++ OK, passed 100 tests.
  8306. 276.34 s [vector] unzip3: OK
  8307. 276.34 s [vector] +++ OK, passed 100 tests.
  8308. 276.34 s [vector] indexed: OK
  8309. 276.34 s [vector] +++ OK, passed 100 tests.
  8310. 276.34 s [vector] update: OK
  8311. 276.34 s [vector] +++ OK, passed 100 tests.
  8312. 276.34 s [vector] concat: OK
  8313. 276.34 s [vector] +++ OK, passed 100 tests.
  8314. 276.34 s [vector] mempty: OK
  8315. 276.34 s [vector] +++ OK, passed 100 tests.
  8316. 276.34 s [vector] mappend: OK
  8317. 276.34 s [vector] +++ OK, passed 100 tests.
  8318. 276.34 s [vector] mconcat: OK
  8319. 276.34 s [vector] +++ OK, passed 100 tests.
  8320. 276.34 s [vector] fmap: OK
  8321. 276.34 s [vector] +++ OK, passed 100 tests.
  8322. 276.34 s [vector] return: OK
  8323. 276.34 s [vector] +++ OK, passed 100 tests.
  8324. 276.34 s [vector] bind: OK
  8325. 276.34 s [vector] +++ OK, passed 100 tests.
  8326. 276.34 s [vector] mzip: OK
  8327. 276.34 s [vector] +++ OK, passed 100 tests.
  8328. 276.34 s [vector] munzip: OK
  8329. 276.34 s [vector] +++ OK, passed 100 tests.
  8330. 276.34 s [vector] applicative_pure: OK
  8331. 276.34 s [vector] +++ OK, passed 100 tests.
  8332. 276.34 s [vector] applicative_appl: OK (0.01s)
  8333. 276.34 s [vector] +++ OK, passed 100 tests.
  8334. 276.34 s [vector] alternative_empty: OK
  8335. 276.34 s [vector] +++ OK, passed 100 tests.
  8336. 276.34 s [vector] alternative_or: OK
  8337. 276.34 s [vector] +++ OK, passed 100 tests.
  8338. 276.35 s [vector] sequence: OK (0.03s)
  8339. 276.35 s [vector] +++ OK, passed 100 tests.
  8340. 276.35 s [vector] sequence_: OK
  8341. 276.35 s [vector] +++ OK, passed 100 tests.
  8342. 276.35 s [vector] glength: OK
  8343. 276.35 s [vector] +++ OK, passed 100 tests.
  8344. 276.35 s [vector] and: OK
  8345. 276.35 s [vector] +++ OK, passed 100 tests.
  8346. 276.35 s [vector] or: OK
  8347. 276.35 s [vector] +++ OK, passed 100 tests.
  8348. 276.35 s [vector] Int
  8349. 276.35 s [vector] fromList.toList == id: OK
  8350. 276.35 s [vector] +++ OK, passed 100 tests.
  8351. 276.35 s [vector] toList.fromList == id: OK
  8352. 276.35 s [vector] +++ OK, passed 100 tests.
  8353. 276.35 s [vector] unstream.stream == id: OK
  8354. 276.35 s [vector] +++ OK, passed 100 tests.
  8355. 276.35 s [vector] stream.unstream == id: OK
  8356. 276.35 s [vector] +++ OK, passed 100 tests.
  8357. 276.35 s [vector] eq: OK
  8358. 276.35 s [vector] +++ OK, passed 100 tests.
  8359. 276.35 s [vector] length: OK
  8360. 276.35 s [vector] +++ OK, passed 100 tests.
  8361. 276.35 s [vector] null: OK
  8362. 276.35 s [vector] +++ OK, passed 100 tests.
  8363. 276.35 s [vector] index: OK
  8364. 276.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8365. 276.35 s [vector] safeIndex: OK
  8366. 276.35 s [vector] +++ OK, passed 100 tests.
  8367. 276.35 s [vector] head: OK
  8368. 276.35 s [vector] +++ OK, passed 100 tests; 25 discarded.
  8369. 276.35 s [vector] last: OK
  8370. 276.35 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8371. 276.35 s [vector] unsafeIndex: OK
  8372. 276.35 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8373. 276.35 s [vector] unsafeHead: OK
  8374. 276.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8375. 276.35 s [vector] unsafeLast: OK
  8376. 276.35 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8377. 276.35 s [vector] slice: OK
  8378. 276.35 s [vector] +++ OK, passed 100 tests.
  8379. 276.35 s [vector] init: OK
  8380. 276.36 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8381. 276.36 s [vector] tail: OK
  8382. 276.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8383. 276.36 s [vector] take: OK
  8384. 276.36 s [vector] +++ OK, passed 100 tests.
  8385. 276.36 s [vector] drop: OK
  8386. 276.36 s [vector] +++ OK, passed 100 tests.
  8387. 276.36 s [vector] splitAt: OK
  8388. 276.36 s [vector] +++ OK, passed 100 tests.
  8389. 276.36 s [vector] empty: OK
  8390. 276.36 s [vector] +++ OK, passed 100 tests.
  8391. 276.36 s [vector] singleton: OK
  8392. 276.36 s [vector] +++ OK, passed 100 tests.
  8393. 276.36 s [vector] replicate: OK
  8394. 276.36 s [vector] +++ OK, passed 100 tests.
  8395. 276.36 s [vector] generate: OK
  8396. 276.36 s [vector] +++ OK, passed 100 tests.
  8397. 276.36 s [vector] iterateN: OK
  8398. 276.37 s [vector] +++ OK, passed 100 tests.
  8399. 276.39 s [vector] iterateNM: OK (0.03s)
  8400. 276.39 s [vector] +++ OK, passed 100 tests.
  8401. 276.41 s [vector] generateM: OK (0.02s)
  8402. 276.41 s [vector] +++ OK, passed 100 tests.
  8403. 276.41 s [vector] replicateM: OK
  8404. 276.41 s [vector] +++ OK, passed 100 tests.
  8405. 276.41 s [vector] create: OK
  8406. 276.42 s [vector] +++ OK, passed 100 tests.
  8407. 276.42 s [vector] createT: OK
  8408. 276.42 s [vector] +++ OK, passed 100 tests.
  8409. 276.42 s [vector] unfoldr: OK
  8410. 276.42 s [vector] +++ OK, passed 100 tests.
  8411. 276.42 s [vector] unfoldrN: OK
  8412. 276.42 s [vector] +++ OK, passed 100 tests.
  8413. 276.42 s [vector] unfoldrExactN: OK
  8414. 276.42 s [vector] +++ OK, passed 100 tests.
  8415. 276.42 s [vector] unfoldrM: OK
  8416. 276.42 s [vector] +++ OK, passed 100 tests.
  8417. 276.43 s [vector] unfoldrNM: OK
  8418. 276.43 s [vector] +++ OK, passed 100 tests.
  8419. 276.44 s [vector] unfoldrExactNM: OK (0.01s)
  8420. 276.44 s [vector] +++ OK, passed 100 tests.
  8421. 276.44 s [vector] constructN: OK
  8422. 276.44 s [vector] +++ OK, passed 100 tests.
  8423. 276.44 s [vector] constructrN: OK
  8424. 276.44 s [vector] +++ OK, passed 100 tests.
  8425. 276.44 s [vector] cons: OK
  8426. 276.44 s [vector] +++ OK, passed 100 tests.
  8427. 276.44 s [vector] snoc: OK
  8428. 276.44 s [vector] +++ OK, passed 100 tests.
  8429. 276.45 s [vector] append: OK
  8430. 276.45 s [vector] +++ OK, passed 100 tests.
  8431. 276.45 s [vector] concat: OK (0.01s)
  8432. 276.45 s [vector] +++ OK, passed 100 tests.
  8433. 276.45 s [vector] force: OK
  8434. 276.45 s [vector] +++ OK, passed 100 tests.
  8435. 276.45 s [vector] upd: OK
  8436. 276.45 s [vector] +++ OK, passed 100 tests.
  8437. 276.46 s [vector] accum: OK
  8438. 276.46 s [vector] +++ OK, passed 100 tests.
  8439. 276.46 s [vector] reverse: OK
  8440. 276.46 s [vector] +++ OK, passed 100 tests.
  8441. 276.46 s [vector] backpermute: OK
  8442. 276.46 s [vector] +++ OK, passed 100 tests.
  8443. 276.46 s [vector] map: OK
  8444. 276.46 s [vector] +++ OK, passed 100 tests.
  8445. 276.46 s [vector] imap: OK
  8446. 276.46 s [vector] +++ OK, passed 100 tests.
  8447. 276.47 s [vector] concatMap: OK
  8448. 276.47 s [vector] +++ OK, passed 100 tests.
  8449. 276.47 s [vector] mapM: OK
  8450. 276.47 s [vector] +++ OK, passed 100 tests.
  8451. 276.49 s [vector] mapM_: OK (0.02s)
  8452. 276.49 s [vector] +++ OK, passed 100 tests.
  8453. 276.49 s [vector] forM: OK
  8454. 276.49 s [vector] +++ OK, passed 100 tests.
  8455. 276.51 s [vector] forM_: OK (0.02s)
  8456. 276.51 s [vector] +++ OK, passed 100 tests.
  8457. 276.51 s [vector] imapM: OK
  8458. 276.51 s [vector] +++ OK, passed 100 tests.
  8459. 276.53 s [vector] imapM_: OK (0.02s)
  8460. 276.53 s [vector] +++ OK, passed 100 tests.
  8461. 276.53 s [vector] zipWith: OK
  8462. 276.53 s [vector] +++ OK, passed 100 tests.
  8463. 276.53 s [vector] zipWith3: OK
  8464. 276.53 s [vector] +++ OK, passed 100 tests.
  8465. 276.54 s [vector] izipWith: OK
  8466. 276.54 s [vector] +++ OK, passed 100 tests.
  8467. 276.55 s [vector] izipWith3: OK
  8468. 276.55 s [vector] +++ OK, passed 100 tests.
  8469. 276.55 s [vector] izipWithM: OK
  8470. 276.55 s [vector] +++ OK, passed 100 tests.
  8471. 276.55 s [vector] izipWithM_: OK (0.01s)
  8472. 276.55 s [vector] +++ OK, passed 100 tests.
  8473. 276.55 s [vector] zipWithM: OK
  8474. 276.55 s [vector] +++ OK, passed 100 tests.
  8475. 276.56 s [vector] zipWithM_: OK
  8476. 276.56 s [vector] +++ OK, passed 100 tests.
  8477. 276.57 s [vector] filter: OK
  8478. 276.57 s [vector] +++ OK, passed 100 tests.
  8479. 276.57 s [vector] ifilter: OK
  8480. 276.57 s [vector] +++ OK, passed 100 tests.
  8481. 276.60 s [vector] filterM: OK (0.03s)
  8482. 276.60 s [vector] +++ OK, passed 100 tests.
  8483. 276.60 s [vector] uniq: OK
  8484. 276.60 s [vector] +++ OK, passed 100 tests.
  8485. 276.61 s [vector] mapMaybe: OK
  8486. 276.61 s [vector] +++ OK, passed 100 tests.
  8487. 276.61 s [vector] imapMaybe: OK
  8488. 276.61 s [vector] +++ OK, passed 100 tests.
  8489. 276.61 s [vector] takeWhile: OK
  8490. 276.61 s [vector] +++ OK, passed 100 tests.
  8491. 276.61 s [vector] dropWhile: OK
  8492. 276.61 s [vector] +++ OK, passed 100 tests.
  8493. 276.61 s [vector] partition: OK
  8494. 276.61 s [vector] +++ OK, passed 100 tests.
  8495. 276.61 s [vector] partitionWith: OK
  8496. 276.61 s [vector] +++ OK, passed 100 tests.
  8497. 276.61 s [vector] span: OK
  8498. 276.61 s [vector] +++ OK, passed 100 tests.
  8499. 276.61 s [vector] break: OK
  8500. 276.61 s [vector] +++ OK, passed 100 tests.
  8501. 276.61 s [vector] spanR: OK
  8502. 276.61 s [vector] +++ OK, passed 100 tests.
  8503. 276.61 s [vector] breakR: OK
  8504. 276.61 s [vector] +++ OK, passed 100 tests.
  8505. 276.61 s [vector] groupBy: OK
  8506. 276.61 s [vector] +++ OK, passed 100 tests.
  8507. 276.61 s [vector] elem: OK
  8508. 276.62 s [vector] +++ OK, passed 100 tests.
  8509. 276.62 s [vector] notElem: OK
  8510. 276.62 s [vector] +++ OK, passed 100 tests.
  8511. 276.62 s [vector] find: OK
  8512. 276.62 s [vector] +++ OK, passed 100 tests.
  8513. 276.62 s [vector] findIndex: OK
  8514. 276.62 s [vector] +++ OK, passed 100 tests.
  8515. 276.62 s [vector] findIndexR: OK
  8516. 276.62 s [vector] +++ OK, passed 100 tests.
  8517. 276.62 s [vector] findIndices: OK
  8518. 276.62 s [vector] +++ OK, passed 100 tests.
  8519. 276.62 s [vector] elemIndex: OK
  8520. 276.62 s [vector] +++ OK, passed 100 tests.
  8521. 276.62 s [vector] elemIndices: OK
  8522. 276.62 s [vector] +++ OK, passed 100 tests.
  8523. 276.62 s [vector] foldl: OK
  8524. 276.62 s [vector] +++ OK, passed 100 tests.
  8525. 276.62 s [vector] foldl1: OK
  8526. 276.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8527. 276.63 s [vector] foldl': OK
  8528. 276.63 s [vector] +++ OK, passed 100 tests.
  8529. 276.63 s [vector] foldl1': OK
  8530. 276.63 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8531. 276.63 s [vector] foldr: OK
  8532. 276.63 s [vector] +++ OK, passed 100 tests.
  8533. 276.63 s [vector] foldr1: OK
  8534. 276.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8535. 276.64 s [vector] foldr': OK
  8536. 276.64 s [vector] +++ OK, passed 100 tests.
  8537. 276.64 s [vector] foldr1': OK
  8538. 276.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8539. 276.65 s [vector] ifoldl: OK
  8540. 276.65 s [vector] +++ OK, passed 100 tests.
  8541. 276.65 s [vector] ifoldl': OK
  8542. 276.66 s [vector] +++ OK, passed 100 tests.
  8543. 276.67 s [vector] ifoldr: OK
  8544. 276.67 s [vector] +++ OK, passed 100 tests.
  8545. 276.67 s [vector] ifoldr': OK
  8546. 276.67 s [vector] +++ OK, passed 100 tests.
  8547. 276.67 s [vector] ifoldM: OK
  8548. 276.67 s [vector] +++ OK, passed 100 tests.
  8549. 276.67 s [vector] ifoldM': OK
  8550. 276.69 s [vector] +++ OK, passed 100 tests.
  8551. 276.69 s [vector] ifoldM_: OK (0.01s)
  8552. 276.69 s [vector] +++ OK, passed 100 tests.
  8553. 276.69 s [vector] ifoldM'_: OK (0.02s)
  8554. 276.69 s [vector] +++ OK, passed 100 tests.
  8555. 276.69 s [vector] all: OK
  8556. 276.69 s [vector] +++ OK, passed 100 tests.
  8557. 276.69 s [vector] any: OK
  8558. 276.69 s [vector] +++ OK, passed 100 tests.
  8559. 276.69 s [vector] prescanl: OK
  8560. 276.69 s [vector] +++ OK, passed 100 tests.
  8561. 276.70 s [vector] prescanl': OK
  8562. 276.70 s [vector] +++ OK, passed 100 tests.
  8563. 276.70 s [vector] postscanl: OK
  8564. 276.70 s [vector] +++ OK, passed 100 tests.
  8565. 276.70 s [vector] postscanl': OK
  8566. 276.70 s [vector] +++ OK, passed 100 tests.
  8567. 276.71 s [vector] scanl: OK
  8568. 276.71 s [vector] +++ OK, passed 100 tests.
  8569. 276.71 s [vector] scanl': OK
  8570. 276.71 s [vector] +++ OK, passed 100 tests.
  8571. 276.72 s [vector] scanl1: OK
  8572. 276.72 s [vector] +++ OK, passed 100 tests.
  8573. 276.72 s [vector] scanl1': OK
  8574. 276.72 s [vector] +++ OK, passed 100 tests.
  8575. 276.72 s [vector] iscanl: OK
  8576. 276.72 s [vector] +++ OK, passed 100 tests.
  8577. 276.72 s [vector] iscanl': OK
  8578. 276.73 s [vector] +++ OK, passed 100 tests.
  8579. 276.73 s [vector] prescanr: OK
  8580. 276.73 s [vector] +++ OK, passed 100 tests.
  8581. 276.73 s [vector] prescanr': OK
  8582. 276.73 s [vector] +++ OK, passed 100 tests.
  8583. 276.74 s [vector] postscanr: OK
  8584. 276.74 s [vector] +++ OK, passed 100 tests.
  8585. 276.74 s [vector] postscanr': OK
  8586. 276.74 s [vector] +++ OK, passed 100 tests.
  8587. 276.74 s [vector] scanr: OK
  8588. 276.74 s [vector] +++ OK, passed 100 tests.
  8589. 276.74 s [vector] scanr': OK
  8590. 276.74 s [vector] +++ OK, passed 100 tests.
  8591. 276.74 s [vector] scanr1: OK
  8592. 276.74 s [vector] +++ OK, passed 100 tests.
  8593. 276.74 s [vector] scanr1': OK
  8594. 276.75 s [vector] +++ OK, passed 100 tests.
  8595. 276.75 s [vector] iscanr: OK
  8596. 276.75 s [vector] +++ OK, passed 100 tests.
  8597. 276.75 s [vector] iscanr': OK
  8598. 276.75 s [vector] +++ OK, passed 100 tests.
  8599. 276.75 s [vector] mut_read: OK
  8600. 276.75 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8601. 276.75 s [vector] mut_write: OK
  8602. 276.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8603. 276.75 s [vector] mut_modify: OK
  8604. 276.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8605. 276.76 s [vector] mut_generate: OK
  8606. 276.76 s [vector] +++ OK, passed 100 tests.
  8607. 276.76 s [vector] mut_generateM: OK
  8608. 276.77 s [vector] +++ OK, passed 100 tests.
  8609. 276.79 s [vector] mut_mapM_: OK (0.01s)
  8610. 276.79 s [vector] +++ OK, passed 100 tests.
  8611. 276.79 s [vector] mut_imapM_: OK (0.01s)
  8612. 276.79 s [vector] +++ OK, passed 100 tests.
  8613. 276.81 s [vector] mut_forM_: OK (0.02s)
  8614. 276.81 s [vector] +++ OK, passed 100 tests.
  8615. 276.82 s [vector] mut_iforM_: OK (0.01s)
  8616. 276.82 s [vector] +++ OK, passed 100 tests.
  8617. 276.82 s [vector] mut_foldr: OK
  8618. 276.82 s [vector] +++ OK, passed 100 tests.
  8619. 276.82 s [vector] mut_foldr': OK
  8620. 276.82 s [vector] +++ OK, passed 100 tests.
  8621. 276.83 s [vector] mut_foldl: OK
  8622. 276.83 s [vector] +++ OK, passed 100 tests.
  8623. 276.83 s [vector] mut_foldl': OK
  8624. 276.83 s [vector] +++ OK, passed 100 tests.
  8625. 276.83 s [vector] mut_ifoldr: OK
  8626. 276.83 s [vector] +++ OK, passed 100 tests.
  8627. 276.84 s [vector] mut_ifoldr': OK
  8628. 276.84 s [vector] +++ OK, passed 100 tests.
  8629. 276.84 s [vector] mut_ifoldl: OK
  8630. 276.84 s [vector] +++ OK, passed 100 tests.
  8631. 276.84 s [vector] mut_ifoldl': OK
  8632. 276.85 s [vector] +++ OK, passed 100 tests.
  8633. 276.85 s [vector] mut_foldM: OK
  8634. 276.85 s [vector] +++ OK, passed 100 tests.
  8635. 276.85 s [vector] mut_foldM': OK
  8636. 276.85 s [vector] +++ OK, passed 100 tests.
  8637. 276.85 s [vector] mut_foldrM: OK
  8638. 276.86 s [vector] +++ OK, passed 100 tests.
  8639. 276.86 s [vector] mut_foldrM': OK
  8640. 276.86 s [vector] +++ OK, passed 100 tests.
  8641. 276.86 s [vector] mut_ifoldM: OK
  8642. 276.86 s [vector] +++ OK, passed 100 tests.
  8643. 276.87 s [vector] mut_ifoldM': OK
  8644. 276.87 s [vector] +++ OK, passed 100 tests.
  8645. 276.87 s [vector] mut_ifoldrM: OK
  8646. 276.87 s [vector] +++ OK, passed 100 tests.
  8647. 276.87 s [vector] mut_ifoldrM': OK
  8648. 276.87 s [vector] +++ OK, passed 100 tests.
  8649. 276.87 s [vector] compare: OK
  8650. 276.87 s [vector] +++ OK, passed 100 tests.
  8651. 276.87 s [vector] maximum: OK
  8652. 276.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8653. 276.87 s [vector] minimum: OK
  8654. 276.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8655. 276.87 s [vector] minIndex: OK
  8656. 276.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8657. 276.87 s [vector] maxIndex: OK
  8658. 276.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8659. 276.87 s [vector] maximumBy: OK
  8660. 276.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8661. 276.87 s [vector] minimumBy: OK
  8662. 276.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8663. 276.87 s [vector] maximumOn: OK
  8664. 276.87 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8665. 276.87 s [vector] minimumOn: OK
  8666. 276.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8667. 276.87 s [vector] maxIndexBy: OK
  8668. 276.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8669. 276.87 s [vector] minIndexBy: OK
  8670. 276.87 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8671. 276.87 s [vector] ListFirstMaxIndexWins: OK
  8672. 276.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8673. 276.87 s [vector] FalseListFirstMaxIndexWins: OK
  8674. 276.87 s [vector] +++ OK, failed as expected. (after 1 test):
  8675. 276.87 s [vector] Exception:
  8676. 276.87 s [vector] Prelude.foldr1: empty list
  8677. 276.87 s [vector] CallStack (from HasCallStack):
  8678. 276.87 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8679. 276.87 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8680. 276.87 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8681. 276.87 s [vector] []
  8682. 276.87 s [vector] zip: OK
  8683. 276.87 s [vector] +++ OK, passed 100 tests.
  8684. 276.87 s [vector] zip3: OK
  8685. 276.87 s [vector] +++ OK, passed 100 tests.
  8686. 276.87 s [vector] unzip: OK
  8687. 276.87 s [vector] +++ OK, passed 100 tests.
  8688. 276.87 s [vector] unzip3: OK
  8689. 276.87 s [vector] +++ OK, passed 100 tests.
  8690. 276.88 s [vector] indexed: OK
  8691. 276.88 s [vector] +++ OK, passed 100 tests.
  8692. 276.88 s [vector] update: OK
  8693. 276.88 s [vector] +++ OK, passed 100 tests.
  8694. 276.88 s [vector] concat: OK
  8695. 276.88 s [vector] +++ OK, passed 100 tests.
  8696. 276.88 s [vector] mempty: OK
  8697. 276.88 s [vector] +++ OK, passed 100 tests.
  8698. 276.88 s [vector] mappend: OK
  8699. 276.89 s [vector] +++ OK, passed 100 tests.
  8700. 276.89 s [vector] mconcat: OK
  8701. 276.89 s [vector] +++ OK, passed 100 tests.
  8702. 276.89 s [vector] fmap: OK
  8703. 276.89 s [vector] +++ OK, passed 100 tests.
  8704. 276.89 s [vector] return: OK
  8705. 276.89 s [vector] +++ OK, passed 100 tests.
  8706. 276.91 s [vector] bind: OK
  8707. 276.91 s [vector] +++ OK, passed 100 tests.
  8708. 276.91 s [vector] mzip: OK
  8709. 276.91 s [vector] +++ OK, passed 100 tests.
  8710. 276.91 s [vector] munzip: OK
  8711. 276.91 s [vector] +++ OK, passed 100 tests.
  8712. 276.91 s [vector] applicative_pure: OK
  8713. 276.91 s [vector] +++ OK, passed 100 tests.
  8714. 276.93 s [vector] applicative_appl: OK (0.02s)
  8715. 276.93 s [vector] +++ OK, passed 100 tests.
  8716. 276.95 s [vector] alternative_empty: OK
  8717. 276.95 s [vector] +++ OK, passed 100 tests.
  8718. 276.95 s [vector] alternative_or: OK
  8719. 276.95 s [vector] +++ OK, passed 100 tests.
  8720. 276.99 s [vector] sequence: OK (0.04s)
  8721. 276.99 s [vector] +++ OK, passed 100 tests.
  8722. 276.99 s [vector] sequence_: OK (0.02s)
  8723. 276.99 s [vector] +++ OK, passed 100 tests.
  8724. 276.99 s [vector] glength: OK
  8725. 276.99 s [vector] +++ OK, passed 100 tests.
  8726. 276.99 s [vector] sum: OK
  8727. 276.99 s [vector] +++ OK, passed 100 tests.
  8728. 276.99 s [vector] product: OK
  8729. 276.99 s [vector] +++ OK, passed 100 tests.
  8730. 276.99 s [vector] enumFromN: OK
  8731. 276.99 s [vector] +++ OK, passed 100 tests.
  8732. 276.99 s [vector] enumFromThenN: OK
  8733. 276.99 s [vector] +++ OK, passed 100 tests.
  8734. 277.00 s [vector] enumFromTo: OK
  8735. 277.00 s [vector] +++ OK, passed 100 tests.
  8736. 277.00 s [vector] enumFromThenTo: OK
  8737. 277.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8738. 277.00 s [vector] unstream
  8739. 277.00 s [vector] unstream == vunstream (exact): OK
  8740. 277.00 s [vector] +++ OK, passed 100 tests.
  8741. 277.00 s [vector] unstream == vunstream (unknown): OK
  8742. 277.00 s [vector] +++ OK, passed 100 tests.
  8743. 277.00 s [vector] unstreamR ~= vunstream (exact): OK
  8744. 277.00 s [vector] +++ OK, passed 100 tests.
  8745. 277.00 s [vector] unstreamR ~= vunstream (unknown): OK
  8746. 277.00 s [vector] +++ OK, passed 100 tests.
  8747. 277.00 s [vector] Tests.Vector.Primitive
  8748. 277.00 s [vector] Int
  8749. 277.00 s [vector] fromList.toList == id: OK
  8750. 277.01 s [vector] +++ OK, passed 100 tests.
  8751. 277.01 s [vector] toList.fromList == id: OK
  8752. 277.01 s [vector] +++ OK, passed 100 tests.
  8753. 277.01 s [vector] unstream.stream == id: OK
  8754. 277.01 s [vector] +++ OK, passed 100 tests.
  8755. 277.01 s [vector] stream.unstream == id: OK
  8756. 277.01 s [vector] +++ OK, passed 100 tests.
  8757. 277.01 s [vector] eq: OK
  8758. 277.01 s [vector] +++ OK, passed 100 tests.
  8759. 277.01 s [vector] length: OK
  8760. 277.01 s [vector] +++ OK, passed 100 tests.
  8761. 277.01 s [vector] null: OK
  8762. 277.01 s [vector] +++ OK, passed 100 tests.
  8763. 277.01 s [vector] index: OK
  8764. 277.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8765. 277.01 s [vector] safeIndex: OK
  8766. 277.01 s [vector] +++ OK, passed 100 tests.
  8767. 277.01 s [vector] head: OK
  8768. 277.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8769. 277.01 s [vector] last: OK
  8770. 277.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8771. 277.01 s [vector] unsafeIndex: OK
  8772. 277.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8773. 277.01 s [vector] unsafeHead: OK
  8774. 277.01 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8775. 277.01 s [vector] unsafeLast: OK
  8776. 277.01 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8777. 277.01 s [vector] slice: OK
  8778. 277.01 s [vector] +++ OK, passed 100 tests.
  8779. 277.01 s [vector] init: OK
  8780. 277.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8781. 277.01 s [vector] tail: OK
  8782. 277.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8783. 277.02 s [vector] take: OK
  8784. 277.02 s [vector] +++ OK, passed 100 tests.
  8785. 277.02 s [vector] drop: OK
  8786. 277.02 s [vector] +++ OK, passed 100 tests.
  8787. 277.02 s [vector] splitAt: OK
  8788. 277.02 s [vector] +++ OK, passed 100 tests.
  8789. 277.02 s [vector] empty: OK
  8790. 277.02 s [vector] +++ OK, passed 100 tests.
  8791. 277.02 s [vector] singleton: OK
  8792. 277.02 s [vector] +++ OK, passed 100 tests.
  8793. 277.02 s [vector] replicate: OK
  8794. 277.02 s [vector] +++ OK, passed 100 tests.
  8795. 277.02 s [vector] generate: OK
  8796. 277.02 s [vector] +++ OK, passed 100 tests.
  8797. 277.02 s [vector] iterateN: OK
  8798. 277.02 s [vector] +++ OK, passed 100 tests.
  8799. 277.03 s [vector] iterateNM: OK
  8800. 277.03 s [vector] +++ OK, passed 100 tests.
  8801. 277.05 s [vector] generateM: OK (0.02s)
  8802. 277.05 s [vector] +++ OK, passed 100 tests.
  8803. 277.06 s [vector] replicateM: OK (0.01s)
  8804. 277.06 s [vector] +++ OK, passed 100 tests.
  8805. 277.06 s [vector] create: OK
  8806. 277.06 s [vector] +++ OK, passed 100 tests.
  8807. 277.06 s [vector] createT: OK
  8808. 277.06 s [vector] +++ OK, passed 100 tests.
  8809. 277.06 s [vector] unfoldr: OK
  8810. 277.06 s [vector] +++ OK, passed 100 tests.
  8811. 277.06 s [vector] unfoldrN: OK
  8812. 277.06 s [vector] +++ OK, passed 100 tests.
  8813. 277.06 s [vector] unfoldrExactN: OK
  8814. 277.06 s [vector] +++ OK, passed 100 tests.
  8815. 277.06 s [vector] unfoldrM: OK
  8816. 277.06 s [vector] +++ OK, passed 100 tests.
  8817. 277.06 s [vector] unfoldrNM: OK
  8818. 277.07 s [vector] +++ OK, passed 100 tests.
  8819. 277.08 s [vector] unfoldrExactNM: OK (0.01s)
  8820. 277.08 s [vector] +++ OK, passed 100 tests.
  8821. 277.08 s [vector] constructN: OK
  8822. 277.08 s [vector] +++ OK, passed 100 tests.
  8823. 277.08 s [vector] constructrN: OK
  8824. 277.08 s [vector] +++ OK, passed 100 tests.
  8825. 277.08 s [vector] cons: OK
  8826. 277.08 s [vector] +++ OK, passed 100 tests.
  8827. 277.08 s [vector] snoc: OK
  8828. 277.08 s [vector] +++ OK, passed 100 tests.
  8829. 277.09 s [vector] append: OK
  8830. 277.09 s [vector] +++ OK, passed 100 tests.
  8831. 277.10 s [vector] concat: OK (0.02s)
  8832. 277.10 s [vector] +++ OK, passed 100 tests.
  8833. 277.10 s [vector] force: OK
  8834. 277.10 s [vector] +++ OK, passed 100 tests.
  8835. 277.10 s [vector] upd: OK
  8836. 277.11 s [vector] +++ OK, passed 100 tests.
  8837. 277.11 s [vector] accum: OK
  8838. 277.11 s [vector] +++ OK, passed 100 tests.
  8839. 277.11 s [vector] reverse: OK
  8840. 277.11 s [vector] +++ OK, passed 100 tests.
  8841. 277.11 s [vector] backpermute: OK
  8842. 277.11 s [vector] +++ OK, passed 100 tests.
  8843. 277.11 s [vector] map: OK
  8844. 277.11 s [vector] +++ OK, passed 100 tests.
  8845. 277.11 s [vector] imap: OK
  8846. 277.11 s [vector] +++ OK, passed 100 tests.
  8847. 277.12 s [vector] concatMap: OK
  8848. 277.12 s [vector] +++ OK, passed 100 tests.
  8849. 277.12 s [vector] mapM: OK
  8850. 277.13 s [vector] +++ OK, passed 100 tests.
  8851. 277.13 s [vector] mapM_: OK (0.01s)
  8852. 277.13 s [vector] +++ OK, passed 100 tests.
  8853. 277.13 s [vector] forM: OK
  8854. 277.13 s [vector] +++ OK, passed 100 tests.
  8855. 277.15 s [vector] forM_: OK (0.02s)
  8856. 277.15 s [vector] +++ OK, passed 100 tests.
  8857. 277.15 s [vector] imapM: OK
  8858. 277.15 s [vector] +++ OK, passed 100 tests.
  8859. 277.17 s [vector] imapM_: OK (0.02s)
  8860. 277.17 s [vector] +++ OK, passed 100 tests.
  8861. 277.17 s [vector] zipWith: OK
  8862. 277.17 s [vector] +++ OK, passed 100 tests.
  8863. 277.17 s [vector] zipWith3: OK
  8864. 277.17 s [vector] +++ OK, passed 100 tests.
  8865. 277.18 s [vector] izipWith: OK
  8866. 277.18 s [vector] +++ OK, passed 100 tests.
  8867. 277.18 s [vector] izipWith3: OK
  8868. 277.18 s [vector] +++ OK, passed 100 tests.
  8869. 277.18 s [vector] izipWithM: OK
  8870. 277.19 s [vector] +++ OK, passed 100 tests.
  8871. 277.19 s [vector] izipWithM_: OK (0.01s)
  8872. 277.19 s [vector] +++ OK, passed 100 tests.
  8873. 277.21 s [vector] zipWithM: OK
  8874. 277.21 s [vector] +++ OK, passed 100 tests.
  8875. 277.21 s [vector] zipWithM_: OK (0.01s)
  8876. 277.21 s [vector] +++ OK, passed 100 tests.
  8877. 277.21 s [vector] filter: OK
  8878. 277.21 s [vector] +++ OK, passed 100 tests.
  8879. 277.21 s [vector] ifilter: OK
  8880. 277.21 s [vector] +++ OK, passed 100 tests.
  8881. 277.25 s [vector] filterM: OK (0.04s)
  8882. 277.25 s [vector] +++ OK, passed 100 tests.
  8883. 277.25 s [vector] uniq: OK
  8884. 277.25 s [vector] +++ OK, passed 100 tests.
  8885. 277.26 s [vector] mapMaybe: OK
  8886. 277.26 s [vector] +++ OK, passed 100 tests.
  8887. 277.26 s [vector] imapMaybe: OK
  8888. 277.26 s [vector] +++ OK, passed 100 tests.
  8889. 277.26 s [vector] takeWhile: OK
  8890. 277.26 s [vector] +++ OK, passed 100 tests.
  8891. 277.26 s [vector] dropWhile: OK
  8892. 277.26 s [vector] +++ OK, passed 100 tests.
  8893. 277.26 s [vector] partition: OK
  8894. 277.26 s [vector] +++ OK, passed 100 tests.
  8895. 277.26 s [vector] partitionWith: OK
  8896. 277.26 s [vector] +++ OK, passed 100 tests.
  8897. 277.26 s [vector] span: OK
  8898. 277.26 s [vector] +++ OK, passed 100 tests.
  8899. 277.27 s [vector] break: OK
  8900. 277.27 s [vector] +++ OK, passed 100 tests.
  8901. 277.27 s [vector] spanR: OK
  8902. 277.27 s [vector] +++ OK, passed 100 tests.
  8903. 277.27 s [vector] breakR: OK
  8904. 277.27 s [vector] +++ OK, passed 100 tests.
  8905. 277.27 s [vector] groupBy: OK
  8906. 277.27 s [vector] +++ OK, passed 100 tests.
  8907. 277.27 s [vector] elem: OK
  8908. 277.27 s [vector] +++ OK, passed 100 tests.
  8909. 277.27 s [vector] notElem: OK
  8910. 277.27 s [vector] +++ OK, passed 100 tests.
  8911. 277.27 s [vector] find: OK
  8912. 277.27 s [vector] +++ OK, passed 100 tests.
  8913. 277.27 s [vector] findIndex: OK
  8914. 277.27 s [vector] +++ OK, passed 100 tests.
  8915. 277.27 s [vector] findIndexR: OK
  8916. 277.27 s [vector] +++ OK, passed 100 tests.
  8917. 277.27 s [vector] findIndices: OK
  8918. 277.27 s [vector] +++ OK, passed 100 tests.
  8919. 277.27 s [vector] elemIndex: OK
  8920. 277.27 s [vector] +++ OK, passed 100 tests.
  8921. 277.27 s [vector] elemIndices: OK
  8922. 277.28 s [vector] +++ OK, passed 100 tests.
  8923. 277.28 s [vector] foldl: OK
  8924. 277.28 s [vector] +++ OK, passed 100 tests.
  8925. 277.28 s [vector] foldl1: OK
  8926. 277.28 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8927. 277.28 s [vector] foldl': OK
  8928. 277.28 s [vector] +++ OK, passed 100 tests.
  8929. 277.28 s [vector] foldl1': OK
  8930. 277.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8931. 277.29 s [vector] foldr: OK
  8932. 277.29 s [vector] +++ OK, passed 100 tests.
  8933. 277.29 s [vector] foldr1: OK
  8934. 277.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8935. 277.29 s [vector] foldr': OK
  8936. 277.29 s [vector] +++ OK, passed 100 tests.
  8937. 277.29 s [vector] foldr1': OK
  8938. 277.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8939. 277.30 s [vector] ifoldl: OK
  8940. 277.30 s [vector] +++ OK, passed 100 tests.
  8941. 277.30 s [vector] ifoldl': OK
  8942. 277.30 s [vector] +++ OK, passed 100 tests.
  8943. 277.31 s [vector] ifoldr: OK
  8944. 277.31 s [vector] +++ OK, passed 100 tests.
  8945. 277.31 s [vector] ifoldr': OK
  8946. 277.31 s [vector] +++ OK, passed 100 tests.
  8947. 277.31 s [vector] ifoldM: OK
  8948. 277.31 s [vector] +++ OK, passed 100 tests.
  8949. 277.33 s [vector] ifoldM': OK
  8950. 277.33 s [vector] +++ OK, passed 100 tests.
  8951. 277.33 s [vector] ifoldM_: OK (0.02s)
  8952. 277.33 s [vector] +++ OK, passed 100 tests.
  8953. 277.35 s [vector] ifoldM'_: OK (0.02s)
  8954. 277.35 s [vector] +++ OK, passed 100 tests.
  8955. 277.35 s [vector] all: OK
  8956. 277.35 s [vector] +++ OK, passed 100 tests.
  8957. 277.35 s [vector] any: OK
  8958. 277.35 s [vector] +++ OK, passed 100 tests.
  8959. 277.35 s [vector] prescanl: OK
  8960. 277.35 s [vector] +++ OK, passed 100 tests.
  8961. 277.36 s [vector] prescanl': OK
  8962. 277.36 s [vector] +++ OK, passed 100 tests.
  8963. 277.36 s [vector] postscanl: OK
  8964. 277.36 s [vector] +++ OK, passed 100 tests.
  8965. 277.36 s [vector] postscanl': OK
  8966. 277.36 s [vector] +++ OK, passed 100 tests.
  8967. 277.36 s [vector] scanl: OK
  8968. 277.36 s [vector] +++ OK, passed 100 tests.
  8969. 277.37 s [vector] scanl': OK
  8970. 277.37 s [vector] +++ OK, passed 100 tests.
  8971. 277.37 s [vector] scanl1: OK
  8972. 277.37 s [vector] +++ OK, passed 100 tests.
  8973. 277.37 s [vector] scanl1': OK
  8974. 277.37 s [vector] +++ OK, passed 100 tests.
  8975. 277.38 s [vector] iscanl: OK
  8976. 277.38 s [vector] +++ OK, passed 100 tests.
  8977. 277.38 s [vector] iscanl': OK
  8978. 277.38 s [vector] +++ OK, passed 100 tests.
  8979. 277.38 s [vector] prescanr: OK
  8980. 277.38 s [vector] +++ OK, passed 100 tests.
  8981. 277.38 s [vector] prescanr': OK
  8982. 277.38 s [vector] +++ OK, passed 100 tests.
  8983. 277.38 s [vector] postscanr: OK
  8984. 277.38 s [vector] +++ OK, passed 100 tests.
  8985. 277.39 s [vector] postscanr': OK
  8986. 277.39 s [vector] +++ OK, passed 100 tests.
  8987. 277.39 s [vector] scanr: OK
  8988. 277.39 s [vector] +++ OK, passed 100 tests.
  8989. 277.39 s [vector] scanr': OK
  8990. 277.40 s [vector] +++ OK, passed 100 tests.
  8991. 277.40 s [vector] scanr1: OK
  8992. 277.40 s [vector] +++ OK, passed 100 tests.
  8993. 277.40 s [vector] scanr1': OK
  8994. 277.40 s [vector] +++ OK, passed 100 tests.
  8995. 277.40 s [vector] iscanr: OK
  8996. 277.41 s [vector] +++ OK, passed 100 tests.
  8997. 277.41 s [vector] iscanr': OK
  8998. 277.41 s [vector] +++ OK, passed 100 tests.
  8999. 277.41 s [vector] mut_read: OK
  9000. 277.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9001. 277.41 s [vector] mut_write: OK
  9002. 277.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9003. 277.41 s [vector] mut_modify: OK
  9004. 277.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9005. 277.41 s [vector] mut_generate: OK
  9006. 277.41 s [vector] +++ OK, passed 100 tests.
  9007. 277.43 s [vector] mut_generateM: OK
  9008. 277.43 s [vector] +++ OK, passed 100 tests.
  9009. 277.45 s [vector] mut_mapM_: OK (0.01s)
  9010. 277.45 s [vector] +++ OK, passed 100 tests.
  9011. 277.45 s [vector] mut_imapM_: OK (0.01s)
  9012. 277.45 s [vector] +++ OK, passed 100 tests.
  9013. 277.47 s [vector] mut_forM_: OK (0.02s)
  9014. 277.47 s [vector] +++ OK, passed 100 tests.
  9015. 277.48 s [vector] mut_iforM_: OK (0.02s)
  9016. 277.48 s [vector] +++ OK, passed 100 tests.
  9017. 277.48 s [vector] mut_foldr: OK
  9018. 277.49 s [vector] +++ OK, passed 100 tests.
  9019. 277.49 s [vector] mut_foldr': OK
  9020. 277.49 s [vector] +++ OK, passed 100 tests.
  9021. 277.49 s [vector] mut_foldl: OK
  9022. 277.49 s [vector] +++ OK, passed 100 tests.
  9023. 277.49 s [vector] mut_foldl': OK
  9024. 277.49 s [vector] +++ OK, passed 100 tests.
  9025. 277.49 s [vector] mut_ifoldr: OK
  9026. 277.50 s [vector] +++ OK, passed 100 tests.
  9027. 277.50 s [vector] mut_ifoldr': OK
  9028. 277.50 s [vector] +++ OK, passed 100 tests.
  9029. 277.50 s [vector] mut_ifoldl: OK
  9030. 277.50 s [vector] +++ OK, passed 100 tests.
  9031. 277.50 s [vector] mut_ifoldl': OK
  9032. 277.50 s [vector] +++ OK, passed 100 tests.
  9033. 277.50 s [vector] mut_foldM: OK
  9034. 277.50 s [vector] +++ OK, passed 100 tests.
  9035. 277.51 s [vector] mut_foldM': OK
  9036. 277.51 s [vector] +++ OK, passed 100 tests.
  9037. 277.51 s [vector] mut_foldrM: OK
  9038. 277.51 s [vector] +++ OK, passed 100 tests.
  9039. 277.51 s [vector] mut_foldrM': OK
  9040. 277.51 s [vector] +++ OK, passed 100 tests.
  9041. 277.51 s [vector] mut_ifoldM: OK
  9042. 277.52 s [vector] +++ OK, passed 100 tests.
  9043. 277.52 s [vector] mut_ifoldM': OK
  9044. 277.52 s [vector] +++ OK, passed 100 tests.
  9045. 277.52 s [vector] mut_ifoldrM: OK
  9046. 277.52 s [vector] +++ OK, passed 100 tests.
  9047. 277.52 s [vector] mut_ifoldrM': OK
  9048. 277.52 s [vector] +++ OK, passed 100 tests.
  9049. 277.52 s [vector] compare: OK
  9050. 277.52 s [vector] +++ OK, passed 100 tests.
  9051. 277.52 s [vector] maximum: OK
  9052. 277.52 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9053. 277.52 s [vector] minimum: OK
  9054. 277.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9055. 277.52 s [vector] minIndex: OK
  9056. 277.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9057. 277.52 s [vector] maxIndex: OK
  9058. 277.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9059. 277.52 s [vector] maximumBy: OK
  9060. 277.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9061. 277.52 s [vector] minimumBy: OK
  9062. 277.53 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9063. 277.53 s [vector] maximumOn: OK
  9064. 277.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9065. 277.53 s [vector] minimumOn: OK
  9066. 277.53 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9067. 277.53 s [vector] maxIndexBy: OK
  9068. 277.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9069. 277.53 s [vector] minIndexBy: OK
  9070. 277.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9071. 277.53 s [vector] ListFirstMaxIndexWins: OK
  9072. 277.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9073. 277.53 s [vector] FalseListFirstMaxIndexWins: OK
  9074. 277.53 s [vector] +++ OK, failed as expected. (after 1 test):
  9075. 277.53 s [vector] Exception:
  9076. 277.53 s [vector] Prelude.foldr1: empty list
  9077. 277.53 s [vector] CallStack (from HasCallStack):
  9078. 277.53 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9079. 277.53 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9080. 277.53 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9081. 277.53 s [vector] []
  9082. 277.53 s [vector] mempty: OK
  9083. 277.53 s [vector] +++ OK, passed 100 tests.
  9084. 277.53 s [vector] mappend: OK
  9085. 277.53 s [vector] +++ OK, passed 100 tests.
  9086. 277.55 s [vector] mconcat: OK (0.01s)
  9087. 277.55 s [vector] +++ OK, passed 100 tests.
  9088. 277.55 s [vector] glength: OK
  9089. 277.55 s [vector] +++ OK, passed 100 tests.
  9090. 277.55 s [vector] sum: OK
  9091. 277.55 s [vector] +++ OK, passed 100 tests.
  9092. 277.55 s [vector] product: OK
  9093. 277.55 s [vector] +++ OK, passed 100 tests.
  9094. 277.55 s [vector] enumFromN: OK
  9095. 277.55 s [vector] +++ OK, passed 100 tests.
  9096. 277.55 s [vector] enumFromThenN: OK
  9097. 277.55 s [vector] +++ OK, passed 100 tests.
  9098. 277.55 s [vector] enumFromTo: OK
  9099. 277.55 s [vector] +++ OK, passed 100 tests.
  9100. 277.55 s [vector] enumFromThenTo: OK
  9101. 277.55 s [vector] +++ OK, passed 100 tests; 10 discarded.
  9102. 277.55 s [vector] Double
  9103. 277.55 s [vector] fromList.toList == id: OK
  9104. 277.55 s [vector] +++ OK, passed 100 tests.
  9105. 277.55 s [vector] toList.fromList == id: OK
  9106. 277.55 s [vector] +++ OK, passed 100 tests.
  9107. 277.55 s [vector] unstream.stream == id: OK
  9108. 277.55 s [vector] +++ OK, passed 100 tests.
  9109. 277.55 s [vector] stream.unstream == id: OK
  9110. 277.55 s [vector] +++ OK, passed 100 tests.
  9111. 277.55 s [vector] eq: OK
  9112. 277.55 s [vector] +++ OK, passed 100 tests.
  9113. 277.55 s [vector] length: OK
  9114. 277.56 s [vector] +++ OK, passed 100 tests.
  9115. 277.56 s [vector] null: OK
  9116. 277.56 s [vector] +++ OK, passed 100 tests.
  9117. 277.56 s [vector] index: OK
  9118. 277.56 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9119. 277.56 s [vector] safeIndex: OK
  9120. 277.56 s [vector] +++ OK, passed 100 tests.
  9121. 277.56 s [vector] head: OK
  9122. 277.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9123. 277.56 s [vector] last: OK
  9124. 277.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9125. 277.56 s [vector] unsafeIndex: OK
  9126. 277.56 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9127. 277.56 s [vector] unsafeHead: OK
  9128. 277.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9129. 277.56 s [vector] unsafeLast: OK
  9130. 277.56 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9131. 277.56 s [vector] slice: OK
  9132. 277.56 s [vector] +++ OK, passed 100 tests.
  9133. 277.56 s [vector] init: OK
  9134. 277.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9135. 277.56 s [vector] tail: OK
  9136. 277.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9137. 277.56 s [vector] take: OK
  9138. 277.57 s [vector] +++ OK, passed 100 tests.
  9139. 277.57 s [vector] drop: OK
  9140. 277.57 s [vector] +++ OK, passed 100 tests.
  9141. 277.57 s [vector] splitAt: OK
  9142. 277.57 s [vector] +++ OK, passed 100 tests.
  9143. 277.57 s [vector] empty: OK
  9144. 277.57 s [vector] +++ OK, passed 100 tests.
  9145. 277.57 s [vector] singleton: OK
  9146. 277.57 s [vector] +++ OK, passed 100 tests.
  9147. 277.57 s [vector] replicate: OK
  9148. 277.57 s [vector] +++ OK, passed 100 tests.
  9149. 277.57 s [vector] generate: OK
  9150. 277.57 s [vector] +++ OK, passed 100 tests.
  9151. 277.57 s [vector] iterateN: OK
  9152. 277.57 s [vector] +++ OK, passed 100 tests.
  9153. 277.59 s [vector] iterateNM: OK (0.02s)
  9154. 277.59 s [vector] +++ OK, passed 100 tests.
  9155. 277.63 s [vector] generateM: OK (0.03s)
  9156. 277.63 s [vector] +++ OK, passed 100 tests.
  9157. 277.63 s [vector] replicateM: OK
  9158. 277.63 s [vector] +++ OK, passed 100 tests.
  9159. 277.63 s [vector] create: OK
  9160. 277.63 s [vector] +++ OK, passed 100 tests.
  9161. 277.63 s [vector] createT: OK
  9162. 277.63 s [vector] +++ OK, passed 100 tests.
  9163. 277.63 s [vector] unfoldr: OK
  9164. 277.63 s [vector] +++ OK, passed 100 tests.
  9165. 277.63 s [vector] unfoldrN: OK
  9166. 277.63 s [vector] +++ OK, passed 100 tests.
  9167. 277.63 s [vector] unfoldrExactN: OK
  9168. 277.63 s [vector] +++ OK, passed 100 tests.
  9169. 277.63 s [vector] unfoldrM: OK
  9170. 277.63 s [vector] +++ OK, passed 100 tests.
  9171. 277.63 s [vector] unfoldrNM: OK
  9172. 277.63 s [vector] +++ OK, passed 100 tests.
  9173. 277.65 s [vector] unfoldrExactNM: OK
  9174. 277.65 s [vector] +++ OK, passed 100 tests.
  9175. 277.67 s [vector] constructN: OK (0.02s)
  9176. 277.67 s [vector] +++ OK, passed 100 tests.
  9177. 277.68 s [vector] constructrN: OK (0.02s)
  9178. 277.68 s [vector] +++ OK, passed 100 tests.
  9179. 277.68 s [vector] cons: OK
  9180. 277.68 s [vector] +++ OK, passed 100 tests.
  9181. 277.68 s [vector] snoc: OK
  9182. 277.69 s [vector] +++ OK, passed 100 tests.
  9183. 277.69 s [vector] append: OK
  9184. 277.69 s [vector] +++ OK, passed 100 tests.
  9185. 277.70 s [vector] concat: OK (0.02s)
  9186. 277.70 s [vector] +++ OK, passed 100 tests.
  9187. 277.70 s [vector] force: OK
  9188. 277.70 s [vector] +++ OK, passed 100 tests.
  9189. 277.70 s [vector] upd: OK
  9190. 277.71 s [vector] +++ OK, passed 100 tests.
  9191. 277.72 s [vector] accum: OK (0.02s)
  9192. 277.72 s [vector] +++ OK, passed 100 tests.
  9193. 277.73 s [vector] reverse: OK
  9194. 277.73 s [vector] +++ OK, passed 100 tests.
  9195. 277.73 s [vector] backpermute: OK
  9196. 277.73 s [vector] +++ OK, passed 100 tests.
  9197. 277.73 s [vector] map: OK
  9198. 277.73 s [vector] +++ OK, passed 100 tests.
  9199. 277.75 s [vector] imap: OK
  9200. 277.75 s [vector] +++ OK, passed 100 tests.
  9201. 277.75 s [vector] concatMap: OK
  9202. 277.75 s [vector] +++ OK, passed 100 tests.
  9203. 277.75 s [vector] mapM: OK
  9204. 277.75 s [vector] +++ OK, passed 100 tests.
  9205. 277.79 s [vector] mapM_: OK (0.04s)
  9206. 277.79 s [vector] +++ OK, passed 100 tests.
  9207. 277.79 s [vector] forM: OK
  9208. 277.79 s [vector] +++ OK, passed 100 tests.
  9209. 277.83 s [vector] forM_: OK (0.02s)
  9210. 277.83 s [vector] +++ OK, passed 100 tests.
  9211. 277.84 s [vector] imapM: OK
  9212. 277.84 s [vector] +++ OK, passed 100 tests.
  9213. 277.88 s [vector] imapM_: OK (0.04s)
  9214. 277.88 s [vector] +++ OK, passed 100 tests.
  9215. 277.88 s [vector] zipWith: OK
  9216. 277.89 s [vector] +++ OK, passed 100 tests.
  9217. 277.90 s [vector] zipWith3: OK (0.01s)
  9218. 277.90 s [vector] +++ OK, passed 100 tests.
  9219. 277.91 s [vector] izipWith: OK
  9220. 277.91 s [vector] +++ OK, passed 100 tests.
  9221. 277.93 s [vector] izipWith3: OK (0.01s)
  9222. 277.93 s [vector] +++ OK, passed 100 tests.
  9223. 277.93 s [vector] izipWithM: OK (0.01s)
  9224. 277.93 s [vector] +++ OK, passed 100 tests.
  9225. 277.95 s [vector] izipWithM_: OK (0.02s)
  9226. 277.95 s [vector] +++ OK, passed 100 tests.
  9227. 277.97 s [vector] zipWithM: OK
  9228. 277.97 s [vector] +++ OK, passed 100 tests.
  9229. 277.99 s [vector] zipWithM_: OK (0.03s)
  9230. 277.99 s [vector] +++ OK, passed 100 tests.
  9231. 277.99 s [vector] filter: OK
  9232. 277.99 s [vector] +++ OK, passed 100 tests.
  9233. 278.00 s [vector] ifilter: OK
  9234. 278.00 s [vector] +++ OK, passed 100 tests.
  9235. 278.05 s [vector] filterM: OK (0.05s)
  9236. 278.05 s [vector] +++ OK, passed 100 tests.
  9237. 278.05 s [vector] uniq: OK
  9238. 278.05 s [vector] +++ OK, passed 100 tests.
  9239. 278.05 s [vector] mapMaybe: OK
  9240. 278.06 s [vector] +++ OK, passed 100 tests.
  9241. 278.06 s [vector] imapMaybe: OK
  9242. 278.06 s [vector] +++ OK, passed 100 tests.
  9243. 278.06 s [vector] takeWhile: OK
  9244. 278.06 s [vector] +++ OK, passed 100 tests.
  9245. 278.07 s [vector] dropWhile: OK
  9246. 278.07 s [vector] +++ OK, passed 100 tests.
  9247. 278.07 s [vector] partition: OK
  9248. 278.07 s [vector] +++ OK, passed 100 tests.
  9249. 278.08 s [vector] partitionWith: OK
  9250. 278.08 s [vector] +++ OK, passed 100 tests.
  9251. 278.08 s [vector] span: OK
  9252. 278.08 s [vector] +++ OK, passed 100 tests.
  9253. 278.08 s [vector] break: OK
  9254. 278.08 s [vector] +++ OK, passed 100 tests.
  9255. 278.08 s [vector] spanR: OK
  9256. 278.08 s [vector] +++ OK, passed 100 tests.
  9257. 278.09 s [vector] breakR: OK
  9258. 278.09 s [vector] +++ OK, passed 100 tests.
  9259. 278.09 s [vector] groupBy: OK
  9260. 278.10 s [vector] +++ OK, passed 100 tests.
  9261. 278.10 s [vector] elem: OK
  9262. 278.10 s [vector] +++ OK, passed 100 tests.
  9263. 278.10 s [vector] notElem: OK
  9264. 278.11 s [vector] +++ OK, passed 100 tests.
  9265. 278.11 s [vector] find: OK
  9266. 278.11 s [vector] +++ OK, passed 100 tests.
  9267. 278.11 s [vector] findIndex: OK
  9268. 278.11 s [vector] +++ OK, passed 100 tests.
  9269. 278.11 s [vector] findIndexR: OK
  9270. 278.11 s [vector] +++ OK, passed 100 tests.
  9271. 278.11 s [vector] findIndices: OK
  9272. 278.11 s [vector] +++ OK, passed 100 tests.
  9273. 278.11 s [vector] elemIndex: OK
  9274. 278.11 s [vector] +++ OK, passed 100 tests.
  9275. 278.11 s [vector] elemIndices: OK
  9276. 278.11 s [vector] +++ OK, passed 100 tests.
  9277. 278.12 s [vector] foldl: OK (0.01s)
  9278. 278.12 s [vector] +++ OK, passed 100 tests.
  9279. 278.13 s [vector] foldl1: OK
  9280. 278.13 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9281. 278.15 s [vector] foldl': OK (0.01s)
  9282. 278.15 s [vector] +++ OK, passed 100 tests.
  9283. 278.17 s [vector] foldl1': OK (0.01s)
  9284. 278.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9285. 278.17 s [vector] foldr: OK (0.01s)
  9286. 278.18 s [vector] +++ OK, passed 100 tests.
  9287. 278.19 s [vector] foldr1: OK (0.01s)
  9288. 278.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9289. 278.21 s [vector] foldr': OK (0.02s)
  9290. 278.21 s [vector] +++ OK, passed 100 tests.
  9291. 278.21 s [vector] foldr1': OK (0.01s)
  9292. 278.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9293. 278.23 s [vector] ifoldl: OK (0.01s)
  9294. 278.23 s [vector] +++ OK, passed 100 tests.
  9295. 278.23 s [vector] ifoldl': OK (0.01s)
  9296. 278.23 s [vector] +++ OK, passed 100 tests.
  9297. 278.25 s [vector] ifoldr: OK (0.01s)
  9298. 278.25 s [vector] +++ OK, passed 100 tests.
  9299. 278.27 s [vector] ifoldr': OK (0.01s)
  9300. 278.27 s [vector] +++ OK, passed 100 tests.
  9301. 278.29 s [vector] ifoldM: OK (0.01s)
  9302. 278.29 s [vector] +++ OK, passed 100 tests.
  9303. 278.29 s [vector] ifoldM': OK (0.01s)
  9304. 278.30 s [vector] +++ OK, passed 100 tests.
  9305. 278.33 s [vector] ifoldM_: OK (0.03s)
  9306. 278.33 s [vector] +++ OK, passed 100 tests.
  9307. 278.35 s [vector] ifoldM'_: OK (0.03s)
  9308. 278.35 s [vector] +++ OK, passed 100 tests.
  9309. 278.35 s [vector] all: OK
  9310. 278.35 s [vector] +++ OK, passed 100 tests.
  9311. 278.35 s [vector] any: OK
  9312. 278.35 s [vector] +++ OK, passed 100 tests.
  9313. 278.37 s [vector] prescanl: OK (0.01s)
  9314. 278.37 s [vector] +++ OK, passed 100 tests.
  9315. 278.37 s [vector] prescanl': OK (0.01s)
  9316. 278.37 s [vector] +++ OK, passed 100 tests.
  9317. 278.38 s [vector] postscanl: OK
  9318. 278.39 s [vector] +++ OK, passed 100 tests.
  9319. 278.41 s [vector] postscanl': OK (0.01s)
  9320. 278.41 s [vector] +++ OK, passed 100 tests.
  9321. 278.41 s [vector] scanl: OK (0.01s)
  9322. 278.41 s [vector] +++ OK, passed 100 tests.
  9323. 278.43 s [vector] scanl': OK (0.01s)
  9324. 278.43 s [vector] +++ OK, passed 100 tests.
  9325. 278.43 s [vector] scanl1: OK (0.01s)
  9326. 278.43 s [vector] +++ OK, passed 100 tests.
  9327. 278.45 s [vector] scanl1': OK (0.01s)
  9328. 278.45 s [vector] +++ OK, passed 100 tests.
  9329. 278.47 s [vector] iscanl: OK (0.01s)
  9330. 278.47 s [vector] +++ OK, passed 100 tests.
  9331. 278.47 s [vector] iscanl': OK (0.01s)
  9332. 278.47 s [vector] +++ OK, passed 100 tests.
  9333. 278.49 s [vector] prescanr: OK (0.01s)
  9334. 278.49 s [vector] +++ OK, passed 100 tests.
  9335. 278.51 s [vector] prescanr': OK (0.01s)
  9336. 278.51 s [vector] +++ OK, passed 100 tests.
  9337. 278.51 s [vector] postscanr: OK (0.01s)
  9338. 278.51 s [vector] +++ OK, passed 100 tests.
  9339. 278.53 s [vector] postscanr': OK (0.01s)
  9340. 278.53 s [vector] +++ OK, passed 100 tests.
  9341. 278.54 s [vector] scanr: OK (0.01s)
  9342. 278.54 s [vector] +++ OK, passed 100 tests.
  9343. 278.55 s [vector] scanr': OK (0.01s)
  9344. 278.55 s [vector] +++ OK, passed 100 tests.
  9345. 278.56 s [vector] scanr1: OK (0.01s)
  9346. 278.57 s [vector] +++ OK, passed 100 tests.
  9347. 278.58 s [vector] scanr1': OK (0.01s)
  9348. 278.58 s [vector] +++ OK, passed 100 tests.
  9349. 278.59 s [vector] iscanr: OK (0.01s)
  9350. 278.59 s [vector] +++ OK, passed 100 tests.
  9351. 278.60 s [vector] iscanr': OK (0.01s)
  9352. 278.60 s [vector] +++ OK, passed 100 tests.
  9353. 278.61 s [vector] mut_read: OK
  9354. 278.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9355. 278.61 s [vector] mut_write: OK
  9356. 278.63 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9357. 278.63 s [vector] mut_modify: OK
  9358. 278.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9359. 278.64 s [vector] mut_generate: OK
  9360. 278.64 s [vector] +++ OK, passed 100 tests.
  9361. 278.64 s [vector] mut_generateM: OK (0.02s)
  9362. 278.64 s [vector] +++ OK, passed 100 tests.
  9363. 278.65 s [vector] mut_mapM_: OK (0.03s)
  9364. 278.65 s [vector] +++ OK, passed 100 tests.
  9365. 278.69 s [vector] mut_imapM_: OK (0.03s)
  9366. 278.69 s [vector] +++ OK, passed 100 tests.
  9367. 278.73 s [vector] mut_forM_: OK (0.04s)
  9368. 278.73 s [vector] +++ OK, passed 100 tests.
  9369. 278.77 s [vector] mut_iforM_: OK (0.04s)
  9370. 278.77 s [vector] +++ OK, passed 100 tests.
  9371. 278.77 s [vector] mut_foldr: OK (0.01s)
  9372. 278.77 s [vector] +++ OK, passed 100 tests.
  9373. 278.79 s [vector] mut_foldr': OK (0.02s)
  9374. 278.79 s [vector] +++ OK, passed 100 tests.
  9375. 278.81 s [vector] mut_foldl: OK (0.01s)
  9376. 278.81 s [vector] +++ OK, passed 100 tests.
  9377. 278.83 s [vector] mut_foldl': OK (0.01s)
  9378. 278.83 s [vector] +++ OK, passed 100 tests.
  9379. 278.83 s [vector] mut_ifoldr: OK (0.01s)
  9380. 278.83 s [vector] +++ OK, passed 100 tests.
  9381. 278.85 s [vector] mut_ifoldr': OK
  9382. 278.85 s [vector] +++ OK, passed 100 tests.
  9383. 278.86 s [vector] mut_ifoldl: OK (0.01s)
  9384. 278.86 s [vector] +++ OK, passed 100 tests.
  9385. 278.87 s [vector] mut_ifoldl': OK (0.01s)
  9386. 278.87 s [vector] +++ OK, passed 100 tests.
  9387. 278.87 s [vector] mut_foldM: OK (0.01s)
  9388. 278.87 s [vector] +++ OK, passed 100 tests.
  9389. 278.89 s [vector] mut_foldM': OK (0.01s)
  9390. 278.89 s [vector] +++ OK, passed 100 tests.
  9391. 278.91 s [vector] mut_foldrM: OK (0.01s)
  9392. 278.91 s [vector] +++ OK, passed 100 tests.
  9393. 278.92 s [vector] mut_foldrM': OK (0.01s)
  9394. 278.92 s [vector] +++ OK, passed 100 tests.
  9395. 278.92 s [vector] mut_ifoldM: OK (0.01s)
  9396. 278.92 s [vector] +++ OK, passed 100 tests.
  9397. 278.93 s [vector] mut_ifoldM': OK
  9398. 278.93 s [vector] +++ OK, passed 100 tests.
  9399. 278.95 s [vector] mut_ifoldrM: OK (0.01s)
  9400. 278.95 s [vector] +++ OK, passed 100 tests.
  9401. 278.96 s [vector] mut_ifoldrM': OK (0.01s)
  9402. 278.96 s [vector] +++ OK, passed 100 tests.
  9403. 278.96 s [vector] compare: OK
  9404. 278.96 s [vector] +++ OK, passed 100 tests.
  9405. 278.96 s [vector] maximum: OK
  9406. 278.96 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9407. 278.96 s [vector] minimum: OK
  9408. 278.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9409. 278.96 s [vector] minIndex: OK
  9410. 278.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9411. 278.96 s [vector] maxIndex: OK
  9412. 278.96 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9413. 278.96 s [vector] maximumBy: OK
  9414. 278.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9415. 278.96 s [vector] minimumBy: OK
  9416. 278.96 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9417. 278.96 s [vector] maximumOn: OK
  9418. 278.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9419. 278.96 s [vector] minimumOn: OK
  9420. 278.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9421. 278.96 s [vector] maxIndexBy: OK
  9422. 278.96 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9423. 278.96 s [vector] minIndexBy: OK
  9424. 278.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9425. 278.96 s [vector] ListFirstMaxIndexWins: OK
  9426. 278.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9427. 278.96 s [vector] FalseListFirstMaxIndexWins: OK
  9428. 278.96 s [vector] +++ OK, failed as expected. (after 1 test):
  9429. 278.97 s [vector] Exception:
  9430. 278.97 s [vector] Prelude.foldr1: empty list
  9431. 278.97 s [vector] CallStack (from HasCallStack):
  9432. 278.97 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9433. 278.97 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9434. 278.97 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9435. 278.97 s [vector] []
  9436. 278.97 s [vector] mempty: OK
  9437. 278.97 s [vector] +++ OK, passed 100 tests.
  9438. 278.98 s [vector] mappend: OK
  9439. 278.98 s [vector] +++ OK, passed 100 tests.
  9440. 278.99 s [vector] mconcat: OK (0.02s)
  9441. 278.99 s [vector] +++ OK, passed 100 tests.
  9442. 278.99 s [vector] glength: OK
  9443. 278.99 s [vector] +++ OK, passed 100 tests.
  9444. 278.99 s [vector] sum: OK
  9445. 278.99 s [vector] +++ OK, passed 100 tests.
  9446. 278.99 s [vector] product: OK
  9447. 278.99 s [vector] +++ OK, passed 100 tests.
  9448. 278.99 s [vector] enumFromN: OK
  9449. 278.99 s [vector] +++ OK, passed 100 tests.
  9450. 278.99 s [vector] enumFromThenN: OK
  9451. 278.99 s [vector] +++ OK, passed 100 tests.
  9452. 278.99 s [vector] enumFromTo: OK
  9453. 278.99 s [vector] +++ OK, passed 100 tests.
  9454. 278.99 s [vector] enumFromThenTo: OK
  9455. 278.99 s [vector] +++ OK, passed 100 tests; 7 discarded.
  9456. 278.99 s [vector] unstream
  9457. 278.99 s [vector] unstream == vunstream (exact): OK
  9458. 278.99 s [vector] +++ OK, passed 100 tests.
  9459. 278.99 s [vector] unstream == vunstream (unknown): OK
  9460. 278.99 s [vector] +++ OK, passed 100 tests.
  9461. 278.99 s [vector] unstreamR ~= vunstream (exact): OK
  9462. 278.99 s [vector] +++ OK, passed 100 tests.
  9463. 278.99 s [vector] unstreamR ~= vunstream (unknown): OK
  9464. 279.00 s [vector] +++ OK, passed 100 tests.
  9465. 279.00 s [vector] Tests.Vector.Storable
  9466. 279.00 s [vector] Data.Vector.Storable.Vector (Int)
  9467. 279.00 s [vector] fromList.toList == id: OK
  9468. 279.00 s [vector] +++ OK, passed 100 tests.
  9469. 279.00 s [vector] toList.fromList == id: OK
  9470. 279.00 s [vector] +++ OK, passed 100 tests.
  9471. 279.00 s [vector] unstream.stream == id: OK
  9472. 279.00 s [vector] +++ OK, passed 100 tests.
  9473. 279.00 s [vector] stream.unstream == id: OK
  9474. 279.00 s [vector] +++ OK, passed 100 tests.
  9475. 279.00 s [vector] eq: OK
  9476. 279.00 s [vector] +++ OK, passed 100 tests.
  9477. 279.00 s [vector] length: OK
  9478. 279.00 s [vector] +++ OK, passed 100 tests.
  9479. 279.00 s [vector] null: OK
  9480. 279.00 s [vector] +++ OK, passed 100 tests.
  9481. 279.00 s [vector] index: OK
  9482. 279.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9483. 279.00 s [vector] safeIndex: OK
  9484. 279.00 s [vector] +++ OK, passed 100 tests.
  9485. 279.00 s [vector] head: OK
  9486. 279.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9487. 279.00 s [vector] last: OK
  9488. 279.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9489. 279.00 s [vector] unsafeIndex: OK
  9490. 279.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9491. 279.00 s [vector] unsafeHead: OK
  9492. 279.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9493. 279.00 s [vector] unsafeLast: OK
  9494. 279.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9495. 279.00 s [vector] slice: OK
  9496. 279.00 s [vector] +++ OK, passed 100 tests.
  9497. 279.00 s [vector] init: OK
  9498. 279.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9499. 279.00 s [vector] tail: OK
  9500. 279.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9501. 279.01 s [vector] take: OK
  9502. 279.01 s [vector] +++ OK, passed 100 tests.
  9503. 279.01 s [vector] drop: OK
  9504. 279.01 s [vector] +++ OK, passed 100 tests.
  9505. 279.01 s [vector] splitAt: OK
  9506. 279.01 s [vector] +++ OK, passed 100 tests.
  9507. 279.01 s [vector] empty: OK
  9508. 279.01 s [vector] +++ OK, passed 100 tests.
  9509. 279.01 s [vector] singleton: OK
  9510. 279.01 s [vector] +++ OK, passed 100 tests.
  9511. 279.01 s [vector] replicate: OK
  9512. 279.01 s [vector] +++ OK, passed 100 tests.
  9513. 279.01 s [vector] generate: OK
  9514. 279.01 s [vector] +++ OK, passed 100 tests.
  9515. 279.01 s [vector] iterateN: OK
  9516. 279.01 s [vector] +++ OK, passed 100 tests.
  9517. 279.03 s [vector] iterateNM: OK (0.01s)
  9518. 279.04 s [vector] +++ OK, passed 100 tests.
  9519. 279.05 s [vector] generateM: OK (0.02s)
  9520. 279.05 s [vector] +++ OK, passed 100 tests.
  9521. 279.05 s [vector] replicateM: OK
  9522. 279.05 s [vector] +++ OK, passed 100 tests.
  9523. 279.05 s [vector] create: OK
  9524. 279.05 s [vector] +++ OK, passed 100 tests.
  9525. 279.05 s [vector] createT: OK
  9526. 279.05 s [vector] +++ OK, passed 100 tests.
  9527. 279.05 s [vector] unfoldr: OK
  9528. 279.05 s [vector] +++ OK, passed 100 tests.
  9529. 279.05 s [vector] unfoldrN: OK
  9530. 279.05 s [vector] +++ OK, passed 100 tests.
  9531. 279.05 s [vector] unfoldrExactN: OK
  9532. 279.05 s [vector] +++ OK, passed 100 tests.
  9533. 279.05 s [vector] unfoldrM: OK
  9534. 279.05 s [vector] +++ OK, passed 100 tests.
  9535. 279.06 s [vector] unfoldrNM: OK
  9536. 279.06 s [vector] +++ OK, passed 100 tests.
  9537. 279.08 s [vector] unfoldrExactNM: OK (0.02s)
  9538. 279.08 s [vector] +++ OK, passed 100 tests.
  9539. 279.08 s [vector] constructN: OK
  9540. 279.08 s [vector] +++ OK, passed 100 tests.
  9541. 279.08 s [vector] constructrN: OK
  9542. 279.08 s [vector] +++ OK, passed 100 tests.
  9543. 279.09 s [vector] cons: OK
  9544. 279.09 s [vector] +++ OK, passed 100 tests.
  9545. 279.09 s [vector] snoc: OK
  9546. 279.09 s [vector] +++ OK, passed 100 tests.
  9547. 279.09 s [vector] append: OK
  9548. 279.09 s [vector] +++ OK, passed 100 tests.
  9549. 279.10 s [vector] concat: OK (0.02s)
  9550. 279.10 s [vector] +++ OK, passed 100 tests.
  9551. 279.10 s [vector] force: OK
  9552. 279.10 s [vector] +++ OK, passed 100 tests.
  9553. 279.11 s [vector] upd: OK
  9554. 279.11 s [vector] +++ OK, passed 100 tests.
  9555. 279.11 s [vector] accum: OK
  9556. 279.11 s [vector] +++ OK, passed 100 tests.
  9557. 279.11 s [vector] reverse: OK
  9558. 279.11 s [vector] +++ OK, passed 100 tests.
  9559. 279.11 s [vector] backpermute: OK
  9560. 279.11 s [vector] +++ OK, passed 100 tests.
  9561. 279.12 s [vector] map: OK
  9562. 279.13 s [vector] +++ OK, passed 100 tests.
  9563. 279.13 s [vector] imap: OK
  9564. 279.13 s [vector] +++ OK, passed 100 tests.
  9565. 279.13 s [vector] concatMap: OK
  9566. 279.13 s [vector] +++ OK, passed 100 tests.
  9567. 279.13 s [vector] mapM: OK
  9568. 279.13 s [vector] +++ OK, passed 100 tests.
  9569. 279.14 s [vector] mapM_: OK (0.02s)
  9570. 279.14 s [vector] +++ OK, passed 100 tests.
  9571. 279.14 s [vector] forM: OK
  9572. 279.15 s [vector] +++ OK, passed 100 tests.
  9573. 279.15 s [vector] forM_: OK (0.01s)
  9574. 279.15 s [vector] +++ OK, passed 100 tests.
  9575. 279.17 s [vector] imapM: OK
  9576. 279.17 s [vector] +++ OK, passed 100 tests.
  9577. 279.18 s [vector] imapM_: OK (0.02s)
  9578. 279.18 s [vector] +++ OK, passed 100 tests.
  9579. 279.18 s [vector] zipWith: OK
  9580. 279.19 s [vector] +++ OK, passed 100 tests.
  9581. 279.19 s [vector] zipWith3: OK
  9582. 279.19 s [vector] +++ OK, passed 100 tests.
  9583. 279.19 s [vector] izipWith: OK
  9584. 279.19 s [vector] +++ OK, passed 100 tests.
  9585. 279.19 s [vector] izipWith3: OK
  9586. 279.19 s [vector] +++ OK, passed 100 tests.
  9587. 279.19 s [vector] izipWithM: OK
  9588. 279.19 s [vector] +++ OK, passed 100 tests.
  9589. 279.20 s [vector] izipWithM_: OK (0.01s)
  9590. 279.21 s [vector] +++ OK, passed 100 tests.
  9591. 279.21 s [vector] zipWithM: OK
  9592. 279.21 s [vector] +++ OK, passed 100 tests.
  9593. 279.22 s [vector] zipWithM_: OK (0.01s)
  9594. 279.22 s [vector] +++ OK, passed 100 tests.
  9595. 279.22 s [vector] filter: OK
  9596. 279.22 s [vector] +++ OK, passed 100 tests.
  9597. 279.22 s [vector] ifilter: OK
  9598. 279.22 s [vector] +++ OK, passed 100 tests.
  9599. 279.25 s [vector] filterM: OK (0.02s)
  9600. 279.25 s [vector] +++ OK, passed 100 tests.
  9601. 279.25 s [vector] uniq: OK
  9602. 279.25 s [vector] +++ OK, passed 100 tests.
  9603. 279.25 s [vector] mapMaybe: OK
  9604. 279.25 s [vector] +++ OK, passed 100 tests.
  9605. 279.26 s [vector] imapMaybe: OK
  9606. 279.26 s [vector] +++ OK, passed 100 tests.
  9607. 279.26 s [vector] takeWhile: OK
  9608. 279.26 s [vector] +++ OK, passed 100 tests.
  9609. 279.26 s [vector] dropWhile: OK
  9610. 279.26 s [vector] +++ OK, passed 100 tests.
  9611. 279.26 s [vector] partition: OK
  9612. 279.26 s [vector] +++ OK, passed 100 tests.
  9613. 279.26 s [vector] partitionWith: OK
  9614. 279.26 s [vector] +++ OK, passed 100 tests.
  9615. 279.26 s [vector] span: OK
  9616. 279.26 s [vector] +++ OK, passed 100 tests.
  9617. 279.26 s [vector] break: OK
  9618. 279.27 s [vector] +++ OK, passed 100 tests.
  9619. 279.27 s [vector] spanR: OK
  9620. 279.27 s [vector] +++ OK, passed 100 tests.
  9621. 279.27 s [vector] breakR: OK
  9622. 279.27 s [vector] +++ OK, passed 100 tests.
  9623. 279.27 s [vector] groupBy: OK
  9624. 279.27 s [vector] +++ OK, passed 100 tests.
  9625. 279.27 s [vector] elem: OK
  9626. 279.27 s [vector] +++ OK, passed 100 tests.
  9627. 279.27 s [vector] notElem: OK
  9628. 279.27 s [vector] +++ OK, passed 100 tests.
  9629. 279.27 s [vector] find: OK
  9630. 279.27 s [vector] +++ OK, passed 100 tests.
  9631. 279.27 s [vector] findIndex: OK
  9632. 279.27 s [vector] +++ OK, passed 100 tests.
  9633. 279.27 s [vector] findIndexR: OK
  9634. 279.27 s [vector] +++ OK, passed 100 tests.
  9635. 279.27 s [vector] findIndices: OK
  9636. 279.27 s [vector] +++ OK, passed 100 tests.
  9637. 279.27 s [vector] elemIndex: OK
  9638. 279.27 s [vector] +++ OK, passed 100 tests.
  9639. 279.27 s [vector] elemIndices: OK
  9640. 279.28 s [vector] +++ OK, passed 100 tests.
  9641. 279.28 s [vector] foldl: OK
  9642. 279.28 s [vector] +++ OK, passed 100 tests.
  9643. 279.28 s [vector] foldl1: OK
  9644. 279.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9645. 279.28 s [vector] foldl': OK
  9646. 279.28 s [vector] +++ OK, passed 100 tests.
  9647. 279.29 s [vector] foldl1': OK
  9648. 279.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9649. 279.29 s [vector] foldr: OK
  9650. 279.29 s [vector] +++ OK, passed 100 tests.
  9651. 279.29 s [vector] foldr1: OK
  9652. 279.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9653. 279.29 s [vector] foldr': OK
  9654. 279.29 s [vector] +++ OK, passed 100 tests.
  9655. 279.29 s [vector] foldr1': OK
  9656. 279.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9657. 279.30 s [vector] ifoldl: OK
  9658. 279.30 s [vector] +++ OK, passed 100 tests.
  9659. 279.30 s [vector] ifoldl': OK
  9660. 279.30 s [vector] +++ OK, passed 100 tests.
  9661. 279.30 s [vector] ifoldr: OK
  9662. 279.31 s [vector] +++ OK, passed 100 tests.
  9663. 279.31 s [vector] ifoldr': OK
  9664. 279.31 s [vector] +++ OK, passed 100 tests.
  9665. 279.31 s [vector] ifoldM: OK
  9666. 279.31 s [vector] +++ OK, passed 100 tests.
  9667. 279.31 s [vector] ifoldM': OK
  9668. 279.31 s [vector] +++ OK, passed 100 tests.
  9669. 279.33 s [vector] ifoldM_: OK (0.02s)
  9670. 279.33 s [vector] +++ OK, passed 100 tests.
  9671. 279.34 s [vector] ifoldM'_: OK (0.01s)
  9672. 279.34 s [vector] +++ OK, passed 100 tests.
  9673. 279.35 s [vector] all: OK
  9674. 279.35 s [vector] +++ OK, passed 100 tests.
  9675. 279.35 s [vector] any: OK
  9676. 279.35 s [vector] +++ OK, passed 100 tests.
  9677. 279.35 s [vector] prescanl: OK
  9678. 279.35 s [vector] +++ OK, passed 100 tests.
  9679. 279.35 s [vector] prescanl': OK
  9680. 279.35 s [vector] +++ OK, passed 100 tests.
  9681. 279.35 s [vector] postscanl: OK
  9682. 279.35 s [vector] +++ OK, passed 100 tests.
  9683. 279.35 s [vector] postscanl': OK
  9684. 279.35 s [vector] +++ OK, passed 100 tests.
  9685. 279.36 s [vector] scanl: OK
  9686. 279.36 s [vector] +++ OK, passed 100 tests.
  9687. 279.36 s [vector] scanl': OK
  9688. 279.36 s [vector] +++ OK, passed 100 tests.
  9689. 279.36 s [vector] scanl1: OK
  9690. 279.36 s [vector] +++ OK, passed 100 tests.
  9691. 279.37 s [vector] scanl1': OK
  9692. 279.37 s [vector] +++ OK, passed 100 tests.
  9693. 279.37 s [vector] iscanl: OK
  9694. 279.37 s [vector] +++ OK, passed 100 tests.
  9695. 279.37 s [vector] iscanl': OK
  9696. 279.37 s [vector] +++ OK, passed 100 tests.
  9697. 279.37 s [vector] prescanr: OK
  9698. 279.37 s [vector] +++ OK, passed 100 tests.
  9699. 279.37 s [vector] prescanr': OK
  9700. 279.38 s [vector] +++ OK, passed 100 tests.
  9701. 279.38 s [vector] postscanr: OK
  9702. 279.38 s [vector] +++ OK, passed 100 tests.
  9703. 279.38 s [vector] postscanr': OK
  9704. 279.38 s [vector] +++ OK, passed 100 tests.
  9705. 279.38 s [vector] scanr: OK
  9706. 279.38 s [vector] +++ OK, passed 100 tests.
  9707. 279.39 s [vector] scanr': OK
  9708. 279.39 s [vector] +++ OK, passed 100 tests.
  9709. 279.39 s [vector] scanr1: OK
  9710. 279.39 s [vector] +++ OK, passed 100 tests.
  9711. 279.39 s [vector] scanr1': OK
  9712. 279.39 s [vector] +++ OK, passed 100 tests.
  9713. 279.39 s [vector] iscanr: OK
  9714. 279.39 s [vector] +++ OK, passed 100 tests.
  9715. 279.39 s [vector] iscanr': OK
  9716. 279.39 s [vector] +++ OK, passed 100 tests.
  9717. 279.39 s [vector] mut_read: OK
  9718. 279.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9719. 279.39 s [vector] mut_write: OK
  9720. 279.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9721. 279.41 s [vector] mut_modify: OK
  9722. 279.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9723. 279.41 s [vector] mut_generate: OK
  9724. 279.41 s [vector] +++ OK, passed 100 tests.
  9725. 279.41 s [vector] mut_generateM: OK
  9726. 279.41 s [vector] +++ OK, passed 100 tests.
  9727. 279.43 s [vector] mut_mapM_: OK (0.01s)
  9728. 279.43 s [vector] +++ OK, passed 100 tests.
  9729. 279.43 s [vector] mut_imapM_: OK (0.01s)
  9730. 279.43 s [vector] +++ OK, passed 100 tests.
  9731. 279.45 s [vector] mut_forM_: OK (0.02s)
  9732. 279.45 s [vector] +++ OK, passed 100 tests.
  9733. 279.46 s [vector] mut_iforM_: OK (0.01s)
  9734. 279.46 s [vector] +++ OK, passed 100 tests.
  9735. 279.47 s [vector] mut_foldr: OK
  9736. 279.47 s [vector] +++ OK, passed 100 tests.
  9737. 279.47 s [vector] mut_foldr': OK
  9738. 279.47 s [vector] +++ OK, passed 100 tests.
  9739. 279.47 s [vector] mut_foldl: OK
  9740. 279.47 s [vector] +++ OK, passed 100 tests.
  9741. 279.48 s [vector] mut_foldl': OK
  9742. 279.48 s [vector] +++ OK, passed 100 tests.
  9743. 279.48 s [vector] mut_ifoldr: OK
  9744. 279.48 s [vector] +++ OK, passed 100 tests.
  9745. 279.48 s [vector] mut_ifoldr': OK
  9746. 279.48 s [vector] +++ OK, passed 100 tests.
  9747. 279.48 s [vector] mut_ifoldl: OK
  9748. 279.49 s [vector] +++ OK, passed 100 tests.
  9749. 279.49 s [vector] mut_ifoldl': OK
  9750. 279.49 s [vector] +++ OK, passed 100 tests.
  9751. 279.49 s [vector] mut_foldM: OK
  9752. 279.49 s [vector] +++ OK, passed 100 tests.
  9753. 279.49 s [vector] mut_foldM': OK
  9754. 279.49 s [vector] +++ OK, passed 100 tests.
  9755. 279.49 s [vector] mut_foldrM: OK
  9756. 279.49 s [vector] +++ OK, passed 100 tests.
  9757. 279.49 s [vector] mut_foldrM': OK
  9758. 279.49 s [vector] +++ OK, passed 100 tests.
  9759. 279.49 s [vector] mut_ifoldM: OK
  9760. 279.49 s [vector] +++ OK, passed 100 tests.
  9761. 279.49 s [vector] mut_ifoldM': OK
  9762. 279.49 s [vector] +++ OK, passed 100 tests.
  9763. 279.49 s [vector] mut_ifoldrM: OK
  9764. 279.49 s [vector] +++ OK, passed 100 tests.
  9765. 279.50 s [vector] mut_ifoldrM': OK
  9766. 279.50 s [vector] +++ OK, passed 100 tests.
  9767. 279.50 s [vector] compare: OK
  9768. 279.50 s [vector] +++ OK, passed 100 tests.
  9769. 279.50 s [vector] maximum: OK
  9770. 279.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9771. 279.50 s [vector] minimum: OK
  9772. 279.50 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9773. 279.50 s [vector] minIndex: OK
  9774. 279.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9775. 279.50 s [vector] maxIndex: OK
  9776. 279.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9777. 279.50 s [vector] maximumBy: OK
  9778. 279.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9779. 279.50 s [vector] minimumBy: OK
  9780. 279.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9781. 279.50 s [vector] maximumOn: OK
  9782. 279.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9783. 279.50 s [vector] minimumOn: OK
  9784. 279.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9785. 279.50 s [vector] maxIndexBy: OK
  9786. 279.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9787. 279.50 s [vector] minIndexBy: OK
  9788. 279.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9789. 279.50 s [vector] ListFirstMaxIndexWins: OK
  9790. 279.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9791. 279.50 s [vector] FalseListFirstMaxIndexWins: OK
  9792. 279.50 s [vector] +++ OK, failed as expected. (after 1 test):
  9793. 279.50 s [vector] Exception:
  9794. 279.50 s [vector] Prelude.foldr1: empty list
  9795. 279.50 s [vector] CallStack (from HasCallStack):
  9796. 279.50 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9797. 279.50 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9798. 279.50 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9799. 279.50 s [vector] []
  9800. 279.50 s [vector] mempty: OK
  9801. 279.50 s [vector] +++ OK, passed 100 tests.
  9802. 279.51 s [vector] mappend: OK
  9803. 279.51 s [vector] +++ OK, passed 100 tests.
  9804. 279.52 s [vector] mconcat: OK (0.01s)
  9805. 279.52 s [vector] +++ OK, passed 100 tests.
  9806. 279.52 s [vector] glength: OK
  9807. 279.52 s [vector] +++ OK, passed 100 tests.
  9808. 279.52 s [vector] sum: OK
  9809. 279.52 s [vector] +++ OK, passed 100 tests.
  9810. 279.52 s [vector] product: OK
  9811. 279.52 s [vector] +++ OK, passed 100 tests.
  9812. 279.52 s [vector] enumFromN: OK
  9813. 279.52 s [vector] +++ OK, passed 100 tests.
  9814. 279.52 s [vector] enumFromThenN: OK
  9815. 279.52 s [vector] +++ OK, passed 100 tests.
  9816. 279.52 s [vector] enumFromTo: OK
  9817. 279.52 s [vector] +++ OK, passed 100 tests.
  9818. 279.52 s [vector] enumFromThenTo: OK
  9819. 279.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9820. 279.52 s [vector] Data.Vector.Storable.Vector (Double)
  9821. 279.52 s [vector] fromList.toList == id: OK
  9822. 279.52 s [vector] +++ OK, passed 100 tests.
  9823. 279.53 s [vector] toList.fromList == id: OK
  9824. 279.53 s [vector] +++ OK, passed 100 tests.
  9825. 279.53 s [vector] unstream.stream == id: OK
  9826. 279.53 s [vector] +++ OK, passed 100 tests.
  9827. 279.53 s [vector] stream.unstream == id: OK
  9828. 279.53 s [vector] +++ OK, passed 100 tests.
  9829. 279.53 s [vector] eq: OK
  9830. 279.53 s [vector] +++ OK, passed 100 tests.
  9831. 279.53 s [vector] length: OK
  9832. 279.53 s [vector] +++ OK, passed 100 tests.
  9833. 279.53 s [vector] null: OK
  9834. 279.53 s [vector] +++ OK, passed 100 tests.
  9835. 279.53 s [vector] index: OK
  9836. 279.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9837. 279.53 s [vector] safeIndex: OK
  9838. 279.53 s [vector] +++ OK, passed 100 tests.
  9839. 279.53 s [vector] head: OK
  9840. 279.53 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9841. 279.53 s [vector] last: OK
  9842. 279.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9843. 279.53 s [vector] unsafeIndex: OK
  9844. 279.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9845. 279.53 s [vector] unsafeHead: OK
  9846. 279.53 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9847. 279.53 s [vector] unsafeLast: OK
  9848. 279.53 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9849. 279.53 s [vector] slice: OK
  9850. 279.54 s [vector] +++ OK, passed 100 tests.
  9851. 279.54 s [vector] init: OK
  9852. 279.54 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9853. 279.54 s [vector] tail: OK
  9854. 279.54 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9855. 279.54 s [vector] take: OK
  9856. 279.54 s [vector] +++ OK, passed 100 tests.
  9857. 279.54 s [vector] drop: OK
  9858. 279.54 s [vector] +++ OK, passed 100 tests.
  9859. 279.54 s [vector] splitAt: OK
  9860. 279.54 s [vector] +++ OK, passed 100 tests.
  9861. 279.54 s [vector] empty: OK
  9862. 279.54 s [vector] +++ OK, passed 100 tests.
  9863. 279.54 s [vector] singleton: OK
  9864. 279.54 s [vector] +++ OK, passed 100 tests.
  9865. 279.54 s [vector] replicate: OK
  9866. 279.54 s [vector] +++ OK, passed 100 tests.
  9867. 279.54 s [vector] generate: OK
  9868. 279.54 s [vector] +++ OK, passed 100 tests.
  9869. 279.55 s [vector] iterateN: OK
  9870. 279.55 s [vector] +++ OK, passed 100 tests.
  9871. 279.57 s [vector] iterateNM: OK (0.03s)
  9872. 279.57 s [vector] +++ OK, passed 100 tests.
  9873. 279.59 s [vector] generateM: OK (0.02s)
  9874. 279.59 s [vector] +++ OK, passed 100 tests.
  9875. 279.60 s [vector] replicateM: OK (0.01s)
  9876. 279.60 s [vector] +++ OK, passed 100 tests.
  9877. 279.60 s [vector] create: OK
  9878. 279.60 s [vector] +++ OK, passed 100 tests.
  9879. 279.60 s [vector] createT: OK
  9880. 279.61 s [vector] +++ OK, passed 100 tests.
  9881. 279.61 s [vector] unfoldr: OK
  9882. 279.61 s [vector] +++ OK, passed 100 tests.
  9883. 279.61 s [vector] unfoldrN: OK
  9884. 279.61 s [vector] +++ OK, passed 100 tests.
  9885. 279.61 s [vector] unfoldrExactN: OK
  9886. 279.61 s [vector] +++ OK, passed 100 tests.
  9887. 279.61 s [vector] unfoldrM: OK
  9888. 279.61 s [vector] +++ OK, passed 100 tests.
  9889. 279.63 s [vector] unfoldrNM: OK
  9890. 279.63 s [vector] +++ OK, passed 100 tests.
  9891. 279.63 s [vector] unfoldrExactNM: OK (0.02s)
  9892. 279.63 s [vector] +++ OK, passed 100 tests.
  9893. 279.65 s [vector] constructN: OK (0.01s)
  9894. 279.65 s [vector] +++ OK, passed 100 tests.
  9895. 279.66 s [vector] constructrN: OK (0.01s)
  9896. 279.66 s [vector] +++ OK, passed 100 tests.
  9897. 279.66 s [vector] cons: OK
  9898. 279.66 s [vector] +++ OK, passed 100 tests.
  9899. 279.66 s [vector] snoc: OK
  9900. 279.66 s [vector] +++ OK, passed 100 tests.
  9901. 279.67 s [vector] append: OK
  9902. 279.67 s [vector] +++ OK, passed 100 tests.
  9903. 279.68 s [vector] concat: OK (0.02s)
  9904. 279.69 s [vector] +++ OK, passed 100 tests.
  9905. 279.69 s [vector] force: OK
  9906. 279.69 s [vector] +++ OK, passed 100 tests.
  9907. 279.69 s [vector] upd: OK
  9908. 279.69 s [vector] +++ OK, passed 100 tests.
  9909. 279.70 s [vector] accum: OK (0.01s)
  9910. 279.70 s [vector] +++ OK, passed 100 tests.
  9911. 279.70 s [vector] reverse: OK
  9912. 279.70 s [vector] +++ OK, passed 100 tests.
  9913. 279.71 s [vector] backpermute: OK
  9914. 279.71 s [vector] +++ OK, passed 100 tests.
  9915. 279.71 s [vector] map: OK
  9916. 279.71 s [vector] +++ OK, passed 100 tests.
  9917. 279.72 s [vector] imap: OK
  9918. 279.73 s [vector] +++ OK, passed 100 tests.
  9919. 279.73 s [vector] concatMap: OK
  9920. 279.73 s [vector] +++ OK, passed 100 tests.
  9921. 279.73 s [vector] mapM: OK
  9922. 279.73 s [vector] +++ OK, passed 100 tests.
  9923. 279.76 s [vector] mapM_: OK (0.03s)
  9924. 279.76 s [vector] +++ OK, passed 100 tests.
  9925. 279.77 s [vector] forM: OK
  9926. 279.77 s [vector] +++ OK, passed 100 tests.
  9927. 279.80 s [vector] forM_: OK (0.03s)
  9928. 279.81 s [vector] +++ OK, passed 100 tests.
  9929. 279.81 s [vector] imapM: OK
  9930. 279.81 s [vector] +++ OK, passed 100 tests.
  9931. 279.84 s [vector] imapM_: OK (0.03s)
  9932. 279.85 s [vector] +++ OK, passed 100 tests.
  9933. 279.85 s [vector] zipWith: OK
  9934. 279.85 s [vector] +++ OK, passed 100 tests.
  9935. 279.85 s [vector] zipWith3: OK
  9936. 279.85 s [vector] +++ OK, passed 100 tests.
  9937. 279.87 s [vector] izipWith: OK
  9938. 279.87 s [vector] +++ OK, passed 100 tests.
  9939. 279.87 s [vector] izipWith3: OK
  9940. 279.87 s [vector] +++ OK, passed 100 tests.
  9941. 279.88 s [vector] izipWithM: OK
  9942. 279.88 s [vector] +++ OK, passed 100 tests.
  9943. 279.91 s [vector] izipWithM_: OK (0.02s)
  9944. 279.91 s [vector] +++ OK, passed 100 tests.
  9945. 279.91 s [vector] zipWithM: OK
  9946. 279.91 s [vector] +++ OK, passed 100 tests.
  9947. 279.94 s [vector] zipWithM_: OK (0.02s)
  9948. 279.94 s [vector] +++ OK, passed 100 tests.
  9949. 279.94 s [vector] filter: OK
  9950. 279.94 s [vector] +++ OK, passed 100 tests.
  9951. 279.95 s [vector] ifilter: OK
  9952. 279.95 s [vector] +++ OK, passed 100 tests.
  9953. 279.99 s [vector] filterM: OK (0.04s)
  9954. 279.99 s [vector] +++ OK, passed 100 tests.
  9955. 280.00 s [vector] uniq: OK
  9956. 280.00 s [vector] +++ OK, passed 100 tests.
  9957. 280.00 s [vector] mapMaybe: OK
  9958. 280.00 s [vector] +++ OK, passed 100 tests.
  9959. 280.00 s [vector] imapMaybe: OK
  9960. 280.00 s [vector] +++ OK, passed 100 tests.
  9961. 280.00 s [vector] takeWhile: OK
  9962. 280.00 s [vector] +++ OK, passed 100 tests.
  9963. 280.01 s [vector] dropWhile: OK
  9964. 280.01 s [vector] +++ OK, passed 100 tests.
  9965. 280.01 s [vector] partition: OK
  9966. 280.01 s [vector] +++ OK, passed 100 tests.
  9967. 280.02 s [vector] partitionWith: OK
  9968. 280.02 s [vector] +++ OK, passed 100 tests.
  9969. 280.02 s [vector] span: OK
  9970. 280.02 s [vector] +++ OK, passed 100 tests.
  9971. 280.02 s [vector] break: OK
  9972. 280.02 s [vector] +++ OK, passed 100 tests.
  9973. 280.02 s [vector] spanR: OK
  9974. 280.02 s [vector] +++ OK, passed 100 tests.
  9975. 280.03 s [vector] breakR: OK
  9976. 280.03 s [vector] +++ OK, passed 100 tests.
  9977. 280.03 s [vector] groupBy: OK
  9978. 280.03 s [vector] +++ OK, passed 100 tests.
  9979. 280.03 s [vector] elem: OK
  9980. 280.03 s [vector] +++ OK, passed 100 tests.
  9981. 280.03 s [vector] notElem: OK
  9982. 280.03 s [vector] +++ OK, passed 100 tests.
  9983. 280.04 s [vector] find: OK
  9984. 280.04 s [vector] +++ OK, passed 100 tests.
  9985. 280.04 s [vector] findIndex: OK
  9986. 280.04 s [vector] +++ OK, passed 100 tests.
  9987. 280.04 s [vector] findIndexR: OK
  9988. 280.04 s [vector] +++ OK, passed 100 tests.
  9989. 280.04 s [vector] findIndices: OK
  9990. 280.04 s [vector] +++ OK, passed 100 tests.
  9991. 280.04 s [vector] elemIndex: OK
  9992. 280.04 s [vector] +++ OK, passed 100 tests.
  9993. 280.05 s [vector] elemIndices: OK
  9994. 280.05 s [vector] +++ OK, passed 100 tests.
  9995. 280.06 s [vector] foldl: OK
  9996. 280.07 s [vector] +++ OK, passed 100 tests.
  9997. 280.07 s [vector] foldl1: OK (0.01s)
  9998. 280.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9999. 280.09 s [vector] foldl': OK
  10000. 280.09 s [vector] +++ OK, passed 100 tests.
  10001. 280.09 s [vector] foldl1': OK (0.01s)
  10002. 280.09 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10003. 280.10 s [vector] foldr: OK (0.01s)
  10004. 280.11 s [vector] +++ OK, passed 100 tests.
  10005. 280.12 s [vector] foldr1: OK (0.01s)
  10006. 280.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10007. 280.13 s [vector] foldr': OK (0.01s)
  10008. 280.13 s [vector] +++ OK, passed 100 tests.
  10009. 280.14 s [vector] foldr1': OK (0.01s)
  10010. 280.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10011. 280.14 s [vector] ifoldl: OK (0.01s)
  10012. 280.14 s [vector] +++ OK, passed 100 tests.
  10013. 280.15 s [vector] ifoldl': OK
  10014. 280.15 s [vector] +++ OK, passed 100 tests.
  10015. 280.17 s [vector] ifoldr: OK (0.01s)
  10016. 280.17 s [vector] +++ OK, passed 100 tests.
  10017. 280.17 s [vector] ifoldr': OK (0.01s)
  10018. 280.17 s [vector] +++ OK, passed 100 tests.
  10019. 280.19 s [vector] ifoldM: OK
  10020. 280.19 s [vector] +++ OK, passed 100 tests.
  10021. 280.21 s [vector] ifoldM': OK (0.01s)
  10022. 280.21 s [vector] +++ OK, passed 100 tests.
  10023. 280.23 s [vector] ifoldM_: OK (0.03s)
  10024. 280.23 s [vector] +++ OK, passed 100 tests.
  10025. 280.26 s [vector] ifoldM'_: OK (0.03s)
  10026. 280.26 s [vector] +++ OK, passed 100 tests.
  10027. 280.27 s [vector] all: OK
  10028. 280.28 s [vector] +++ OK, passed 100 tests.
  10029. 280.29 s [vector] any: OK
  10030. 280.29 s [vector] +++ OK, passed 100 tests.
  10031. 280.29 s [vector] prescanl: OK (0.01s)
  10032. 280.29 s [vector] +++ OK, passed 100 tests.
  10033. 280.29 s [vector] prescanl': OK (0.01s)
  10034. 280.29 s [vector] +++ OK, passed 100 tests.
  10035. 280.31 s [vector] postscanl: OK (0.02s)
  10036. 280.31 s [vector] +++ OK, passed 100 tests.
  10037. 280.31 s [vector] postscanl': OK (0.01s)
  10038. 280.31 s [vector] +++ OK, passed 100 tests.
  10039. 280.32 s [vector] scanl: OK
  10040. 280.32 s [vector] +++ OK, passed 100 tests.
  10041. 280.35 s [vector] scanl': OK (0.01s)
  10042. 280.35 s [vector] +++ OK, passed 100 tests.
  10043. 280.35 s [vector] scanl1: OK (0.01s)
  10044. 280.35 s [vector] +++ OK, passed 100 tests.
  10045. 280.37 s [vector] scanl1': OK (0.01s)
  10046. 280.37 s [vector] +++ OK, passed 100 tests.
  10047. 280.38 s [vector] iscanl: OK (0.01s)
  10048. 280.38 s [vector] +++ OK, passed 100 tests.
  10049. 280.39 s [vector] iscanl': OK (0.01s)
  10050. 280.39 s [vector] +++ OK, passed 100 tests.
  10051. 280.40 s [vector] prescanr: OK
  10052. 280.41 s [vector] +++ OK, passed 100 tests.
  10053. 280.42 s [vector] prescanr': OK (0.01s)
  10054. 280.42 s [vector] +++ OK, passed 100 tests.
  10055. 280.43 s [vector] postscanr: OK (0.01s)
  10056. 280.43 s [vector] +++ OK, passed 100 tests.
  10057. 280.43 s [vector] postscanr': OK (0.01s)
  10058. 280.43 s [vector] +++ OK, passed 100 tests.
  10059. 280.45 s [vector] scanr: OK (0.01s)
  10060. 280.45 s [vector] +++ OK, passed 100 tests.
  10061. 280.47 s [vector] scanr': OK (0.01s)
  10062. 280.47 s [vector] +++ OK, passed 100 tests.
  10063. 280.48 s [vector] scanr1: OK (0.01s)
  10064. 280.49 s [vector] +++ OK, passed 100 tests.
  10065. 280.49 s [vector] scanr1': OK
  10066. 280.49 s [vector] +++ OK, passed 100 tests.
  10067. 280.49 s [vector] iscanr: OK (0.01s)
  10068. 280.50 s [vector] +++ OK, passed 100 tests.
  10069. 280.50 s [vector] iscanr': OK (0.01s)
  10070. 280.50 s [vector] +++ OK, passed 100 tests.
  10071. 280.50 s [vector] mut_read: OK
  10072. 280.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10073. 280.50 s [vector] mut_write: OK
  10074. 280.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10075. 280.50 s [vector] mut_modify: OK
  10076. 280.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10077. 280.51 s [vector] mut_generate: OK
  10078. 280.51 s [vector] +++ OK, passed 100 tests.
  10079. 280.52 s [vector] mut_generateM: OK (0.02s)
  10080. 280.52 s [vector] +++ OK, passed 100 tests.
  10081. 280.57 s [vector] mut_mapM_: OK (0.03s)
  10082. 280.57 s [vector] +++ OK, passed 100 tests.
  10083. 280.59 s [vector] mut_imapM_: OK (0.03s)
  10084. 280.59 s [vector] +++ OK, passed 100 tests.
  10085. 280.63 s [vector] mut_forM_: OK (0.03s)
  10086. 280.63 s [vector] +++ OK, passed 100 tests.
  10087. 280.65 s [vector] mut_iforM_: OK (0.03s)
  10088. 280.65 s [vector] +++ OK, passed 100 tests.
  10089. 280.67 s [vector] mut_foldr: OK (0.01s)
  10090. 280.67 s [vector] +++ OK, passed 100 tests.
  10091. 280.69 s [vector] mut_foldr': OK (0.02s)
  10092. 280.69 s [vector] +++ OK, passed 100 tests.
  10093. 280.69 s [vector] mut_foldl: OK (0.01s)
  10094. 280.69 s [vector] +++ OK, passed 100 tests.
  10095. 280.71 s [vector] mut_foldl': OK (0.01s)
  10096. 280.71 s [vector] +++ OK, passed 100 tests.
  10097. 280.73 s [vector] mut_ifoldr: OK (0.02s)
  10098. 280.73 s [vector] +++ OK, passed 100 tests.
  10099. 280.74 s [vector] mut_ifoldr': OK (0.01s)
  10100. 280.74 s [vector] +++ OK, passed 100 tests.
  10101. 280.75 s [vector] mut_ifoldl: OK (0.01s)
  10102. 280.75 s [vector] +++ OK, passed 100 tests.
  10103. 280.77 s [vector] mut_ifoldl': OK (0.01s)
  10104. 280.77 s [vector] +++ OK, passed 100 tests.
  10105. 280.77 s [vector] mut_foldM: OK (0.01s)
  10106. 280.77 s [vector] +++ OK, passed 100 tests.
  10107. 280.79 s [vector] mut_foldM': OK (0.01s)
  10108. 280.79 s [vector] +++ OK, passed 100 tests.
  10109. 280.81 s [vector] mut_foldrM: OK (0.02s)
  10110. 280.81 s [vector] +++ OK, passed 100 tests.
  10111. 280.82 s [vector] mut_foldrM': OK (0.01s)
  10112. 280.82 s [vector] +++ OK, passed 100 tests.
  10113. 280.83 s [vector] mut_ifoldM: OK (0.01s)
  10114. 280.83 s [vector] +++ OK, passed 100 tests.
  10115. 280.83 s [vector] mut_ifoldM': OK (0.01s)
  10116. 280.83 s [vector] +++ OK, passed 100 tests.
  10117. 280.84 s [vector] mut_ifoldrM: OK
  10118. 280.84 s [vector] +++ OK, passed 100 tests.
  10119. 280.85 s [vector] mut_ifoldrM': OK (0.01s)
  10120. 280.85 s [vector] +++ OK, passed 100 tests.
  10121. 280.85 s [vector] compare: OK
  10122. 280.85 s [vector] +++ OK, passed 100 tests.
  10123. 280.85 s [vector] maximum: OK
  10124. 280.85 s [vector] +++ OK, passed 100 tests; 24 discarded.
  10125. 280.85 s [vector] minimum: OK
  10126. 280.85 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10127. 280.85 s [vector] minIndex: OK
  10128. 280.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10129. 280.85 s [vector] maxIndex: OK
  10130. 280.85 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10131. 280.86 s [vector] maximumBy: OK
  10132. 280.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10133. 280.86 s [vector] minimumBy: OK
  10134. 280.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10135. 280.86 s [vector] maximumOn: OK
  10136. 280.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10137. 280.86 s [vector] minimumOn: OK
  10138. 280.86 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10139. 280.86 s [vector] maxIndexBy: OK
  10140. 280.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10141. 280.86 s [vector] minIndexBy: OK
  10142. 280.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10143. 280.86 s [vector] ListFirstMaxIndexWins: OK
  10144. 280.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10145. 280.86 s [vector] FalseListFirstMaxIndexWins: OK
  10146. 280.86 s [vector] +++ OK, failed as expected. (after 1 test):
  10147. 280.86 s [vector] Exception:
  10148. 280.86 s [vector] Prelude.foldr1: empty list
  10149. 280.86 s [vector] CallStack (from HasCallStack):
  10150. 280.86 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10151. 280.86 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10152. 280.86 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10153. 280.86 s [vector] []
  10154. 280.86 s [vector] mempty: OK
  10155. 280.86 s [vector] +++ OK, passed 100 tests.
  10156. 280.87 s [vector] mappend: OK
  10157. 280.87 s [vector] +++ OK, passed 100 tests.
  10158. 280.89 s [vector] mconcat: OK (0.02s)
  10159. 280.89 s [vector] +++ OK, passed 100 tests.
  10160. 280.89 s [vector] glength: OK
  10161. 280.89 s [vector] +++ OK, passed 100 tests.
  10162. 280.89 s [vector] sum: OK
  10163. 280.89 s [vector] +++ OK, passed 100 tests.
  10164. 280.89 s [vector] product: OK
  10165. 280.89 s [vector] +++ OK, passed 100 tests.
  10166. 280.89 s [vector] enumFromN: OK
  10167. 280.89 s [vector] +++ OK, passed 100 tests.
  10168. 280.89 s [vector] enumFromThenN: OK
  10169. 280.89 s [vector] +++ OK, passed 100 tests.
  10170. 280.89 s [vector] enumFromTo: OK
  10171. 280.89 s [vector] +++ OK, passed 100 tests.
  10172. 280.89 s [vector] enumFromThenTo: OK
  10173. 280.89 s [vector] +++ OK, passed 100 tests; 4 discarded.
  10174. 280.89 s [vector] unstream
  10175. 280.89 s [vector] unstream == vunstream (exact): OK
  10176. 280.89 s [vector] +++ OK, passed 100 tests.
  10177. 280.89 s [vector] unstream == vunstream (unknown): OK
  10178. 280.89 s [vector] +++ OK, passed 100 tests.
  10179. 280.89 s [vector] unstreamR ~= vunstream (exact): OK
  10180. 280.89 s [vector] +++ OK, passed 100 tests.
  10181. 280.89 s [vector] unstreamR ~= vunstream (unknown): OK
  10182. 280.89 s [vector] +++ OK, passed 100 tests.
  10183. 280.89 s [vector] Tests.Vector.Strict
  10184. 280.89 s [vector] Bool
  10185. 280.89 s [vector] fromList.toList == id: OK
  10186. 280.89 s [vector] +++ OK, passed 100 tests.
  10187. 280.89 s [vector] toList.fromList == id: OK
  10188. 280.89 s [vector] +++ OK, passed 100 tests.
  10189. 280.89 s [vector] unstream.stream == id: OK
  10190. 280.89 s [vector] +++ OK, passed 100 tests.
  10191. 280.89 s [vector] stream.unstream == id: OK
  10192. 280.89 s [vector] +++ OK, passed 100 tests.
  10193. 280.89 s [vector] eq: OK
  10194. 280.89 s [vector] +++ OK, passed 100 tests.
  10195. 280.89 s [vector] length: OK
  10196. 280.89 s [vector] +++ OK, passed 100 tests.
  10197. 280.89 s [vector] null: OK
  10198. 280.89 s [vector] +++ OK, passed 100 tests.
  10199. 280.89 s [vector] index: OK
  10200. 280.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10201. 280.90 s [vector] safeIndex: OK
  10202. 280.90 s [vector] +++ OK, passed 100 tests.
  10203. 280.90 s [vector] head: OK
  10204. 280.90 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10205. 280.90 s [vector] last: OK
  10206. 280.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10207. 280.90 s [vector] unsafeIndex: OK
  10208. 280.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10209. 280.90 s [vector] unsafeHead: OK
  10210. 280.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10211. 280.90 s [vector] unsafeLast: OK
  10212. 280.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10213. 280.90 s [vector] slice: OK
  10214. 280.90 s [vector] +++ OK, passed 100 tests.
  10215. 280.90 s [vector] init: OK
  10216. 280.90 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10217. 280.90 s [vector] tail: OK
  10218. 280.90 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10219. 280.90 s [vector] take: OK
  10220. 280.90 s [vector] +++ OK, passed 100 tests.
  10221. 280.90 s [vector] drop: OK
  10222. 280.90 s [vector] +++ OK, passed 100 tests.
  10223. 280.90 s [vector] splitAt: OK
  10224. 280.90 s [vector] +++ OK, passed 100 tests.
  10225. 280.90 s [vector] empty: OK
  10226. 280.90 s [vector] +++ OK, passed 100 tests.
  10227. 280.90 s [vector] singleton: OK
  10228. 280.90 s [vector] +++ OK, passed 100 tests.
  10229. 280.90 s [vector] replicate: OK
  10230. 280.90 s [vector] +++ OK, passed 100 tests.
  10231. 280.90 s [vector] generate: OK
  10232. 280.90 s [vector] +++ OK, passed 100 tests.
  10233. 280.91 s [vector] iterateN: OK
  10234. 280.91 s [vector] +++ OK, passed 100 tests.
  10235. 280.93 s [vector] iterateNM: OK (0.02s)
  10236. 280.93 s [vector] +++ OK, passed 100 tests.
  10237. 280.93 s [vector] generateM: OK (0.01s)
  10238. 280.93 s [vector] +++ OK, passed 100 tests.
  10239. 280.94 s [vector] replicateM: OK
  10240. 280.94 s [vector] +++ OK, passed 100 tests.
  10241. 280.94 s [vector] create: OK
  10242. 280.94 s [vector] +++ OK, passed 100 tests.
  10243. 280.94 s [vector] createT: OK
  10244. 280.94 s [vector] +++ OK, passed 100 tests.
  10245. 280.94 s [vector] unfoldr: OK
  10246. 280.94 s [vector] +++ OK, passed 100 tests.
  10247. 280.94 s [vector] unfoldrN: OK
  10248. 280.94 s [vector] +++ OK, passed 100 tests.
  10249. 280.94 s [vector] unfoldrExactN: OK
  10250. 280.94 s [vector] +++ OK, passed 100 tests.
  10251. 280.94 s [vector] unfoldrM: OK
  10252. 280.95 s [vector] +++ OK, passed 100 tests.
  10253. 280.96 s [vector] unfoldrNM: OK
  10254. 280.96 s [vector] +++ OK, passed 100 tests.
  10255. 280.96 s [vector] unfoldrExactNM: OK (0.02s)
  10256. 280.97 s [vector] +++ OK, passed 100 tests.
  10257. 280.97 s [vector] constructN: OK
  10258. 280.97 s [vector] +++ OK, passed 100 tests.
  10259. 280.97 s [vector] constructrN: OK
  10260. 280.97 s [vector] +++ OK, passed 100 tests.
  10261. 280.97 s [vector] cons: OK
  10262. 280.97 s [vector] +++ OK, passed 100 tests.
  10263. 280.97 s [vector] snoc: OK
  10264. 280.97 s [vector] +++ OK, passed 100 tests.
  10265. 280.97 s [vector] append: OK
  10266. 280.97 s [vector] +++ OK, passed 100 tests.
  10267. 280.98 s [vector] concat: OK
  10268. 280.98 s [vector] +++ OK, passed 100 tests.
  10269. 280.98 s [vector] force: OK
  10270. 280.98 s [vector] +++ OK, passed 100 tests.
  10271. 280.98 s [vector] upd: OK
  10272. 280.98 s [vector] +++ OK, passed 100 tests.
  10273. 280.98 s [vector] accum: OK
  10274. 280.98 s [vector] +++ OK, passed 100 tests.
  10275. 280.98 s [vector] reverse: OK
  10276. 280.98 s [vector] +++ OK, passed 100 tests.
  10277. 280.98 s [vector] backpermute: OK
  10278. 280.98 s [vector] +++ OK, passed 100 tests.
  10279. 280.98 s [vector] map: OK
  10280. 280.98 s [vector] +++ OK, passed 100 tests.
  10281. 280.98 s [vector] imap: OK
  10282. 280.98 s [vector] +++ OK, passed 100 tests.
  10283. 280.99 s [vector] concatMap: OK
  10284. 280.99 s [vector] +++ OK, passed 100 tests.
  10285. 280.99 s [vector] mapM: OK
  10286. 280.99 s [vector] +++ OK, passed 100 tests.
  10287. 281.00 s [vector] mapM_: OK (0.01s)
  10288. 281.00 s [vector] +++ OK, passed 100 tests.
  10289. 281.01 s [vector] forM: OK
  10290. 281.01 s [vector] +++ OK, passed 100 tests.
  10291. 281.02 s [vector] forM_: OK (0.02s)
  10292. 281.02 s [vector] +++ OK, passed 100 tests.
  10293. 281.02 s [vector] imapM: OK
  10294. 281.03 s [vector] +++ OK, passed 100 tests.
  10295. 281.04 s [vector] imapM_: OK (0.02s)
  10296. 281.04 s [vector] +++ OK, passed 100 tests.
  10297. 281.04 s [vector] zipWith: OK
  10298. 281.04 s [vector] +++ OK, passed 100 tests.
  10299. 281.04 s [vector] zipWith3: OK
  10300. 281.04 s [vector] +++ OK, passed 100 tests.
  10301. 281.04 s [vector] izipWith: OK
  10302. 281.04 s [vector] +++ OK, passed 100 tests.
  10303. 281.04 s [vector] izipWith3: OK
  10304. 281.04 s [vector] +++ OK, passed 100 tests.
  10305. 281.05 s [vector] izipWithM: OK
  10306. 281.05 s [vector] +++ OK, passed 100 tests.
  10307. 281.05 s [vector] izipWithM_: OK
  10308. 281.05 s [vector] +++ OK, passed 100 tests.
  10309. 281.05 s [vector] zipWithM: OK
  10310. 281.05 s [vector] +++ OK, passed 100 tests.
  10311. 281.06 s [vector] zipWithM_: OK
  10312. 281.06 s [vector] +++ OK, passed 100 tests.
  10313. 281.06 s [vector] filter: OK
  10314. 281.06 s [vector] +++ OK, passed 100 tests.
  10315. 281.07 s [vector] ifilter: OK
  10316. 281.07 s [vector] +++ OK, passed 100 tests.
  10317. 281.09 s [vector] filterM: OK (0.02s)
  10318. 281.09 s [vector] +++ OK, passed 100 tests.
  10319. 281.44 s [vector] uniq: OK
  10320. 281.44 s [vector] +++ OK, passed 100 tests.
  10321. 281.44 s [vector] mapMaybe: OK
  10322. 281.44 s [vector] +++ OK, passed 100 tests.
  10323. 281.44 s [vector] imapMaybe: OK
  10324. 281.44 s [vector] +++ OK, passed 100 tests.
  10325. 281.44 s [vector] takeWhile: OK
  10326. 281.44 s [vector] +++ OK, passed 100 tests.
  10327. 281.44 s [vector] dropWhile: OK
  10328. 281.44 s [vector] +++ OK, passed 100 tests.
  10329. 281.44 s [vector] partition: OK
  10330. 281.44 s [vector] +++ OK, passed 100 tests.
  10331. 281.44 s [vector] partitionWith: OK
  10332. 281.44 s [vector] +++ OK, passed 100 tests.
  10333. 281.44 s [vector] span: OK
  10334. 281.44 s [vector] +++ OK, passed 100 tests.
  10335. 281.44 s [vector] break: OK
  10336. 281.44 s [vector] +++ OK, passed 100 tests.
  10337. 281.44 s [vector] spanR: OK
  10338. 281.44 s [vector] +++ OK, passed 100 tests.
  10339. 281.44 s [vector] breakR: OK
  10340. 281.44 s [vector] +++ OK, passed 100 tests.
  10341. 281.44 s [vector] groupBy: OK
  10342. 281.44 s [vector] +++ OK, passed 100 tests.
  10343. 281.44 s [vector] elem: OK
  10344. 281.44 s [vector] +++ OK, passed 100 tests.
  10345. 281.44 s [vector] notElem: OK
  10346. 281.44 s [vector] +++ OK, passed 100 tests.
  10347. 281.44 s [vector] find: OK
  10348. 281.44 s [vector] +++ OK, passed 100 tests.
  10349. 281.44 s [vector] findIndex: OK
  10350. 281.44 s [vector] +++ OK, passed 100 tests.
  10351. 281.44 s [vector] findIndexR: OK
  10352. 281.44 s [vector] +++ OK, passed 100 tests.
  10353. 281.44 s [vector] findIndices: OK
  10354. 281.44 s [vector] +++ OK, passed 100 tests.
  10355. 281.44 s [vector] elemIndex: OK
  10356. 281.44 s [vector] +++ OK, passed 100 tests.
  10357. 281.44 s [vector] elemIndices: OK
  10358. 281.44 s [vector] +++ OK, passed 100 tests.
  10359. 281.44 s [vector] foldl: OK
  10360. 281.44 s [vector] +++ OK, passed 100 tests.
  10361. 281.44 s [vector] foldl1: OK
  10362. 281.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10363. 281.44 s [vector] foldl': OK
  10364. 281.44 s [vector] +++ OK, passed 100 tests.
  10365. 281.44 s [vector] foldl1': OK
  10366. 281.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10367. 281.44 s [vector] foldr: OK
  10368. 281.44 s [vector] +++ OK, passed 100 tests.
  10369. 281.44 s [vector] foldr1: OK
  10370. 281.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10371. 281.44 s [vector] foldr': OK
  10372. 281.44 s [vector] +++ OK, passed 100 tests.
  10373. 281.44 s [vector] foldr1': OK
  10374. 281.44 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10375. 281.44 s [vector] ifoldl: OK
  10376. 281.44 s [vector] +++ OK, passed 100 tests.
  10377. 281.44 s [vector] ifoldl': OK
  10378. 281.44 s [vector] +++ OK, passed 100 tests.
  10379. 281.44 s [vector] ifoldr: OK
  10380. 281.44 s [vector] +++ OK, passed 100 tests.
  10381. 281.44 s [vector] ifoldr': OK
  10382. 281.44 s [vector] +++ OK, passed 100 tests.
  10383. 281.44 s [vector] ifoldM: OK
  10384. 281.44 s [vector] +++ OK, passed 100 tests.
  10385. 281.44 s [vector] ifoldM': OK
  10386. 281.44 s [vector] +++ OK, passed 100 tests.
  10387. 281.44 s [vector] ifoldM_: OK
  10388. 281.44 s [vector] +++ OK, passed 100 tests.
  10389. 281.44 s [vector] ifoldM'_: OK
  10390. 281.44 s [vector] +++ OK, passed 100 tests.
  10391. 281.44 s [vector] all: OK
  10392. 281.44 s [vector] +++ OK, passed 100 tests.
  10393. 281.44 s [vector] any: OK
  10394. 281.44 s [vector] +++ OK, passed 100 tests.
  10395. 281.44 s [vector] prescanl: OK
  10396. 281.44 s [vector] +++ OK, passed 100 tests.
  10397. 281.44 s [vector] prescanl': OK
  10398. 281.44 s [vector] +++ OK, passed 100 tests.
  10399. 281.44 s [vector] postscanl: OK
  10400. 281.44 s [vector] +++ OK, passed 100 tests.
  10401. 281.44 s [vector] postscanl': OK
  10402. 281.44 s [vector] +++ OK, passed 100 tests.
  10403. 281.44 s [vector] scanl: OK
  10404. 281.44 s [vector] +++ OK, passed 100 tests.
  10405. 281.44 s [vector] scanl': OK
  10406. 281.44 s [vector] +++ OK, passed 100 tests.
  10407. 281.44 s [vector] scanl1: OK
  10408. 281.44 s [vector] +++ OK, passed 100 tests.
  10409. 281.44 s [vector] scanl1': OK
  10410. 281.44 s [vector] +++ OK, passed 100 tests.
  10411. 281.44 s [vector] iscanl: OK
  10412. 281.44 s [vector] +++ OK, passed 100 tests.
  10413. 281.44 s [vector] iscanl': OK
  10414. 281.44 s [vector] +++ OK, passed 100 tests.
  10415. 281.45 s [vector] prescanr: OK
  10416. 281.45 s [vector] +++ OK, passed 100 tests.
  10417. 281.45 s [vector] prescanr': OK
  10418. 281.45 s [vector] +++ OK, passed 100 tests.
  10419. 281.45 s [vector] postscanr: OK
  10420. 281.45 s [vector] +++ OK, passed 100 tests.
  10421. 281.45 s [vector] postscanr': OK
  10422. 281.45 s [vector] +++ OK, passed 100 tests.
  10423. 281.45 s [vector] scanr: OK
  10424. 281.45 s [vector] +++ OK, passed 100 tests.
  10425. 281.45 s [vector] scanr': OK
  10426. 281.45 s [vector] +++ OK, passed 100 tests.
  10427. 281.45 s [vector] scanr1: OK
  10428. 281.45 s [vector] +++ OK, passed 100 tests.
  10429. 281.45 s [vector] scanr1': OK
  10430. 281.45 s [vector] +++ OK, passed 100 tests.
  10431. 281.45 s [vector] iscanr: OK
  10432. 281.45 s [vector] +++ OK, passed 100 tests.
  10433. 281.45 s [vector] iscanr': OK
  10434. 281.45 s [vector] +++ OK, passed 100 tests.
  10435. 281.45 s [vector] mut_read: OK
  10436. 281.45 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10437. 281.45 s [vector] mut_write: OK
  10438. 281.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10439. 281.45 s [vector] mut_modify: OK
  10440. 281.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10441. 281.45 s [vector] mut_generate: OK
  10442. 281.45 s [vector] +++ OK, passed 100 tests.
  10443. 281.45 s [vector] mut_generateM: OK
  10444. 281.45 s [vector] +++ OK, passed 100 tests.
  10445. 281.45 s [vector] mut_mapM_: OK
  10446. 281.45 s [vector] +++ OK, passed 100 tests.
  10447. 281.45 s [vector] mut_imapM_: OK
  10448. 281.45 s [vector] +++ OK, passed 100 tests.
  10449. 281.45 s [vector] mut_forM_: OK
  10450. 281.45 s [vector] +++ OK, passed 100 tests.
  10451. 281.45 s [vector] mut_iforM_: OK
  10452. 281.45 s [vector] +++ OK, passed 100 tests.
  10453. 281.45 s [vector] mut_foldr: OK
  10454. 281.45 s [vector] +++ OK, passed 100 tests.
  10455. 281.45 s [vector] mut_foldr': OK
  10456. 281.45 s [vector] +++ OK, passed 100 tests.
  10457. 281.45 s [vector] mut_foldl: OK
  10458. 281.45 s [vector] +++ OK, passed 100 tests.
  10459. 281.45 s [vector] mut_foldl': OK
  10460. 281.45 s [vector] +++ OK, passed 100 tests.
  10461. 281.45 s [vector] mut_ifoldr: OK
  10462. 281.45 s [vector] +++ OK, passed 100 tests.
  10463. 281.45 s [vector] mut_ifoldr': OK
  10464. 281.45 s [vector] +++ OK, passed 100 tests.
  10465. 281.45 s [vector] mut_ifoldl: OK
  10466. 281.45 s [vector] +++ OK, passed 100 tests.
  10467. 281.45 s [vector] mut_ifoldl': OK
  10468. 281.45 s [vector] +++ OK, passed 100 tests.
  10469. 281.45 s [vector] mut_foldM: OK
  10470. 281.45 s [vector] +++ OK, passed 100 tests.
  10471. 281.45 s [vector] mut_foldM': OK
  10472. 281.45 s [vector] +++ OK, passed 100 tests.
  10473. 281.45 s [vector] mut_foldrM: OK
  10474. 281.45 s [vector] +++ OK, passed 100 tests.
  10475. 281.45 s [vector] mut_foldrM': OK
  10476. 281.45 s [vector] +++ OK, passed 100 tests.
  10477. 281.45 s [vector] mut_ifoldM: OK
  10478. 281.45 s [vector] +++ OK, passed 100 tests.
  10479. 281.45 s [vector] mut_ifoldM': OK
  10480. 281.45 s [vector] +++ OK, passed 100 tests.
  10481. 281.45 s [vector] mut_ifoldrM: OK
  10482. 281.45 s [vector] +++ OK, passed 100 tests.
  10483. 281.45 s [vector] mut_ifoldrM': OK
  10484. 281.45 s [vector] +++ OK, passed 100 tests.
  10485. 281.45 s [vector] compare: OK
  10486. 281.45 s [vector] +++ OK, passed 100 tests.
  10487. 281.45 s [vector] maximum: OK
  10488. 281.45 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10489. 281.45 s [vector] minimum: OK
  10490. 281.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10491. 281.45 s [vector] minIndex: OK
  10492. 281.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10493. 281.45 s [vector] maxIndex: OK
  10494. 281.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10495. 281.45 s [vector] maximumBy: OK
  10496. 281.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10497. 281.45 s [vector] minimumBy: OK
  10498. 281.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10499. 281.45 s [vector] maximumOn: OK
  10500. 281.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10501. 281.45 s [vector] minimumOn: OK
  10502. 281.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10503. 281.45 s [vector] maxIndexBy: OK
  10504. 281.45 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10505. 281.45 s [vector] minIndexBy: OK
  10506. 281.45 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10507. 281.45 s [vector] ListFirstMaxIndexWins: OK
  10508. 281.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10509. 281.45 s [vector] FalseListFirstMaxIndexWins: OK
  10510. 281.45 s [vector] +++ OK, failed as expected. (after 1 test):
  10511. 281.45 s [vector] Exception:
  10512. 281.45 s [vector] Prelude.foldr1: empty list
  10513. 281.45 s [vector] CallStack (from HasCallStack):
  10514. 281.45 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10515. 281.45 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10516. 281.45 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10517. 281.45 s [vector] []
  10518. 281.45 s [vector] zip: OK
  10519. 281.45 s [vector] +++ OK, passed 100 tests.
  10520. 281.45 s [vector] zip3: OK
  10521. 281.45 s [vector] +++ OK, passed 100 tests.
  10522. 281.45 s [vector] unzip: OK
  10523. 281.45 s [vector] +++ OK, passed 100 tests.
  10524. 281.45 s [vector] unzip3: OK
  10525. 281.45 s [vector] +++ OK, passed 100 tests.
  10526. 281.45 s [vector] indexed: OK
  10527. 281.45 s [vector] +++ OK, passed 100 tests.
  10528. 281.45 s [vector] update: OK
  10529. 281.45 s [vector] +++ OK, passed 100 tests.
  10530. 281.45 s [vector] concat: OK
  10531. 281.45 s [vector] +++ OK, passed 100 tests.
  10532. 281.45 s [vector] mempty: OK
  10533. 281.45 s [vector] +++ OK, passed 100 tests.
  10534. 281.45 s [vector] mappend: OK
  10535. 281.45 s [vector] +++ OK, passed 100 tests.
  10536. 281.45 s [vector] mconcat: OK
  10537. 281.45 s [vector] +++ OK, passed 100 tests.
  10538. 281.45 s [vector] fmap: OK
  10539. 281.45 s [vector] +++ OK, passed 100 tests.
  10540. 281.45 s [vector] return: OK
  10541. 281.45 s [vector] +++ OK, passed 100 tests.
  10542. 281.45 s [vector] bind: OK
  10543. 281.45 s [vector] +++ OK, passed 100 tests.
  10544. 281.45 s [vector] mzip: OK
  10545. 281.45 s [vector] +++ OK, passed 100 tests.
  10546. 281.45 s [vector] munzip: OK
  10547. 281.45 s [vector] +++ OK, passed 100 tests.
  10548. 281.45 s [vector] applicative_pure: OK
  10549. 281.45 s [vector] +++ OK, passed 100 tests.
  10550. 281.45 s [vector] applicative_appl: OK (0.01s)
  10551. 281.45 s [vector] +++ OK, passed 100 tests.
  10552. 281.45 s [vector] alternative_empty: OK
  10553. 281.45 s [vector] +++ OK, passed 100 tests.
  10554. 281.45 s [vector] alternative_or: OK
  10555. 281.45 s [vector] +++ OK, passed 100 tests.
  10556. 281.45 s [vector] sequence: OK (0.02s)
  10557. 281.45 s [vector] +++ OK, passed 100 tests.
  10558. 281.45 s [vector] sequence_: OK
  10559. 281.45 s [vector] +++ OK, passed 100 tests.
  10560. 281.45 s [vector] glength: OK
  10561. 281.45 s [vector] +++ OK, passed 100 tests.
  10562. 281.45 s [vector] and: OK
  10563. 281.45 s [vector] +++ OK, passed 100 tests.
  10564. 281.45 s [vector] or: OK
  10565. 281.45 s [vector] +++ OK, passed 100 tests.
  10566. 281.45 s [vector] Int
  10567. 281.45 s [vector] fromList.toList == id: OK
  10568. 281.45 s [vector] +++ OK, passed 100 tests.
  10569. 281.45 s [vector] toList.fromList == id: OK
  10570. 281.45 s [vector] +++ OK, passed 100 tests.
  10571. 281.45 s [vector] unstream.stream == id: OK
  10572. 281.45 s [vector] +++ OK, passed 100 tests.
  10573. 281.45 s [vector] stream.unstream == id: OK
  10574. 281.45 s [vector] +++ OK, passed 100 tests.
  10575. 281.45 s [vector] eq: OK
  10576. 281.45 s [vector] +++ OK, passed 100 tests.
  10577. 281.45 s [vector] length: OK
  10578. 281.45 s [vector] +++ OK, passed 100 tests.
  10579. 281.45 s [vector] null: OK
  10580. 281.45 s [vector] +++ OK, passed 100 tests.
  10581. 281.45 s [vector] index: OK
  10582. 281.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10583. 281.45 s [vector] safeIndex: OK
  10584. 281.45 s [vector] +++ OK, passed 100 tests.
  10585. 281.45 s [vector] head: OK
  10586. 281.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10587. 281.45 s [vector] last: OK
  10588. 281.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10589. 281.45 s [vector] unsafeIndex: OK
  10590. 281.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10591. 281.45 s [vector] unsafeHead: OK
  10592. 281.45 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10593. 281.45 s [vector] unsafeLast: OK
  10594. 281.45 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10595. 281.45 s [vector] slice: OK
  10596. 281.45 s [vector] +++ OK, passed 100 tests.
  10597. 281.45 s [vector] init: OK
  10598. 281.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10599. 281.45 s [vector] tail: OK
  10600. 281.45 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10601. 281.45 s [vector] take: OK
  10602. 281.45 s [vector] +++ OK, passed 100 tests.
  10603. 281.45 s [vector] drop: OK
  10604. 281.45 s [vector] +++ OK, passed 100 tests.
  10605. 281.45 s [vector] splitAt: OK
  10606. 281.45 s [vector] +++ OK, passed 100 tests.
  10607. 281.45 s [vector] empty: OK
  10608. 281.45 s [vector] +++ OK, passed 100 tests.
  10609. 281.45 s [vector] singleton: OK
  10610. 281.45 s [vector] +++ OK, passed 100 tests.
  10611. 281.45 s [vector] replicate: OK
  10612. 281.45 s [vector] +++ OK, passed 100 tests.
  10613. 281.45 s [vector] generate: OK
  10614. 281.45 s [vector] +++ OK, passed 100 tests.
  10615. 281.45 s [vector] iterateN: OK
  10616. 281.45 s [vector] +++ OK, passed 100 tests.
  10617. 281.45 s [vector] iterateNM: OK (0.01s)
  10618. 281.45 s [vector] +++ OK, passed 100 tests.
  10619. 281.45 s [vector] generateM: OK (0.02s)
  10620. 281.45 s [vector] +++ OK, passed 100 tests.
  10621. 281.45 s [vector] replicateM: OK
  10622. 281.45 s [vector] +++ OK, passed 100 tests.
  10623. 281.45 s [vector] create: OK
  10624. 281.45 s [vector] +++ OK, passed 100 tests.
  10625. 281.45 s [vector] createT: OK
  10626. 281.45 s [vector] +++ OK, passed 100 tests.
  10627. 281.45 s [vector] unfoldr: OK
  10628. 281.45 s [vector] +++ OK, passed 100 tests.
  10629. 281.45 s [vector] unfoldrN: OK
  10630. 281.45 s [vector] +++ OK, passed 100 tests.
  10631. 281.45 s [vector] unfoldrExactN: OK
  10632. 281.45 s [vector] +++ OK, passed 100 tests.
  10633. 281.46 s [vector] unfoldrM: OK
  10634. 281.46 s [vector] +++ OK, passed 100 tests.
  10635. 281.46 s [vector] unfoldrNM: OK
  10636. 281.46 s [vector] +++ OK, passed 100 tests.
  10637. 281.46 s [vector] unfoldrExactNM: OK (0.01s)
  10638. 281.46 s [vector] +++ OK, passed 100 tests.
  10639. 281.46 s [vector] constructN: OK
  10640. 281.46 s [vector] +++ OK, passed 100 tests.
  10641. 281.46 s [vector] constructrN: OK
  10642. 281.46 s [vector] +++ OK, passed 100 tests.
  10643. 281.46 s [vector] cons: OK
  10644. 281.46 s [vector] +++ OK, passed 100 tests.
  10645. 281.46 s [vector] snoc: OK
  10646. 281.46 s [vector] +++ OK, passed 100 tests.
  10647. 281.46 s [vector] append: OK
  10648. 281.46 s [vector] +++ OK, passed 100 tests.
  10649. 281.46 s [vector] concat: OK (0.01s)
  10650. 281.46 s [vector] +++ OK, passed 100 tests.
  10651. 281.46 s [vector] force: OK
  10652. 281.46 s [vector] +++ OK, passed 100 tests.
  10653. 281.46 s [vector] upd: OK
  10654. 281.46 s [vector] +++ OK, passed 100 tests.
  10655. 281.46 s [vector] accum: OK
  10656. 281.46 s [vector] +++ OK, passed 100 tests.
  10657. 281.46 s [vector] reverse: OK
  10658. 281.46 s [vector] +++ OK, passed 100 tests.
  10659. 281.46 s [vector] backpermute: OK
  10660. 281.46 s [vector] +++ OK, passed 100 tests.
  10661. 281.46 s [vector] map: OK
  10662. 281.46 s [vector] +++ OK, passed 100 tests.
  10663. 281.46 s [vector] imap: OK
  10664. 281.46 s [vector] +++ OK, passed 100 tests.
  10665. 281.46 s [vector] concatMap: OK
  10666. 281.46 s [vector] +++ OK, passed 100 tests.
  10667. 281.46 s [vector] mapM: OK
  10668. 281.46 s [vector] +++ OK, passed 100 tests.
  10669. 281.46 s [vector] mapM_: OK
  10670. 281.46 s [vector] +++ OK, passed 100 tests.
  10671. 281.46 s [vector] forM: OK
  10672. 281.46 s [vector] +++ OK, passed 100 tests.
  10673. 281.46 s [vector] forM_: OK (0.02s)
  10674. 281.46 s [vector] +++ OK, passed 100 tests.
  10675. 281.46 s [vector] imapM: OK
  10676. 281.46 s [vector] +++ OK, passed 100 tests.
  10677. 281.47 s [vector] imapM_: OK (0.02s)
  10678. 281.47 s [vector] +++ OK, passed 100 tests.
  10679. 281.47 s [vector] zipWith: OK
  10680. 281.47 s [vector] +++ OK, passed 100 tests.
  10681. 281.47 s [vector] zipWith3: OK
  10682. 281.47 s [vector] +++ OK, passed 100 tests.
  10683. 281.47 s [vector] izipWith: OK
  10684. 281.47 s [vector] +++ OK, passed 100 tests.
  10685. 281.48 s [vector] izipWith3: OK
  10686. 281.48 s [vector] +++ OK, passed 100 tests.
  10687. 281.48 s [vector] izipWithM: OK
  10688. 281.48 s [vector] +++ OK, passed 100 tests.
  10689. 281.49 s [vector] izipWithM_: OK
  10690. 281.49 s [vector] +++ OK, passed 100 tests.
  10691. 281.49 s [vector] zipWithM: OK
  10692. 281.49 s [vector] +++ OK, passed 100 tests.
  10693. 281.51 s [vector] zipWithM_: OK (0.01s)
  10694. 281.51 s [vector] +++ OK, passed 100 tests.
  10695. 281.51 s [vector] filter: OK
  10696. 281.51 s [vector] +++ OK, passed 100 tests.
  10697. 281.51 s [vector] ifilter: OK
  10698. 281.51 s [vector] +++ OK, passed 100 tests.
  10699. 281.53 s [vector] filterM: OK (0.02s)
  10700. 281.53 s [vector] +++ OK, passed 100 tests.
  10701. 281.53 s [vector] uniq: OK
  10702. 281.53 s [vector] +++ OK, passed 100 tests.
  10703. 281.53 s [vector] mapMaybe: OK
  10704. 281.53 s [vector] +++ OK, passed 100 tests.
  10705. 281.53 s [vector] imapMaybe: OK
  10706. 281.53 s [vector] +++ OK, passed 100 tests.
  10707. 281.53 s [vector] takeWhile: OK
  10708. 281.53 s [vector] +++ OK, passed 100 tests.
  10709. 281.53 s [vector] dropWhile: OK
  10710. 281.53 s [vector] +++ OK, passed 100 tests.
  10711. 281.54 s [vector] partition: OK
  10712. 281.54 s [vector] +++ OK, passed 100 tests.
  10713. 281.54 s [vector] partitionWith: OK
  10714. 281.54 s [vector] +++ OK, passed 100 tests.
  10715. 281.54 s [vector] span: OK
  10716. 281.54 s [vector] +++ OK, passed 100 tests.
  10717. 281.54 s [vector] break: OK
  10718. 281.54 s [vector] +++ OK, passed 100 tests.
  10719. 281.54 s [vector] spanR: OK
  10720. 281.54 s [vector] +++ OK, passed 100 tests.
  10721. 281.54 s [vector] breakR: OK
  10722. 281.54 s [vector] +++ OK, passed 100 tests.
  10723. 281.54 s [vector] groupBy: OK
  10724. 281.54 s [vector] +++ OK, passed 100 tests.
  10725. 281.54 s [vector] elem: OK
  10726. 281.54 s [vector] +++ OK, passed 100 tests.
  10727. 281.54 s [vector] notElem: OK
  10728. 281.54 s [vector] +++ OK, passed 100 tests.
  10729. 281.54 s [vector] find: OK
  10730. 281.54 s [vector] +++ OK, passed 100 tests.
  10731. 281.55 s [vector] findIndex: OK
  10732. 281.55 s [vector] +++ OK, passed 100 tests.
  10733. 281.55 s [vector] findIndexR: OK
  10734. 281.55 s [vector] +++ OK, passed 100 tests.
  10735. 281.55 s [vector] findIndices: OK
  10736. 281.55 s [vector] +++ OK, passed 100 tests.
  10737. 281.55 s [vector] elemIndex: OK
  10738. 281.55 s [vector] +++ OK, passed 100 tests.
  10739. 281.55 s [vector] elemIndices: OK
  10740. 281.55 s [vector] +++ OK, passed 100 tests.
  10741. 281.55 s [vector] foldl: OK
  10742. 281.55 s [vector] +++ OK, passed 100 tests.
  10743. 281.55 s [vector] foldl1: OK
  10744. 281.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10745. 281.56 s [vector] foldl': OK
  10746. 281.56 s [vector] +++ OK, passed 100 tests.
  10747. 281.56 s [vector] foldl1': OK
  10748. 281.56 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10749. 281.56 s [vector] foldr: OK
  10750. 281.56 s [vector] +++ OK, passed 100 tests.
  10751. 281.56 s [vector] foldr1: OK
  10752. 281.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10753. 281.56 s [vector] foldr': OK
  10754. 281.57 s [vector] +++ OK, passed 100 tests.
  10755. 281.57 s [vector] foldr1': OK
  10756. 281.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10757. 281.57 s [vector] ifoldl: OK
  10758. 281.57 s [vector] +++ OK, passed 100 tests.
  10759. 281.57 s [vector] ifoldl': OK
  10760. 281.58 s [vector] +++ OK, passed 100 tests.
  10761. 281.58 s [vector] ifoldr: OK
  10762. 281.58 s [vector] +++ OK, passed 100 tests.
  10763. 281.58 s [vector] ifoldr': OK
  10764. 281.58 s [vector] +++ OK, passed 100 tests.
  10765. 281.58 s [vector] ifoldM: OK
  10766. 281.58 s [vector] +++ OK, passed 100 tests.
  10767. 281.58 s [vector] ifoldM': OK
  10768. 281.58 s [vector] +++ OK, passed 100 tests.
  10769. 281.60 s [vector] ifoldM_: OK
  10770. 281.60 s [vector] +++ OK, passed 100 tests.
  10771. 281.61 s [vector] ifoldM'_: OK (0.02s)
  10772. 281.61 s [vector] +++ OK, passed 100 tests.
  10773. 281.61 s [vector] all: OK
  10774. 281.61 s [vector] +++ OK, passed 100 tests.
  10775. 281.62 s [vector] any: OK
  10776. 281.62 s [vector] +++ OK, passed 100 tests.
  10777. 281.63 s [vector] prescanl: OK
  10778. 281.63 s [vector] +++ OK, passed 100 tests.
  10779. 281.63 s [vector] prescanl': OK
  10780. 281.63 s [vector] +++ OK, passed 100 tests.
  10781. 281.63 s [vector] postscanl: OK
  10782. 281.63 s [vector] +++ OK, passed 100 tests.
  10783. 281.63 s [vector] postscanl': OK
  10784. 281.63 s [vector] +++ OK, passed 100 tests.
  10785. 281.63 s [vector] scanl: OK
  10786. 281.63 s [vector] +++ OK, passed 100 tests.
  10787. 281.63 s [vector] scanl': OK
  10788. 281.63 s [vector] +++ OK, passed 100 tests.
  10789. 281.64 s [vector] scanl1: OK
  10790. 281.64 s [vector] +++ OK, passed 100 tests.
  10791. 281.64 s [vector] scanl1': OK
  10792. 281.64 s [vector] +++ OK, passed 100 tests.
  10793. 281.64 s [vector] iscanl: OK
  10794. 281.64 s [vector] +++ OK, passed 100 tests.
  10795. 281.64 s [vector] iscanl': OK
  10796. 281.65 s [vector] +++ OK, passed 100 tests.
  10797. 281.65 s [vector] prescanr: OK
  10798. 281.65 s [vector] +++ OK, passed 100 tests.
  10799. 281.65 s [vector] prescanr': OK
  10800. 281.65 s [vector] +++ OK, passed 100 tests.
  10801. 281.65 s [vector] postscanr: OK
  10802. 281.65 s [vector] +++ OK, passed 100 tests.
  10803. 281.65 s [vector] postscanr': OK
  10804. 281.65 s [vector] +++ OK, passed 100 tests.
  10805. 281.65 s [vector] scanr: OK
  10806. 281.66 s [vector] +++ OK, passed 100 tests.
  10807. 281.66 s [vector] scanr': OK
  10808. 281.66 s [vector] +++ OK, passed 100 tests.
  10809. 281.66 s [vector] scanr1: OK
  10810. 281.66 s [vector] +++ OK, passed 100 tests.
  10811. 281.66 s [vector] scanr1': OK
  10812. 281.66 s [vector] +++ OK, passed 100 tests.
  10813. 281.67 s [vector] iscanr: OK
  10814. 281.67 s [vector] +++ OK, passed 100 tests.
  10815. 281.67 s [vector] iscanr': OK
  10816. 281.67 s [vector] +++ OK, passed 100 tests.
  10817. 281.67 s [vector] mut_read: OK
  10818. 281.67 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10819. 281.67 s [vector] mut_write: OK
  10820. 281.67 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10821. 281.67 s [vector] mut_modify: OK
  10822. 281.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10823. 281.67 s [vector] mut_generate: OK
  10824. 281.67 s [vector] +++ OK, passed 100 tests.
  10825. 281.69 s [vector] mut_generateM: OK
  10826. 281.69 s [vector] +++ OK, passed 100 tests.
  10827. 281.69 s [vector] mut_mapM_: OK (0.01s)
  10828. 281.69 s [vector] +++ OK, passed 100 tests.
  10829. 281.71 s [vector] mut_imapM_: OK (0.01s)
  10830. 281.71 s [vector] +++ OK, passed 100 tests.
  10831. 281.73 s [vector] mut_forM_: OK (0.01s)
  10832. 281.73 s [vector] +++ OK, passed 100 tests.
  10833. 281.73 s [vector] mut_iforM_: OK (0.01s)
  10834. 281.73 s [vector] +++ OK, passed 100 tests.
  10835. 281.73 s [vector] mut_foldr: OK
  10836. 281.73 s [vector] +++ OK, passed 100 tests.
  10837. 281.73 s [vector] mut_foldr': OK
  10838. 281.73 s [vector] +++ OK, passed 100 tests.
  10839. 281.74 s [vector] mut_foldl: OK
  10840. 281.74 s [vector] +++ OK, passed 100 tests.
  10841. 281.74 s [vector] mut_foldl': OK
  10842. 281.74 s [vector] +++ OK, passed 100 tests.
  10843. 281.75 s [vector] mut_ifoldr: OK
  10844. 281.75 s [vector] +++ OK, passed 100 tests.
  10845. 281.75 s [vector] mut_ifoldr': OK
  10846. 281.75 s [vector] +++ OK, passed 100 tests.
  10847. 281.76 s [vector] mut_ifoldl: OK
  10848. 281.76 s [vector] +++ OK, passed 100 tests.
  10849. 281.77 s [vector] mut_ifoldl': OK
  10850. 281.77 s [vector] +++ OK, passed 100 tests.
  10851. 281.77 s [vector] mut_foldM: OK
  10852. 281.77 s [vector] +++ OK, passed 100 tests.
  10853. 281.77 s [vector] mut_foldM': OK
  10854. 281.77 s [vector] +++ OK, passed 100 tests.
  10855. 281.77 s [vector] mut_foldrM: OK
  10856. 281.77 s [vector] +++ OK, passed 100 tests.
  10857. 281.77 s [vector] mut_foldrM': OK
  10858. 281.77 s [vector] +++ OK, passed 100 tests.
  10859. 281.77 s [vector] mut_ifoldM: OK
  10860. 281.77 s [vector] +++ OK, passed 100 tests.
  10861. 281.77 s [vector] mut_ifoldM': OK
  10862. 281.77 s [vector] +++ OK, passed 100 tests.
  10863. 281.77 s [vector] mut_ifoldrM: OK
  10864. 281.77 s [vector] +++ OK, passed 100 tests.
  10865. 281.77 s [vector] mut_ifoldrM': OK
  10866. 281.77 s [vector] +++ OK, passed 100 tests.
  10867. 281.77 s [vector] compare: OK
  10868. 281.77 s [vector] +++ OK, passed 100 tests.
  10869. 281.77 s [vector] maximum: OK
  10870. 281.77 s [vector] +++ OK, passed 100 tests; 10 discarded.
  10871. 281.77 s [vector] minimum: OK
  10872. 281.77 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10873. 281.77 s [vector] minIndex: OK
  10874. 281.77 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10875. 281.77 s [vector] maxIndex: OK
  10876. 281.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10877. 281.77 s [vector] maximumBy: OK
  10878. 281.77 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10879. 281.78 s [vector] minimumBy: OK
  10880. 281.78 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10881. 281.78 s [vector] maximumOn: OK
  10882. 281.78 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10883. 281.78 s [vector] minimumOn: OK
  10884. 281.78 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10885. 281.78 s [vector] maxIndexBy: OK
  10886. 281.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10887. 281.78 s [vector] minIndexBy: OK
  10888. 281.78 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10889. 281.78 s [vector] ListFirstMaxIndexWins: OK
  10890. 281.78 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10891. 281.78 s [vector] FalseListFirstMaxIndexWins: OK
  10892. 281.78 s [vector] +++ OK, failed as expected. (after 1 test):
  10893. 281.78 s [vector] Exception:
  10894. 281.78 s [vector] Prelude.foldr1: empty list
  10895. 281.78 s [vector] CallStack (from HasCallStack):
  10896. 281.78 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10897. 281.78 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10898. 281.78 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10899. 281.78 s [vector] []
  10900. 281.78 s [vector] zip: OK
  10901. 281.78 s [vector] +++ OK, passed 100 tests.
  10902. 281.78 s [vector] zip3: OK
  10903. 281.78 s [vector] +++ OK, passed 100 tests.
  10904. 281.78 s [vector] unzip: OK
  10905. 281.78 s [vector] +++ OK, passed 100 tests.
  10906. 281.78 s [vector] unzip3: OK
  10907. 281.78 s [vector] +++ OK, passed 100 tests.
  10908. 281.78 s [vector] indexed: OK
  10909. 281.78 s [vector] +++ OK, passed 100 tests.
  10910. 281.78 s [vector] update: OK
  10911. 281.78 s [vector] +++ OK, passed 100 tests.
  10912. 281.79 s [vector] concat: OK
  10913. 281.79 s [vector] +++ OK, passed 100 tests.
  10914. 281.79 s [vector] mempty: OK
  10915. 281.79 s [vector] +++ OK, passed 100 tests.
  10916. 281.79 s [vector] mappend: OK
  10917. 281.79 s [vector] +++ OK, passed 100 tests.
  10918. 281.80 s [vector] mconcat: OK
  10919. 281.80 s [vector] +++ OK, passed 100 tests.
  10920. 281.80 s [vector] fmap: OK
  10921. 281.80 s [vector] +++ OK, passed 100 tests.
  10922. 281.80 s [vector] return: OK
  10923. 281.80 s [vector] +++ OK, passed 100 tests.
  10924. 281.81 s [vector] bind: OK (0.01s)
  10925. 281.82 s [vector] +++ OK, passed 100 tests.
  10926. 281.82 s [vector] mzip: OK
  10927. 281.82 s [vector] +++ OK, passed 100 tests.
  10928. 281.83 s [vector] munzip: OK
  10929. 281.83 s [vector] +++ OK, passed 100 tests.
  10930. 281.83 s [vector] applicative_pure: OK
  10931. 281.83 s [vector] +++ OK, passed 100 tests.
  10932. 281.84 s [vector] applicative_appl: OK (0.02s)
  10933. 281.84 s [vector] +++ OK, passed 100 tests.
  10934. 281.84 s [vector] alternative_empty: OK
  10935. 281.84 s [vector] +++ OK, passed 100 tests.
  10936. 281.84 s [vector] alternative_or: OK
  10937. 281.84 s [vector] +++ OK, passed 100 tests.
  10938. 281.87 s [vector] sequence: OK (0.03s)
  10939. 281.87 s [vector] +++ OK, passed 100 tests.
  10940. 281.87 s [vector] sequence_: OK
  10941. 281.87 s [vector] +++ OK, passed 100 tests.
  10942. 281.87 s [vector] glength: OK
  10943. 281.87 s [vector] +++ OK, passed 100 tests.
  10944. 281.87 s [vector] sum: OK
  10945. 281.87 s [vector] +++ OK, passed 100 tests.
  10946. 281.87 s [vector] product: OK
  10947. 281.87 s [vector] +++ OK, passed 100 tests.
  10948. 281.87 s [vector] enumFromN: OK
  10949. 281.87 s [vector] +++ OK, passed 100 tests.
  10950. 281.87 s [vector] enumFromThenN: OK
  10951. 281.87 s [vector] +++ OK, passed 100 tests.
  10952. 281.88 s [vector] enumFromTo: OK
  10953. 281.88 s [vector] +++ OK, passed 100 tests.
  10954. 281.88 s [vector] enumFromThenTo: OK
  10955. 281.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10956. 281.88 s [vector] unstream
  10957. 281.88 s [vector] unstream == vunstream (exact): OK
  10958. 281.88 s [vector] +++ OK, passed 100 tests.
  10959. 281.88 s [vector] unstream == vunstream (unknown): OK
  10960. 281.88 s [vector] +++ OK, passed 100 tests.
  10961. 281.88 s [vector] unstreamR ~= vunstream (exact): OK
  10962. 281.88 s [vector] +++ OK, passed 100 tests.
  10963. 281.88 s [vector] unstreamR ~= vunstream (unknown): OK
  10964. 281.88 s [vector] +++ OK, passed 100 tests.
  10965. 281.88 s [vector] Tests.Vector.Unboxed
  10966. 281.88 s [vector] ()
  10967. 281.88 s [vector] fromList.toList == id: OK
  10968. 281.88 s [vector] +++ OK, passed 100 tests.
  10969. 281.88 s [vector] toList.fromList == id: OK
  10970. 281.88 s [vector] +++ OK, passed 100 tests.
  10971. 281.88 s [vector] unstream.stream == id: OK
  10972. 281.88 s [vector] +++ OK, passed 100 tests.
  10973. 281.88 s [vector] stream.unstream == id: OK
  10974. 281.88 s [vector] +++ OK, passed 100 tests.
  10975. 281.88 s [vector] eq: OK
  10976. 281.88 s [vector] +++ OK, passed 100 tests.
  10977. 281.88 s [vector] length: OK
  10978. 281.88 s [vector] +++ OK, passed 100 tests.
  10979. 281.88 s [vector] null: OK
  10980. 281.88 s [vector] +++ OK, passed 100 tests.
  10981. 281.88 s [vector] index: OK
  10982. 281.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10983. 281.88 s [vector] safeIndex: OK
  10984. 281.88 s [vector] +++ OK, passed 100 tests.
  10985. 281.88 s [vector] head: OK
  10986. 281.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10987. 281.88 s [vector] last: OK
  10988. 281.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10989. 281.88 s [vector] unsafeIndex: OK
  10990. 281.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10991. 281.88 s [vector] unsafeHead: OK
  10992. 281.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10993. 281.88 s [vector] unsafeLast: OK
  10994. 281.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10995. 281.88 s [vector] slice: OK
  10996. 281.88 s [vector] +++ OK, passed 100 tests.
  10997. 281.88 s [vector] init: OK
  10998. 281.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10999. 281.88 s [vector] tail: OK
  11000. 281.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11001. 281.88 s [vector] take: OK
  11002. 281.88 s [vector] +++ OK, passed 100 tests.
  11003. 281.88 s [vector] drop: OK
  11004. 281.88 s [vector] +++ OK, passed 100 tests.
  11005. 281.88 s [vector] splitAt: OK
  11006. 281.88 s [vector] +++ OK, passed 100 tests.
  11007. 281.88 s [vector] empty: OK
  11008. 281.88 s [vector] +++ OK, passed 100 tests.
  11009. 281.89 s [vector] singleton: OK
  11010. 281.89 s [vector] +++ OK, passed 100 tests.
  11011. 281.89 s [vector] replicate: OK
  11012. 281.89 s [vector] +++ OK, passed 100 tests.
  11013. 281.89 s [vector] generate: OK
  11014. 281.89 s [vector] +++ OK, passed 100 tests.
  11015. 281.89 s [vector] iterateN: OK
  11016. 281.89 s [vector] +++ OK, passed 100 tests.
  11017. 281.91 s [vector] iterateNM: OK (0.02s)
  11018. 281.91 s [vector] +++ OK, passed 100 tests.
  11019. 281.92 s [vector] generateM: OK (0.02s)
  11020. 281.92 s [vector] +++ OK, passed 100 tests.
  11021. 281.93 s [vector] replicateM: OK
  11022. 281.93 s [vector] +++ OK, passed 100 tests.
  11023. 281.93 s [vector] create: OK
  11024. 281.93 s [vector] +++ OK, passed 100 tests.
  11025. 281.93 s [vector] createT: OK
  11026. 281.93 s [vector] +++ OK, passed 100 tests.
  11027. 281.93 s [vector] unfoldr: OK
  11028. 281.93 s [vector] +++ OK, passed 100 tests.
  11029. 281.93 s [vector] unfoldrN: OK
  11030. 281.93 s [vector] +++ OK, passed 100 tests.
  11031. 281.93 s [vector] unfoldrExactN: OK
  11032. 281.94 s [vector] +++ OK, passed 100 tests.
  11033. 281.94 s [vector] unfoldrM: OK
  11034. 281.94 s [vector] +++ OK, passed 100 tests.
  11035. 281.95 s [vector] unfoldrNM: OK
  11036. 281.95 s [vector] +++ OK, passed 100 tests.
  11037. 281.95 s [vector] unfoldrExactNM: OK (0.01s)
  11038. 281.95 s [vector] +++ OK, passed 100 tests.
  11039. 281.95 s [vector] constructN: OK
  11040. 281.95 s [vector] +++ OK, passed 100 tests.
  11041. 281.95 s [vector] constructrN: OK
  11042. 281.95 s [vector] +++ OK, passed 100 tests.
  11043. 281.95 s [vector] cons: OK
  11044. 281.96 s [vector] +++ OK, passed 100 tests.
  11045. 281.96 s [vector] snoc: OK
  11046. 281.96 s [vector] +++ OK, passed 100 tests.
  11047. 281.96 s [vector] append: OK
  11048. 281.97 s [vector] +++ OK, passed 100 tests.
  11049. 281.97 s [vector] concat: OK (0.01s)
  11050. 281.97 s [vector] +++ OK, passed 100 tests.
  11051. 281.97 s [vector] force: OK
  11052. 281.97 s [vector] +++ OK, passed 100 tests.
  11053. 281.97 s [vector] upd: OK
  11054. 281.97 s [vector] +++ OK, passed 100 tests.
  11055. 281.97 s [vector] accum: OK
  11056. 281.97 s [vector] +++ OK, passed 100 tests.
  11057. 281.97 s [vector] reverse: OK
  11058. 281.97 s [vector] +++ OK, passed 100 tests.
  11059. 281.98 s [vector] backpermute: OK
  11060. 281.98 s [vector] +++ OK, passed 100 tests.
  11061. 281.98 s [vector] map: OK
  11062. 281.98 s [vector] +++ OK, passed 100 tests.
  11063. 281.98 s [vector] imap: OK
  11064. 281.98 s [vector] +++ OK, passed 100 tests.
  11065. 281.99 s [vector] concatMap: OK
  11066. 281.99 s [vector] +++ OK, passed 100 tests.
  11067. 281.99 s [vector] mapM: OK
  11068. 281.99 s [vector] +++ OK, passed 100 tests.
  11069. 281.99 s [vector] mapM_: OK
  11070. 281.99 s [vector] +++ OK, passed 100 tests.
  11071. 281.99 s [vector] forM: OK
  11072. 281.99 s [vector] +++ OK, passed 100 tests.
  11073. 282.00 s [vector] forM_: OK
  11074. 282.00 s [vector] +++ OK, passed 100 tests.
  11075. 282.00 s [vector] imapM: OK
  11076. 282.01 s [vector] +++ OK, passed 100 tests.
  11077. 282.01 s [vector] imapM_: OK
  11078. 282.01 s [vector] +++ OK, passed 100 tests.
  11079. 282.01 s [vector] zipWith: OK
  11080. 282.01 s [vector] +++ OK, passed 100 tests.
  11081. 282.01 s [vector] zipWith3: OK
  11082. 282.01 s [vector] +++ OK, passed 100 tests.
  11083. 282.01 s [vector] izipWith: OK
  11084. 282.01 s [vector] +++ OK, passed 100 tests.
  11085. 282.01 s [vector] izipWith3: OK
  11086. 282.01 s [vector] +++ OK, passed 100 tests.
  11087. 282.01 s [vector] izipWithM: OK
  11088. 282.01 s [vector] +++ OK, passed 100 tests.
  11089. 282.02 s [vector] izipWithM_: OK
  11090. 282.02 s [vector] +++ OK, passed 100 tests.
  11091. 282.02 s [vector] zipWithM: OK
  11092. 282.02 s [vector] +++ OK, passed 100 tests.
  11093. 282.02 s [vector] zipWithM_: OK
  11094. 282.02 s [vector] +++ OK, passed 100 tests.
  11095. 282.02 s [vector] filter: OK
  11096. 282.02 s [vector] +++ OK, passed 100 tests.
  11097. 282.03 s [vector] ifilter: OK
  11098. 282.03 s [vector] +++ OK, passed 100 tests.
  11099. 282.04 s [vector] filterM: OK (0.02s)
  11100. 282.04 s [vector] +++ OK, passed 100 tests.
  11101. 282.04 s [vector] uniq: OK
  11102. 282.04 s [vector] +++ OK, passed 100 tests.
  11103. 282.04 s [vector] mapMaybe: OK
  11104. 282.05 s [vector] +++ OK, passed 100 tests.
  11105. 282.05 s [vector] imapMaybe: OK
  11106. 282.05 s [vector] +++ OK, passed 100 tests.
  11107. 282.05 s [vector] takeWhile: OK
  11108. 282.05 s [vector] +++ OK, passed 100 tests.
  11109. 282.05 s [vector] dropWhile: OK
  11110. 282.05 s [vector] +++ OK, passed 100 tests.
  11111. 282.05 s [vector] partition: OK
  11112. 282.05 s [vector] +++ OK, passed 100 tests.
  11113. 282.05 s [vector] partitionWith: OK
  11114. 282.05 s [vector] +++ OK, passed 100 tests.
  11115. 282.05 s [vector] span: OK
  11116. 282.05 s [vector] +++ OK, passed 100 tests.
  11117. 282.05 s [vector] break: OK
  11118. 282.05 s [vector] +++ OK, passed 100 tests.
  11119. 282.05 s [vector] spanR: OK
  11120. 282.05 s [vector] +++ OK, passed 100 tests.
  11121. 282.05 s [vector] breakR: OK
  11122. 282.05 s [vector] +++ OK, passed 100 tests.
  11123. 282.05 s [vector] groupBy: OK
  11124. 282.05 s [vector] +++ OK, passed 100 tests.
  11125. 282.05 s [vector] elem: OK
  11126. 282.05 s [vector] +++ OK, passed 100 tests.
  11127. 282.05 s [vector] notElem: OK
  11128. 282.05 s [vector] +++ OK, passed 100 tests.
  11129. 282.05 s [vector] find: OK
  11130. 282.05 s [vector] +++ OK, passed 100 tests.
  11131. 282.05 s [vector] findIndex: OK
  11132. 282.05 s [vector] +++ OK, passed 100 tests.
  11133. 282.05 s [vector] findIndexR: OK
  11134. 282.05 s [vector] +++ OK, passed 100 tests.
  11135. 282.06 s [vector] findIndices: OK
  11136. 282.06 s [vector] +++ OK, passed 100 tests.
  11137. 282.06 s [vector] elemIndex: OK
  11138. 282.06 s [vector] +++ OK, passed 100 tests.
  11139. 282.06 s [vector] elemIndices: OK
  11140. 282.06 s [vector] +++ OK, passed 100 tests.
  11141. 282.06 s [vector] foldl: OK
  11142. 282.06 s [vector] +++ OK, passed 100 tests.
  11143. 282.06 s [vector] foldl1: OK
  11144. 282.06 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11145. 282.06 s [vector] foldl': OK
  11146. 282.06 s [vector] +++ OK, passed 100 tests.
  11147. 282.06 s [vector] foldl1': OK
  11148. 282.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11149. 282.06 s [vector] foldr: OK
  11150. 282.06 s [vector] +++ OK, passed 100 tests.
  11151. 282.06 s [vector] foldr1: OK
  11152. 282.06 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11153. 282.06 s [vector] foldr': OK
  11154. 282.06 s [vector] +++ OK, passed 100 tests.
  11155. 282.06 s [vector] foldr1': OK
  11156. 282.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11157. 282.06 s [vector] ifoldl: OK
  11158. 282.06 s [vector] +++ OK, passed 100 tests.
  11159. 282.06 s [vector] ifoldl': OK
  11160. 282.06 s [vector] +++ OK, passed 100 tests.
  11161. 282.06 s [vector] ifoldr: OK
  11162. 282.06 s [vector] +++ OK, passed 100 tests.
  11163. 282.06 s [vector] ifoldr': OK
  11164. 282.06 s [vector] +++ OK, passed 100 tests.
  11165. 282.06 s [vector] ifoldM: OK
  11166. 282.06 s [vector] +++ OK, passed 100 tests.
  11167. 282.06 s [vector] ifoldM': OK
  11168. 282.07 s [vector] +++ OK, passed 100 tests.
  11169. 282.07 s [vector] ifoldM_: OK
  11170. 282.07 s [vector] +++ OK, passed 100 tests.
  11171. 282.08 s [vector] ifoldM'_: OK
  11172. 282.08 s [vector] +++ OK, passed 100 tests.
  11173. 282.08 s [vector] all: OK
  11174. 282.08 s [vector] +++ OK, passed 100 tests.
  11175. 282.08 s [vector] any: OK
  11176. 282.08 s [vector] +++ OK, passed 100 tests.
  11177. 282.08 s [vector] prescanl: OK
  11178. 282.08 s [vector] +++ OK, passed 100 tests.
  11179. 282.08 s [vector] prescanl': OK
  11180. 282.08 s [vector] +++ OK, passed 100 tests.
  11181. 282.08 s [vector] postscanl: OK
  11182. 282.08 s [vector] +++ OK, passed 100 tests.
  11183. 282.08 s [vector] postscanl': OK
  11184. 282.09 s [vector] +++ OK, passed 100 tests.
  11185. 282.09 s [vector] scanl: OK
  11186. 282.09 s [vector] +++ OK, passed 100 tests.
  11187. 282.09 s [vector] scanl': OK
  11188. 282.09 s [vector] +++ OK, passed 100 tests.
  11189. 282.09 s [vector] scanl1: OK
  11190. 282.09 s [vector] +++ OK, passed 100 tests.
  11191. 282.09 s [vector] scanl1': OK
  11192. 282.09 s [vector] +++ OK, passed 100 tests.
  11193. 282.09 s [vector] iscanl: OK
  11194. 282.09 s [vector] +++ OK, passed 100 tests.
  11195. 282.09 s [vector] iscanl': OK
  11196. 282.09 s [vector] +++ OK, passed 100 tests.
  11197. 282.09 s [vector] prescanr: OK
  11198. 282.09 s [vector] +++ OK, passed 100 tests.
  11199. 282.09 s [vector] prescanr': OK
  11200. 282.09 s [vector] +++ OK, passed 100 tests.
  11201. 282.09 s [vector] postscanr: OK
  11202. 282.09 s [vector] +++ OK, passed 100 tests.
  11203. 282.09 s [vector] postscanr': OK
  11204. 282.09 s [vector] +++ OK, passed 100 tests.
  11205. 282.09 s [vector] scanr: OK
  11206. 282.09 s [vector] +++ OK, passed 100 tests.
  11207. 282.09 s [vector] scanr': OK
  11208. 282.09 s [vector] +++ OK, passed 100 tests.
  11209. 282.09 s [vector] scanr1: OK
  11210. 282.10 s [vector] +++ OK, passed 100 tests.
  11211. 282.10 s [vector] scanr1': OK
  11212. 282.10 s [vector] +++ OK, passed 100 tests.
  11213. 282.10 s [vector] iscanr: OK
  11214. 282.10 s [vector] +++ OK, passed 100 tests.
  11215. 282.10 s [vector] iscanr': OK
  11216. 282.10 s [vector] +++ OK, passed 100 tests.
  11217. 282.10 s [vector] mut_read: OK
  11218. 282.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11219. 282.10 s [vector] mut_write: OK
  11220. 282.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11221. 282.10 s [vector] mut_modify: OK
  11222. 282.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11223. 282.11 s [vector] mut_generate: OK
  11224. 282.11 s [vector] +++ OK, passed 100 tests.
  11225. 282.11 s [vector] mut_generateM: OK
  11226. 282.11 s [vector] +++ OK, passed 100 tests.
  11227. 282.11 s [vector] mut_mapM_: OK
  11228. 282.11 s [vector] +++ OK, passed 100 tests.
  11229. 282.12 s [vector] mut_imapM_: OK
  11230. 282.12 s [vector] +++ OK, passed 100 tests.
  11231. 282.13 s [vector] mut_forM_: OK
  11232. 282.13 s [vector] +++ OK, passed 100 tests.
  11233. 282.13 s [vector] mut_iforM_: OK
  11234. 282.13 s [vector] +++ OK, passed 100 tests.
  11235. 282.13 s [vector] mut_foldr: OK
  11236. 282.13 s [vector] +++ OK, passed 100 tests.
  11237. 282.13 s [vector] mut_foldr': OK
  11238. 282.13 s [vector] +++ OK, passed 100 tests.
  11239. 282.14 s [vector] mut_foldl: OK
  11240. 282.14 s [vector] +++ OK, passed 100 tests.
  11241. 282.14 s [vector] mut_foldl': OK
  11242. 282.14 s [vector] +++ OK, passed 100 tests.
  11243. 282.14 s [vector] mut_ifoldr: OK
  11244. 282.14 s [vector] +++ OK, passed 100 tests.
  11245. 282.14 s [vector] mut_ifoldr': OK
  11246. 282.14 s [vector] +++ OK, passed 100 tests.
  11247. 282.14 s [vector] mut_ifoldl: OK
  11248. 282.14 s [vector] +++ OK, passed 100 tests.
  11249. 282.14 s [vector] mut_ifoldl': OK
  11250. 282.14 s [vector] +++ OK, passed 100 tests.
  11251. 282.14 s [vector] mut_foldM: OK
  11252. 282.14 s [vector] +++ OK, passed 100 tests.
  11253. 282.14 s [vector] mut_foldM': OK
  11254. 282.14 s [vector] +++ OK, passed 100 tests.
  11255. 282.14 s [vector] mut_foldrM: OK
  11256. 282.14 s [vector] +++ OK, passed 100 tests.
  11257. 282.14 s [vector] mut_foldrM': OK
  11258. 282.14 s [vector] +++ OK, passed 100 tests.
  11259. 282.14 s [vector] mut_ifoldM: OK
  11260. 282.14 s [vector] +++ OK, passed 100 tests.
  11261. 282.14 s [vector] mut_ifoldM': OK
  11262. 282.14 s [vector] +++ OK, passed 100 tests.
  11263. 282.14 s [vector] mut_ifoldrM: OK
  11264. 282.14 s [vector] +++ OK, passed 100 tests.
  11265. 282.14 s [vector] mut_ifoldrM': OK
  11266. 282.14 s [vector] +++ OK, passed 100 tests.
  11267. 282.14 s [vector] compare: OK
  11268. 282.15 s [vector] +++ OK, passed 100 tests.
  11269. 282.15 s [vector] maximum: OK
  11270. 282.15 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11271. 282.15 s [vector] minimum: OK
  11272. 282.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11273. 282.15 s [vector] minIndex: OK
  11274. 282.15 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11275. 282.15 s [vector] maxIndex: OK
  11276. 282.15 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11277. 282.15 s [vector] maximumBy: OK
  11278. 282.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11279. 282.15 s [vector] minimumBy: OK
  11280. 282.15 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11281. 282.15 s [vector] maximumOn: OK
  11282. 282.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11283. 282.15 s [vector] minimumOn: OK
  11284. 282.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11285. 282.15 s [vector] maxIndexBy: OK
  11286. 282.15 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11287. 282.15 s [vector] minIndexBy: OK
  11288. 282.15 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11289. 282.15 s [vector] ListFirstMaxIndexWins: OK
  11290. 282.15 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11291. 282.15 s [vector] FalseListFirstMaxIndexWins: OK
  11292. 282.15 s [vector] +++ OK, failed as expected. (after 1 test):
  11293. 282.15 s [vector] Exception:
  11294. 282.15 s [vector] Prelude.foldr1: empty list
  11295. 282.15 s [vector] CallStack (from HasCallStack):
  11296. 282.15 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11297. 282.15 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11298. 282.15 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11299. 282.15 s [vector] []
  11300. 282.15 s [vector] zip: OK
  11301. 282.15 s [vector] +++ OK, passed 100 tests.
  11302. 282.15 s [vector] zip3: OK
  11303. 282.15 s [vector] +++ OK, passed 100 tests.
  11304. 282.15 s [vector] unzip: OK
  11305. 282.15 s [vector] +++ OK, passed 100 tests.
  11306. 282.15 s [vector] unzip3: OK
  11307. 282.15 s [vector] +++ OK, passed 100 tests.
  11308. 282.15 s [vector] indexed: OK
  11309. 282.15 s [vector] +++ OK, passed 100 tests.
  11310. 282.15 s [vector] update: OK
  11311. 282.15 s [vector] +++ OK, passed 100 tests.
  11312. 282.15 s [vector] mempty: OK
  11313. 282.16 s [vector] +++ OK, passed 100 tests.
  11314. 282.16 s [vector] mappend: OK
  11315. 282.16 s [vector] +++ OK, passed 100 tests.
  11316. 282.16 s [vector] mconcat: OK
  11317. 282.16 s [vector] +++ OK, passed 100 tests.
  11318. 282.16 s [vector] glength: OK
  11319. 282.17 s [vector] +++ OK, passed 100 tests.
  11320. 282.17 s [vector] (Bool)
  11321. 282.17 s [vector] fromList.toList == id: OK
  11322. 282.17 s [vector] +++ OK, passed 100 tests.
  11323. 282.17 s [vector] toList.fromList == id: OK
  11324. 282.17 s [vector] +++ OK, passed 100 tests.
  11325. 282.17 s [vector] unstream.stream == id: OK
  11326. 282.17 s [vector] +++ OK, passed 100 tests.
  11327. 282.17 s [vector] stream.unstream == id: OK
  11328. 282.17 s [vector] +++ OK, passed 100 tests.
  11329. 282.17 s [vector] eq: OK
  11330. 282.17 s [vector] +++ OK, passed 100 tests.
  11331. 282.17 s [vector] length: OK
  11332. 282.17 s [vector] +++ OK, passed 100 tests.
  11333. 282.17 s [vector] null: OK
  11334. 282.17 s [vector] +++ OK, passed 100 tests.
  11335. 282.17 s [vector] index: OK
  11336. 282.17 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11337. 282.17 s [vector] safeIndex: OK
  11338. 282.17 s [vector] +++ OK, passed 100 tests.
  11339. 282.17 s [vector] head: OK
  11340. 282.17 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11341. 282.17 s [vector] last: OK
  11342. 282.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11343. 282.17 s [vector] unsafeIndex: OK
  11344. 282.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11345. 282.17 s [vector] unsafeHead: OK
  11346. 282.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11347. 282.17 s [vector] unsafeLast: OK
  11348. 282.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11349. 282.17 s [vector] slice: OK
  11350. 282.17 s [vector] +++ OK, passed 100 tests.
  11351. 282.17 s [vector] init: OK
  11352. 282.17 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11353. 282.17 s [vector] tail: OK
  11354. 282.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11355. 282.17 s [vector] take: OK
  11356. 282.17 s [vector] +++ OK, passed 100 tests.
  11357. 282.17 s [vector] drop: OK
  11358. 282.17 s [vector] +++ OK, passed 100 tests.
  11359. 282.17 s [vector] splitAt: OK
  11360. 282.17 s [vector] +++ OK, passed 100 tests.
  11361. 282.17 s [vector] empty: OK
  11362. 282.17 s [vector] +++ OK, passed 100 tests.
  11363. 282.18 s [vector] singleton: OK
  11364. 282.18 s [vector] +++ OK, passed 100 tests.
  11365. 282.18 s [vector] replicate: OK
  11366. 282.18 s [vector] +++ OK, passed 100 tests.
  11367. 282.18 s [vector] generate: OK
  11368. 282.18 s [vector] +++ OK, passed 100 tests.
  11369. 282.18 s [vector] iterateN: OK
  11370. 282.18 s [vector] +++ OK, passed 100 tests.
  11371. 282.21 s [vector] iterateNM: OK (0.02s)
  11372. 282.21 s [vector] +++ OK, passed 100 tests.
  11373. 282.21 s [vector] generateM: OK (0.01s)
  11374. 282.21 s [vector] +++ OK, passed 100 tests.
  11375. 282.22 s [vector] replicateM: OK
  11376. 282.22 s [vector] +++ OK, passed 100 tests.
  11377. 282.22 s [vector] create: OK
  11378. 282.22 s [vector] +++ OK, passed 100 tests.
  11379. 282.22 s [vector] createT: OK
  11380. 282.22 s [vector] +++ OK, passed 100 tests.
  11381. 282.22 s [vector] unfoldr: OK
  11382. 282.22 s [vector] +++ OK, passed 100 tests.
  11383. 282.22 s [vector] unfoldrN: OK
  11384. 282.23 s [vector] +++ OK, passed 100 tests.
  11385. 282.23 s [vector] unfoldrExactN: OK
  11386. 282.23 s [vector] +++ OK, passed 100 tests.
  11387. 282.23 s [vector] unfoldrM: OK
  11388. 282.23 s [vector] +++ OK, passed 100 tests.
  11389. 282.24 s [vector] unfoldrNM: OK
  11390. 282.24 s [vector] +++ OK, passed 100 tests.
  11391. 282.24 s [vector] unfoldrExactNM: OK (0.01s)
  11392. 282.24 s [vector] +++ OK, passed 100 tests.
  11393. 282.24 s [vector] constructN: OK
  11394. 282.24 s [vector] +++ OK, passed 100 tests.
  11395. 282.24 s [vector] constructrN: OK
  11396. 282.24 s [vector] +++ OK, passed 100 tests.
  11397. 282.24 s [vector] cons: OK
  11398. 282.24 s [vector] +++ OK, passed 100 tests.
  11399. 282.24 s [vector] snoc: OK
  11400. 282.24 s [vector] +++ OK, passed 100 tests.
  11401. 282.24 s [vector] append: OK
  11402. 282.24 s [vector] +++ OK, passed 100 tests.
  11403. 282.25 s [vector] concat: OK (0.01s)
  11404. 282.26 s [vector] +++ OK, passed 100 tests.
  11405. 282.26 s [vector] force: OK
  11406. 282.26 s [vector] +++ OK, passed 100 tests.
  11407. 282.26 s [vector] upd: OK
  11408. 282.26 s [vector] +++ OK, passed 100 tests.
  11409. 282.26 s [vector] accum: OK
  11410. 282.26 s [vector] +++ OK, passed 100 tests.
  11411. 282.26 s [vector] reverse: OK
  11412. 282.26 s [vector] +++ OK, passed 100 tests.
  11413. 282.26 s [vector] backpermute: OK
  11414. 282.26 s [vector] +++ OK, passed 100 tests.
  11415. 282.26 s [vector] map: OK
  11416. 282.26 s [vector] +++ OK, passed 100 tests.
  11417. 282.26 s [vector] imap: OK
  11418. 282.26 s [vector] +++ OK, passed 100 tests.
  11419. 282.26 s [vector] concatMap: OK
  11420. 282.26 s [vector] +++ OK, passed 100 tests.
  11421. 282.27 s [vector] mapM: OK
  11422. 282.27 s [vector] +++ OK, passed 100 tests.
  11423. 282.27 s [vector] mapM_: OK
  11424. 282.27 s [vector] +++ OK, passed 100 tests.
  11425. 282.28 s [vector] forM: OK
  11426. 282.28 s [vector] +++ OK, passed 100 tests.
  11427. 282.28 s [vector] forM_: OK
  11428. 282.28 s [vector] +++ OK, passed 100 tests.
  11429. 282.28 s [vector] imapM: OK
  11430. 282.29 s [vector] +++ OK, passed 100 tests.
  11431. 282.29 s [vector] imapM_: OK
  11432. 282.29 s [vector] +++ OK, passed 100 tests.
  11433. 282.30 s [vector] zipWith: OK
  11434. 282.30 s [vector] +++ OK, passed 100 tests.
  11435. 282.30 s [vector] zipWith3: OK
  11436. 282.30 s [vector] +++ OK, passed 100 tests.
  11437. 282.30 s [vector] izipWith: OK
  11438. 282.30 s [vector] +++ OK, passed 100 tests.
  11439. 282.30 s [vector] izipWith3: OK
  11440. 282.30 s [vector] +++ OK, passed 100 tests.
  11441. 282.31 s [vector] izipWithM: OK
  11442. 282.31 s [vector] +++ OK, passed 100 tests.
  11443. 282.31 s [vector] izipWithM_: OK
  11444. 282.31 s [vector] +++ OK, passed 100 tests.
  11445. 282.31 s [vector] zipWithM: OK
  11446. 282.31 s [vector] +++ OK, passed 100 tests.
  11447. 282.32 s [vector] zipWithM_: OK
  11448. 282.32 s [vector] +++ OK, passed 100 tests.
  11449. 282.32 s [vector] filter: OK
  11450. 282.32 s [vector] +++ OK, passed 100 tests.
  11451. 282.33 s [vector] ifilter: OK
  11452. 282.33 s [vector] +++ OK, passed 100 tests.
  11453. 282.34 s [vector] filterM: OK (0.01s)
  11454. 282.34 s [vector] +++ OK, passed 100 tests.
  11455. 282.34 s [vector] uniq: OK
  11456. 282.34 s [vector] +++ OK, passed 100 tests.
  11457. 282.34 s [vector] mapMaybe: OK
  11458. 282.34 s [vector] +++ OK, passed 100 tests.
  11459. 282.34 s [vector] imapMaybe: OK
  11460. 282.34 s [vector] +++ OK, passed 100 tests.
  11461. 282.34 s [vector] takeWhile: OK
  11462. 282.34 s [vector] +++ OK, passed 100 tests.
  11463. 282.34 s [vector] dropWhile: OK
  11464. 282.34 s [vector] +++ OK, passed 100 tests.
  11465. 282.34 s [vector] partition: OK
  11466. 282.34 s [vector] +++ OK, passed 100 tests.
  11467. 282.34 s [vector] partitionWith: OK
  11468. 282.34 s [vector] +++ OK, passed 100 tests.
  11469. 282.34 s [vector] span: OK
  11470. 282.34 s [vector] +++ OK, passed 100 tests.
  11471. 282.34 s [vector] break: OK
  11472. 282.34 s [vector] +++ OK, passed 100 tests.
  11473. 282.35 s [vector] spanR: OK
  11474. 282.35 s [vector] +++ OK, passed 100 tests.
  11475. 282.35 s [vector] breakR: OK
  11476. 282.35 s [vector] +++ OK, passed 100 tests.
  11477. 282.35 s [vector] groupBy: OK
  11478. 282.35 s [vector] +++ OK, passed 100 tests.
  11479. 282.35 s [vector] elem: OK
  11480. 282.35 s [vector] +++ OK, passed 100 tests.
  11481. 282.35 s [vector] notElem: OK
  11482. 282.35 s [vector] +++ OK, passed 100 tests.
  11483. 282.35 s [vector] find: OK
  11484. 282.35 s [vector] +++ OK, passed 100 tests.
  11485. 282.35 s [vector] findIndex: OK
  11486. 282.35 s [vector] +++ OK, passed 100 tests.
  11487. 282.35 s [vector] findIndexR: OK
  11488. 282.35 s [vector] +++ OK, passed 100 tests.
  11489. 282.35 s [vector] findIndices: OK
  11490. 282.35 s [vector] +++ OK, passed 100 tests.
  11491. 282.35 s [vector] elemIndex: OK
  11492. 282.35 s [vector] +++ OK, passed 100 tests.
  11493. 282.35 s [vector] elemIndices: OK
  11494. 282.35 s [vector] +++ OK, passed 100 tests.
  11495. 282.35 s [vector] foldl: OK
  11496. 282.35 s [vector] +++ OK, passed 100 tests.
  11497. 282.35 s [vector] foldl1: OK
  11498. 282.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11499. 282.35 s [vector] foldl': OK
  11500. 282.35 s [vector] +++ OK, passed 100 tests.
  11501. 282.36 s [vector] foldl1': OK
  11502. 282.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11503. 282.36 s [vector] foldr: OK
  11504. 282.36 s [vector] +++ OK, passed 100 tests.
  11505. 282.36 s [vector] foldr1: OK
  11506. 282.36 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11507. 282.36 s [vector] foldr': OK
  11508. 282.36 s [vector] +++ OK, passed 100 tests.
  11509. 282.36 s [vector] foldr1': OK
  11510. 282.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11511. 282.36 s [vector] ifoldl: OK
  11512. 282.36 s [vector] +++ OK, passed 100 tests.
  11513. 282.36 s [vector] ifoldl': OK
  11514. 282.37 s [vector] +++ OK, passed 100 tests.
  11515. 282.37 s [vector] ifoldr: OK
  11516. 282.37 s [vector] +++ OK, passed 100 tests.
  11517. 282.37 s [vector] ifoldr': OK
  11518. 282.37 s [vector] +++ OK, passed 100 tests.
  11519. 282.37 s [vector] ifoldM: OK
  11520. 282.37 s [vector] +++ OK, passed 100 tests.
  11521. 282.37 s [vector] ifoldM': OK
  11522. 282.37 s [vector] +++ OK, passed 100 tests.
  11523. 282.38 s [vector] ifoldM_: OK
  11524. 282.38 s [vector] +++ OK, passed 100 tests.
  11525. 282.39 s [vector] ifoldM'_: OK
  11526. 282.39 s [vector] +++ OK, passed 100 tests.
  11527. 282.39 s [vector] all: OK
  11528. 282.39 s [vector] +++ OK, passed 100 tests.
  11529. 282.39 s [vector] any: OK
  11530. 282.39 s [vector] +++ OK, passed 100 tests.
  11531. 282.39 s [vector] prescanl: OK
  11532. 282.39 s [vector] +++ OK, passed 100 tests.
  11533. 282.39 s [vector] prescanl': OK
  11534. 282.39 s [vector] +++ OK, passed 100 tests.
  11535. 282.39 s [vector] postscanl: OK
  11536. 282.39 s [vector] +++ OK, passed 100 tests.
  11537. 282.39 s [vector] postscanl': OK
  11538. 282.39 s [vector] +++ OK, passed 100 tests.
  11539. 282.40 s [vector] scanl: OK
  11540. 282.40 s [vector] +++ OK, passed 100 tests.
  11541. 282.40 s [vector] scanl': OK
  11542. 282.40 s [vector] +++ OK, passed 100 tests.
  11543. 282.40 s [vector] scanl1: OK
  11544. 282.40 s [vector] +++ OK, passed 100 tests.
  11545. 282.40 s [vector] scanl1': OK
  11546. 282.40 s [vector] +++ OK, passed 100 tests.
  11547. 282.40 s [vector] iscanl: OK
  11548. 282.40 s [vector] +++ OK, passed 100 tests.
  11549. 282.40 s [vector] iscanl': OK
  11550. 282.40 s [vector] +++ OK, passed 100 tests.
  11551. 282.41 s [vector] prescanr: OK
  11552. 282.41 s [vector] +++ OK, passed 100 tests.
  11553. 282.41 s [vector] prescanr': OK
  11554. 282.41 s [vector] +++ OK, passed 100 tests.
  11555. 282.41 s [vector] postscanr: OK
  11556. 282.41 s [vector] +++ OK, passed 100 tests.
  11557. 282.41 s [vector] postscanr': OK
  11558. 282.41 s [vector] +++ OK, passed 100 tests.
  11559. 282.41 s [vector] scanr: OK
  11560. 282.41 s [vector] +++ OK, passed 100 tests.
  11561. 282.41 s [vector] scanr': OK
  11562. 282.41 s [vector] +++ OK, passed 100 tests.
  11563. 282.41 s [vector] scanr1: OK
  11564. 282.41 s [vector] +++ OK, passed 100 tests.
  11565. 282.42 s [vector] scanr1': OK
  11566. 282.42 s [vector] +++ OK, passed 100 tests.
  11567. 282.42 s [vector] iscanr: OK
  11568. 282.42 s [vector] +++ OK, passed 100 tests.
  11569. 282.42 s [vector] iscanr': OK
  11570. 282.42 s [vector] +++ OK, passed 100 tests.
  11571. 282.42 s [vector] mut_read: OK
  11572. 282.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11573. 282.42 s [vector] mut_write: OK
  11574. 282.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11575. 282.42 s [vector] mut_modify: OK
  11576. 282.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11577. 282.43 s [vector] mut_generate: OK
  11578. 282.43 s [vector] +++ OK, passed 100 tests.
  11579. 282.43 s [vector] mut_generateM: OK
  11580. 282.43 s [vector] +++ OK, passed 100 tests.
  11581. 282.44 s [vector] mut_mapM_: OK
  11582. 282.44 s [vector] +++ OK, passed 100 tests.
  11583. 282.45 s [vector] mut_imapM_: OK
  11584. 282.45 s [vector] +++ OK, passed 100 tests.
  11585. 282.45 s [vector] mut_forM_: OK
  11586. 282.45 s [vector] +++ OK, passed 100 tests.
  11587. 282.46 s [vector] mut_iforM_: OK (0.01s)
  11588. 282.46 s [vector] +++ OK, passed 100 tests.
  11589. 282.47 s [vector] mut_foldr: OK
  11590. 282.47 s [vector] +++ OK, passed 100 tests.
  11591. 282.47 s [vector] mut_foldr': OK
  11592. 282.47 s [vector] +++ OK, passed 100 tests.
  11593. 282.47 s [vector] mut_foldl: OK
  11594. 282.47 s [vector] +++ OK, passed 100 tests.
  11595. 282.47 s [vector] mut_foldl': OK
  11596. 282.48 s [vector] +++ OK, passed 100 tests.
  11597. 282.48 s [vector] mut_ifoldr: OK
  11598. 282.48 s [vector] +++ OK, passed 100 tests.
  11599. 282.49 s [vector] mut_ifoldr': OK
  11600. 282.49 s [vector] +++ OK, passed 100 tests.
  11601. 282.49 s [vector] mut_ifoldl: OK
  11602. 282.49 s [vector] +++ OK, passed 100 tests.
  11603. 282.50 s [vector] mut_ifoldl': OK
  11604. 282.50 s [vector] +++ OK, passed 100 tests.
  11605. 282.51 s [vector] mut_foldM: OK
  11606. 282.51 s [vector] +++ OK, passed 100 tests.
  11607. 282.51 s [vector] mut_foldM': OK
  11608. 282.51 s [vector] +++ OK, passed 100 tests.
  11609. 282.51 s [vector] mut_foldrM: OK
  11610. 282.51 s [vector] +++ OK, passed 100 tests.
  11611. 282.52 s [vector] mut_foldrM': OK
  11612. 282.52 s [vector] +++ OK, passed 100 tests.
  11613. 282.52 s [vector] mut_ifoldM: OK
  11614. 282.52 s [vector] +++ OK, passed 100 tests.
  11615. 282.52 s [vector] mut_ifoldM': OK
  11616. 282.52 s [vector] +++ OK, passed 100 tests.
  11617. 282.52 s [vector] mut_ifoldrM: OK
  11618. 282.53 s [vector] +++ OK, passed 100 tests.
  11619. 282.53 s [vector] mut_ifoldrM': OK
  11620. 282.53 s [vector] +++ OK, passed 100 tests.
  11621. 282.53 s [vector] compare: OK
  11622. 282.53 s [vector] +++ OK, passed 100 tests.
  11623. 282.53 s [vector] maximum: OK
  11624. 282.53 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11625. 282.53 s [vector] minimum: OK
  11626. 282.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11627. 282.53 s [vector] minIndex: OK
  11628. 282.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11629. 282.53 s [vector] maxIndex: OK
  11630. 282.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11631. 282.53 s [vector] maximumBy: OK
  11632. 282.53 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11633. 282.53 s [vector] minimumBy: OK
  11634. 282.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11635. 282.53 s [vector] maximumOn: OK
  11636. 282.53 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11637. 282.53 s [vector] minimumOn: OK
  11638. 282.53 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11639. 282.53 s [vector] maxIndexBy: OK
  11640. 282.53 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11641. 282.53 s [vector] minIndexBy: OK
  11642. 282.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11643. 282.53 s [vector] ListFirstMaxIndexWins: OK
  11644. 282.53 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11645. 282.53 s [vector] FalseListFirstMaxIndexWins: OK
  11646. 282.53 s [vector] +++ OK, failed as expected. (after 1 test):
  11647. 282.53 s [vector] Exception:
  11648. 282.53 s [vector] Prelude.foldr1: empty list
  11649. 282.53 s [vector] CallStack (from HasCallStack):
  11650. 282.53 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11651. 282.53 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11652. 282.53 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11653. 282.53 s [vector] []
  11654. 282.53 s [vector] zip: OK
  11655. 282.53 s [vector] +++ OK, passed 100 tests.
  11656. 282.53 s [vector] zip3: OK
  11657. 282.53 s [vector] +++ OK, passed 100 tests.
  11658. 282.54 s [vector] unzip: OK
  11659. 282.54 s [vector] +++ OK, passed 100 tests.
  11660. 282.54 s [vector] unzip3: OK
  11661. 282.54 s [vector] +++ OK, passed 100 tests.
  11662. 282.54 s [vector] indexed: OK
  11663. 282.54 s [vector] +++ OK, passed 100 tests.
  11664. 282.54 s [vector] update: OK
  11665. 282.54 s [vector] +++ OK, passed 100 tests.
  11666. 282.54 s [vector] mempty: OK
  11667. 282.54 s [vector] +++ OK, passed 100 tests.
  11668. 282.54 s [vector] mappend: OK
  11669. 282.55 s [vector] +++ OK, passed 100 tests.
  11670. 282.56 s [vector] mconcat: OK (0.01s)
  11671. 282.56 s [vector] +++ OK, passed 100 tests.
  11672. 282.56 s [vector] glength: OK
  11673. 282.56 s [vector] +++ OK, passed 100 tests.
  11674. 282.56 s [vector] and: OK
  11675. 282.56 s [vector] +++ OK, passed 100 tests.
  11676. 282.56 s [vector] or: OK
  11677. 282.56 s [vector] +++ OK, passed 100 tests.
  11678. 282.56 s [vector] (Int)
  11679. 282.56 s [vector] fromList.toList == id: OK
  11680. 282.56 s [vector] +++ OK, passed 100 tests.
  11681. 282.56 s [vector] toList.fromList == id: OK
  11682. 282.56 s [vector] +++ OK, passed 100 tests.
  11683. 282.56 s [vector] unstream.stream == id: OK
  11684. 282.56 s [vector] +++ OK, passed 100 tests.
  11685. 282.56 s [vector] stream.unstream == id: OK
  11686. 282.56 s [vector] +++ OK, passed 100 tests.
  11687. 282.56 s [vector] eq: OK
  11688. 282.56 s [vector] +++ OK, passed 100 tests.
  11689. 282.56 s [vector] length: OK
  11690. 282.56 s [vector] +++ OK, passed 100 tests.
  11691. 282.56 s [vector] null: OK
  11692. 282.56 s [vector] +++ OK, passed 100 tests.
  11693. 282.56 s [vector] index: OK
  11694. 282.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11695. 282.56 s [vector] safeIndex: OK
  11696. 282.56 s [vector] +++ OK, passed 100 tests.
  11697. 282.56 s [vector] head: OK
  11698. 282.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11699. 282.56 s [vector] last: OK
  11700. 282.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11701. 282.56 s [vector] unsafeIndex: OK
  11702. 282.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11703. 282.56 s [vector] unsafeHead: OK
  11704. 282.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11705. 282.56 s [vector] unsafeLast: OK
  11706. 282.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11707. 282.56 s [vector] slice: OK
  11708. 282.56 s [vector] +++ OK, passed 100 tests.
  11709. 282.56 s [vector] init: OK
  11710. 282.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11711. 282.57 s [vector] tail: OK
  11712. 282.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11713. 282.57 s [vector] take: OK
  11714. 282.57 s [vector] +++ OK, passed 100 tests.
  11715. 282.57 s [vector] drop: OK
  11716. 282.57 s [vector] +++ OK, passed 100 tests.
  11717. 282.57 s [vector] splitAt: OK
  11718. 282.57 s [vector] +++ OK, passed 100 tests.
  11719. 282.57 s [vector] empty: OK
  11720. 282.57 s [vector] +++ OK, passed 100 tests.
  11721. 282.57 s [vector] singleton: OK
  11722. 282.57 s [vector] +++ OK, passed 100 tests.
  11723. 282.57 s [vector] replicate: OK
  11724. 282.57 s [vector] +++ OK, passed 100 tests.
  11725. 282.57 s [vector] generate: OK
  11726. 282.57 s [vector] +++ OK, passed 100 tests.
  11727. 282.57 s [vector] iterateN: OK
  11728. 282.57 s [vector] +++ OK, passed 100 tests.
  11729. 282.59 s [vector] iterateNM: OK (0.02s)
  11730. 282.59 s [vector] +++ OK, passed 100 tests.
  11731. 282.62 s [vector] generateM: OK (0.02s)
  11732. 282.62 s [vector] +++ OK, passed 100 tests.
  11733. 282.62 s [vector] replicateM: OK
  11734. 282.62 s [vector] +++ OK, passed 100 tests.
  11735. 282.62 s [vector] create: OK
  11736. 282.62 s [vector] +++ OK, passed 100 tests.
  11737. 282.62 s [vector] createT: OK
  11738. 282.62 s [vector] +++ OK, passed 100 tests.
  11739. 282.62 s [vector] unfoldr: OK
  11740. 282.62 s [vector] +++ OK, passed 100 tests.
  11741. 282.62 s [vector] unfoldrN: OK
  11742. 282.63 s [vector] +++ OK, passed 100 tests.
  11743. 282.63 s [vector] unfoldrExactN: OK
  11744. 282.63 s [vector] +++ OK, passed 100 tests.
  11745. 282.63 s [vector] unfoldrM: OK
  11746. 282.63 s [vector] +++ OK, passed 100 tests.
  11747. 282.63 s [vector] unfoldrNM: OK
  11748. 282.63 s [vector] +++ OK, passed 100 tests.
  11749. 282.65 s [vector] unfoldrExactNM: OK (0.02s)
  11750. 282.65 s [vector] +++ OK, passed 100 tests.
  11751. 282.65 s [vector] constructN: OK
  11752. 282.65 s [vector] +++ OK, passed 100 tests.
  11753. 282.66 s [vector] constructrN: OK
  11754. 282.66 s [vector] +++ OK, passed 100 tests.
  11755. 282.66 s [vector] cons: OK
  11756. 282.66 s [vector] +++ OK, passed 100 tests.
  11757. 282.66 s [vector] snoc: OK
  11758. 282.66 s [vector] +++ OK, passed 100 tests.
  11759. 282.67 s [vector] append: OK
  11760. 282.67 s [vector] +++ OK, passed 100 tests.
  11761. 282.68 s [vector] concat: OK (0.02s)
  11762. 282.68 s [vector] +++ OK, passed 100 tests.
  11763. 282.68 s [vector] force: OK
  11764. 282.68 s [vector] +++ OK, passed 100 tests.
  11765. 282.68 s [vector] upd: OK
  11766. 282.68 s [vector] +++ OK, passed 100 tests.
  11767. 282.68 s [vector] accum: OK
  11768. 282.68 s [vector] +++ OK, passed 100 tests.
  11769. 282.68 s [vector] reverse: OK
  11770. 282.68 s [vector] +++ OK, passed 100 tests.
  11771. 282.68 s [vector] backpermute: OK
  11772. 282.68 s [vector] +++ OK, passed 100 tests.
  11773. 282.68 s [vector] map: OK
  11774. 282.68 s [vector] +++ OK, passed 100 tests.
  11775. 282.69 s [vector] imap: OK
  11776. 282.69 s [vector] +++ OK, passed 100 tests.
  11777. 282.69 s [vector] concatMap: OK
  11778. 282.69 s [vector] +++ OK, passed 100 tests.
  11779. 282.69 s [vector] mapM: OK
  11780. 282.69 s [vector] +++ OK, passed 100 tests.
  11781. 282.71 s [vector] mapM_: OK (0.02s)
  11782. 282.71 s [vector] +++ OK, passed 100 tests.
  11783. 282.71 s [vector] forM: OK
  11784. 282.71 s [vector] +++ OK, passed 100 tests.
  11785. 282.73 s [vector] forM_: OK (0.02s)
  11786. 282.73 s [vector] +++ OK, passed 100 tests.
  11787. 282.73 s [vector] imapM: OK
  11788. 282.73 s [vector] +++ OK, passed 100 tests.
  11789. 282.74 s [vector] imapM_: OK (0.01s)
  11790. 282.74 s [vector] +++ OK, passed 100 tests.
  11791. 282.75 s [vector] zipWith: OK
  11792. 282.75 s [vector] +++ OK, passed 100 tests.
  11793. 282.75 s [vector] zipWith3: OK
  11794. 282.75 s [vector] +++ OK, passed 100 tests.
  11795. 282.75 s [vector] izipWith: OK
  11796. 282.75 s [vector] +++ OK, passed 100 tests.
  11797. 282.75 s [vector] izipWith3: OK
  11798. 282.75 s [vector] +++ OK, passed 100 tests.
  11799. 282.75 s [vector] izipWithM: OK
  11800. 282.75 s [vector] +++ OK, passed 100 tests.
  11801. 282.76 s [vector] izipWithM_: OK
  11802. 282.76 s [vector] +++ OK, passed 100 tests.
  11803. 282.77 s [vector] zipWithM: OK
  11804. 282.77 s [vector] +++ OK, passed 100 tests.
  11805. 282.78 s [vector] zipWithM_: OK (0.01s)
  11806. 282.78 s [vector] +++ OK, passed 100 tests.
  11807. 282.79 s [vector] filter: OK
  11808. 282.79 s [vector] +++ OK, passed 100 tests.
  11809. 282.79 s [vector] ifilter: OK
  11810. 282.79 s [vector] +++ OK, passed 100 tests.
  11811. 282.80 s [vector] filterM: OK (0.02s)
  11812. 282.81 s [vector] +++ OK, passed 100 tests.
  11813. 282.81 s [vector] uniq: OK
  11814. 282.81 s [vector] +++ OK, passed 100 tests.
  11815. 282.81 s [vector] mapMaybe: OK
  11816. 282.81 s [vector] +++ OK, passed 100 tests.
  11817. 282.81 s [vector] imapMaybe: OK
  11818. 282.81 s [vector] +++ OK, passed 100 tests.
  11819. 282.81 s [vector] takeWhile: OK
  11820. 282.81 s [vector] +++ OK, passed 100 tests.
  11821. 282.81 s [vector] dropWhile: OK
  11822. 282.81 s [vector] +++ OK, passed 100 tests.
  11823. 282.81 s [vector] partition: OK
  11824. 282.81 s [vector] +++ OK, passed 100 tests.
  11825. 282.81 s [vector] partitionWith: OK
  11826. 282.81 s [vector] +++ OK, passed 100 tests.
  11827. 282.81 s [vector] span: OK
  11828. 282.82 s [vector] +++ OK, passed 100 tests.
  11829. 282.82 s [vector] break: OK
  11830. 282.82 s [vector] +++ OK, passed 100 tests.
  11831. 282.82 s [vector] spanR: OK
  11832. 282.82 s [vector] +++ OK, passed 100 tests.
  11833. 282.82 s [vector] breakR: OK
  11834. 282.82 s [vector] +++ OK, passed 100 tests.
  11835. 282.82 s [vector] groupBy: OK
  11836. 282.82 s [vector] +++ OK, passed 100 tests.
  11837. 282.82 s [vector] elem: OK
  11838. 282.82 s [vector] +++ OK, passed 100 tests.
  11839. 282.82 s [vector] notElem: OK
  11840. 282.82 s [vector] +++ OK, passed 100 tests.
  11841. 282.82 s [vector] find: OK
  11842. 282.82 s [vector] +++ OK, passed 100 tests.
  11843. 282.82 s [vector] findIndex: OK
  11844. 282.82 s [vector] +++ OK, passed 100 tests.
  11845. 282.82 s [vector] findIndexR: OK
  11846. 282.82 s [vector] +++ OK, passed 100 tests.
  11847. 282.82 s [vector] findIndices: OK
  11848. 282.82 s [vector] +++ OK, passed 100 tests.
  11849. 282.82 s [vector] elemIndex: OK
  11850. 282.82 s [vector] +++ OK, passed 100 tests.
  11851. 282.82 s [vector] elemIndices: OK
  11852. 282.83 s [vector] +++ OK, passed 100 tests.
  11853. 282.83 s [vector] foldl: OK
  11854. 282.83 s [vector] +++ OK, passed 100 tests.
  11855. 282.83 s [vector] foldl1: OK
  11856. 282.83 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11857. 282.83 s [vector] foldl': OK
  11858. 282.83 s [vector] +++ OK, passed 100 tests.
  11859. 282.84 s [vector] foldl1': OK
  11860. 282.84 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11861. 282.84 s [vector] foldr: OK
  11862. 282.84 s [vector] +++ OK, passed 100 tests.
  11863. 282.84 s [vector] foldr1: OK
  11864. 282.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11865. 282.84 s [vector] foldr': OK
  11866. 282.85 s [vector] +++ OK, passed 100 tests.
  11867. 282.85 s [vector] foldr1': OK
  11868. 282.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11869. 282.85 s [vector] ifoldl: OK
  11870. 282.85 s [vector] +++ OK, passed 100 tests.
  11871. 282.85 s [vector] ifoldl': OK
  11872. 282.85 s [vector] +++ OK, passed 100 tests.
  11873. 282.85 s [vector] ifoldr: OK
  11874. 282.85 s [vector] +++ OK, passed 100 tests.
  11875. 282.85 s [vector] ifoldr': OK
  11876. 282.86 s [vector] +++ OK, passed 100 tests.
  11877. 282.87 s [vector] ifoldM: OK
  11878. 282.87 s [vector] +++ OK, passed 100 tests.
  11879. 282.89 s [vector] ifoldM': OK
  11880. 282.89 s [vector] +++ OK, passed 100 tests.
  11881. 282.89 s [vector] ifoldM_: OK (0.01s)
  11882. 282.89 s [vector] +++ OK, passed 100 tests.
  11883. 282.89 s [vector] ifoldM'_: OK (0.01s)
  11884. 282.89 s [vector] +++ OK, passed 100 tests.
  11885. 282.89 s [vector] all: OK
  11886. 282.89 s [vector] +++ OK, passed 100 tests.
  11887. 282.89 s [vector] any: OK
  11888. 282.89 s [vector] +++ OK, passed 100 tests.
  11889. 282.89 s [vector] prescanl: OK
  11890. 282.89 s [vector] +++ OK, passed 100 tests.
  11891. 282.89 s [vector] prescanl': OK
  11892. 282.89 s [vector] +++ OK, passed 100 tests.
  11893. 282.90 s [vector] postscanl: OK
  11894. 282.90 s [vector] +++ OK, passed 100 tests.
  11895. 282.90 s [vector] postscanl': OK
  11896. 282.90 s [vector] +++ OK, passed 100 tests.
  11897. 282.90 s [vector] scanl: OK
  11898. 282.90 s [vector] +++ OK, passed 100 tests.
  11899. 282.90 s [vector] scanl': OK
  11900. 282.90 s [vector] +++ OK, passed 100 tests.
  11901. 282.91 s [vector] scanl1: OK
  11902. 282.91 s [vector] +++ OK, passed 100 tests.
  11903. 282.91 s [vector] scanl1': OK
  11904. 282.91 s [vector] +++ OK, passed 100 tests.
  11905. 282.91 s [vector] iscanl: OK
  11906. 282.91 s [vector] +++ OK, passed 100 tests.
  11907. 282.91 s [vector] iscanl': OK
  11908. 282.91 s [vector] +++ OK, passed 100 tests.
  11909. 282.92 s [vector] prescanr: OK
  11910. 282.92 s [vector] +++ OK, passed 100 tests.
  11911. 282.92 s [vector] prescanr': OK
  11912. 282.92 s [vector] +++ OK, passed 100 tests.
  11913. 282.92 s [vector] postscanr: OK
  11914. 282.92 s [vector] +++ OK, passed 100 tests.
  11915. 282.93 s [vector] postscanr': OK
  11916. 282.93 s [vector] +++ OK, passed 100 tests.
  11917. 282.93 s [vector] scanr: OK
  11918. 282.93 s [vector] +++ OK, passed 100 tests.
  11919. 282.93 s [vector] scanr': OK
  11920. 282.93 s [vector] +++ OK, passed 100 tests.
  11921. 282.93 s [vector] scanr1: OK
  11922. 282.93 s [vector] +++ OK, passed 100 tests.
  11923. 282.93 s [vector] scanr1': OK
  11924. 282.93 s [vector] +++ OK, passed 100 tests.
  11925. 282.94 s [vector] iscanr: OK
  11926. 282.94 s [vector] +++ OK, passed 100 tests.
  11927. 282.94 s [vector] iscanr': OK
  11928. 282.94 s [vector] +++ OK, passed 100 tests.
  11929. 282.94 s [vector] mut_read: OK
  11930. 282.94 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11931. 282.94 s [vector] mut_write: OK
  11932. 282.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11933. 282.94 s [vector] mut_modify: OK
  11934. 282.94 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11935. 282.95 s [vector] mut_generate: OK
  11936. 282.95 s [vector] +++ OK, passed 100 tests.
  11937. 282.95 s [vector] mut_generateM: OK
  11938. 282.95 s [vector] +++ OK, passed 100 tests.
  11939. 282.97 s [vector] mut_mapM_: OK (0.01s)
  11940. 282.97 s [vector] +++ OK, passed 100 tests.
  11941. 282.99 s [vector] mut_imapM_: OK (0.01s)
  11942. 282.99 s [vector] +++ OK, passed 100 tests.
  11943. 282.99 s [vector] mut_forM_: OK (0.01s)
  11944. 282.99 s [vector] +++ OK, passed 100 tests.
  11945. 283.01 s [vector] mut_iforM_: OK
  11946. 283.01 s [vector] +++ OK, passed 100 tests.
  11947. 283.01 s [vector] mut_foldr: OK
  11948. 283.01 s [vector] +++ OK, passed 100 tests.
  11949. 283.01 s [vector] mut_foldr': OK
  11950. 283.01 s [vector] +++ OK, passed 100 tests.
  11951. 283.02 s [vector] mut_foldl: OK
  11952. 283.02 s [vector] +++ OK, passed 100 tests.
  11953. 283.02 s [vector] mut_foldl': OK
  11954. 283.02 s [vector] +++ OK, passed 100 tests.
  11955. 283.02 s [vector] mut_ifoldr: OK
  11956. 283.02 s [vector] +++ OK, passed 100 tests.
  11957. 283.03 s [vector] mut_ifoldr': OK
  11958. 283.03 s [vector] +++ OK, passed 100 tests.
  11959. 283.03 s [vector] mut_ifoldl: OK
  11960. 283.03 s [vector] +++ OK, passed 100 tests.
  11961. 283.04 s [vector] mut_ifoldl': OK
  11962. 283.04 s [vector] +++ OK, passed 100 tests.
  11963. 283.04 s [vector] mut_foldM: OK
  11964. 283.04 s [vector] +++ OK, passed 100 tests.
  11965. 283.04 s [vector] mut_foldM': OK
  11966. 283.05 s [vector] +++ OK, passed 100 tests.
  11967. 283.05 s [vector] mut_foldrM: OK
  11968. 283.05 s [vector] +++ OK, passed 100 tests.
  11969. 283.05 s [vector] mut_foldrM': OK
  11970. 283.05 s [vector] +++ OK, passed 100 tests.
  11971. 283.05 s [vector] mut_ifoldM: OK
  11972. 283.05 s [vector] +++ OK, passed 100 tests.
  11973. 283.05 s [vector] mut_ifoldM': OK
  11974. 283.05 s [vector] +++ OK, passed 100 tests.
  11975. 283.05 s [vector] mut_ifoldrM: OK
  11976. 283.05 s [vector] +++ OK, passed 100 tests.
  11977. 283.05 s [vector] mut_ifoldrM': OK
  11978. 283.05 s [vector] +++ OK, passed 100 tests.
  11979. 283.05 s [vector] compare: OK
  11980. 283.05 s [vector] +++ OK, passed 100 tests.
  11981. 283.05 s [vector] maximum: OK
  11982. 283.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11983. 283.05 s [vector] minimum: OK
  11984. 283.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11985. 283.06 s [vector] minIndex: OK
  11986. 283.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11987. 283.06 s [vector] maxIndex: OK
  11988. 283.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11989. 283.06 s [vector] maximumBy: OK
  11990. 283.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11991. 283.06 s [vector] minimumBy: OK
  11992. 283.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11993. 283.06 s [vector] maximumOn: OK
  11994. 283.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11995. 283.06 s [vector] minimumOn: OK
  11996. 283.06 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11997. 283.06 s [vector] maxIndexBy: OK
  11998. 283.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11999. 283.06 s [vector] minIndexBy: OK
  12000. 283.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12001. 283.06 s [vector] ListFirstMaxIndexWins: OK
  12002. 283.06 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12003. 283.06 s [vector] FalseListFirstMaxIndexWins: OK
  12004. 283.06 s [vector] +++ OK, failed as expected. (after 1 test):
  12005. 283.06 s [vector] Exception:
  12006. 283.06 s [vector] Prelude.foldr1: empty list
  12007. 283.06 s [vector] CallStack (from HasCallStack):
  12008. 283.06 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12009. 283.06 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12010. 283.06 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12011. 283.06 s [vector] []
  12012. 283.06 s [vector] zip: OK
  12013. 283.06 s [vector] +++ OK, passed 100 tests.
  12014. 283.06 s [vector] zip3: OK
  12015. 283.06 s [vector] +++ OK, passed 100 tests.
  12016. 283.06 s [vector] unzip: OK
  12017. 283.07 s [vector] +++ OK, passed 100 tests.
  12018. 283.07 s [vector] unzip3: OK
  12019. 283.07 s [vector] +++ OK, passed 100 tests.
  12020. 283.07 s [vector] indexed: OK
  12021. 283.07 s [vector] +++ OK, passed 100 tests.
  12022. 283.07 s [vector] update: OK
  12023. 283.07 s [vector] +++ OK, passed 100 tests.
  12024. 283.07 s [vector] mempty: OK
  12025. 283.07 s [vector] +++ OK, passed 100 tests.
  12026. 283.09 s [vector] mappend: OK
  12027. 283.09 s [vector] +++ OK, passed 100 tests.
  12028. 283.09 s [vector] mconcat: OK (0.01s)
  12029. 283.09 s [vector] +++ OK, passed 100 tests.
  12030. 283.09 s [vector] glength: OK
  12031. 283.09 s [vector] +++ OK, passed 100 tests.
  12032. 283.09 s [vector] sum: OK
  12033. 283.09 s [vector] +++ OK, passed 100 tests.
  12034. 283.09 s [vector] product: OK
  12035. 283.09 s [vector] +++ OK, passed 100 tests.
  12036. 283.09 s [vector] enumFromN: OK
  12037. 283.09 s [vector] +++ OK, passed 100 tests.
  12038. 283.09 s [vector] enumFromThenN: OK
  12039. 283.09 s [vector] +++ OK, passed 100 tests.
  12040. 283.09 s [vector] enumFromTo: OK
  12041. 283.09 s [vector] +++ OK, passed 100 tests.
  12042. 283.09 s [vector] enumFromThenTo: OK
  12043. 283.09 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12044. 283.09 s [vector] (Float)
  12045. 283.09 s [vector] fromList.toList == id: OK
  12046. 283.09 s [vector] +++ OK, passed 100 tests.
  12047. 283.09 s [vector] toList.fromList == id: OK
  12048. 283.09 s [vector] +++ OK, passed 100 tests.
  12049. 283.09 s [vector] unstream.stream == id: OK
  12050. 283.09 s [vector] +++ OK, passed 100 tests.
  12051. 283.10 s [vector] stream.unstream == id: OK
  12052. 283.10 s [vector] +++ OK, passed 100 tests.
  12053. 283.10 s [vector] eq: OK
  12054. 283.10 s [vector] +++ OK, passed 100 tests.
  12055. 283.10 s [vector] length: OK
  12056. 283.10 s [vector] +++ OK, passed 100 tests.
  12057. 283.10 s [vector] null: OK
  12058. 283.10 s [vector] +++ OK, passed 100 tests.
  12059. 283.10 s [vector] index: OK
  12060. 283.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12061. 283.10 s [vector] safeIndex: OK
  12062. 283.10 s [vector] +++ OK, passed 100 tests.
  12063. 283.10 s [vector] head: OK
  12064. 283.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12065. 283.10 s [vector] last: OK
  12066. 283.10 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12067. 283.10 s [vector] unsafeIndex: OK
  12068. 283.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12069. 283.10 s [vector] unsafeHead: OK
  12070. 283.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12071. 283.11 s [vector] unsafeLast: OK
  12072. 283.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12073. 283.11 s [vector] slice: OK
  12074. 283.11 s [vector] +++ OK, passed 100 tests.
  12075. 283.11 s [vector] init: OK
  12076. 283.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12077. 283.11 s [vector] tail: OK
  12078. 283.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12079. 283.11 s [vector] take: OK
  12080. 283.11 s [vector] +++ OK, passed 100 tests.
  12081. 283.11 s [vector] drop: OK
  12082. 283.11 s [vector] +++ OK, passed 100 tests.
  12083. 283.11 s [vector] splitAt: OK
  12084. 283.11 s [vector] +++ OK, passed 100 tests.
  12085. 283.11 s [vector] empty: OK
  12086. 283.11 s [vector] +++ OK, passed 100 tests.
  12087. 283.11 s [vector] singleton: OK
  12088. 283.11 s [vector] +++ OK, passed 100 tests.
  12089. 283.11 s [vector] replicate: OK
  12090. 283.11 s [vector] +++ OK, passed 100 tests.
  12091. 283.11 s [vector] generate: OK
  12092. 283.11 s [vector] +++ OK, passed 100 tests.
  12093. 283.11 s [vector] iterateN: OK
  12094. 283.11 s [vector] +++ OK, passed 100 tests.
  12095. 283.13 s [vector] iterateNM: OK (0.02s)
  12096. 283.13 s [vector] +++ OK, passed 100 tests.
  12097. 283.17 s [vector] generateM: OK (0.03s)
  12098. 283.17 s [vector] +++ OK, passed 100 tests.
  12099. 283.17 s [vector] replicateM: OK
  12100. 283.17 s [vector] +++ OK, passed 100 tests.
  12101. 283.17 s [vector] create: OK
  12102. 283.17 s [vector] +++ OK, passed 100 tests.
  12103. 283.18 s [vector] createT: OK
  12104. 283.18 s [vector] +++ OK, passed 100 tests.
  12105. 283.18 s [vector] unfoldr: OK
  12106. 283.18 s [vector] +++ OK, passed 100 tests.
  12107. 283.18 s [vector] unfoldrN: OK
  12108. 283.18 s [vector] +++ OK, passed 100 tests.
  12109. 283.19 s [vector] unfoldrExactN: OK
  12110. 283.19 s [vector] +++ OK, passed 100 tests.
  12111. 283.19 s [vector] unfoldrM: OK
  12112. 283.19 s [vector] +++ OK, passed 100 tests.
  12113. 283.19 s [vector] unfoldrNM: OK
  12114. 283.19 s [vector] +++ OK, passed 100 tests.
  12115. 283.21 s [vector] unfoldrExactNM: OK (0.02s)
  12116. 283.21 s [vector] +++ OK, passed 100 tests.
  12117. 283.21 s [vector] constructN: OK
  12118. 283.22 s [vector] +++ OK, passed 100 tests.
  12119. 283.22 s [vector] constructrN: OK
  12120. 283.22 s [vector] +++ OK, passed 100 tests.
  12121. 283.22 s [vector] cons: OK
  12122. 283.22 s [vector] +++ OK, passed 100 tests.
  12123. 283.22 s [vector] snoc: OK
  12124. 283.22 s [vector] +++ OK, passed 100 tests.
  12125. 283.22 s [vector] append: OK
  12126. 283.22 s [vector] +++ OK, passed 100 tests.
  12127. 283.25 s [vector] concat: OK (0.01s)
  12128. 283.25 s [vector] +++ OK, passed 100 tests.
  12129. 283.25 s [vector] force: OK
  12130. 283.26 s [vector] +++ OK, passed 100 tests.
  12131. 283.26 s [vector] upd: OK
  12132. 283.26 s [vector] +++ OK, passed 100 tests.
  12133. 283.26 s [vector] accum: OK
  12134. 283.26 s [vector] +++ OK, passed 100 tests.
  12135. 283.26 s [vector] reverse: OK
  12136. 283.26 s [vector] +++ OK, passed 100 tests.
  12137. 283.27 s [vector] backpermute: OK
  12138. 283.27 s [vector] +++ OK, passed 100 tests.
  12139. 283.27 s [vector] map: OK
  12140. 283.28 s [vector] +++ OK, passed 100 tests.
  12141. 283.29 s [vector] imap: OK
  12142. 283.29 s [vector] +++ OK, passed 100 tests.
  12143. 283.29 s [vector] concatMap: OK
  12144. 283.29 s [vector] +++ OK, passed 100 tests.
  12145. 283.29 s [vector] mapM: OK
  12146. 283.29 s [vector] +++ OK, passed 100 tests.
  12147. 283.31 s [vector] mapM_: OK (0.02s)
  12148. 283.31 s [vector] +++ OK, passed 100 tests.
  12149. 283.31 s [vector] forM: OK
  12150. 283.31 s [vector] +++ OK, passed 100 tests.
  12151. 283.34 s [vector] forM_: OK (0.03s)
  12152. 283.35 s [vector] +++ OK, passed 100 tests.
  12153. 283.35 s [vector] imapM: OK
  12154. 283.35 s [vector] +++ OK, passed 100 tests.
  12155. 283.39 s [vector] imapM_: OK (0.03s)
  12156. 283.39 s [vector] +++ OK, passed 100 tests.
  12157. 283.39 s [vector] zipWith: OK
  12158. 283.39 s [vector] +++ OK, passed 100 tests.
  12159. 283.39 s [vector] zipWith3: OK
  12160. 283.39 s [vector] +++ OK, passed 100 tests.
  12161. 283.41 s [vector] izipWith: OK
  12162. 283.41 s [vector] +++ OK, passed 100 tests.
  12163. 283.41 s [vector] izipWith3: OK
  12164. 283.41 s [vector] +++ OK, passed 100 tests.
  12165. 283.43 s [vector] izipWithM: OK
  12166. 283.43 s [vector] +++ OK, passed 100 tests.
  12167. 283.44 s [vector] izipWithM_: OK (0.02s)
  12168. 283.45 s [vector] +++ OK, passed 100 tests.
  12169. 283.45 s [vector] zipWithM: OK
  12170. 283.45 s [vector] +++ OK, passed 100 tests.
  12171. 283.47 s [vector] zipWithM_: OK (0.02s)
  12172. 283.47 s [vector] +++ OK, passed 100 tests.
  12173. 283.47 s [vector] filter: OK
  12174. 283.47 s [vector] +++ OK, passed 100 tests.
  12175. 283.48 s [vector] ifilter: OK
  12176. 283.48 s [vector] +++ OK, passed 100 tests.
  12177. 283.51 s [vector] filterM: OK (0.04s)
  12178. 283.52 s [vector] +++ OK, passed 100 tests.
  12179. 283.53 s [vector] uniq: OK
  12180. 283.53 s [vector] +++ OK, passed 100 tests.
  12181. 283.53 s [vector] mapMaybe: OK
  12182. 283.53 s [vector] +++ OK, passed 100 tests.
  12183. 283.53 s [vector] imapMaybe: OK
  12184. 283.53 s [vector] +++ OK, passed 100 tests.
  12185. 283.53 s [vector] takeWhile: OK
  12186. 283.53 s [vector] +++ OK, passed 100 tests.
  12187. 283.53 s [vector] dropWhile: OK
  12188. 283.53 s [vector] +++ OK, passed 100 tests.
  12189. 283.53 s [vector] partition: OK
  12190. 283.53 s [vector] +++ OK, passed 100 tests.
  12191. 283.54 s [vector] partitionWith: OK
  12192. 283.54 s [vector] +++ OK, passed 100 tests.
  12193. 283.54 s [vector] span: OK
  12194. 283.54 s [vector] +++ OK, passed 100 tests.
  12195. 283.54 s [vector] break: OK
  12196. 283.54 s [vector] +++ OK, passed 100 tests.
  12197. 283.54 s [vector] spanR: OK
  12198. 283.55 s [vector] +++ OK, passed 100 tests.
  12199. 283.55 s [vector] breakR: OK
  12200. 283.55 s [vector] +++ OK, passed 100 tests.
  12201. 283.55 s [vector] groupBy: OK
  12202. 283.55 s [vector] +++ OK, passed 100 tests.
  12203. 283.55 s [vector] elem: OK
  12204. 283.55 s [vector] +++ OK, passed 100 tests.
  12205. 283.55 s [vector] notElem: OK
  12206. 283.55 s [vector] +++ OK, passed 100 tests.
  12207. 283.55 s [vector] find: OK
  12208. 283.55 s [vector] +++ OK, passed 100 tests.
  12209. 283.55 s [vector] findIndex: OK
  12210. 283.55 s [vector] +++ OK, passed 100 tests.
  12211. 283.55 s [vector] findIndexR: OK
  12212. 283.55 s [vector] +++ OK, passed 100 tests.
  12213. 283.55 s [vector] findIndices: OK
  12214. 283.55 s [vector] +++ OK, passed 100 tests.
  12215. 283.56 s [vector] elemIndex: OK
  12216. 283.56 s [vector] +++ OK, passed 100 tests.
  12217. 283.56 s [vector] elemIndices: OK
  12218. 283.56 s [vector] +++ OK, passed 100 tests.
  12219. 283.56 s [vector] foldl: OK
  12220. 283.56 s [vector] +++ OK, passed 100 tests.
  12221. 283.57 s [vector] foldl1: OK
  12222. 283.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12223. 283.58 s [vector] foldl': OK
  12224. 283.59 s [vector] +++ OK, passed 100 tests.
  12225. 283.59 s [vector] foldl1': OK
  12226. 283.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12227. 283.59 s [vector] foldr: OK
  12228. 283.59 s [vector] +++ OK, passed 100 tests.
  12229. 283.60 s [vector] foldr1: OK
  12230. 283.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12231. 283.60 s [vector] foldr': OK
  12232. 283.60 s [vector] +++ OK, passed 100 tests.
  12233. 283.61 s [vector] foldr1': OK
  12234. 283.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12235. 283.62 s [vector] ifoldl: OK
  12236. 283.62 s [vector] +++ OK, passed 100 tests.
  12237. 283.63 s [vector] ifoldl': OK
  12238. 283.63 s [vector] +++ OK, passed 100 tests.
  12239. 283.64 s [vector] ifoldr: OK
  12240. 283.65 s [vector] +++ OK, passed 100 tests.
  12241. 283.65 s [vector] ifoldr': OK
  12242. 283.65 s [vector] +++ OK, passed 100 tests.
  12243. 283.65 s [vector] ifoldM: OK
  12244. 283.65 s [vector] +++ OK, passed 100 tests.
  12245. 283.65 s [vector] ifoldM': OK
  12246. 283.65 s [vector] +++ OK, passed 100 tests.
  12247. 283.69 s [vector] ifoldM_: OK (0.03s)
  12248. 283.69 s [vector] +++ OK, passed 100 tests.
  12249. 283.71 s [vector] ifoldM'_: OK (0.03s)
  12250. 283.71 s [vector] +++ OK, passed 100 tests.
  12251. 283.71 s [vector] all: OK
  12252. 283.71 s [vector] +++ OK, passed 100 tests.
  12253. 283.72 s [vector] any: OK
  12254. 283.72 s [vector] +++ OK, passed 100 tests.
  12255. 283.73 s [vector] prescanl: OK
  12256. 283.73 s [vector] +++ OK, passed 100 tests.
  12257. 283.73 s [vector] prescanl': OK
  12258. 283.73 s [vector] +++ OK, passed 100 tests.
  12259. 283.74 s [vector] postscanl: OK
  12260. 283.75 s [vector] +++ OK, passed 100 tests.
  12261. 283.75 s [vector] postscanl': OK
  12262. 283.75 s [vector] +++ OK, passed 100 tests.
  12263. 283.76 s [vector] scanl: OK
  12264. 283.76 s [vector] +++ OK, passed 100 tests.
  12265. 283.77 s [vector] scanl': OK
  12266. 283.77 s [vector] +++ OK, passed 100 tests.
  12267. 283.77 s [vector] scanl1: OK
  12268. 283.77 s [vector] +++ OK, passed 100 tests.
  12269. 283.77 s [vector] scanl1': OK
  12270. 283.77 s [vector] +++ OK, passed 100 tests.
  12271. 283.78 s [vector] iscanl: OK
  12272. 283.78 s [vector] +++ OK, passed 100 tests.
  12273. 283.79 s [vector] iscanl': OK
  12274. 283.79 s [vector] +++ OK, passed 100 tests.
  12275. 283.80 s [vector] prescanr: OK
  12276. 283.80 s [vector] +++ OK, passed 100 tests.
  12277. 283.80 s [vector] prescanr': OK
  12278. 283.80 s [vector] +++ OK, passed 100 tests.
  12279. 283.81 s [vector] postscanr: OK
  12280. 283.81 s [vector] +++ OK, passed 100 tests.
  12281. 283.82 s [vector] postscanr': OK
  12282. 283.83 s [vector] +++ OK, passed 100 tests.
  12283. 283.83 s [vector] scanr: OK
  12284. 283.83 s [vector] +++ OK, passed 100 tests.
  12285. 283.83 s [vector] scanr': OK
  12286. 283.83 s [vector] +++ OK, passed 100 tests.
  12287. 283.84 s [vector] scanr1: OK
  12288. 283.84 s [vector] +++ OK, passed 100 tests.
  12289. 283.85 s [vector] scanr1': OK
  12290. 283.85 s [vector] +++ OK, passed 100 tests.
  12291. 283.85 s [vector] iscanr: OK
  12292. 283.86 s [vector] +++ OK, passed 100 tests.
  12293. 283.86 s [vector] iscanr': OK
  12294. 283.86 s [vector] +++ OK, passed 100 tests.
  12295. 283.86 s [vector] mut_read: OK
  12296. 283.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12297. 283.86 s [vector] mut_write: OK
  12298. 283.86 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12299. 283.87 s [vector] mut_modify: OK
  12300. 283.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12301. 283.87 s [vector] mut_generate: OK
  12302. 283.87 s [vector] +++ OK, passed 100 tests.
  12303. 283.89 s [vector] mut_generateM: OK
  12304. 283.89 s [vector] +++ OK, passed 100 tests.
  12305. 283.93 s [vector] mut_mapM_: OK (0.03s)
  12306. 283.93 s [vector] +++ OK, passed 100 tests.
  12307. 283.95 s [vector] mut_imapM_: OK (0.04s)
  12308. 283.95 s [vector] +++ OK, passed 100 tests.
  12309. 283.99 s [vector] mut_forM_: OK (0.04s)
  12310. 283.99 s [vector] +++ OK, passed 100 tests.
  12311. 284.02 s [vector] mut_iforM_: OK (0.02s)
  12312. 284.02 s [vector] +++ OK, passed 100 tests.
  12313. 284.02 s [vector] mut_foldr: OK
  12314. 284.03 s [vector] +++ OK, passed 100 tests.
  12315. 284.03 s [vector] mut_foldr': OK
  12316. 284.03 s [vector] +++ OK, passed 100 tests.
  12317. 284.04 s [vector] mut_foldl: OK
  12318. 284.05 s [vector] +++ OK, passed 100 tests.
  12319. 284.05 s [vector] mut_foldl': OK
  12320. 284.05 s [vector] +++ OK, passed 100 tests.
  12321. 284.05 s [vector] mut_ifoldr: OK
  12322. 284.05 s [vector] +++ OK, passed 100 tests.
  12323. 284.06 s [vector] mut_ifoldr': OK
  12324. 284.06 s [vector] +++ OK, passed 100 tests.
  12325. 284.07 s [vector] mut_ifoldl: OK
  12326. 284.07 s [vector] +++ OK, passed 100 tests.
  12327. 284.08 s [vector] mut_ifoldl': OK
  12328. 284.08 s [vector] +++ OK, passed 100 tests.
  12329. 284.09 s [vector] mut_foldM: OK
  12330. 284.09 s [vector] +++ OK, passed 100 tests.
  12331. 284.09 s [vector] mut_foldM': OK
  12332. 284.09 s [vector] +++ OK, passed 100 tests.
  12333. 284.09 s [vector] mut_foldrM: OK
  12334. 284.10 s [vector] +++ OK, passed 100 tests.
  12335. 284.11 s [vector] mut_foldrM': OK
  12336. 284.12 s [vector] +++ OK, passed 100 tests.
  12337. 284.13 s [vector] mut_ifoldM: OK (0.01s)
  12338. 284.13 s [vector] +++ OK, passed 100 tests.
  12339. 284.13 s [vector] mut_ifoldM': OK
  12340. 284.13 s [vector] +++ OK, passed 100 tests.
  12341. 284.13 s [vector] mut_ifoldrM: OK
  12342. 284.13 s [vector] +++ OK, passed 100 tests.
  12343. 284.14 s [vector] mut_ifoldrM': OK
  12344. 284.14 s [vector] +++ OK, passed 100 tests.
  12345. 284.14 s [vector] compare: OK
  12346. 284.14 s [vector] +++ OK, passed 100 tests.
  12347. 284.14 s [vector] maximum: OK
  12348. 284.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12349. 284.14 s [vector] minimum: OK
  12350. 284.14 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12351. 284.14 s [vector] minIndex: OK
  12352. 284.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12353. 284.14 s [vector] maxIndex: OK
  12354. 284.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12355. 284.14 s [vector] maximumBy: OK
  12356. 284.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12357. 284.14 s [vector] minimumBy: OK
  12358. 284.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12359. 284.14 s [vector] maximumOn: OK
  12360. 284.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12361. 284.14 s [vector] minimumOn: OK
  12362. 284.14 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12363. 284.15 s [vector] maxIndexBy: OK
  12364. 284.15 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12365. 284.15 s [vector] minIndexBy: OK
  12366. 284.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12367. 284.15 s [vector] ListFirstMaxIndexWins: OK
  12368. 284.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12369. 284.15 s [vector] FalseListFirstMaxIndexWins: OK
  12370. 284.15 s [vector] +++ OK, failed as expected. (after 1 test):
  12371. 284.15 s [vector] Exception:
  12372. 284.15 s [vector] Prelude.foldr1: empty list
  12373. 284.15 s [vector] CallStack (from HasCallStack):
  12374. 284.15 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12375. 284.15 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12376. 284.15 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12377. 284.15 s [vector] []
  12378. 284.15 s [vector] zip: OK
  12379. 284.15 s [vector] +++ OK, passed 100 tests.
  12380. 284.15 s [vector] zip3: OK
  12381. 284.15 s [vector] +++ OK, passed 100 tests.
  12382. 284.15 s [vector] unzip: OK
  12383. 284.15 s [vector] +++ OK, passed 100 tests.
  12384. 284.15 s [vector] unzip3: OK
  12385. 284.16 s [vector] +++ OK, passed 100 tests.
  12386. 284.16 s [vector] indexed: OK
  12387. 284.16 s [vector] +++ OK, passed 100 tests.
  12388. 284.16 s [vector] update: OK
  12389. 284.16 s [vector] +++ OK, passed 100 tests.
  12390. 284.16 s [vector] mempty: OK
  12391. 284.16 s [vector] +++ OK, passed 100 tests.
  12392. 284.16 s [vector] mappend: OK
  12393. 284.17 s [vector] +++ OK, passed 100 tests.
  12394. 284.19 s [vector] mconcat: OK (0.02s)
  12395. 284.19 s [vector] +++ OK, passed 100 tests.
  12396. 284.19 s [vector] glength: OK
  12397. 284.19 s [vector] +++ OK, passed 100 tests.
  12398. 284.19 s [vector] sum: OK
  12399. 284.19 s [vector] +++ OK, passed 100 tests.
  12400. 284.19 s [vector] product: OK
  12401. 284.19 s [vector] +++ OK, passed 100 tests.
  12402. 284.19 s [vector] enumFromN: OK
  12403. 284.19 s [vector] +++ OK, passed 100 tests.
  12404. 284.19 s [vector] enumFromThenN: OK
  12405. 284.19 s [vector] +++ OK, passed 100 tests.
  12406. 284.19 s [vector] enumFromTo: OK
  12407. 284.19 s [vector] +++ OK, passed 100 tests.
  12408. 284.19 s [vector] enumFromThenTo: OK
  12409. 284.19 s [vector] +++ OK, passed 100 tests.
  12410. 284.19 s [vector] (Double)
  12411. 284.19 s [vector] fromList.toList == id: OK
  12412. 284.19 s [vector] +++ OK, passed 100 tests.
  12413. 284.19 s [vector] toList.fromList == id: OK
  12414. 284.19 s [vector] +++ OK, passed 100 tests.
  12415. 284.19 s [vector] unstream.stream == id: OK
  12416. 284.19 s [vector] +++ OK, passed 100 tests.
  12417. 284.19 s [vector] stream.unstream == id: OK
  12418. 284.19 s [vector] +++ OK, passed 100 tests.
  12419. 284.19 s [vector] eq: OK
  12420. 284.19 s [vector] +++ OK, passed 100 tests.
  12421. 284.19 s [vector] length: OK
  12422. 284.19 s [vector] +++ OK, passed 100 tests.
  12423. 284.19 s [vector] null: OK
  12424. 284.19 s [vector] +++ OK, passed 100 tests.
  12425. 284.19 s [vector] index: OK
  12426. 284.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12427. 284.20 s [vector] safeIndex: OK
  12428. 284.20 s [vector] +++ OK, passed 100 tests.
  12429. 284.20 s [vector] head: OK
  12430. 284.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12431. 284.20 s [vector] last: OK
  12432. 284.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12433. 284.20 s [vector] unsafeIndex: OK
  12434. 284.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12435. 284.20 s [vector] unsafeHead: OK
  12436. 284.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12437. 284.20 s [vector] unsafeLast: OK
  12438. 284.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12439. 284.20 s [vector] slice: OK
  12440. 284.20 s [vector] +++ OK, passed 100 tests.
  12441. 284.20 s [vector] init: OK
  12442. 284.20 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12443. 284.20 s [vector] tail: OK
  12444. 284.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12445. 284.20 s [vector] take: OK
  12446. 284.20 s [vector] +++ OK, passed 100 tests.
  12447. 284.20 s [vector] drop: OK
  12448. 284.20 s [vector] +++ OK, passed 100 tests.
  12449. 284.20 s [vector] splitAt: OK
  12450. 284.21 s [vector] +++ OK, passed 100 tests.
  12451. 284.21 s [vector] empty: OK
  12452. 284.21 s [vector] +++ OK, passed 100 tests.
  12453. 284.21 s [vector] singleton: OK
  12454. 284.21 s [vector] +++ OK, passed 100 tests.
  12455. 284.21 s [vector] replicate: OK
  12456. 284.21 s [vector] +++ OK, passed 100 tests.
  12457. 284.21 s [vector] generate: OK
  12458. 284.21 s [vector] +++ OK, passed 100 tests.
  12459. 284.21 s [vector] iterateN: OK
  12460. 284.21 s [vector] +++ OK, passed 100 tests.
  12461. 284.23 s [vector] iterateNM: OK (0.01s)
  12462. 284.23 s [vector] +++ OK, passed 100 tests.
  12463. 284.25 s [vector] generateM: OK (0.02s)
  12464. 284.25 s [vector] +++ OK, passed 100 tests.
  12465. 284.25 s [vector] replicateM: OK (0.01s)
  12466. 284.25 s [vector] +++ OK, passed 100 tests.
  12467. 284.26 s [vector] create: OK
  12468. 284.26 s [vector] +++ OK, passed 100 tests.
  12469. 284.26 s [vector] createT: OK
  12470. 284.26 s [vector] +++ OK, passed 100 tests.
  12471. 284.26 s [vector] unfoldr: OK
  12472. 284.26 s [vector] +++ OK, passed 100 tests.
  12473. 284.26 s [vector] unfoldrN: OK
  12474. 284.26 s [vector] +++ OK, passed 100 tests.
  12475. 284.26 s [vector] unfoldrExactN: OK
  12476. 284.26 s [vector] +++ OK, passed 100 tests.
  12477. 284.26 s [vector] unfoldrM: OK
  12478. 284.26 s [vector] +++ OK, passed 100 tests.
  12479. 284.26 s [vector] unfoldrNM: OK
  12480. 284.26 s [vector] +++ OK, passed 100 tests.
  12481. 284.28 s [vector] unfoldrExactNM: OK
  12482. 284.28 s [vector] +++ OK, passed 100 tests.
  12483. 284.29 s [vector] constructN: OK (0.01s)
  12484. 284.29 s [vector] +++ OK, passed 100 tests.
  12485. 284.30 s [vector] constructrN: OK (0.01s)
  12486. 284.30 s [vector] +++ OK, passed 100 tests.
  12487. 284.30 s [vector] cons: OK
  12488. 284.30 s [vector] +++ OK, passed 100 tests.
  12489. 284.30 s [vector] snoc: OK
  12490. 284.30 s [vector] +++ OK, passed 100 tests.
  12491. 284.30 s [vector] append: OK
  12492. 284.30 s [vector] +++ OK, passed 100 tests.
  12493. 284.33 s [vector] concat: OK (0.01s)
  12494. 284.33 s [vector] +++ OK, passed 100 tests.
  12495. 284.33 s [vector] force: OK
  12496. 284.33 s [vector] +++ OK, passed 100 tests.
  12497. 284.33 s [vector] upd: OK
  12498. 284.33 s [vector] +++ OK, passed 100 tests.
  12499. 284.34 s [vector] accum: OK (0.01s)
  12500. 284.34 s [vector] +++ OK, passed 100 tests.
  12501. 284.35 s [vector] reverse: OK
  12502. 284.35 s [vector] +++ OK, passed 100 tests.
  12503. 284.35 s [vector] backpermute: OK
  12504. 284.35 s [vector] +++ OK, passed 100 tests.
  12505. 284.35 s [vector] map: OK
  12506. 284.35 s [vector] +++ OK, passed 100 tests.
  12507. 284.36 s [vector] imap: OK
  12508. 284.37 s [vector] +++ OK, passed 100 tests.
  12509. 284.37 s [vector] concatMap: OK
  12510. 284.37 s [vector] +++ OK, passed 100 tests.
  12511. 284.37 s [vector] mapM: OK
  12512. 284.37 s [vector] +++ OK, passed 100 tests.
  12513. 284.41 s [vector] mapM_: OK (0.04s)
  12514. 284.41 s [vector] +++ OK, passed 100 tests.
  12515. 284.43 s [vector] forM: OK
  12516. 284.43 s [vector] +++ OK, passed 100 tests.
  12517. 284.45 s [vector] forM_: OK (0.03s)
  12518. 284.45 s [vector] +++ OK, passed 100 tests.
  12519. 284.46 s [vector] imapM: OK
  12520. 284.46 s [vector] +++ OK, passed 100 tests.
  12521. 284.49 s [vector] imapM_: OK (0.03s)
  12522. 284.49 s [vector] +++ OK, passed 100 tests.
  12523. 284.51 s [vector] zipWith: OK
  12524. 284.51 s [vector] +++ OK, passed 100 tests.
  12525. 284.51 s [vector] zipWith3: OK (0.01s)
  12526. 284.51 s [vector] +++ OK, passed 100 tests.
  12527. 284.53 s [vector] izipWith: OK
  12528. 284.53 s [vector] +++ OK, passed 100 tests.
  12529. 284.53 s [vector] izipWith3: OK (0.01s)
  12530. 284.54 s [vector] +++ OK, passed 100 tests.
  12531. 284.54 s [vector] izipWithM: OK
  12532. 284.55 s [vector] +++ OK, passed 100 tests.
  12533. 284.58 s [vector] izipWithM_: OK (0.04s)
  12534. 284.58 s [vector] +++ OK, passed 100 tests.
  12535. 284.58 s [vector] zipWithM: OK
  12536. 284.58 s [vector] +++ OK, passed 100 tests.
  12537. 284.61 s [vector] zipWithM_: OK (0.02s)
  12538. 284.61 s [vector] +++ OK, passed 100 tests.
  12539. 284.62 s [vector] filter: OK
  12540. 284.63 s [vector] +++ OK, passed 100 tests.
  12541. 284.63 s [vector] ifilter: OK
  12542. 284.63 s [vector] +++ OK, passed 100 tests.
  12543. 284.66 s [vector] filterM: OK (0.04s)
  12544. 284.67 s [vector] +++ OK, passed 100 tests.
  12545. 284.67 s [vector] uniq: OK
  12546. 284.67 s [vector] +++ OK, passed 100 tests.
  12547. 284.67 s [vector] mapMaybe: OK
  12548. 284.67 s [vector] +++ OK, passed 100 tests.
  12549. 284.68 s [vector] imapMaybe: OK
  12550. 284.68 s [vector] +++ OK, passed 100 tests.
  12551. 284.68 s [vector] takeWhile: OK
  12552. 284.68 s [vector] +++ OK, passed 100 tests.
  12553. 284.68 s [vector] dropWhile: OK
  12554. 284.68 s [vector] +++ OK, passed 100 tests.
  12555. 284.68 s [vector] partition: OK
  12556. 284.68 s [vector] +++ OK, passed 100 tests.
  12557. 284.69 s [vector] partitionWith: OK
  12558. 284.69 s [vector] +++ OK, passed 100 tests.
  12559. 284.69 s [vector] span: OK
  12560. 284.69 s [vector] +++ OK, passed 100 tests.
  12561. 284.69 s [vector] break: OK
  12562. 284.69 s [vector] +++ OK, passed 100 tests.
  12563. 284.69 s [vector] spanR: OK
  12564. 284.69 s [vector] +++ OK, passed 100 tests.
  12565. 284.70 s [vector] breakR: OK
  12566. 284.70 s [vector] +++ OK, passed 100 tests.
  12567. 284.71 s [vector] groupBy: OK
  12568. 284.71 s [vector] +++ OK, passed 100 tests.
  12569. 284.71 s [vector] elem: OK
  12570. 284.71 s [vector] +++ OK, passed 100 tests.
  12571. 284.71 s [vector] notElem: OK
  12572. 284.71 s [vector] +++ OK, passed 100 tests.
  12573. 284.71 s [vector] find: OK
  12574. 284.71 s [vector] +++ OK, passed 100 tests.
  12575. 284.71 s [vector] findIndex: OK
  12576. 284.71 s [vector] +++ OK, passed 100 tests.
  12577. 284.71 s [vector] findIndexR: OK
  12578. 284.71 s [vector] +++ OK, passed 100 tests.
  12579. 284.72 s [vector] findIndices: OK
  12580. 284.72 s [vector] +++ OK, passed 100 tests.
  12581. 284.72 s [vector] elemIndex: OK
  12582. 284.72 s [vector] +++ OK, passed 100 tests.
  12583. 284.73 s [vector] elemIndices: OK
  12584. 284.73 s [vector] +++ OK, passed 100 tests.
  12585. 284.74 s [vector] foldl: OK (0.01s)
  12586. 284.74 s [vector] +++ OK, passed 100 tests.
  12587. 284.75 s [vector] foldl1: OK (0.01s)
  12588. 284.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12589. 284.75 s [vector] foldl': OK (0.01s)
  12590. 284.75 s [vector] +++ OK, passed 100 tests.
  12591. 284.77 s [vector] foldl1': OK (0.01s)
  12592. 284.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12593. 284.78 s [vector] foldr: OK (0.01s)
  12594. 284.78 s [vector] +++ OK, passed 100 tests.
  12595. 284.78 s [vector] foldr1: OK
  12596. 284.78 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12597. 284.79 s [vector] foldr': OK (0.01s)
  12598. 284.79 s [vector] +++ OK, passed 100 tests.
  12599. 284.80 s [vector] foldr1': OK
  12600. 284.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12601. 284.81 s [vector] ifoldl: OK
  12602. 284.81 s [vector] +++ OK, passed 100 tests.
  12603. 284.83 s [vector] ifoldl': OK (0.01s)
  12604. 284.83 s [vector] +++ OK, passed 100 tests.
  12605. 284.85 s [vector] ifoldr: OK (0.01s)
  12606. 284.85 s [vector] +++ OK, passed 100 tests.
  12607. 284.85 s [vector] ifoldr': OK (0.01s)
  12608. 284.85 s [vector] +++ OK, passed 100 tests.
  12609. 284.87 s [vector] ifoldM: OK (0.01s)
  12610. 284.87 s [vector] +++ OK, passed 100 tests.
  12611. 284.87 s [vector] ifoldM': OK (0.01s)
  12612. 284.87 s [vector] +++ OK, passed 100 tests.
  12613. 284.91 s [vector] ifoldM_: OK (0.04s)
  12614. 284.91 s [vector] +++ OK, passed 100 tests.
  12615. 284.94 s [vector] ifoldM'_: OK (0.03s)
  12616. 284.94 s [vector] +++ OK, passed 100 tests.
  12617. 284.94 s [vector] all: OK
  12618. 284.94 s [vector] +++ OK, passed 100 tests.
  12619. 284.94 s [vector] any: OK
  12620. 284.95 s [vector] +++ OK, passed 100 tests.
  12621. 284.95 s [vector] prescanl: OK
  12622. 284.95 s [vector] +++ OK, passed 100 tests.
  12623. 284.96 s [vector] prescanl': OK (0.01s)
  12624. 284.96 s [vector] +++ OK, passed 100 tests.
  12625. 284.97 s [vector] postscanl: OK
  12626. 284.97 s [vector] +++ OK, passed 100 tests.
  12627. 284.99 s [vector] postscanl': OK (0.01s)
  12628. 284.99 s [vector] +++ OK, passed 100 tests.
  12629. 285.01 s [vector] scanl: OK (0.01s)
  12630. 285.01 s [vector] +++ OK, passed 100 tests.
  12631. 285.01 s [vector] scanl': OK (0.01s)
  12632. 285.01 s [vector] +++ OK, passed 100 tests.
  12633. 285.03 s [vector] scanl1: OK
  12634. 285.03 s [vector] +++ OK, passed 100 tests.
  12635. 285.03 s [vector] scanl1': OK (0.01s)
  12636. 285.03 s [vector] +++ OK, passed 100 tests.
  12637. 285.05 s [vector] iscanl: OK (0.01s)
  12638. 285.05 s [vector] +++ OK, passed 100 tests.
  12639. 285.07 s [vector] iscanl': OK (0.01s)
  12640. 285.07 s [vector] +++ OK, passed 100 tests.
  12641. 285.08 s [vector] prescanr: OK (0.01s)
  12642. 285.08 s [vector] +++ OK, passed 100 tests.
  12643. 285.09 s [vector] prescanr': OK (0.01s)
  12644. 285.09 s [vector] +++ OK, passed 100 tests.
  12645. 285.09 s [vector] postscanr: OK (0.01s)
  12646. 285.09 s [vector] +++ OK, passed 100 tests.
  12647. 285.11 s [vector] postscanr': OK (0.01s)
  12648. 285.11 s [vector] +++ OK, passed 100 tests.
  12649. 285.12 s [vector] scanr: OK
  12650. 285.12 s [vector] +++ OK, passed 100 tests.
  12651. 285.13 s [vector] scanr': OK (0.01s)
  12652. 285.13 s [vector] +++ OK, passed 100 tests.
  12653. 285.14 s [vector] scanr1: OK
  12654. 285.14 s [vector] +++ OK, passed 100 tests.
  12655. 285.15 s [vector] scanr1': OK (0.01s)
  12656. 285.15 s [vector] +++ OK, passed 100 tests.
  12657. 285.15 s [vector] iscanr: OK (0.01s)
  12658. 285.16 s [vector] +++ OK, passed 100 tests.
  12659. 285.16 s [vector] iscanr': OK (0.01s)
  12660. 285.16 s [vector] +++ OK, passed 100 tests.
  12661. 285.17 s [vector] mut_read: OK
  12662. 285.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12663. 285.17 s [vector] mut_write: OK
  12664. 285.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12665. 285.17 s [vector] mut_modify: OK
  12666. 285.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12667. 285.17 s [vector] mut_generate: OK
  12668. 285.17 s [vector] +++ OK, passed 100 tests.
  12669. 285.19 s [vector] mut_generateM: OK (0.01s)
  12670. 285.19 s [vector] +++ OK, passed 100 tests.
  12671. 285.23 s [vector] mut_mapM_: OK (0.04s)
  12672. 285.23 s [vector] +++ OK, passed 100 tests.
  12673. 285.25 s [vector] mut_imapM_: OK (0.03s)
  12674. 285.25 s [vector] +++ OK, passed 100 tests.
  12675. 285.29 s [vector] mut_forM_: OK (0.03s)
  12676. 285.29 s [vector] +++ OK, passed 100 tests.
  12677. 285.33 s [vector] mut_iforM_: OK (0.03s)
  12678. 285.33 s [vector] +++ OK, passed 100 tests.
  12679. 285.33 s [vector] mut_foldr: OK (0.01s)
  12680. 285.33 s [vector] +++ OK, passed 100 tests.
  12681. 285.35 s [vector] mut_foldr': OK (0.01s)
  12682. 285.35 s [vector] +++ OK, passed 100 tests.
  12683. 285.35 s [vector] mut_foldl: OK (0.01s)
  12684. 285.35 s [vector] +++ OK, passed 100 tests.
  12685. 285.37 s [vector] mut_foldl': OK (0.01s)
  12686. 285.37 s [vector] +++ OK, passed 100 tests.
  12687. 285.37 s [vector] mut_ifoldr: OK (0.01s)
  12688. 285.37 s [vector] +++ OK, passed 100 tests.
  12689. 285.39 s [vector] mut_ifoldr': OK (0.01s)
  12690. 285.39 s [vector] +++ OK, passed 100 tests.
  12691. 285.40 s [vector] mut_ifoldl: OK (0.01s)
  12692. 285.41 s [vector] +++ OK, passed 100 tests.
  12693. 285.42 s [vector] mut_ifoldl': OK (0.01s)
  12694. 285.42 s [vector] +++ OK, passed 100 tests.
  12695. 285.43 s [vector] mut_foldM: OK (0.01s)
  12696. 285.43 s [vector] +++ OK, passed 100 tests.
  12697. 285.45 s [vector] mut_foldM': OK (0.01s)
  12698. 285.45 s [vector] +++ OK, passed 100 tests.
  12699. 285.45 s [vector] mut_foldrM: OK
  12700. 285.45 s [vector] +++ OK, passed 100 tests.
  12701. 285.45 s [vector] mut_foldrM': OK (0.01s)
  12702. 285.45 s [vector] +++ OK, passed 100 tests.
  12703. 285.47 s [vector] mut_ifoldM: OK (0.01s)
  12704. 285.47 s [vector] +++ OK, passed 100 tests.
  12705. 285.47 s [vector] mut_ifoldM': OK (0.01s)
  12706. 285.48 s [vector] +++ OK, passed 100 tests.
  12707. 285.48 s [vector] mut_ifoldrM: OK (0.01s)
  12708. 285.48 s [vector] +++ OK, passed 100 tests.
  12709. 285.50 s [vector] mut_ifoldrM': OK
  12710. 285.50 s [vector] +++ OK, passed 100 tests.
  12711. 285.50 s [vector] compare: OK
  12712. 285.50 s [vector] +++ OK, passed 100 tests.
  12713. 285.50 s [vector] maximum: OK
  12714. 285.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12715. 285.50 s [vector] minimum: OK
  12716. 285.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12717. 285.50 s [vector] minIndex: OK
  12718. 285.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12719. 285.50 s [vector] maxIndex: OK
  12720. 285.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12721. 285.50 s [vector] maximumBy: OK
  12722. 285.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12723. 285.50 s [vector] minimumBy: OK
  12724. 285.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12725. 285.50 s [vector] maximumOn: OK
  12726. 285.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12727. 285.50 s [vector] minimumOn: OK
  12728. 285.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12729. 285.51 s [vector] maxIndexBy: OK
  12730. 285.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12731. 285.51 s [vector] minIndexBy: OK
  12732. 285.51 s [vector] +++ OK, passed 100 tests; 26 discarded.
  12733. 285.51 s [vector] ListFirstMaxIndexWins: OK
  12734. 285.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12735. 285.51 s [vector] FalseListFirstMaxIndexWins: OK
  12736. 285.51 s [vector] +++ OK, failed as expected. (after 1 test):
  12737. 285.51 s [vector] Exception:
  12738. 285.51 s [vector] Prelude.foldr1: empty list
  12739. 285.51 s [vector] CallStack (from HasCallStack):
  12740. 285.51 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12741. 285.51 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12742. 285.51 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12743. 285.51 s [vector] []
  12744. 285.51 s [vector] zip: OK
  12745. 285.51 s [vector] +++ OK, passed 100 tests.
  12746. 285.51 s [vector] zip3: OK
  12747. 285.51 s [vector] +++ OK, passed 100 tests.
  12748. 285.51 s [vector] unzip: OK
  12749. 285.51 s [vector] +++ OK, passed 100 tests.
  12750. 285.51 s [vector] unzip3: OK
  12751. 285.51 s [vector] +++ OK, passed 100 tests.
  12752. 285.52 s [vector] indexed: OK
  12753. 285.52 s [vector] +++ OK, passed 100 tests.
  12754. 285.52 s [vector] update: OK
  12755. 285.52 s [vector] +++ OK, passed 100 tests.
  12756. 285.52 s [vector] mempty: OK
  12757. 285.52 s [vector] +++ OK, passed 100 tests.
  12758. 285.52 s [vector] mappend: OK
  12759. 285.53 s [vector] +++ OK, passed 100 tests.
  12760. 285.54 s [vector] mconcat: OK (0.02s)
  12761. 285.54 s [vector] +++ OK, passed 100 tests.
  12762. 285.54 s [vector] glength: OK
  12763. 285.54 s [vector] +++ OK, passed 100 tests.
  12764. 285.54 s [vector] sum: OK
  12765. 285.54 s [vector] +++ OK, passed 100 tests.
  12766. 285.54 s [vector] product: OK
  12767. 285.54 s [vector] +++ OK, passed 100 tests.
  12768. 285.54 s [vector] enumFromN: OK
  12769. 285.54 s [vector] +++ OK, passed 100 tests.
  12770. 285.55 s [vector] enumFromThenN: OK
  12771. 285.55 s [vector] +++ OK, passed 100 tests.
  12772. 285.55 s [vector] enumFromTo: OK
  12773. 285.55 s [vector] +++ OK, passed 100 tests.
  12774. 285.55 s [vector] enumFromThenTo: OK
  12775. 285.55 s [vector] +++ OK, passed 100 tests; 6 discarded.
  12776. 285.55 s [vector] (Int,Bool)
  12777. 285.55 s [vector] fromList.toList == id: OK
  12778. 285.55 s [vector] +++ OK, passed 100 tests.
  12779. 285.55 s [vector] toList.fromList == id: OK
  12780. 285.55 s [vector] +++ OK, passed 100 tests.
  12781. 285.55 s [vector] unstream.stream == id: OK
  12782. 285.55 s [vector] +++ OK, passed 100 tests.
  12783. 285.55 s [vector] stream.unstream == id: OK
  12784. 285.55 s [vector] +++ OK, passed 100 tests.
  12785. 285.55 s [vector] eq: OK
  12786. 285.55 s [vector] +++ OK, passed 100 tests.
  12787. 285.55 s [vector] length: OK
  12788. 285.55 s [vector] +++ OK, passed 100 tests.
  12789. 285.55 s [vector] null: OK
  12790. 285.55 s [vector] +++ OK, passed 100 tests.
  12791. 285.55 s [vector] index: OK
  12792. 285.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12793. 285.55 s [vector] safeIndex: OK
  12794. 285.55 s [vector] +++ OK, passed 100 tests.
  12795. 285.55 s [vector] head: OK
  12796. 285.55 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12797. 285.55 s [vector] last: OK
  12798. 285.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12799. 285.56 s [vector] unsafeIndex: OK
  12800. 285.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12801. 285.56 s [vector] unsafeHead: OK
  12802. 285.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12803. 285.56 s [vector] unsafeLast: OK
  12804. 285.56 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12805. 285.56 s [vector] slice: OK
  12806. 285.56 s [vector] +++ OK, passed 100 tests.
  12807. 285.56 s [vector] init: OK
  12808. 285.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12809. 285.56 s [vector] tail: OK
  12810. 285.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12811. 285.56 s [vector] take: OK
  12812. 285.56 s [vector] +++ OK, passed 100 tests.
  12813. 285.56 s [vector] drop: OK
  12814. 285.56 s [vector] +++ OK, passed 100 tests.
  12815. 285.56 s [vector] splitAt: OK
  12816. 285.56 s [vector] +++ OK, passed 100 tests.
  12817. 285.56 s [vector] empty: OK
  12818. 285.56 s [vector] +++ OK, passed 100 tests.
  12819. 285.57 s [vector] singleton: OK
  12820. 285.57 s [vector] +++ OK, passed 100 tests.
  12821. 285.57 s [vector] replicate: OK
  12822. 285.57 s [vector] +++ OK, passed 100 tests.
  12823. 285.57 s [vector] generate: OK
  12824. 285.57 s [vector] +++ OK, passed 100 tests.
  12825. 285.57 s [vector] iterateN: OK
  12826. 285.57 s [vector] +++ OK, passed 100 tests.
  12827. 285.58 s [vector] iterateNM: OK
  12828. 285.58 s [vector] +++ OK, passed 100 tests.
  12829. 285.59 s [vector] generateM: OK (0.01s)
  12830. 285.59 s [vector] +++ OK, passed 100 tests.
  12831. 285.61 s [vector] replicateM: OK
  12832. 285.61 s [vector] +++ OK, passed 100 tests.
  12833. 285.61 s [vector] create: OK
  12834. 285.61 s [vector] +++ OK, passed 100 tests.
  12835. 285.61 s [vector] createT: OK
  12836. 285.61 s [vector] +++ OK, passed 100 tests.
  12837. 285.61 s [vector] unfoldr: OK
  12838. 285.61 s [vector] +++ OK, passed 100 tests.
  12839. 285.61 s [vector] unfoldrN: OK
  12840. 285.61 s [vector] +++ OK, passed 100 tests.
  12841. 285.62 s [vector] unfoldrExactN: OK
  12842. 285.62 s [vector] +++ OK, passed 100 tests.
  12843. 285.63 s [vector] unfoldrM: OK
  12844. 285.63 s [vector] +++ OK, passed 100 tests.
  12845. 285.63 s [vector] unfoldrNM: OK
  12846. 285.63 s [vector] +++ OK, passed 100 tests.
  12847. 285.65 s [vector] unfoldrExactNM: OK (0.02s)
  12848. 285.65 s [vector] +++ OK, passed 100 tests.
  12849. 285.65 s [vector] constructN: OK
  12850. 285.65 s [vector] +++ OK, passed 100 tests.
  12851. 285.66 s [vector] constructrN: OK
  12852. 285.66 s [vector] +++ OK, passed 100 tests.
  12853. 285.66 s [vector] cons: OK
  12854. 285.66 s [vector] +++ OK, passed 100 tests.
  12855. 285.66 s [vector] snoc: OK
  12856. 285.66 s [vector] +++ OK, passed 100 tests.
  12857. 285.66 s [vector] append: OK
  12858. 285.67 s [vector] +++ OK, passed 100 tests.
  12859. 285.70 s [vector] concat: OK (0.03s)
  12860. 285.70 s [vector] +++ OK, passed 100 tests.
  12861. 285.70 s [vector] force: OK
  12862. 285.70 s [vector] +++ OK, passed 100 tests.
  12863. 285.70 s [vector] upd: OK
  12864. 285.70 s [vector] +++ OK, passed 100 tests.
  12865. 285.70 s [vector] accum: OK
  12866. 285.71 s [vector] +++ OK, passed 100 tests.
  12867. 285.71 s [vector] reverse: OK
  12868. 285.71 s [vector] +++ OK, passed 100 tests.
  12869. 285.71 s [vector] backpermute: OK
  12870. 285.71 s [vector] +++ OK, passed 100 tests.
  12871. 285.71 s [vector] map: OK
  12872. 285.71 s [vector] +++ OK, passed 100 tests.
  12873. 285.72 s [vector] imap: OK
  12874. 285.72 s [vector] +++ OK, passed 100 tests.
  12875. 285.73 s [vector] concatMap: OK
  12876. 285.73 s [vector] +++ OK, passed 100 tests.
  12877. 285.73 s [vector] mapM: OK
  12878. 285.73 s [vector] +++ OK, passed 100 tests.
  12879. 285.75 s [vector] mapM_: OK (0.02s)
  12880. 285.75 s [vector] +++ OK, passed 100 tests.
  12881. 285.75 s [vector] forM: OK
  12882. 285.75 s [vector] +++ OK, passed 100 tests.
  12883. 285.78 s [vector] forM_: OK (0.02s)
  12884. 285.78 s [vector] +++ OK, passed 100 tests.
  12885. 285.78 s [vector] imapM: OK
  12886. 285.78 s [vector] +++ OK, passed 100 tests.
  12887. 285.80 s [vector] imapM_: OK
  12888. 285.80 s [vector] +++ OK, passed 100 tests.
  12889. 285.80 s [vector] zipWith: OK
  12890. 285.80 s [vector] +++ OK, passed 100 tests.
  12891. 285.81 s [vector] zipWith3: OK
  12892. 285.81 s [vector] +++ OK, passed 100 tests.
  12893. 285.81 s [vector] izipWith: OK
  12894. 285.81 s [vector] +++ OK, passed 100 tests.
  12895. 285.82 s [vector] izipWith3: OK
  12896. 285.82 s [vector] +++ OK, passed 100 tests.
  12897. 285.82 s [vector] izipWithM: OK
  12898. 285.83 s [vector] +++ OK, passed 100 tests.
  12899. 285.84 s [vector] izipWithM_: OK (0.02s)
  12900. 285.84 s [vector] +++ OK, passed 100 tests.
  12901. 285.84 s [vector] zipWithM: OK
  12902. 285.85 s [vector] +++ OK, passed 100 tests.
  12903. 285.86 s [vector] zipWithM_: OK (0.02s)
  12904. 285.86 s [vector] +++ OK, passed 100 tests.
  12905. 285.86 s [vector] filter: OK
  12906. 285.86 s [vector] +++ OK, passed 100 tests.
  12907. 285.87 s [vector] ifilter: OK
  12908. 285.87 s [vector] +++ OK, passed 100 tests.
  12909. 285.89 s [vector] filterM: OK (0.03s)
  12910. 285.89 s [vector] +++ OK, passed 100 tests.
  12911. 285.90 s [vector] uniq: OK
  12912. 285.90 s [vector] +++ OK, passed 100 tests.
  12913. 285.90 s [vector] mapMaybe: OK
  12914. 285.90 s [vector] +++ OK, passed 100 tests.
  12915. 285.90 s [vector] imapMaybe: OK
  12916. 285.90 s [vector] +++ OK, passed 100 tests.
  12917. 285.90 s [vector] takeWhile: OK
  12918. 285.90 s [vector] +++ OK, passed 100 tests.
  12919. 285.91 s [vector] dropWhile: OK
  12920. 285.91 s [vector] +++ OK, passed 100 tests.
  12921. 285.91 s [vector] partition: OK
  12922. 285.91 s [vector] +++ OK, passed 100 tests.
  12923. 285.91 s [vector] partitionWith: OK
  12924. 285.91 s [vector] +++ OK, passed 100 tests.
  12925. 285.91 s [vector] span: OK
  12926. 285.91 s [vector] +++ OK, passed 100 tests.
  12927. 285.91 s [vector] break: OK
  12928. 285.91 s [vector] +++ OK, passed 100 tests.
  12929. 285.91 s [vector] spanR: OK
  12930. 285.92 s [vector] +++ OK, passed 100 tests.
  12931. 285.92 s [vector] breakR: OK
  12932. 285.92 s [vector] +++ OK, passed 100 tests.
  12933. 285.92 s [vector] groupBy: OK
  12934. 285.92 s [vector] +++ OK, passed 100 tests.
  12935. 285.92 s [vector] elem: OK
  12936. 285.92 s [vector] +++ OK, passed 100 tests.
  12937. 285.92 s [vector] notElem: OK
  12938. 285.92 s [vector] +++ OK, passed 100 tests.
  12939. 285.92 s [vector] find: OK
  12940. 285.92 s [vector] +++ OK, passed 100 tests.
  12941. 285.93 s [vector] findIndex: OK
  12942. 285.93 s [vector] +++ OK, passed 100 tests.
  12943. 285.93 s [vector] findIndexR: OK
  12944. 285.93 s [vector] +++ OK, passed 100 tests.
  12945. 285.93 s [vector] findIndices: OK
  12946. 285.93 s [vector] +++ OK, passed 100 tests.
  12947. 285.93 s [vector] elemIndex: OK
  12948. 285.93 s [vector] +++ OK, passed 100 tests.
  12949. 285.93 s [vector] elemIndices: OK
  12950. 285.93 s [vector] +++ OK, passed 100 tests.
  12951. 285.93 s [vector] foldl: OK
  12952. 285.93 s [vector] +++ OK, passed 100 tests.
  12953. 285.94 s [vector] foldl1: OK
  12954. 285.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12955. 285.94 s [vector] foldl': OK
  12956. 285.94 s [vector] +++ OK, passed 100 tests.
  12957. 285.94 s [vector] foldl1': OK
  12958. 285.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12959. 285.95 s [vector] foldr: OK
  12960. 285.95 s [vector] +++ OK, passed 100 tests.
  12961. 285.95 s [vector] foldr1: OK
  12962. 285.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12963. 285.95 s [vector] foldr': OK
  12964. 285.96 s [vector] +++ OK, passed 100 tests.
  12965. 285.97 s [vector] foldr1': OK
  12966. 285.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12967. 285.97 s [vector] ifoldl: OK
  12968. 285.97 s [vector] +++ OK, passed 100 tests.
  12969. 285.97 s [vector] ifoldl': OK
  12970. 285.97 s [vector] +++ OK, passed 100 tests.
  12971. 285.97 s [vector] ifoldr: OK
  12972. 285.97 s [vector] +++ OK, passed 100 tests.
  12973. 285.98 s [vector] ifoldr': OK
  12974. 285.98 s [vector] +++ OK, passed 100 tests.
  12975. 285.99 s [vector] ifoldM: OK
  12976. 285.99 s [vector] +++ OK, passed 100 tests.
  12977. 285.99 s [vector] ifoldM': OK
  12978. 285.99 s [vector] +++ OK, passed 100 tests.
  12979. 286.01 s [vector] ifoldM_: OK (0.02s)
  12980. 286.01 s [vector] +++ OK, passed 100 tests.
  12981. 286.03 s [vector] ifoldM'_: OK (0.02s)
  12982. 286.03 s [vector] +++ OK, passed 100 tests.
  12983. 286.03 s [vector] all: OK
  12984. 286.03 s [vector] +++ OK, passed 100 tests.
  12985. 286.04 s [vector] any: OK
  12986. 286.04 s [vector] +++ OK, passed 100 tests.
  12987. 286.04 s [vector] prescanl: OK
  12988. 286.04 s [vector] +++ OK, passed 100 tests.
  12989. 286.05 s [vector] prescanl': OK
  12990. 286.05 s [vector] +++ OK, passed 100 tests.
  12991. 286.05 s [vector] postscanl: OK
  12992. 286.05 s [vector] +++ OK, passed 100 tests.
  12993. 286.05 s [vector] postscanl': OK
  12994. 286.05 s [vector] +++ OK, passed 100 tests.
  12995. 286.06 s [vector] scanl: OK
  12996. 286.06 s [vector] +++ OK, passed 100 tests.
  12997. 286.06 s [vector] scanl': OK
  12998. 286.06 s [vector] +++ OK, passed 100 tests.
  12999. 286.07 s [vector] scanl1: OK
  13000. 286.07 s [vector] +++ OK, passed 100 tests.
  13001. 286.07 s [vector] scanl1': OK
  13002. 286.07 s [vector] +++ OK, passed 100 tests.
  13003. 286.08 s [vector] iscanl: OK
  13004. 286.08 s [vector] +++ OK, passed 100 tests.
  13005. 286.08 s [vector] iscanl': OK
  13006. 286.08 s [vector] +++ OK, passed 100 tests.
  13007. 286.08 s [vector] prescanr: OK
  13008. 286.08 s [vector] +++ OK, passed 100 tests.
  13009. 286.09 s [vector] prescanr': OK
  13010. 286.09 s [vector] +++ OK, passed 100 tests.
  13011. 286.09 s [vector] postscanr: OK
  13012. 286.57 s [vector] +++ OK, passed 100 tests.
  13013. 286.57 s [vector] postscanr': OK
  13014. 286.57 s [vector] +++ OK, passed 100 tests.
  13015. 286.57 s [vector] scanr: OK
  13016. 286.57 s [vector] +++ OK, passed 100 tests.
  13017. 286.57 s [vector] scanr': OK
  13018. 286.57 s [vector] +++ OK, passed 100 tests.
  13019. 286.57 s [vector] scanr1: OK
  13020. 286.57 s [vector] +++ OK, passed 100 tests.
  13021. 286.57 s [vector] scanr1': OK
  13022. 286.57 s [vector] +++ OK, passed 100 tests.
  13023. 286.57 s [vector] iscanr: OK
  13024. 286.57 s [vector] +++ OK, passed 100 tests.
  13025. 286.57 s [vector] iscanr': OK
  13026. 286.57 s [vector] +++ OK, passed 100 tests.
  13027. 286.57 s [vector] mut_read: OK
  13028. 286.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13029. 286.57 s [vector] mut_write: OK
  13030. 286.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13031. 286.57 s [vector] mut_modify: OK
  13032. 286.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13033. 286.57 s [vector] mut_generate: OK
  13034. 286.57 s [vector] +++ OK, passed 100 tests.
  13035. 286.57 s [vector] mut_generateM: OK (0.02s)
  13036. 286.57 s [vector] +++ OK, passed 100 tests.
  13037. 286.57 s [vector] mut_mapM_: OK (0.02s)
  13038. 286.57 s [vector] +++ OK, passed 100 tests.
  13039. 286.57 s [vector] mut_imapM_: OK (0.02s)
  13040. 286.57 s [vector] +++ OK, passed 100 tests.
  13041. 286.57 s [vector] mut_forM_: OK (0.01s)
  13042. 286.57 s [vector] +++ OK, passed 100 tests.
  13043. 286.57 s [vector] mut_iforM_: OK (0.02s)
  13044. 286.57 s [vector] +++ OK, passed 100 tests.
  13045. 286.57 s [vector] mut_foldr: OK
  13046. 286.57 s [vector] +++ OK, passed 100 tests.
  13047. 286.57 s [vector] mut_foldr': OK
  13048. 286.57 s [vector] +++ OK, passed 100 tests.
  13049. 286.57 s [vector] mut_foldl: OK
  13050. 286.57 s [vector] +++ OK, passed 100 tests.
  13051. 286.57 s [vector] mut_foldl': OK
  13052. 286.57 s [vector] +++ OK, passed 100 tests.
  13053. 286.57 s [vector] mut_ifoldr: OK
  13054. 286.57 s [vector] +++ OK, passed 100 tests.
  13055. 286.57 s [vector] mut_ifoldr': OK
  13056. 286.57 s [vector] +++ OK, passed 100 tests.
  13057. 286.57 s [vector] mut_ifoldl: OK
  13058. 286.57 s [vector] +++ OK, passed 100 tests.
  13059. 286.57 s [vector] mut_ifoldl': OK
  13060. 286.57 s [vector] +++ OK, passed 100 tests.
  13061. 286.57 s [vector] mut_foldM: OK
  13062. 286.57 s [vector] +++ OK, passed 100 tests.
  13063. 286.57 s [vector] mut_foldM': OK
  13064. 286.57 s [vector] +++ OK, passed 100 tests.
  13065. 286.57 s [vector] mut_foldrM: OK
  13066. 286.57 s [vector] +++ OK, passed 100 tests.
  13067. 286.57 s [vector] mut_foldrM': OK
  13068. 286.57 s [vector] +++ OK, passed 100 tests.
  13069. 286.57 s [vector] mut_ifoldM: OK
  13070. 286.57 s [vector] +++ OK, passed 100 tests.
  13071. 286.57 s [vector] mut_ifoldM': OK
  13072. 286.57 s [vector] +++ OK, passed 100 tests.
  13073. 286.57 s [vector] mut_ifoldrM: OK
  13074. 286.57 s [vector] +++ OK, passed 100 tests.
  13075. 286.57 s [vector] mut_ifoldrM': OK
  13076. 286.57 s [vector] +++ OK, passed 100 tests.
  13077. 286.57 s [vector] compare: OK
  13078. 286.57 s [vector] +++ OK, passed 100 tests.
  13079. 286.57 s [vector] maximum: OK
  13080. 286.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13081. 286.57 s [vector] minimum: OK
  13082. 286.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13083. 286.57 s [vector] minIndex: OK
  13084. 286.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13085. 286.57 s [vector] maxIndex: OK
  13086. 286.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13087. 286.57 s [vector] maximumBy: OK
  13088. 286.57 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13089. 286.57 s [vector] minimumBy: OK
  13090. 286.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13091. 286.57 s [vector] maximumOn: OK
  13092. 286.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13093. 286.57 s [vector] minimumOn: OK
  13094. 286.57 s [vector] +++ OK, passed 100 tests; 24 discarded.
  13095. 286.57 s [vector] maxIndexBy: OK
  13096. 286.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13097. 286.57 s [vector] minIndexBy: OK
  13098. 286.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13099. 286.57 s [vector] ListFirstMaxIndexWins: OK
  13100. 286.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13101. 286.57 s [vector] FalseListFirstMaxIndexWins: OK
  13102. 286.57 s [vector] +++ OK, failed as expected. (after 1 test):
  13103. 286.57 s [vector] Exception:
  13104. 286.57 s [vector] Prelude.foldr1: empty list
  13105. 286.57 s [vector] CallStack (from HasCallStack):
  13106. 286.57 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13107. 286.57 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13108. 286.57 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13109. 286.57 s [vector] []
  13110. 286.57 s [vector] zip: OK
  13111. 286.57 s [vector] +++ OK, passed 100 tests.
  13112. 286.57 s [vector] zip3: OK
  13113. 286.57 s [vector] +++ OK, passed 100 tests.
  13114. 286.57 s [vector] unzip: OK
  13115. 286.57 s [vector] +++ OK, passed 100 tests.
  13116. 286.57 s [vector] unzip3: OK
  13117. 286.57 s [vector] +++ OK, passed 100 tests.
  13118. 286.57 s [vector] indexed: OK
  13119. 286.57 s [vector] +++ OK, passed 100 tests.
  13120. 286.57 s [vector] update: OK
  13121. 286.57 s [vector] +++ OK, passed 100 tests.
  13122. 286.57 s [vector] mempty: OK
  13123. 286.57 s [vector] +++ OK, passed 100 tests.
  13124. 286.57 s [vector] mappend: OK
  13125. 286.57 s [vector] +++ OK, passed 100 tests.
  13126. 286.57 s [vector] mconcat: OK (0.03s)
  13127. 286.57 s [vector] +++ OK, passed 100 tests.
  13128. 286.57 s [vector] glength: OK
  13129. 286.57 s [vector] +++ OK, passed 100 tests.
  13130. 286.57 s [vector] (Int,Bool,Int)
  13131. 286.57 s [vector] fromList.toList == id: OK
  13132. 286.57 s [vector] +++ OK, passed 100 tests.
  13133. 286.57 s [vector] toList.fromList == id: OK
  13134. 286.57 s [vector] +++ OK, passed 100 tests.
  13135. 286.57 s [vector] unstream.stream == id: OK
  13136. 286.57 s [vector] +++ OK, passed 100 tests.
  13137. 286.57 s [vector] stream.unstream == id: OK
  13138. 286.57 s [vector] +++ OK, passed 100 tests.
  13139. 286.57 s [vector] eq: OK
  13140. 286.57 s [vector] +++ OK, passed 100 tests.
  13141. 286.57 s [vector] length: OK
  13142. 286.57 s [vector] +++ OK, passed 100 tests.
  13143. 286.57 s [vector] null: OK
  13144. 286.57 s [vector] +++ OK, passed 100 tests.
  13145. 286.57 s [vector] index: OK
  13146. 286.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13147. 286.57 s [vector] safeIndex: OK
  13148. 286.57 s [vector] +++ OK, passed 100 tests.
  13149. 286.57 s [vector] head: OK
  13150. 286.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13151. 286.57 s [vector] last: OK
  13152. 286.57 s [vector] +++ OK, passed 100 tests; 23 discarded.
  13153. 286.57 s [vector] unsafeIndex: OK
  13154. 286.57 s [vector] +++ OK, passed 100 tests; 23 discarded.
  13155. 286.57 s [vector] unsafeHead: OK
  13156. 286.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13157. 286.57 s [vector] unsafeLast: OK
  13158. 286.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13159. 286.57 s [vector] slice: OK
  13160. 286.57 s [vector] +++ OK, passed 100 tests.
  13161. 286.57 s [vector] init: OK
  13162. 286.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13163. 286.57 s [vector] tail: OK
  13164. 286.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13165. 286.57 s [vector] take: OK
  13166. 286.57 s [vector] +++ OK, passed 100 tests.
  13167. 286.57 s [vector] drop: OK
  13168. 286.57 s [vector] +++ OK, passed 100 tests.
  13169. 286.57 s [vector] splitAt: OK
  13170. 286.57 s [vector] +++ OK, passed 100 tests.
  13171. 286.57 s [vector] empty: OK
  13172. 286.57 s [vector] +++ OK, passed 100 tests.
  13173. 286.57 s [vector] singleton: OK
  13174. 286.57 s [vector] +++ OK, passed 100 tests.
  13175. 286.57 s [vector] replicate: OK
  13176. 286.57 s [vector] +++ OK, passed 100 tests.
  13177. 286.57 s [vector] generate: OK
  13178. 286.57 s [vector] +++ OK, passed 100 tests.
  13179. 286.57 s [vector] iterateN: OK
  13180. 286.57 s [vector] +++ OK, passed 100 tests.
  13181. 286.57 s [vector] iterateNM: OK (0.02s)
  13182. 286.57 s [vector] +++ OK, passed 100 tests.
  13183. 286.57 s [vector] generateM: OK
  13184. 286.57 s [vector] +++ OK, passed 100 tests.
  13185. 286.57 s [vector] replicateM: OK
  13186. 286.57 s [vector] +++ OK, passed 100 tests.
  13187. 286.57 s [vector] create: OK
  13188. 286.57 s [vector] +++ OK, passed 100 tests.
  13189. 286.57 s [vector] createT: OK
  13190. 286.57 s [vector] +++ OK, passed 100 tests.
  13191. 286.57 s [vector] unfoldr: OK
  13192. 286.57 s [vector] +++ OK, passed 100 tests.
  13193. 286.57 s [vector] unfoldrN: OK
  13194. 286.57 s [vector] +++ OK, passed 100 tests.
  13195. 286.57 s [vector] unfoldrExactN: OK
  13196. 286.57 s [vector] +++ OK, passed 100 tests.
  13197. 286.57 s [vector] unfoldrM: OK
  13198. 286.57 s [vector] +++ OK, passed 100 tests.
  13199. 286.58 s [vector] unfoldrNM: OK
  13200. 286.58 s [vector] +++ OK, passed 100 tests.
  13201. 286.58 s [vector] unfoldrExactNM: OK
  13202. 286.58 s [vector] +++ OK, passed 100 tests.
  13203. 286.58 s [vector] constructN: OK
  13204. 286.58 s [vector] +++ OK, passed 100 tests.
  13205. 286.58 s [vector] constructrN: OK
  13206. 286.58 s [vector] +++ OK, passed 100 tests.
  13207. 286.58 s [vector] cons: OK
  13208. 286.58 s [vector] +++ OK, passed 100 tests.
  13209. 286.58 s [vector] snoc: OK
  13210. 286.58 s [vector] +++ OK, passed 100 tests.
  13211. 286.58 s [vector] append: OK
  13212. 286.58 s [vector] +++ OK, passed 100 tests.
  13213. 286.58 s [vector] concat: OK (0.05s)
  13214. 286.58 s [vector] +++ OK, passed 100 tests.
  13215. 286.58 s [vector] force: OK
  13216. 286.58 s [vector] +++ OK, passed 100 tests.
  13217. 286.58 s [vector] upd: OK
  13218. 286.58 s [vector] +++ OK, passed 100 tests.
  13219. 286.58 s [vector] accum: OK
  13220. 286.58 s [vector] +++ OK, passed 100 tests.
  13221. 286.58 s [vector] reverse: OK
  13222. 286.58 s [vector] +++ OK, passed 100 tests.
  13223. 286.58 s [vector] backpermute: OK
  13224. 286.58 s [vector] +++ OK, passed 100 tests.
  13225. 286.58 s [vector] map: OK
  13226. 286.58 s [vector] +++ OK, passed 100 tests.
  13227. 286.58 s [vector] imap: OK
  13228. 286.58 s [vector] +++ OK, passed 100 tests.
  13229. 286.58 s [vector] concatMap: OK
  13230. 286.58 s [vector] +++ OK, passed 100 tests.
  13231. 286.58 s [vector] mapM: OK
  13232. 286.58 s [vector] +++ OK, passed 100 tests.
  13233. 286.60 s [vector] mapM_: OK (0.03s)
  13234. 286.61 s [vector] +++ OK, passed 100 tests.
  13235. 286.61 s [vector] forM: OK
  13236. 286.61 s [vector] +++ OK, passed 100 tests.
  13237. 286.64 s [vector] forM_: OK (0.04s)
  13238. 286.64 s [vector] +++ OK, passed 100 tests.
  13239. 286.64 s [vector] imapM: OK
  13240. 286.64 s [vector] +++ OK, passed 100 tests.
  13241. 286.69 s [vector] imapM_: OK (0.04s)
  13242. 286.69 s [vector] +++ OK, passed 100 tests.
  13243. 286.69 s [vector] zipWith: OK
  13244. 286.69 s [vector] +++ OK, passed 100 tests.
  13245. 286.70 s [vector] zipWith3: OK
  13246. 286.70 s [vector] +++ OK, passed 100 tests.
  13247. 286.70 s [vector] izipWith: OK
  13248. 286.70 s [vector] +++ OK, passed 100 tests.
  13249. 286.71 s [vector] izipWith3: OK
  13250. 286.71 s [vector] +++ OK, passed 100 tests.
  13251. 286.72 s [vector] izipWithM: OK
  13252. 286.72 s [vector] +++ OK, passed 100 tests.
  13253. 286.75 s [vector] izipWithM_: OK (0.02s)
  13254. 286.75 s [vector] +++ OK, passed 100 tests.
  13255. 286.75 s [vector] zipWithM: OK
  13256. 286.75 s [vector] +++ OK, passed 100 tests.
  13257. 286.78 s [vector] zipWithM_: OK (0.03s)
  13258. 286.78 s [vector] +++ OK, passed 100 tests.
  13259. 286.78 s [vector] filter: OK
  13260. 286.78 s [vector] +++ OK, passed 100 tests.
  13261. 286.78 s [vector] ifilter: OK
  13262. 286.79 s [vector] +++ OK, passed 100 tests.
  13263. 286.82 s [vector] filterM: OK (0.04s)
  13264. 286.83 s [vector] +++ OK, passed 100 tests.
  13265. 286.83 s [vector] uniq: OK
  13266. 286.83 s [vector] +++ OK, passed 100 tests.
  13267. 286.83 s [vector] mapMaybe: OK
  13268. 286.83 s [vector] +++ OK, passed 100 tests.
  13269. 286.83 s [vector] imapMaybe: OK
  13270. 286.83 s [vector] +++ OK, passed 100 tests.
  13271. 286.83 s [vector] takeWhile: OK
  13272. 286.83 s [vector] +++ OK, passed 100 tests.
  13273. 286.84 s [vector] dropWhile: OK
  13274. 286.84 s [vector] +++ OK, passed 100 tests.
  13275. 286.84 s [vector] partition: OK
  13276. 286.85 s [vector] +++ OK, passed 100 tests.
  13277. 286.85 s [vector] partitionWith: OK
  13278. 286.85 s [vector] +++ OK, passed 100 tests.
  13279. 286.85 s [vector] span: OK
  13280. 286.85 s [vector] +++ OK, passed 100 tests.
  13281. 286.85 s [vector] break: OK
  13282. 286.85 s [vector] +++ OK, passed 100 tests.
  13283. 286.85 s [vector] spanR: OK
  13284. 286.85 s [vector] +++ OK, passed 100 tests.
  13285. 286.85 s [vector] breakR: OK
  13286. 286.85 s [vector] +++ OK, passed 100 tests.
  13287. 286.86 s [vector] groupBy: OK
  13288. 286.86 s [vector] +++ OK, passed 100 tests.
  13289. 286.86 s [vector] elem: OK
  13290. 286.86 s [vector] +++ OK, passed 100 tests.
  13291. 286.86 s [vector] notElem: OK
  13292. 286.86 s [vector] +++ OK, passed 100 tests.
  13293. 286.86 s [vector] find: OK
  13294. 286.86 s [vector] +++ OK, passed 100 tests.
  13295. 286.86 s [vector] findIndex: OK
  13296. 286.86 s [vector] +++ OK, passed 100 tests.
  13297. 286.86 s [vector] findIndexR: OK
  13298. 286.87 s [vector] +++ OK, passed 100 tests.
  13299. 286.87 s [vector] findIndices: OK
  13300. 286.87 s [vector] +++ OK, passed 100 tests.
  13301. 286.87 s [vector] elemIndex: OK
  13302. 286.87 s [vector] +++ OK, passed 100 tests.
  13303. 286.87 s [vector] elemIndices: OK
  13304. 286.87 s [vector] +++ OK, passed 100 tests.
  13305. 286.88 s [vector] foldl: OK
  13306. 286.88 s [vector] +++ OK, passed 100 tests.
  13307. 286.88 s [vector] foldl1: OK
  13308. 286.88 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13309. 286.89 s [vector] foldl': OK
  13310. 286.89 s [vector] +++ OK, passed 100 tests.
  13311. 286.89 s [vector] foldl1': OK
  13312. 286.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13313. 286.90 s [vector] foldr: OK
  13314. 286.90 s [vector] +++ OK, passed 100 tests.
  13315. 286.90 s [vector] foldr1: OK
  13316. 286.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13317. 286.91 s [vector] foldr': OK
  13318. 286.91 s [vector] +++ OK, passed 100 tests.
  13319. 286.92 s [vector] foldr1': OK
  13320. 286.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13321. 286.92 s [vector] ifoldl: OK
  13322. 286.92 s [vector] +++ OK, passed 100 tests.
  13323. 286.92 s [vector] ifoldl': OK
  13324. 286.93 s [vector] +++ OK, passed 100 tests.
  13325. 286.93 s [vector] ifoldr: OK
  13326. 286.93 s [vector] +++ OK, passed 100 tests.
  13327. 286.94 s [vector] ifoldr': OK
  13328. 286.94 s [vector] +++ OK, passed 100 tests.
  13329. 286.94 s [vector] ifoldM: OK
  13330. 286.94 s [vector] +++ OK, passed 100 tests.
  13331. 286.95 s [vector] ifoldM': OK
  13332. 286.95 s [vector] +++ OK, passed 100 tests.
  13333. 286.99 s [vector] ifoldM_: OK (0.04s)
  13334. 286.99 s [vector] +++ OK, passed 100 tests.
  13335. 287.02 s [vector] ifoldM'_: OK (0.04s)
  13336. 287.02 s [vector] +++ OK, passed 100 tests.
  13337. 287.02 s [vector] all: OK
  13338. 287.02 s [vector] +++ OK, passed 100 tests.
  13339. 287.02 s [vector] any: OK
  13340. 287.03 s [vector] +++ OK, passed 100 tests.
  13341. 287.03 s [vector] prescanl: OK
  13342. 287.03 s [vector] +++ OK, passed 100 tests.
  13343. 287.04 s [vector] prescanl': OK
  13344. 287.04 s [vector] +++ OK, passed 100 tests.
  13345. 287.05 s [vector] postscanl: OK (0.01s)
  13346. 287.05 s [vector] +++ OK, passed 100 tests.
  13347. 287.05 s [vector] postscanl': OK
  13348. 287.05 s [vector] +++ OK, passed 100 tests.
  13349. 287.06 s [vector] scanl: OK
  13350. 287.06 s [vector] +++ OK, passed 100 tests.
  13351. 287.07 s [vector] scanl': OK
  13352. 287.07 s [vector] +++ OK, passed 100 tests.
  13353. 287.07 s [vector] scanl1: OK
  13354. 287.07 s [vector] +++ OK, passed 100 tests.
  13355. 287.08 s [vector] scanl1': OK
  13356. 287.09 s [vector] +++ OK, passed 100 tests.
  13357. 287.09 s [vector] iscanl: OK
  13358. 287.09 s [vector] +++ OK, passed 100 tests.
  13359. 287.09 s [vector] iscanl': OK
  13360. 287.09 s [vector] +++ OK, passed 100 tests.
  13361. 287.09 s [vector] prescanr: OK
  13362. 287.10 s [vector] +++ OK, passed 100 tests.
  13363. 287.10 s [vector] prescanr': OK
  13364. 287.10 s [vector] +++ OK, passed 100 tests.
  13365. 287.11 s [vector] postscanr: OK
  13366. 287.11 s [vector] +++ OK, passed 100 tests.
  13367. 287.11 s [vector] postscanr': OK
  13368. 287.11 s [vector] +++ OK, passed 100 tests.
  13369. 287.12 s [vector] scanr: OK
  13370. 287.13 s [vector] +++ OK, passed 100 tests.
  13371. 287.13 s [vector] scanr': OK
  13372. 287.13 s [vector] +++ OK, passed 100 tests.
  13373. 287.13 s [vector] scanr1: OK
  13374. 287.13 s [vector] +++ OK, passed 100 tests.
  13375. 287.14 s [vector] scanr1': OK
  13376. 287.15 s [vector] +++ OK, passed 100 tests.
  13377. 287.15 s [vector] iscanr: OK
  13378. 287.15 s [vector] +++ OK, passed 100 tests.
  13379. 287.15 s [vector] iscanr': OK
  13380. 287.15 s [vector] +++ OK, passed 100 tests.
  13381. 287.15 s [vector] mut_read: OK
  13382. 287.15 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13383. 287.15 s [vector] mut_write: OK
  13384. 287.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13385. 287.15 s [vector] mut_modify: OK
  13386. 287.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13387. 287.16 s [vector] mut_generate: OK
  13388. 287.16 s [vector] +++ OK, passed 100 tests.
  13389. 287.18 s [vector] mut_generateM: OK
  13390. 287.18 s [vector] +++ OK, passed 100 tests.
  13391. 287.21 s [vector] mut_mapM_: OK (0.03s)
  13392. 287.21 s [vector] +++ OK, passed 100 tests.
  13393. 287.25 s [vector] mut_imapM_: OK (0.04s)
  13394. 287.25 s [vector] +++ OK, passed 100 tests.
  13395. 287.29 s [vector] mut_forM_: OK (0.03s)
  13396. 287.29 s [vector] +++ OK, passed 100 tests.
  13397. 287.32 s [vector] mut_iforM_: OK (0.04s)
  13398. 287.32 s [vector] +++ OK, passed 100 tests.
  13399. 287.32 s [vector] mut_foldr: OK
  13400. 287.33 s [vector] +++ OK, passed 100 tests.
  13401. 287.33 s [vector] mut_foldr': OK
  13402. 287.33 s [vector] +++ OK, passed 100 tests.
  13403. 287.33 s [vector] mut_foldl: OK
  13404. 287.33 s [vector] +++ OK, passed 100 tests.
  13405. 287.34 s [vector] mut_foldl': OK
  13406. 287.34 s [vector] +++ OK, passed 100 tests.
  13407. 287.34 s [vector] mut_ifoldr: OK
  13408. 287.35 s [vector] +++ OK, passed 100 tests.
  13409. 287.35 s [vector] mut_ifoldr': OK
  13410. 287.35 s [vector] +++ OK, passed 100 tests.
  13411. 287.35 s [vector] mut_ifoldl: OK
  13412. 287.35 s [vector] +++ OK, passed 100 tests.
  13413. 287.36 s [vector] mut_ifoldl': OK
  13414. 287.36 s [vector] +++ OK, passed 100 tests.
  13415. 287.37 s [vector] mut_foldM: OK
  13416. 287.37 s [vector] +++ OK, passed 100 tests.
  13417. 287.37 s [vector] mut_foldM': OK
  13418. 287.37 s [vector] +++ OK, passed 100 tests.
  13419. 287.38 s [vector] mut_foldrM: OK
  13420. 287.38 s [vector] +++ OK, passed 100 tests.
  13421. 287.38 s [vector] mut_foldrM': OK
  13422. 287.38 s [vector] +++ OK, passed 100 tests.
  13423. 287.39 s [vector] mut_ifoldM: OK
  13424. 287.39 s [vector] +++ OK, passed 100 tests.
  13425. 287.39 s [vector] mut_ifoldM': OK
  13426. 287.39 s [vector] +++ OK, passed 100 tests.
  13427. 287.39 s [vector] mut_ifoldrM: OK
  13428. 287.39 s [vector] +++ OK, passed 100 tests.
  13429. 287.40 s [vector] mut_ifoldrM': OK
  13430. 287.40 s [vector] +++ OK, passed 100 tests.
  13431. 287.40 s [vector] compare: OK
  13432. 287.40 s [vector] +++ OK, passed 100 tests.
  13433. 287.40 s [vector] maximum: OK
  13434. 287.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13435. 287.40 s [vector] minimum: OK
  13436. 287.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13437. 287.40 s [vector] minIndex: OK
  13438. 287.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13439. 287.41 s [vector] maxIndex: OK
  13440. 287.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13441. 287.41 s [vector] maximumBy: OK
  13442. 287.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13443. 287.41 s [vector] minimumBy: OK
  13444. 287.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13445. 287.41 s [vector] maximumOn: OK
  13446. 287.41 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13447. 287.41 s [vector] minimumOn: OK
  13448. 287.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13449. 287.41 s [vector] maxIndexBy: OK
  13450. 287.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13451. 287.41 s [vector] minIndexBy: OK
  13452. 287.41 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13453. 287.42 s [vector] ListFirstMaxIndexWins: OK
  13454. 287.42 s [vector] +++ OK, passed 100 tests; 26 discarded.
  13455. 287.42 s [vector] FalseListFirstMaxIndexWins: OK
  13456. 287.42 s [vector] +++ OK, failed as expected. (after 1 test):
  13457. 287.42 s [vector] Exception:
  13458. 287.42 s [vector] Prelude.foldr1: empty list
  13459. 287.42 s [vector] CallStack (from HasCallStack):
  13460. 287.42 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13461. 287.42 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13462. 287.42 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13463. 287.42 s [vector] []
  13464. 287.42 s [vector] zip: OK
  13465. 287.42 s [vector] +++ OK, passed 100 tests.
  13466. 287.42 s [vector] zip3: OK
  13467. 287.43 s [vector] +++ OK, passed 100 tests.
  13468. 287.43 s [vector] unzip: OK
  13469. 287.43 s [vector] +++ OK, passed 100 tests.
  13470. 287.43 s [vector] unzip3: OK
  13471. 287.43 s [vector] +++ OK, passed 100 tests.
  13472. 287.43 s [vector] indexed: OK
  13473. 287.43 s [vector] +++ OK, passed 100 tests.
  13474. 287.43 s [vector] update: OK
  13475. 287.43 s [vector] +++ OK, passed 100 tests.
  13476. 287.43 s [vector] mempty: OK
  13477. 287.44 s [vector] +++ OK, passed 100 tests.
  13478. 287.45 s [vector] mappend: OK
  13479. 287.45 s [vector] +++ OK, passed 100 tests.
  13480. 287.48 s [vector] mconcat: OK (0.04s)
  13481. 287.48 s [vector] +++ OK, passed 100 tests.
  13482. 287.48 s [vector] glength: OK
  13483. 287.48 s [vector] +++ OK, passed 100 tests.
  13484. 287.48 s [vector] unstream
  13485. 287.48 s [vector] unstream == vunstream (exact): OK
  13486. 287.48 s [vector] +++ OK, passed 100 tests.
  13487. 287.48 s [vector] unstream == vunstream (unknown): OK
  13488. 287.48 s [vector] +++ OK, passed 100 tests.
  13489. 287.48 s [vector] unstreamR ~= vunstream (exact): OK
  13490. 287.48 s [vector] +++ OK, passed 100 tests.
  13491. 287.48 s [vector] unstreamR ~= vunstream (unknown): OK
  13492. 287.48 s [vector] +++ OK, passed 100 tests.
  13493. 287.48 s [vector] Data.Vector.Storable.Vector Alignment
  13494. 287.48 s [vector] Aligned Double: OK
  13495. 287.48 s [vector] Aligned Int: OK
  13496. 287.48 s [vector] Regression tests
  13497. 287.48 s [vector] enumFromTo crash #188
  13498. 287.48 s [vector] Word8: OK
  13499. 287.48 s [vector] Word16: OK
  13500. 287.48 s [vector] Word32: OK
  13501. 287.48 s [vector] Word64: OK
  13502. 287.48 s [vector] Word: OK
  13503. 287.48 s [vector] Int8: OK
  13504. 287.48 s [vector] Int16: OK
  13505. 287.48 s [vector] Int32: OK
  13506. 287.48 s [vector] Int64: OK
  13507. 287.48 s [vector] Int: OK
  13508. 287.48 s [vector] Char: OK
  13509. 287.48 s [vector] Negative tests
  13510. 287.48 s [vector] slice out of bounds #257
  13511. 287.48 s [vector] Boxed
  13512. 287.48 s [vector] Negative ix: OK
  13513. 287.48 s [vector] Negative size: OK
  13514. 287.48 s [vector] Negative ix and size: OK
  13515. 287.48 s [vector] Too large ix: OK
  13516. 287.48 s [vector] Too large size: OK
  13517. 287.48 s [vector] Too large ix and size: OK
  13518. 287.48 s [vector] Overflow: OK
  13519. 287.48 s [vector] OutOfMemory: OK
  13520. 287.48 s [vector] Primitive
  13521. 287.48 s [vector] Negative ix: OK
  13522. 287.48 s [vector] Negative size: OK
  13523. 287.48 s [vector] Negative ix and size: OK
  13524. 287.48 s [vector] Too large ix: OK
  13525. 287.48 s [vector] Too large size: OK
  13526. 287.48 s [vector] Too large ix and size: OK
  13527. 287.48 s [vector] Overflow: OK
  13528. 287.48 s [vector] OutOfMemory: OK
  13529. 287.48 s [vector] Storable
  13530. 287.48 s [vector] Negative ix: OK
  13531. 287.48 s [vector] Negative size: OK
  13532. 287.48 s [vector] Negative ix and size: OK
  13533. 287.48 s [vector] Too large ix: OK
  13534. 287.48 s [vector] Too large size: OK
  13535. 287.48 s [vector] Too large ix and size: OK
  13536. 287.48 s [vector] Overflow: OK
  13537. 287.48 s [vector] OutOfMemory: OK
  13538. 287.48 s [vector] Unboxed
  13539. 287.48 s [vector] Negative ix: OK
  13540. 287.48 s [vector] Negative size: OK
  13541. 287.48 s [vector] Negative ix and size: OK
  13542. 287.48 s [vector] Too large ix: OK
  13543. 287.48 s [vector] Too large size: OK
  13544. 287.48 s [vector] Too large ix and size: OK
  13545. 287.48 s [vector] Overflow: OK
  13546. 287.48 s [vector] OutOfMemory: OK
  13547. 287.48 s [vector] take #282
  13548. 287.48 s [vector] Boxed: OK
  13549. 287.48 s [vector] Primitive: OK
  13550. 287.48 s [vector] Storable: OK
  13551. 287.48 s [vector] Unboxed: OK
  13552. 287.48 s [vector] Data.Vector
  13553. 287.48 s [vector] MonadFix: OK
  13554. 287.48 s [vector] toFromArray: OK
  13555. 287.48 s [vector] toFromArraySlice: OK
  13556. 287.48 s [vector] toFromArraySliceUnsafe: OK
  13557. 287.48 s [vector] toFromMutableArray: OK
  13558. 287.48 s [vector] Data.Vector.Mutable (Move): OK
  13559. 287.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13560. 287.48 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  13561. 287.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13562. 287.49 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  13563. 287.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13564. 287.49 s [vector] Data.Vector.Storable.Mutable (Move): OK
  13565. 287.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13566. 287.49 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  13567. 287.49 s [vector] +++ OK, passed 100 tests.
  13568. 287.49 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  13569. 287.49 s [vector] +++ OK, passed 100 tests.
  13570. 287.49 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  13571. 287.49 s [vector] +++ OK, passed 100 tests.
  13572. 287.49 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  13573. 287.49 s [vector] +++ OK, passed 100 tests.
  13574. 287.49 s [vector]
  13575. 287.49 s [vector] All 2808 tests passed (11.64s)
  13576. 287.50 s [vector] Test suite vector-tests-O2: PASS
  13577. 287.50 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  13578. 287.50 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  13579. 287.51 s [vector] Phase: haddockPhase
  13580. 287.51 s [vector] Phase: installPhase
  13581. 287.57 s [vector] Installing library in /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  13582. 288.11 s [vector] Installing internal library benchmarks-O2 in /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/vector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2
  13583. 288.35 s [vector] Phase: fixupPhase
  13584. 288.37 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0
  13585. 288.38 s [vector] shrinking /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSvector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a-ghc9.10.3.so
  13586. 288.39 s [vector] shrinking /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSvector-0.13.2.0-FSl781E9b3H9AKfW1qAF2V-benchmarks-O2-ghc9.10.3.so
  13587. 288.41 s [vector] checking for references to /build/ in /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0...
  13588. 288.44 s [vector] patching script interpreter paths in /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0
  13589. 288.45 s [vector] stripping (with command strip and flags -S -p) in /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0/lib
  13590. 289.09 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0
  13591. 289.56 s [vector:post-build] Pushing 1 paths (97 are already present) using zstd to cache sellout ⏳
  13592. 289.56 s [vector:post-build]
  13593. 289.92 s [vector:post-build] Pushing /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0 (58.07 MiB)
  13594. 291.75 s [vector:post-build]
  13595. 291.75 s [vector:post-build] All done.
  13596. 291.77 s [vector:post-build] Uploading to the NixCI cache: /nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0
  13597. 291.91 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13598. 291.91 s [vector:post-build] copying 1 paths...
  13599. 291.91 s [vector:post-build] copying path '/nix/store/iiwj3raksfx8v08mxb4ax0x13hj1mbsl-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  13600. 304.64 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13601. 304.91 s [vector:post-build] copying 1 paths...
  13602. 304.91 s [vector:post-build] copying path '/nix/store/w2gq8i6jvy0bi4cr65w2d8m4sg7l6qnf-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  13603. 305.17 s Progress: 5 of 15 built, 36 of 36 downloaded from cache
  13604. 305.21 s Building /nix/store/xqd70lna4yqvx8fhh3rrk8vnfp0y8k68-nothunks-0.3.1.drv
  13605. 305.36 s [nothunks] Phase: setupCompilerEnvironmentPhase
  13606. 305.37 s [nothunks] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  13607. 305.57 s [nothunks] Phase: unpackPhase
  13608. 305.57 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  13609. 305.58 s [nothunks] source root is nothunks-0.3.1
  13610. 305.58 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  13611. 305.59 s [nothunks] Phase: patchPhase
  13612. 305.59 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  13613. 305.59 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  13614. 305.61 s [nothunks] Phase: compileBuildDriverPhase
  13615. 305.61 s [nothunks] setupCompileFlags: -package-db=/build/tmp.KPuM8YN3kS/setup-package.conf.d -threaded
  13616. 305.66 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.KPuM8YN3kS/Main.o )
  13617. 305.70 s [nothunks] [2 of 2] Linking Setup
  13618. 306.96 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  13619. 307.02 s [nothunks] Phase: configurePhase
  13620. 307.03 s [nothunks] configureFlags: --verbose --prefix=/nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.KPuM8YN3kS/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  13621. 307.03 s [nothunks] Using Parsec parser
  13622. 307.03 s [nothunks] Configuring nothunks-0.3.1...
  13623. 307.37 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  13624. 307.65 s [nothunks] Dependency base: using base-4.20.2.0
  13625. 307.65 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.2.0
  13626. 307.65 s [nothunks] Dependency containers: using containers-0.7
  13627. 307.65 s [nothunks] Dependency ghc-heap: using ghc-heap-9.10.3
  13628. 307.65 s [nothunks] Dependency stm: using stm-2.5.3.1
  13629. 307.65 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.3
  13630. 307.65 s [nothunks] Dependency time: using time-1.12.2
  13631. 307.65 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  13632. 307.65 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  13633. 307.65 s [nothunks] Dependency base: using base-4.20.2.0
  13634. 307.65 s [nothunks] Dependency containers: using containers-0.7
  13635. 307.65 s [nothunks] Dependency ghc-prim: using ghc-prim-0.12.0
  13636. 307.65 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  13637. 307.65 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  13638. 307.65 s [nothunks] Dependency random: using random-1.2.1.3
  13639. 307.65 s [nothunks] Dependency stm: using stm-2.5.3.1
  13640. 307.65 s [nothunks] Dependency tasty: using tasty-1.5.3
  13641. 307.65 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  13642. 307.65 s [nothunks] Source component graph:
  13643. 307.65 s [nothunks] component lib
  13644. 307.65 s [nothunks] component test:nothunks-test dependency lib
  13645. 307.65 s [nothunks] Configured component graph:
  13646. 307.65 s [nothunks] component nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  13647. 307.65 s [nothunks] include base-4.20.2.0-64da
  13648. 307.65 s [nothunks] include bytestring-0.12.2.0-262e
  13649. 307.65 s [nothunks] include containers-0.7-504a
  13650. 307.65 s [nothunks] include ghc-heap-9.10.3-7805
  13651. 307.65 s [nothunks] include stm-2.5.3.1-a2f3
  13652. 307.65 s [nothunks] include text-2.1.3-c691
  13653. 307.65 s [nothunks] include time-1.12.2-652a
  13654. 307.65 s [nothunks] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  13655. 307.65 s [nothunks] include wherefrom-compat-0.1.1.1-yp5RypMYSz1KLSyhMA9Ta
  13656. 307.65 s [nothunks] component nothunks-0.3.1-9PLORH1jEHICdQFPMi70o3-nothunks-test
  13657. 307.65 s [nothunks] include base-4.20.2.0-64da
  13658. 307.65 s [nothunks] include containers-0.7-504a
  13659. 307.65 s [nothunks] include ghc-prim-0.12.0-1d7d
  13660. 307.65 s [nothunks] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  13661. 307.65 s [nothunks] include nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  13662. 307.65 s [nothunks] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  13663. 307.65 s [nothunks] include stm-2.5.3.1-a2f3
  13664. 307.65 s [nothunks] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  13665. 307.65 s [nothunks] include tasty-hedgehog-1.4.0.2-2xK7lvGG5mD8uErfBwrBze
  13666. 307.65 s [nothunks] Linked component graph:
  13667. 307.65 s [nothunks] unit nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  13668. 307.65 s [nothunks] include base-4.20.2.0-64da
  13669. 307.65 s [nothunks] include bytestring-0.12.2.0-262e
  13670. 307.65 s [nothunks] include containers-0.7-504a
  13671. 307.65 s [nothunks] include ghc-heap-9.10.3-7805
  13672. 307.65 s [nothunks] include stm-2.5.3.1-a2f3
  13673. 307.65 s [nothunks] include text-2.1.3-c691
  13674. 307.65 s [nothunks] include time-1.12.2-652a
  13675. 307.65 s [nothunks] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  13676. 307.65 s [nothunks] include wherefrom-compat-0.1.1.1-yp5RypMYSz1KLSyhMA9Ta
  13677. 307.65 s [nothunks] NoThunks.Class=nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam:NoThunks.Class
  13678. 307.65 s [nothunks] unit nothunks-0.3.1-9PLORH1jEHICdQFPMi70o3-nothunks-test
  13679. 307.65 s [nothunks] include base-4.20.2.0-64da
  13680. 307.65 s [nothunks] include containers-0.7-504a
  13681. 307.65 s [nothunks] include ghc-prim-0.12.0-1d7d
  13682. 307.65 s [nothunks] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  13683. 307.65 s [nothunks] include nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  13684. 307.65 s [nothunks] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  13685. 307.65 s [nothunks] include stm-2.5.3.1-a2f3
  13686. 307.65 s [nothunks] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  13687. 307.65 s [nothunks] include tasty-hedgehog-1.4.0.2-2xK7lvGG5mD8uErfBwrBze
  13688. 307.65 s [nothunks] Ready component graph:
  13689. 307.65 s [nothunks] definite nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  13690. 307.65 s [nothunks] depends base-4.20.2.0-64da
  13691. 307.65 s [nothunks] depends bytestring-0.12.2.0-262e
  13692. 307.65 s [nothunks] depends containers-0.7-504a
  13693. 307.65 s [nothunks] depends ghc-heap-9.10.3-7805
  13694. 307.65 s [nothunks] depends stm-2.5.3.1-a2f3
  13695. 307.65 s [nothunks] depends text-2.1.3-c691
  13696. 307.65 s [nothunks] depends time-1.12.2-652a
  13697. 307.65 s [nothunks] depends vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  13698. 307.65 s [nothunks] depends wherefrom-compat-0.1.1.1-yp5RypMYSz1KLSyhMA9Ta
  13699. 307.65 s [nothunks] definite nothunks-0.3.1-9PLORH1jEHICdQFPMi70o3-nothunks-test
  13700. 307.65 s [nothunks] depends base-4.20.2.0-64da
  13701. 307.65 s [nothunks] depends containers-0.7-504a
  13702. 307.65 s [nothunks] depends ghc-prim-0.12.0-1d7d
  13703. 307.65 s [nothunks] depends hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  13704. 307.65 s [nothunks] depends nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  13705. 307.65 s [nothunks] depends random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  13706. 307.65 s [nothunks] depends stm-2.5.3.1-a2f3
  13707. 307.65 s [nothunks] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  13708. 307.65 s [nothunks] depends tasty-hedgehog-1.4.0.2-2xK7lvGG5mD8uErfBwrBze
  13709. 307.65 s [nothunks] Using Cabal-3.12.1.0 compiled by ghc-9.10
  13710. 307.65 s [nothunks] Using compiler: ghc-9.10.3
  13711. 307.65 s [nothunks] Using install prefix:
  13712. 307.65 s [nothunks] /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1
  13713. 307.65 s [nothunks] Executables installed in:
  13714. 307.65 s [nothunks] /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/bin
  13715. 307.65 s [nothunks] Libraries installed in:
  13716. 307.65 s [nothunks] /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  13717. 307.65 s [nothunks] Dynamic Libraries installed in:
  13718. 307.65 s [nothunks] /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  13719. 307.65 s [nothunks] Private executables installed in:
  13720. 307.65 s [nothunks] /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.10.3-05f6/nothunks-0.3.1
  13721. 307.65 s [nothunks] Data files installed in:
  13722. 307.65 s [nothunks] /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/share/x86_64-linux-ghc-9.10.3-05f6/nothunks-0.3.1
  13723. 307.65 s [nothunks] Documentation installed in:
  13724. 307.65 s [nothunks] /nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  13725. 307.65 s [nothunks] Configuration files installed in:
  13726. 307.65 s [nothunks] /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/etc
  13727. 307.65 s [nothunks] No alex found
  13728. 307.65 s [nothunks] Using ar found on system at:
  13729. 307.65 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  13730. 307.65 s [nothunks] No c2hs found
  13731. 307.65 s [nothunks] No cpphs found
  13732. 307.65 s [nothunks] No doctest found
  13733. 307.65 s [nothunks] Using gcc version 14.3.0 given by user at:
  13734. 307.65 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  13735. 307.65 s [nothunks] Using ghc version 9.10.3 found on system at:
  13736. 307.65 s [nothunks] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  13737. 307.65 s [nothunks] Using ghc-pkg version 9.10.3 found on system at:
  13738. 307.65 s [nothunks] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  13739. 307.65 s [nothunks] No ghcjs found
  13740. 307.65 s [nothunks] No ghcjs-pkg found
  13741. 307.65 s [nothunks] No greencard found
  13742. 307.65 s [nothunks] Using haddock version 2.31.1 found on system at:
  13743. 307.65 s [nothunks] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  13744. 307.65 s [nothunks] No happy found
  13745. 307.65 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  13746. 307.65 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  13747. 307.65 s [nothunks] No hmake found
  13748. 307.65 s [nothunks] Using hpc version 0.69 found on system at:
  13749. 307.65 s [nothunks] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  13750. 307.65 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  13751. 307.65 s [nothunks] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  13752. 307.65 s [nothunks] Using hscolour version 1.25 found on system at:
  13753. 307.65 s [nothunks] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  13754. 307.65 s [nothunks] No jhc found
  13755. 307.65 s [nothunks] Using ld found on system at:
  13756. 307.65 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  13757. 307.65 s [nothunks] No pkg-config found
  13758. 307.65 s [nothunks] Using runghc version 9.10.3 found on system at:
  13759. 307.65 s [nothunks] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  13760. 307.65 s [nothunks] Using strip version 2.44 found on system at:
  13761. 307.65 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  13762. 307.65 s [nothunks] Using tar found on system at:
  13763. 307.65 s [nothunks] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  13764. 307.65 s [nothunks] No uhc found
  13765. 307.89 s [nothunks] Phase: buildPhase
  13766. 307.94 s [nothunks] Preprocessing library for nothunks-0.3.1...
  13767. 307.94 s [nothunks] Building library for nothunks-0.3.1...
  13768. 308.02 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  13769. 310.82 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  13770. 314.73 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  13771. 314.73 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1...
  13772. 314.83 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 )
  13773. 316.88 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  13774. 317.18 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  13775. 318.27 s [nothunks] Phase: checkPhase
  13776. 318.61 s [nothunks] Running 1 test suites...
  13777. 318.61 s [nothunks] Test suite nothunks-test: RUNNING...
  13778. 318.62 s [nothunks] Tests
  13779. 318.62 s [nothunks] NoThunks.Class
  13780. 318.62 s [nothunks] Sanity
  13781. 318.62 s [nothunks] IntNotNF: OK
  13782. 318.62 s [nothunks] ✓ <interactive> passed 1 test.
  13783. 318.62 s [nothunks] IntIsNF: OK
  13784. 318.62 s [nothunks] ✓ <interactive> passed 1 test.
  13785. 318.62 s [nothunks] Pair: OK
  13786. 318.62 s [nothunks] ✓ <interactive> passed 1 test.
  13787. 318.62 s [nothunks] Sum: OK
  13788. 318.62 s [nothunks] ✓ <interactive> passed 1 test.
  13789. 318.62 s [nothunks] Fn: OK
  13790. 318.62 s [nothunks] ✓ <interactive> passed 1 test.
  13791. 318.62 s [nothunks] IO: OK
  13792. 318.62 s [nothunks] ✓ <interactive> passed 1 test.
  13793. 318.62 s [nothunks] InspectHeap
  13794. 318.64 s [nothunks] Int: OK (0.02s)
  13795. 318.64 s [nothunks] ✓ <interactive> passed 1000 tests.
  13796. 318.64 s [nothunks] Just ["Int"] 54% ██████████▋·········
  13797. 318.64 s [nothunks] Nothing 46% █████████▎··········
  13798. 318.67 s [nothunks] IntInt: OK (0.02s)
  13799. 318.67 s [nothunks] ✓ <interactive> passed 1000 tests.
  13800. 318.67 s [nothunks] Just ["Int","Tuple2"] 38% ███████▌············
  13801. 318.67 s [nothunks] Just ["Tuple2"] 48% █████████▋··········
  13802. 318.67 s [nothunks] Nothing 14% ██▊·················
  13803. 318.69 s [nothunks] SumInt: OK (0.02s)
  13804. 318.69 s [nothunks] ✓ <interactive> passed 1000 tests.
  13805. 318.69 s [nothunks] Just ["Either"] 32% ██████▎·············
  13806. 318.69 s [nothunks] Just ["Int","Either"] 36% ███████▏············
  13807. 318.69 s [nothunks] Nothing 33% ██████▌·············
  13808. 318.70 s [nothunks] ListInt: OK (0.02s)
  13809. 318.70 s [nothunks] ✓ <interactive> passed 1000 tests.
  13810. 318.70 s [nothunks] Just ["Int","List"] 24% ████▉···············
  13811. 318.70 s [nothunks] Just ["List"] 44% ████████▋···········
  13812. 318.70 s [nothunks] Nothing 32% ██████▍·············
  13813. 318.71 s [nothunks] IntListInt: OK (0.02s)
  13814. 318.71 s [nothunks] ✓ <interactive> passed 1000 tests.
  13815. 318.72 s [nothunks] Just ["Int","List","Tuple2"] 6% █···················
  13816. 318.72 s [nothunks] Just ["Int","Tuple2"] 26% █████▏··············
  13817. 318.72 s [nothunks] Just ["List","Tuple2"] 10% █▉··················
  13818. 318.72 s [nothunks] Just ["Tuple2"] 50% ██████████··········
  13819. 318.72 s [nothunks] Nothing 8% █▋··················
  13820. 318.74 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  13821. 318.74 s [nothunks] after 11 tests and 1 shrink.
  13822. 318.74 s [nothunks] shrink path: 11:c
  13823. 318.74 s [nothunks] Just ["Int","Seq"] 18% ███▋················
  13824. 318.74 s [nothunks] Nothing 73% ██████████████▌·····
  13825. 318.74 s [nothunks]
  13826. 318.74 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  13827. 318.74 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  13828. 318.74 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  13829. 318.74 s [nothunks] 168 ┃ -> Proxy a
  13830. 318.74 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  13831. 318.74 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  13832. 318.74 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  13833. 318.74 s [nothunks] 172 ┃ -> Property
  13834. 318.74 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  13835. 318.74 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  13836. 318.74 s [nothunks] ┃ │ Wrap
  13837. 318.74 s [nothunks] ┃ │ { unwrap =
  13838. 318.74 s [nothunks] ┃ │ SeqEnqueue
  13839. 318.74 s [nothunks] ┃ │ (IntValue 0)
  13840. 318.74 s [nothunks] ┃ │ (SeqEnqueue
  13841. 318.74 s [nothunks] ┃ │ (IntValue 0)
  13842. 318.74 s [nothunks] ┃ │ (SeqEnqueue
  13843. 318.74 s [nothunks] ┃ │ (IntValue 0)
  13844. 318.74 s [nothunks] ┃ │ (SeqEnqueue
  13845. 318.74 s [nothunks] ┃ │ (IntValue 0)
  13846. 318.74 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  13847. 318.74 s [nothunks] ┃ │ }
  13848. 318.74 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  13849. 318.74 s [nothunks] 176 ┃ fromModel m $ \a -> do
  13850. 318.74 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  13851. 318.74 s [nothunks] ┃ │ IsNF
  13852. 318.74 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  13853. 318.74 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  13854. 318.74 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13855. 318.74 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  13856. 318.74 s [nothunks] ┃ │ - Just
  13857. 318.74 s [nothunks] ┃ │ - ThunkInfo
  13858. 318.74 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  13859. 318.74 s [nothunks] ┃ │ + Nothing
  13860. 318.74 s [nothunks]
  13861. 318.74 s [nothunks] This failure can be reproduced by running:
  13862. 318.74 s [nothunks] > recheckAt (Seed 6605901157962934402 5364699536051580407) "11:c" EXPECTED FAILURE
  13863. 318.74 s [nothunks]
  13864. 318.74 s [nothunks] OK (0.02s)
  13865. 318.74 s [nothunks] ✓ <interactive> passed 1 test.
  13866. 318.74 s [nothunks] Model
  13867. 318.76 s [nothunks] Int: OK (0.01s)
  13868. 318.77 s [nothunks] ✓ <interactive> passed 1000 tests.
  13869. 318.77 s [nothunks] Just ["Int"] 50% ██████████··········
  13870. 318.77 s [nothunks] Nothing 50% █████████▉··········
  13871. 318.78 s [nothunks] IntInt: OK (0.02s)
  13872. 318.78 s [nothunks] ✓ <interactive> passed 1000 tests.
  13873. 318.78 s [nothunks] Just ["Int","Tuple2"] 38% ███████▋············
  13874. 318.78 s [nothunks] Just ["Tuple2"] 48% █████████▋··········
  13875. 318.78 s [nothunks] Nothing 13% ██▌·················
  13876. 318.78 s [nothunks] SumInt: OK (0.01s)
  13877. 318.78 s [nothunks] ✓ <interactive> passed 1000 tests.
  13878. 318.78 s [nothunks] Just ["Either"] 34% ██████▊·············
  13879. 318.78 s [nothunks] Just ["Int","Either"] 35% ██████▉·············
  13880. 318.78 s [nothunks] Nothing 31% ██████▎·············
  13881. 318.80 s [nothunks] ListInt: OK (0.02s)
  13882. 318.80 s [nothunks] ✓ <interactive> passed 1000 tests.
  13883. 318.80 s [nothunks] Just ["Int","List"] 23% ████▋···············
  13884. 318.80 s [nothunks] Just ["List"] 44% ████████▋···········
  13885. 318.80 s [nothunks] Nothing 33% ██████▌·············
  13886. 318.82 s [nothunks] IntListInt: OK (0.01s)
  13887. 318.82 s [nothunks] ✓ <interactive> passed 1000 tests.
  13888. 318.82 s [nothunks] Just ["Int","List","Tuple2"] 5% █···················
  13889. 318.83 s [nothunks] Just ["Int","Tuple2"] 26% █████▏··············
  13890. 318.83 s [nothunks] Just ["List","Tuple2"] 10% ██··················
  13891. 318.83 s [nothunks] Just ["Tuple2"] 51% ██████████▏·········
  13892. 318.83 s [nothunks] Nothing 7% █▍··················
  13893. 318.90 s [nothunks] SeqInt: OK (0.07s)
  13894. 318.90 s [nothunks] ✓ <interactive> passed 1000 tests.
  13895. 318.90 s [nothunks] Just ["Int","Seq"] 47% █████████▍··········
  13896. 318.90 s [nothunks] Nothing 53% ██████████▌·········
  13897. 318.92 s [nothunks] AllowThunksIn: OK (0.02s)
  13898. 318.92 s [nothunks] ✓ <interactive> passed 1000 tests.
  13899. 318.92 s [nothunks] Just ["Int","field2","Record"] 24% ████▊···············
  13900. 318.92 s [nothunks] Just ["Record"] 54% ██████████▋·········
  13901. 318.92 s [nothunks] Nothing 22% ████▍···············
  13902. 318.93 s [nothunks] Fn: OK
  13903. 318.93 s [nothunks] ✓ <interactive> passed 1000 tests.
  13904. 318.94 s [nothunks] Just ["->"] 27% █████▎··············
  13905. 318.94 s [nothunks] Nothing 73% ██████████████▋·····
  13906. 318.94 s [nothunks] IO: OK
  13907. 318.95 s [nothunks] ✓ <interactive> passed 1000 tests.
  13908. 318.95 s [nothunks] Just ["IO"] 25% █████···············
  13909. 318.95 s [nothunks] Nothing 75% ██████████████▉·····
  13910. 318.96 s [nothunks] ThunkFreeFn: OK (0.01s)
  13911. 318.96 s [nothunks] ✓ <interactive> passed 1000 tests.
  13912. 318.96 s [nothunks] Just ["->"] 25% ████▉···············
  13913. 318.96 s [nothunks] Just ["...","->"] 39% ███████▊············
  13914. 318.96 s [nothunks] Nothing 36% ███████▎············
  13915. 318.96 s [nothunks] ThunkFreeIO: OK (0.01s)
  13916. 318.96 s [nothunks] ✓ <interactive> passed 1000 tests.
  13917. 318.96 s [nothunks] Just ["...","IO"] 36% ███████·············
  13918. 318.96 s [nothunks] Just ["IO"] 29% █████▊··············
  13919. 318.96 s [nothunks] Nothing 35% ███████·············
  13920. 318.96 s [nothunks] MutableVars
  13921. 318.96 s [nothunks] IORef
  13922. 318.96 s [nothunks] NotNF: OK
  13923. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13924. 318.96 s [nothunks] NF: OK
  13925. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13926. 318.96 s [nothunks] NotNFPure: OK
  13927. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13928. 318.96 s [nothunks] NFPure: OK
  13929. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13930. 318.96 s [nothunks] NotNFAtomically: OK
  13931. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13932. 318.96 s [nothunks] NFAtomically: OK
  13933. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13934. 318.96 s [nothunks] MVar
  13935. 318.96 s [nothunks] NotNF: OK
  13936. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13937. 318.96 s [nothunks] NF: OK
  13938. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13939. 318.96 s [nothunks] NotNFPure: OK
  13940. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13941. 318.96 s [nothunks] NFPure: OK
  13942. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13943. 318.96 s [nothunks] NotNFAtomically: OK
  13944. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13945. 318.96 s [nothunks] NFAtomically: OK
  13946. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13947. 318.96 s [nothunks] TVar
  13948. 318.96 s [nothunks] NotNF: OK
  13949. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13950. 318.96 s [nothunks] NF: OK
  13951. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13952. 318.96 s [nothunks] NotNFPure: OK
  13953. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13954. 318.96 s [nothunks] NFPure: OK
  13955. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13956. 318.96 s [nothunks] NotNFAtomically: OK
  13957. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13958. 318.96 s [nothunks] NFAtomically: OK
  13959. 318.96 s [nothunks] ✓ <interactive> passed 1 test.
  13960. 318.96 s [nothunks]
  13961. 318.96 s [nothunks] All 41 tests passed (0.34s)
  13962. 318.96 s [nothunks] Test suite nothunks-test: PASS
  13963. 318.96 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  13964. 318.96 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  13965. 318.97 s [nothunks] Phase: haddockPhase
  13966. 319.19 s [nothunks] Preprocessing library for nothunks-0.3.1...
  13967. 319.19 s [nothunks] Running Haddock on library for nothunks-0.3.1...
  13968. 319.19 s [nothunks] Warning: The documentation for the following packages are not installed. No
  13969. 319.19 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  13970. 319.57 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
  13971. 320.46 s [nothunks] Haddock coverage:
  13972. 320.46 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  13973. 320.46 s [nothunks] * at src/NoThunks/Class.hs:334:48
  13974. 320.46 s [nothunks] * at src/NoThunks/Class.hs:334:1
  13975. 320.46 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13976. 320.46 s [nothunks] by specifying the type/value namespace explicitly.
  13977. 320.46 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  13978. 320.46 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  13979. 320.46 s [nothunks] * at src/NoThunks/Class.hs:353:25
  13980. 320.46 s [nothunks] * at src/NoThunks/Class.hs:353:1
  13981. 320.46 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13982. 320.46 s [nothunks] by specifying the type/value namespace explicitly.
  13983. 320.46 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  13984. 320.46 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  13985. 320.46 s [nothunks] * at src/NoThunks/Class.hs:358:47
  13986. 320.46 s [nothunks] * at src/NoThunks/Class.hs:358:1
  13987. 320.46 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13988. 320.46 s [nothunks] by specifying the type/value namespace explicitly.
  13989. 320.46 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  13990. 320.46 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  13991. 320.46 s [nothunks] * at src/NoThunks/Class.hs:308:27
  13992. 320.46 s [nothunks] * at src/NoThunks/Class.hs:308:1
  13993. 320.46 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13994. 320.46 s [nothunks] by specifying the type/value namespace explicitly.
  13995. 320.46 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  13996. 320.47 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  13997. 320.47 s [nothunks] * at src/NoThunks/Class.hs:230:18
  13998. 320.47 s [nothunks] * at src/NoThunks/Class.hs:230:1
  13999. 320.47 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  14000. 320.47 s [nothunks] by specifying the type/value namespace explicitly.
  14001. 320.47 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  14002. 320.47 s [nothunks] Warning: 'GHC' is out of scope.
  14003. 320.47 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  14004. 320.47 s [nothunks] Warning: 'a' is out of scope.
  14005. 320.47 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  14006. 320.47 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  14007. 320.47 s [nothunks] Missing documentation for:
  14008. 320.47 s [nothunks] Module header
  14009. 320.91 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  14010. 320.91 s [nothunks] - Data.Vector.Vector
  14011. 320.91 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  14012. 320.91 s [nothunks] - NoThunks.Class.HasFields
  14013. 320.91 s [nothunks] - NoThunks.Class.Elem
  14014. 320.91 s [nothunks] - NoThunks.Class.GShowTypeOf
  14015. 320.91 s [nothunks] - NoThunks.Class.GWRecordField
  14016. 320.91 s [nothunks] - NoThunks.Class.checkContainsThunks
  14017. 325.30 s [nothunks] Documentation created: dist/doc/html/nothunks/,
  14018. 325.30 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  14019. 325.36 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  14020. 325.44 s [nothunks] Phase: installPhase
  14021. 325.44 s [nothunks] Installing library in /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  14022. 325.67 s [nothunks] Phase: fixupPhase
  14023. 325.69 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1
  14024. 325.69 s [nothunks] shrinking /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSnothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam-ghc9.10.3.so
  14025. 325.70 s [nothunks] checking for references to /build/ in /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1...
  14026. 325.71 s [nothunks] patching script interpreter paths in /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1
  14027. 325.72 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1/lib
  14028. 325.77 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc
  14029. 325.77 s [nothunks] checking for references to /build/ in /nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc...
  14030. 325.79 s [nothunks] patching script interpreter paths in /nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc
  14031. 325.88 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1 /nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc
  14032. 326.38 s [nothunks:post-build] Pushing 2 paths (100 are already present) using zstd to cache sellout ⏳
  14033. 326.38 s [nothunks:post-build]
  14034. 326.74 s [nothunks:post-build] Pushing /nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc (838.24 KiB)
  14035. 326.83 s [nothunks:post-build] Pushing /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1 (2.85 MiB)
  14036. 327.93 s [nothunks:post-build]
  14037. 327.93 s [nothunks:post-build] All done.
  14038. 327.96 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1 /nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc
  14039. 328.00 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14040. 328.49 s [nothunks:post-build] copying 2 paths...
  14041. 328.49 s [nothunks:post-build] copying path '/nix/store/wgkc0azsn0hkm9n50lmgd4h7b8civ112-nothunks-0.3.1-doc' to 'https://cache.nix-ci.com'...
  14042. 328.94 s [nothunks:post-build] copying path '/nix/store/q3j71gpnprxk4iw9kb4lwafsbk2qhbx4-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  14043. 329.93 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14044. 330.24 s [nothunks:post-build] copying 1 paths...
  14045. 330.24 s [nothunks:post-build] copying path '/nix/store/xqd70lna4yqvx8fhh3rrk8vnfp0y8k68-nothunks-0.3.1.drv' to 'https://cache.nix-ci.com'...
  14046. 330.51 s Progress: 6 of 15 built, 36 of 36 downloaded from cache
  14047. 330.57 s Building /nix/store/924f0jc8vckgh1byfg683lax1s9a3yn1-unordered-containers-0.2.20.1.drv
  14048. 330.70 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  14049. 330.70 s [unordered-containers] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  14050. 330.94 s [unordered-containers] Phase: unpackPhase
  14051. 330.94 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  14052. 330.95 s [unordered-containers] source root is unordered-containers-0.2.20.1
  14053. 330.95 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  14054. 330.96 s [unordered-containers] Phase: patchPhase
  14055. 330.97 s [unordered-containers] Phase: compileBuildDriverPhase
  14056. 330.97 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.KMAXHLMrku/setup-package.conf.d -threaded
  14057. 331.06 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.KMAXHLMrku/Main.o )
  14058. 331.12 s [unordered-containers] [2 of 2] Linking Setup
  14059. 332.76 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  14060. 332.77 s [unordered-containers] Phase: configurePhase
  14061. 332.78 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.KMAXHLMrku/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  14062. 332.79 s [unordered-containers] Using Parsec parser
  14063. 332.79 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  14064. 333.13 s [unordered-containers] Flags chosen: debug=False
  14065. 333.45 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.20.2.0
  14066. 333.45 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.0.0
  14067. 333.45 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
  14068. 333.45 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.22.0.0
  14069. 333.46 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  14070. 333.46 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  14071. 333.46 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  14072. 333.46 s [unordered-containers] Dependency base: using base-4.20.2.0
  14073. 333.46 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.7
  14074. 333.46 s [unordered-containers] Dependency hashable: using hashable-1.5.0.0
  14075. 333.46 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  14076. 333.46 s [unordered-containers] Dependency random: using random-1.2.1.3
  14077. 333.46 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  14078. 333.46 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  14079. 333.46 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  14080. 333.46 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  14081. 333.46 s [unordered-containers] Source component graph:
  14082. 333.46 s [unordered-containers] component lib
  14083. 333.46 s [unordered-containers] component test:unordered-containers-tests dependency lib
  14084. 333.46 s [unordered-containers] Configured component graph:
  14085. 333.46 s [unordered-containers] component unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14086. 333.46 s [unordered-containers] include base-4.20.2.0-64da
  14087. 333.46 s [unordered-containers] include deepseq-1.5.0.0-9a2c
  14088. 333.46 s [unordered-containers] include hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  14089. 333.46 s [unordered-containers] include template-haskell-2.22.0.0-09e7
  14090. 333.46 s [unordered-containers] component unordered-containers-0.2.20.1-1vi3OXi9xRj6NOlFqsDNWl-unordered-containers-tests
  14091. 333.46 s [unordered-containers] include ChasingBottoms-1.3.1.17-FMp1YdIQccZ5CLIwe3eDxw
  14092. 333.46 s [unordered-containers] include HUnit-1.6.2.0-JXuCVna2BYuFcGoUe74k6J
  14093. 333.46 s [unordered-containers] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  14094. 333.46 s [unordered-containers] include base-4.20.2.0-64da
  14095. 333.46 s [unordered-containers] include containers-0.7-504a
  14096. 333.46 s [unordered-containers] include hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  14097. 333.46 s [unordered-containers] include nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  14098. 333.46 s [unordered-containers] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  14099. 333.46 s [unordered-containers] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  14100. 333.46 s [unordered-containers] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  14101. 333.46 s [unordered-containers] include tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  14102. 333.46 s [unordered-containers] include unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14103. 333.46 s [unordered-containers] Linked component graph:
  14104. 333.46 s [unordered-containers] unit unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14105. 333.46 s [unordered-containers] include base-4.20.2.0-64da
  14106. 333.46 s [unordered-containers] include deepseq-1.5.0.0-9a2c
  14107. 333.46 s [unordered-containers] include hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  14108. 333.46 s [unordered-containers] include template-haskell-2.22.0.0-09e7
  14109. 333.46 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq:Data.HashSet.Internal
  14110. 333.46 s [unordered-containers] unit unordered-containers-0.2.20.1-1vi3OXi9xRj6NOlFqsDNWl-unordered-containers-tests
  14111. 333.46 s [unordered-containers] include ChasingBottoms-1.3.1.17-FMp1YdIQccZ5CLIwe3eDxw
  14112. 333.46 s [unordered-containers] include HUnit-1.6.2.0-JXuCVna2BYuFcGoUe74k6J
  14113. 333.46 s [unordered-containers] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  14114. 333.46 s [unordered-containers] include base-4.20.2.0-64da
  14115. 333.46 s [unordered-containers] include containers-0.7-504a
  14116. 333.46 s [unordered-containers] include hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  14117. 333.46 s [unordered-containers] include nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  14118. 333.46 s [unordered-containers] include random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  14119. 333.46 s [unordered-containers] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  14120. 333.46 s [unordered-containers] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  14121. 333.46 s [unordered-containers] include tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  14122. 333.46 s [unordered-containers] include unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14123. 333.46 s [unordered-containers] Ready component graph:
  14124. 333.46 s [unordered-containers] definite unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14125. 333.46 s [unordered-containers] depends base-4.20.2.0-64da
  14126. 333.46 s [unordered-containers] depends deepseq-1.5.0.0-9a2c
  14127. 333.46 s [unordered-containers] depends hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  14128. 333.46 s [unordered-containers] depends template-haskell-2.22.0.0-09e7
  14129. 333.46 s [unordered-containers] definite unordered-containers-0.2.20.1-1vi3OXi9xRj6NOlFqsDNWl-unordered-containers-tests
  14130. 333.46 s [unordered-containers] depends ChasingBottoms-1.3.1.17-FMp1YdIQccZ5CLIwe3eDxw
  14131. 333.46 s [unordered-containers] depends HUnit-1.6.2.0-JXuCVna2BYuFcGoUe74k6J
  14132. 333.46 s [unordered-containers] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  14133. 333.46 s [unordered-containers] depends base-4.20.2.0-64da
  14134. 333.46 s [unordered-containers] depends containers-0.7-504a
  14135. 333.46 s [unordered-containers] depends hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  14136. 333.46 s [unordered-containers] depends nothunks-0.3.1-FLCAh2u6qghIwf8ocCjKam
  14137. 333.46 s [unordered-containers] depends random-1.2.1.3-9T1sBqjfI7C3JconfAiPFk
  14138. 333.46 s [unordered-containers] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  14139. 333.46 s [unordered-containers] depends tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  14140. 333.46 s [unordered-containers] depends tasty-quickcheck-0.11.1-Hvgwz6b13sJErazuubakNq
  14141. 333.46 s [unordered-containers] depends unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14142. 333.46 s [unordered-containers] Using Cabal-3.12.1.0 compiled by ghc-9.10
  14143. 333.46 s [unordered-containers] Using compiler: ghc-9.10.3
  14144. 333.46 s [unordered-containers] Using install prefix:
  14145. 333.46 s [unordered-containers] /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1
  14146. 333.46 s [unordered-containers] Executables installed in:
  14147. 333.46 s [unordered-containers] /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/bin
  14148. 333.46 s [unordered-containers] Libraries installed in:
  14149. 333.46 s [unordered-containers] /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14150. 333.46 s [unordered-containers] Dynamic Libraries installed in:
  14151. 333.46 s [unordered-containers] /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  14152. 333.46 s [unordered-containers] Private executables installed in:
  14153. 333.46 s [unordered-containers] /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.10.3-05f6/unordered-containers-0.2.20.1
  14154. 333.46 s [unordered-containers] Data files installed in:
  14155. 333.46 s [unordered-containers] /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.10.3-05f6/unordered-containers-0.2.20.1
  14156. 333.46 s [unordered-containers] Documentation installed in:
  14157. 333.46 s [unordered-containers] /nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  14158. 333.46 s [unordered-containers] Configuration files installed in:
  14159. 333.46 s [unordered-containers] /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/etc
  14160. 333.46 s [unordered-containers] No alex found
  14161. 333.46 s [unordered-containers] Using ar found on system at:
  14162. 333.46 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  14163. 333.46 s [unordered-containers] No c2hs found
  14164. 333.46 s [unordered-containers] No cpphs found
  14165. 333.46 s [unordered-containers] No doctest found
  14166. 333.46 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  14167. 333.46 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  14168. 333.46 s [unordered-containers] Using ghc version 9.10.3 found on system at:
  14169. 333.46 s [unordered-containers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  14170. 333.46 s [unordered-containers] Using ghc-pkg version 9.10.3 found on system at:
  14171. 333.46 s [unordered-containers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  14172. 333.46 s [unordered-containers] No ghcjs found
  14173. 333.46 s [unordered-containers] No ghcjs-pkg found
  14174. 333.46 s [unordered-containers] No greencard found
  14175. 333.46 s [unordered-containers] Using haddock version 2.31.1 found on system at:
  14176. 333.46 s [unordered-containers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  14177. 333.46 s [unordered-containers] No happy found
  14178. 333.46 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  14179. 333.46 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  14180. 333.46 s [unordered-containers] No hmake found
  14181. 333.46 s [unordered-containers] Using hpc version 0.69 found on system at:
  14182. 333.46 s [unordered-containers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  14183. 333.46 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  14184. 333.46 s [unordered-containers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  14185. 333.46 s [unordered-containers] Using hscolour version 1.25 found on system at:
  14186. 333.46 s [unordered-containers] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  14187. 333.46 s [unordered-containers] No jhc found
  14188. 333.46 s [unordered-containers] Using ld found on system at:
  14189. 333.46 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  14190. 333.46 s [unordered-containers] No pkg-config found
  14191. 333.46 s [unordered-containers] Using runghc version 9.10.3 found on system at:
  14192. 333.46 s [unordered-containers] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  14193. 333.46 s [unordered-containers] Using strip version 2.44 found on system at:
  14194. 333.46 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  14195. 333.46 s [unordered-containers] Using tar found on system at:
  14196. 333.46 s [unordered-containers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  14197. 333.46 s [unordered-containers] No uhc found
  14198. 333.71 s [unordered-containers] Phase: buildPhase
  14199. 333.76 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  14200. 333.78 s [unordered-containers] Building library for unordered-containers-0.2.20.1...
  14201. 333.88 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14202. 333.88 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14203. 333.88 s [unordered-containers] |
  14204. 333.88 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14205. 333.88 s [unordered-containers] | ^^^^^^^^^^
  14206. 333.88 s [unordered-containers]
  14207. 334.12 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 )
  14208. 334.31 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14209. 334.31 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14210. 334.31 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14211. 334.31 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14212. 334.31 s [unordered-containers] |
  14213. 334.31 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14214. 334.31 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14215. 334.31 s [unordered-containers]
  14216. 334.93 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 )
  14217. 334.93 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 )
  14218. 344.36 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 )
  14219. 344.94 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 )
  14220. 347.58 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 )
  14221. 347.58 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  14222. 347.58 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 )
  14223. 347.62 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 )
  14224. 347.97 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14225. 347.97 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14226. 347.97 s [unordered-containers] |
  14227. 347.97 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14228. 347.97 s [unordered-containers] | ^^^^^^^^^^
  14229. 347.97 s [unordered-containers]
  14230. 348.20 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  14231. 348.50 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14232. 348.50 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14233. 348.50 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14234. 348.50 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14235. 348.50 s [unordered-containers] |
  14236. 348.50 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14237. 348.50 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14238. 348.50 s [unordered-containers]
  14239. 349.45 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  14240. 349.50 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  14241. 361.69 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  14242. 362.57 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  14243. 366.15 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  14244. 366.15 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  14245. 366.15 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  14246. 366.82 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  14247. 368.55 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  14248. 368.55 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  14249. 368.79 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 )
  14250. 369.51 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  14251. 369.51 s [unordered-containers] tests/Regressions.hs:93:16: warning: [GHC-63394] [-Wx-partial]
  14252. 369.51 s [unordered-containers] In the use of ‘head’
  14253. 369.51 s [unordered-containers] (imported from Prelude, but defined in GHC.Internal.List):
  14254. 369.51 s [unordered-containers] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  14255. 369.51 s [unordered-containers] |
  14256. 369.51 s [unordered-containers] 93 | k = head keys
  14257. 369.51 s [unordered-containers] | ^^^^
  14258. 369.51 s [unordered-containers]
  14259. 373.15 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 )
  14260. 373.23 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  14261. 373.23 s [unordered-containers] tests/Strictness.hs:7:1: warning: [GHC-66111] [-Wunused-imports]
  14262. 373.23 s [unordered-containers] The import of ‘Data.Foldable’ is redundant
  14263. 373.23 s [unordered-containers] except perhaps to import instances from ‘Data.Foldable’
  14264. 373.23 s [unordered-containers] To import instances alone, use: import Data.Foldable()
  14265. 373.23 s [unordered-containers] |
  14266. 373.23 s [unordered-containers] 7 | import Data.Foldable (foldl')
  14267. 373.23 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14268. 373.23 s [unordered-containers]
  14269. 373.23 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 )
  14270. 373.23 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 )
  14271. 381.77 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 )
  14272. 381.80 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  14273. 381.80 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  14274. 382.50 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  14275. 383.91 s [unordered-containers] buildPhase completed in 50 seconds
  14276. 383.91 s [unordered-containers] Phase: checkPhase
  14277. 384.28 s [unordered-containers] Running 1 test suites...
  14278. 384.28 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  14279. 384.32 s [unordered-containers] All
  14280. 384.32 s [unordered-containers] Properties
  14281. 384.32 s [unordered-containers] Data.HashMap.Lazy
  14282. 384.32 s [unordered-containers] instances
  14283. 384.32 s [unordered-containers] Eq
  14284. 384.36 s [unordered-containers] ==: OK (0.01s)
  14285. 384.36 s [unordered-containers] +++ OK, passed 100 tests.
  14286. 384.36 s [unordered-containers] /=: OK (0.04s)
  14287. 384.36 s [unordered-containers] +++ OK, passed 100 tests.
  14288. 384.36 s [unordered-containers] Ord
  14289. 384.45 s [unordered-containers] compare reflexive: OK (0.12s)
  14290. 384.45 s [unordered-containers] +++ OK, passed 100 tests.
  14291. 384.45 s [unordered-containers] compare transitive: OK (0.06s)
  14292. 384.45 s [unordered-containers] +++ OK, passed 100 tests.
  14293. 384.45 s [unordered-containers] compare antisymmetric: OK (0.04s)
  14294. 384.45 s [unordered-containers] +++ OK, passed 100 tests.
  14295. 384.45 s [unordered-containers] Ord => Eq: OK (0.05s)
  14296. 384.45 s [unordered-containers] +++ OK, passed 100 tests.
  14297. 384.69 s [unordered-containers] Read/Show: OK (0.39s)
  14298. 384.69 s [unordered-containers] +++ OK, passed 100 tests.
  14299. 384.69 s [unordered-containers] Functor: OK (0.22s)
  14300. 384.69 s [unordered-containers] +++ OK, passed 100 tests.
  14301. 384.69 s [unordered-containers] Foldable: OK (0.03s)
  14302. 384.69 s [unordered-containers] +++ OK, passed 100 tests.
  14303. 384.69 s [unordered-containers] Bifoldable
  14304. 384.69 s [unordered-containers] bifoldMap: OK (0.02s)
  14305. 384.69 s [unordered-containers] +++ OK, passed 100 tests.
  14306. 384.69 s [unordered-containers] bifoldr: OK (0.03s)
  14307. 384.69 s [unordered-containers] +++ OK, passed 100 tests.
  14308. 384.69 s [unordered-containers] bifoldl: OK (0.12s)
  14309. 384.69 s [unordered-containers] +++ OK, passed 100 tests.
  14310. 384.69 s [unordered-containers] Hashable: OK (0.09s)
  14311. 384.69 s [unordered-containers] +++ OK, passed 100 tests.
  14312. 384.69 s [unordered-containers] empty
  14313. 384.69 s [unordered-containers] valid: OK
  14314. 384.69 s [unordered-containers] +++ OK, passed 1 test.
  14315. 384.69 s [unordered-containers] singleton
  14316. 384.69 s [unordered-containers] valid: OK
  14317. 384.69 s [unordered-containers] +++ OK, passed 100 tests.
  14318. 384.69 s [unordered-containers] size: OK (0.04s)
  14319. 384.69 s [unordered-containers] +++ OK, passed 100 tests.
  14320. 384.69 s [unordered-containers] member: OK (0.03s)
  14321. 384.69 s [unordered-containers] +++ OK, passed 100 tests.
  14322. 384.70 s [unordered-containers] lookup: OK (0.02s)
  14323. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14324. 384.70 s [unordered-containers] !?: OK (0.03s)
  14325. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14326. 384.70 s [unordered-containers] insert
  14327. 384.70 s [unordered-containers] model: OK
  14328. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14329. 384.70 s [unordered-containers] valid: OK (0.04s)
  14330. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14331. 384.70 s [unordered-containers] insertWith
  14332. 384.70 s [unordered-containers] insertWith: OK (0.01s)
  14333. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14334. 384.70 s [unordered-containers] valid: OK (0.01s)
  14335. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14336. 384.70 s [unordered-containers] delete
  14337. 384.70 s [unordered-containers] model: OK (0.04s)
  14338. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14339. 384.70 s [unordered-containers] valid: OK
  14340. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14341. 384.70 s [unordered-containers] adjust
  14342. 384.70 s [unordered-containers] model: OK (0.04s)
  14343. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14344. 384.70 s [unordered-containers] valid: OK
  14345. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14346. 384.70 s [unordered-containers] update
  14347. 384.70 s [unordered-containers] model: OK (0.05s)
  14348. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14349. 384.70 s [unordered-containers] valid: OK (0.05s)
  14350. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14351. 384.70 s [unordered-containers] alter
  14352. 384.70 s [unordered-containers] model: OK (0.05s)
  14353. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14354. 384.70 s [unordered-containers] valid: OK
  14355. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14356. 384.70 s [unordered-containers] alterF
  14357. 384.70 s [unordered-containers] model
  14358. 384.70 s [unordered-containers] []: OK (0.30s)
  14359. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14360. 384.70 s [unordered-containers] adjust: OK (0.05s)
  14361. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14362. 384.70 s [unordered-containers] insert: OK (0.09s)
  14363. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14364. 384.70 s [unordered-containers] insertWith: OK (0.04s)
  14365. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14366. 384.70 s [unordered-containers] delete: OK (0.05s)
  14367. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14368. 384.70 s [unordered-containers] lookup: OK (0.11s)
  14369. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14370. 384.70 s [unordered-containers] valid: OK (0.04s)
  14371. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14372. 384.70 s [unordered-containers] isSubmapOf
  14373. 384.70 s [unordered-containers] model: OK (0.04s)
  14374. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14375. 384.70 s [unordered-containers] m ⊆ m: OK (0.02s)
  14376. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14377. 384.70 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.03s)
  14378. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14379. 384.70 s [unordered-containers] m1\m2 ⊆ m1: OK (0.04s)
  14380. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14381. 384.70 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.04s)
  14382. 384.70 s [unordered-containers] +++ OK, passed 100 tests; 184 discarded.
  14383. 384.70 s [unordered-containers] delete k m ⊆ m: OK (0.01s)
  14384. 384.70 s [unordered-containers] +++ OK, passed 100 tests; 23 discarded.
  14385. 384.70 s [unordered-containers] m ⊈ delete k m : OK (0.02s)
  14386. 384.70 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  14387. 384.70 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.05s)
  14388. 384.70 s [unordered-containers] +++ OK, passed 100 tests; 7 discarded.
  14389. 384.70 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.07s)
  14390. 384.70 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  14391. 384.70 s [unordered-containers] union
  14392. 384.70 s [unordered-containers] model: OK (0.10s)
  14393. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14394. 384.70 s [unordered-containers] valid: OK (0.06s)
  14395. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14396. 384.70 s [unordered-containers] unionWith
  14397. 384.70 s [unordered-containers] model: OK (0.11s)
  14398. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14399. 384.70 s [unordered-containers] valid: OK (0.03s)
  14400. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14401. 384.70 s [unordered-containers] unionWithKey
  14402. 384.70 s [unordered-containers] model: OK (0.12s)
  14403. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14404. 384.70 s [unordered-containers] valid: OK (0.03s)
  14405. 384.70 s [unordered-containers] +++ OK, passed 100 tests.
  14406. 384.70 s [unordered-containers] unions
  14407. 386.12 s [unordered-containers] model: OK (1.67s)
  14408. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14409. 386.16 s [unordered-containers] valid: OK (0.79s)
  14410. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14411. 386.16 s [unordered-containers] difference
  14412. 386.16 s [unordered-containers] model: OK (0.10s)
  14413. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14414. 386.16 s [unordered-containers] valid: OK (0.02s)
  14415. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14416. 386.16 s [unordered-containers] differenceWith
  14417. 386.16 s [unordered-containers] model: OK (0.15s)
  14418. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14419. 386.16 s [unordered-containers] valid: OK (0.14s)
  14420. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14421. 386.16 s [unordered-containers] intersection
  14422. 386.16 s [unordered-containers] model: OK (0.07s)
  14423. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14424. 386.16 s [unordered-containers] valid: OK (0.04s)
  14425. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14426. 386.16 s [unordered-containers] intersectionWith
  14427. 386.16 s [unordered-containers] model: OK (0.10s)
  14428. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14429. 386.16 s [unordered-containers] valid: OK (0.02s)
  14430. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14431. 386.16 s [unordered-containers] intersectionWithKey
  14432. 386.16 s [unordered-containers] model: OK (0.16s)
  14433. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14434. 386.16 s [unordered-containers] valid: OK (0.02s)
  14435. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14436. 386.16 s [unordered-containers] compose
  14437. 386.16 s [unordered-containers] valid: OK (0.06s)
  14438. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14439. 386.16 s [unordered-containers] map
  14440. 386.16 s [unordered-containers] model: OK (0.20s)
  14441. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14442. 386.16 s [unordered-containers] valid: OK (0.02s)
  14443. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14444. 386.16 s [unordered-containers] traverseWithKey
  14445. 386.16 s [unordered-containers] model: OK (0.24s)
  14446. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14447. 386.16 s [unordered-containers] valid: OK (0.05s)
  14448. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14449. 386.16 s [unordered-containers] mapKeys
  14450. 386.16 s [unordered-containers] model: OK (0.05s)
  14451. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14452. 386.16 s [unordered-containers] valid: OK (0.94s)
  14453. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14454. 386.16 s [unordered-containers] foldr: OK (0.06s)
  14455. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14456. 386.16 s [unordered-containers] foldl: OK (0.04s)
  14457. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14458. 386.16 s [unordered-containers] foldrWithKey: OK (0.06s)
  14459. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14460. 386.16 s [unordered-containers] foldlWithKey: OK (0.09s)
  14461. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14462. 386.16 s [unordered-containers] foldrWithKey': OK (0.06s)
  14463. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14464. 386.16 s [unordered-containers] foldlWithKey': OK (0.03s)
  14465. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14466. 386.16 s [unordered-containers] foldl': OK (0.03s)
  14467. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14468. 386.16 s [unordered-containers] foldr': OK (0.04s)
  14469. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14470. 386.16 s [unordered-containers] foldMapWithKey: OK (0.07s)
  14471. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14472. 386.16 s [unordered-containers] filter
  14473. 386.16 s [unordered-containers] model: OK (0.13s)
  14474. 386.16 s [unordered-containers] +++ OK, passed 100 tests.
  14475. 386.17 s [unordered-containers] valid: OK (0.08s)
  14476. 386.17 s [unordered-containers] +++ OK, passed 100 tests.
  14477. 386.17 s [unordered-containers] filterWithKey
  14478. 387.25 s [unordered-containers] model: OK (2.64s)
  14479. 387.25 s [unordered-containers] +++ OK, passed 100 tests.
  14480. 387.33 s [unordered-containers] valid: OK (1.80s)
  14481. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14482. 387.33 s [unordered-containers] mapMaybe
  14483. 387.33 s [unordered-containers] model: OK (0.14s)
  14484. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14485. 387.33 s [unordered-containers] valid: OK (0.05s)
  14486. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14487. 387.33 s [unordered-containers] mapMaybeWithKey
  14488. 387.33 s [unordered-containers] model: OK (2.43s)
  14489. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14490. 387.33 s [unordered-containers] valid: OK (1.31s)
  14491. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14492. 387.33 s [unordered-containers] elems: OK (0.02s)
  14493. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14494. 387.33 s [unordered-containers] keys: OK (0.03s)
  14495. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14496. 387.33 s [unordered-containers] fromList
  14497. 387.33 s [unordered-containers] model: OK (0.01s)
  14498. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14499. 387.33 s [unordered-containers] valid: OK
  14500. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14501. 387.33 s [unordered-containers] fromListWith
  14502. 387.33 s [unordered-containers] model: OK (0.03s)
  14503. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14504. 387.33 s [unordered-containers] valid: OK (0.02s)
  14505. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14506. 387.33 s [unordered-containers] fromListWithKey
  14507. 387.33 s [unordered-containers] model: OK (0.03s)
  14508. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14509. 387.33 s [unordered-containers] valid: OK (0.02s)
  14510. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14511. 387.33 s [unordered-containers] toList: OK (0.03s)
  14512. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14513. 387.33 s [unordered-containers] Data.HashMap.Strict
  14514. 387.33 s [unordered-containers] instances
  14515. 387.33 s [unordered-containers] Eq
  14516. 387.33 s [unordered-containers] ==: OK (0.03s)
  14517. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14518. 387.33 s [unordered-containers] /=: OK (0.12s)
  14519. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14520. 387.33 s [unordered-containers] Ord
  14521. 387.33 s [unordered-containers] compare reflexive: OK (0.01s)
  14522. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14523. 387.33 s [unordered-containers] compare transitive: OK (0.11s)
  14524. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14525. 387.33 s [unordered-containers] compare antisymmetric: OK (0.05s)
  14526. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14527. 387.33 s [unordered-containers] Ord => Eq: OK (0.03s)
  14528. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14529. 387.33 s [unordered-containers] Read/Show: OK (0.69s)
  14530. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14531. 387.33 s [unordered-containers] Functor: OK (0.18s)
  14532. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14533. 387.33 s [unordered-containers] Foldable: OK (0.05s)
  14534. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14535. 387.33 s [unordered-containers] Bifoldable
  14536. 387.33 s [unordered-containers] bifoldMap: OK (0.04s)
  14537. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14538. 387.33 s [unordered-containers] bifoldr: OK (0.01s)
  14539. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14540. 387.33 s [unordered-containers] bifoldl: OK (0.04s)
  14541. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14542. 387.33 s [unordered-containers] Hashable: OK (0.05s)
  14543. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14544. 387.33 s [unordered-containers] empty
  14545. 387.33 s [unordered-containers] valid: OK (0.02s)
  14546. 387.33 s [unordered-containers] +++ OK, passed 1 test.
  14547. 387.33 s [unordered-containers] singleton
  14548. 387.33 s [unordered-containers] valid: OK
  14549. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14550. 387.33 s [unordered-containers] size: OK (0.05s)
  14551. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14552. 387.33 s [unordered-containers] member: OK (0.03s)
  14553. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14554. 387.33 s [unordered-containers] lookup: OK (0.03s)
  14555. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14556. 387.33 s [unordered-containers] !?: OK (0.08s)
  14557. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14558. 387.33 s [unordered-containers] insert
  14559. 387.33 s [unordered-containers] model: OK (0.02s)
  14560. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14561. 387.33 s [unordered-containers] valid: OK (0.07s)
  14562. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14563. 387.33 s [unordered-containers] insertWith
  14564. 387.33 s [unordered-containers] insertWith: OK (0.05s)
  14565. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14566. 387.33 s [unordered-containers] valid: OK (0.04s)
  14567. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14568. 387.33 s [unordered-containers] delete
  14569. 387.33 s [unordered-containers] model: OK (0.05s)
  14570. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14571. 387.33 s [unordered-containers] valid: OK (0.03s)
  14572. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14573. 387.33 s [unordered-containers] adjust
  14574. 387.33 s [unordered-containers] model: OK (0.08s)
  14575. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14576. 387.33 s [unordered-containers] valid: OK (0.02s)
  14577. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14578. 387.33 s [unordered-containers] update
  14579. 387.33 s [unordered-containers] model: OK (0.04s)
  14580. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14581. 387.33 s [unordered-containers] valid: OK (0.04s)
  14582. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14583. 387.33 s [unordered-containers] alter
  14584. 387.33 s [unordered-containers] model: OK (0.08s)
  14585. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14586. 387.33 s [unordered-containers] valid: OK (0.01s)
  14587. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14588. 387.33 s [unordered-containers] alterF
  14589. 387.33 s [unordered-containers] model
  14590. 387.33 s [unordered-containers] []: OK (0.39s)
  14591. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14592. 387.33 s [unordered-containers] adjust: OK (0.05s)
  14593. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14594. 387.33 s [unordered-containers] insert: OK (0.03s)
  14595. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14596. 387.33 s [unordered-containers] insertWith: OK (0.05s)
  14597. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14598. 387.33 s [unordered-containers] delete: OK (0.04s)
  14599. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14600. 387.33 s [unordered-containers] lookup: OK (0.03s)
  14601. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14602. 387.33 s [unordered-containers] valid: OK (0.11s)
  14603. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14604. 387.33 s [unordered-containers] isSubmapOf
  14605. 387.33 s [unordered-containers] model: OK (0.10s)
  14606. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14607. 387.33 s [unordered-containers] m ⊆ m: OK (0.04s)
  14608. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14609. 387.33 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.09s)
  14610. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14611. 387.33 s [unordered-containers] m1\m2 ⊆ m1: OK (0.07s)
  14612. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14613. 387.33 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.07s)
  14614. 387.33 s [unordered-containers] +++ OK, passed 100 tests; 175 discarded.
  14615. 387.33 s [unordered-containers] delete k m ⊆ m: OK (0.12s)
  14616. 387.33 s [unordered-containers] +++ OK, passed 100 tests; 22 discarded.
  14617. 387.33 s [unordered-containers] m ⊈ delete k m : OK (0.05s)
  14618. 387.33 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  14619. 387.33 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.05s)
  14620. 387.33 s [unordered-containers] +++ OK, passed 100 tests; 8 discarded.
  14621. 387.33 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  14622. 387.33 s [unordered-containers] +++ OK, passed 100 tests; 5 discarded.
  14623. 387.33 s [unordered-containers] union
  14624. 387.33 s [unordered-containers] model: OK (0.05s)
  14625. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14626. 387.33 s [unordered-containers] valid: OK (0.02s)
  14627. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14628. 387.33 s [unordered-containers] unionWith
  14629. 387.33 s [unordered-containers] model: OK (0.20s)
  14630. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14631. 387.33 s [unordered-containers] valid: OK (0.08s)
  14632. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14633. 387.33 s [unordered-containers] unionWithKey
  14634. 387.33 s [unordered-containers] model: OK (0.44s)
  14635. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14636. 387.33 s [unordered-containers] valid: OK (0.06s)
  14637. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14638. 387.33 s [unordered-containers] unions
  14639. 387.33 s [unordered-containers] model: OK (2.04s)
  14640. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14641. 387.33 s [unordered-containers] valid: OK (1.05s)
  14642. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14643. 387.33 s [unordered-containers] difference
  14644. 387.33 s [unordered-containers] model: OK (0.13s)
  14645. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14646. 387.33 s [unordered-containers] valid: OK (0.11s)
  14647. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14648. 387.33 s [unordered-containers] differenceWith
  14649. 387.33 s [unordered-containers] model: OK (0.16s)
  14650. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14651. 387.33 s [unordered-containers] valid: OK (0.26s)
  14652. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14653. 387.33 s [unordered-containers] intersection
  14654. 387.33 s [unordered-containers] model: OK (0.04s)
  14655. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14656. 387.33 s [unordered-containers] valid: OK (0.07s)
  14657. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14658. 387.33 s [unordered-containers] intersectionWith
  14659. 387.33 s [unordered-containers] model: OK (0.08s)
  14660. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14661. 387.33 s [unordered-containers] valid: OK (0.13s)
  14662. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14663. 387.33 s [unordered-containers] intersectionWithKey
  14664. 387.33 s [unordered-containers] model: OK (0.44s)
  14665. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14666. 387.33 s [unordered-containers] valid: OK (0.26s)
  14667. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14668. 387.33 s [unordered-containers] compose
  14669. 387.33 s [unordered-containers] valid: OK (0.05s)
  14670. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14671. 387.33 s [unordered-containers] map
  14672. 387.33 s [unordered-containers] model: OK (0.26s)
  14673. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14674. 387.33 s [unordered-containers] valid: OK (0.11s)
  14675. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14676. 387.33 s [unordered-containers] traverseWithKey
  14677. 387.33 s [unordered-containers] model: OK (0.27s)
  14678. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14679. 387.33 s [unordered-containers] valid: OK (0.11s)
  14680. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14681. 387.33 s [unordered-containers] mapKeys
  14682. 387.33 s [unordered-containers] model: OK (0.06s)
  14683. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14684. 387.33 s [unordered-containers] valid: OK (0.96s)
  14685. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14686. 387.33 s [unordered-containers] foldr: OK (0.10s)
  14687. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14688. 387.33 s [unordered-containers] foldl: OK (0.07s)
  14689. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14690. 387.33 s [unordered-containers] foldrWithKey: OK (0.09s)
  14691. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14692. 387.33 s [unordered-containers] foldlWithKey: OK (0.04s)
  14693. 387.33 s [unordered-containers] +++ OK, passed 100 tests.
  14694. 387.33 s [unordered-containers] foldrWithKey': OK (0.06s)
  14695. 387.34 s [unordered-containers] +++ OK, passed 100 tests.
  14696. 387.34 s [unordered-containers] foldlWithKey': OK (0.05s)
  14697. 387.34 s [unordered-containers] +++ OK, passed 100 tests.
  14698. 387.34 s [unordered-containers] foldl': OK (0.04s)
  14699. 387.34 s [unordered-containers] +++ OK, passed 100 tests.
  14700. 387.34 s [unordered-containers] foldr': OK (0.02s)
  14701. 387.34 s [unordered-containers] +++ OK, passed 100 tests.
  14702. 387.34 s [unordered-containers] foldMapWithKey: OK (0.06s)
  14703. 387.34 s [unordered-containers] +++ OK, passed 100 tests.
  14704. 387.34 s [unordered-containers] filter
  14705. 387.34 s [unordered-containers] model: OK (0.21s)
  14706. 387.34 s [unordered-containers] +++ OK, passed 100 tests.
  14707. 387.34 s [unordered-containers] valid: OK (0.06s)
  14708. 387.34 s [unordered-containers] +++ OK, passed 100 tests.
  14709. 387.34 s [unordered-containers] filterWithKey
  14710. 387.41 s [unordered-containers] model: OK (1.80s)
  14711. 387.41 s [unordered-containers] +++ OK, passed 100 tests.
  14712. 387.41 s [unordered-containers] valid: OK (1.59s)
  14713. 387.41 s [unordered-containers] +++ OK, passed 100 tests.
  14714. 387.41 s [unordered-containers] mapMaybe
  14715. 387.41 s [unordered-containers] model: OK (0.22s)
  14716. 387.41 s [unordered-containers] +++ OK, passed 100 tests.
  14717. 387.41 s [unordered-containers] valid: OK (0.11s)
  14718. 387.41 s [unordered-containers] +++ OK, passed 100 tests.
  14719. 387.41 s [unordered-containers] mapMaybeWithKey
  14720. 387.44 s [unordered-containers] model: OK (1.76s)
  14721. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14722. 387.44 s [unordered-containers] valid: OK (1.55s)
  14723. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14724. 387.44 s [unordered-containers] elems: OK (0.16s)
  14725. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14726. 387.44 s [unordered-containers] keys: OK (0.05s)
  14727. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14728. 387.44 s [unordered-containers] fromList
  14729. 387.44 s [unordered-containers] model: OK (0.04s)
  14730. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14731. 387.44 s [unordered-containers] valid: OK (0.05s)
  14732. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14733. 387.44 s [unordered-containers] fromListWith
  14734. 387.44 s [unordered-containers] model: OK (0.04s)
  14735. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14736. 387.44 s [unordered-containers] valid: OK (0.13s)
  14737. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14738. 387.44 s [unordered-containers] fromListWithKey
  14739. 387.44 s [unordered-containers] model: OK (0.04s)
  14740. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14741. 387.44 s [unordered-containers] valid: OK (0.12s)
  14742. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14743. 387.44 s [unordered-containers] toList: OK (0.08s)
  14744. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14745. 387.44 s [unordered-containers] Data.HashSet
  14746. 387.44 s [unordered-containers] instances
  14747. 387.44 s [unordered-containers] Eq
  14748. 387.44 s [unordered-containers] ==: OK (0.06s)
  14749. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14750. 387.44 s [unordered-containers] == permutations: OK (0.07s)
  14751. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14752. 387.44 s [unordered-containers] /=: OK (0.07s)
  14753. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14754. 387.44 s [unordered-containers] Ord
  14755. 387.44 s [unordered-containers] compare reflexive: OK (0.03s)
  14756. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14757. 387.44 s [unordered-containers] compare transitive: OK (0.04s)
  14758. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14759. 387.44 s [unordered-containers] compare antisymmetric: OK (0.05s)
  14760. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14761. 387.44 s [unordered-containers] Ord => Eq: OK (0.02s)
  14762. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14763. 387.44 s [unordered-containers] Read/Show: OK (0.72s)
  14764. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14765. 387.44 s [unordered-containers] Foldable: OK (0.03s)
  14766. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14767. 387.44 s [unordered-containers] Hashable: OK (0.08s)
  14768. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14769. 387.44 s [unordered-containers] size: OK (0.04s)
  14770. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14771. 387.44 s [unordered-containers] member: OK (0.07s)
  14772. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14773. 387.44 s [unordered-containers] insert: OK (0.03s)
  14774. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14775. 387.44 s [unordered-containers] delete: OK (0.01s)
  14776. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14777. 387.44 s [unordered-containers] union: OK (0.12s)
  14778. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14779. 387.44 s [unordered-containers] map: OK (1.30s)
  14780. 387.44 s [unordered-containers] +++ OK, passed 100 tests.
  14781. 387.45 s [unordered-containers] foldr: OK (0.06s)
  14782. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14783. 387.45 s [unordered-containers] foldl': OK (0.05s)
  14784. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14785. 387.45 s [unordered-containers] filter: OK (1.19s)
  14786. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14787. 387.45 s [unordered-containers] toList: OK (0.06s)
  14788. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14789. 387.45 s [unordered-containers] Data.HashMap.Internal.List
  14790. 387.45 s [unordered-containers] isPermutationBy: OK (0.05s)
  14791. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14792. 387.45 s [unordered-containers] isPermutationBy of different length: OK (0.03s)
  14793. 387.45 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  14794. 387.45 s [unordered-containers] pUnorderedCompare: OK (0.13s)
  14795. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14796. 387.45 s [unordered-containers] modelUnorderedCompare
  14797. 387.45 s [unordered-containers] reflexive: OK (0.01s)
  14798. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14799. 387.45 s [unordered-containers] anti-symmetric: OK (0.01s)
  14800. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14801. 387.45 s [unordered-containers] transitive: OK (0.02s)
  14802. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14803. 387.45 s [unordered-containers] Regression tests
  14804. 387.45 s [unordered-containers] issue32: OK
  14805. 387.45 s [unordered-containers] issue39a: OK
  14806. 387.45 s [unordered-containers] issue39b: OK (0.04s)
  14807. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14808. 387.45 s [unordered-containers] issue254 lazy: OK (0.12s)
  14809. 387.45 s [unordered-containers] issue254 strict: OK (0.12s)
  14810. 387.45 s [unordered-containers] issue379
  14811. 387.45 s [unordered-containers] Lazy.unionWith: OK (0.07s)
  14812. 387.45 s [unordered-containers] union: OK
  14813. 387.45 s [unordered-containers] Strict.unionWith: OK
  14814. 387.45 s [unordered-containers] Strict.unionWithKey: OK (0.01s)
  14815. 387.45 s [unordered-containers] issue381
  14816. 387.45 s [unordered-containers] mapMaybe: OK
  14817. 387.45 s [unordered-containers] mapMaybeWithKey: OK
  14818. 387.45 s [unordered-containers] issue382: OK
  14819. 387.45 s [unordered-containers] issue383: OK
  14820. 387.45 s [unordered-containers] issue420: OK
  14821. 387.45 s [unordered-containers] issue491
  14822. 387.45 s [unordered-containers] 1: OK
  14823. 387.45 s [unordered-containers] 2: OK
  14824. 387.45 s [unordered-containers] 3: OK
  14825. 387.45 s [unordered-containers] Strictness
  14826. 387.45 s [unordered-containers] HashMap.Strict
  14827. 387.45 s [unordered-containers] singleton is key-strict: OK
  14828. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14829. 387.45 s [unordered-containers] singleton is value-strict: OK
  14830. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14831. 387.45 s [unordered-containers] member is key-strict: OK
  14832. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14833. 387.45 s [unordered-containers] lookup is key-strict: OK
  14834. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14835. 387.45 s [unordered-containers] lookupDefault is key-strict: OK (0.03s)
  14836. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14837. 387.45 s [unordered-containers] findWithDefault is key-strict: OK
  14838. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14839. 387.45 s [unordered-containers] ! is key-strict: OK
  14840. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14841. 387.45 s [unordered-containers] delete is key-strict: OK
  14842. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14843. 387.45 s [unordered-containers] adjust is key-strict: OK
  14844. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14845. 387.45 s [unordered-containers] adjust is value-strict: OK (0.05s)
  14846. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14847. 387.45 s [unordered-containers] insert is key-strict: OK
  14848. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14849. 387.45 s [unordered-containers] insert is value-strict: OK (0.02s)
  14850. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14851. 387.45 s [unordered-containers] insertWith is key-strict: OK (0.03s)
  14852. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14853. 387.45 s [unordered-containers] insertWith is value-strict: OK (0.06s)
  14854. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14855. 387.45 s [unordered-containers] fromList is key-strict: OK
  14856. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14857. 387.45 s [unordered-containers] fromList is value-strict: OK
  14858. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14859. 387.45 s [unordered-containers] fromListWith is key-strict: OK
  14860. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14861. 387.45 s [unordered-containers] fromListWith is value-strict: OK
  14862. 387.45 s [unordered-containers] +++ OK, passed 100 tests.
  14863. 387.45 s [unordered-containers]
  14864. 387.45 s [unordered-containers] All 257 tests passed (3.14s)
  14865. 387.46 s [unordered-containers] Test suite unordered-containers-tests: PASS
  14866. 387.46 s [unordered-containers] Test suite logged to:
  14867. 387.46 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  14868. 387.46 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  14869. 387.47 s [unordered-containers] Phase: haddockPhase
  14870. 387.67 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  14871. 387.67 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1...
  14872. 387.95 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14873. 387.95 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14874. 387.95 s [unordered-containers] |
  14875. 387.95 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14876. 387.95 s [unordered-containers] | ^^^^^^^^^^
  14877. 387.95 s [unordered-containers]
  14878. 388.14 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
  14879. 388.60 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14880. 388.60 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14881. 388.60 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14882. 388.60 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14883. 388.60 s [unordered-containers] |
  14884. 388.60 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14885. 388.60 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14886. 388.60 s [unordered-containers]
  14887. 388.62 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
  14888. 388.66 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
  14889. 390.06 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
  14890. 390.13 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
  14891. 390.32 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
  14892. 390.42 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
  14893. 390.43 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
  14894. 390.43 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
  14895. 390.44 s [unordered-containers] Haddock coverage:
  14896. 390.44 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  14897. 390.44 s [unordered-containers] Missing documentation for:
  14898. 390.44 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  14899. 390.44 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  14900. 390.44 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  14901. 390.44 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  14902. 390.44 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  14903. 390.44 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  14904. 390.44 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  14905. 390.44 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  14906. 390.44 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  14907. 390.44 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  14908. 390.44 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  14909. 390.44 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  14910. 390.44 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  14911. 390.44 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  14912. 390.44 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  14913. 390.44 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  14914. 390.44 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  14915. 390.44 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  14916. 390.44 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  14917. 390.44 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  14918. 390.44 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  14919. 390.44 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  14920. 390.44 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  14921. 390.44 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  14922. 390.44 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  14923. 390.44 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  14924. 390.44 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  14925. 390.44 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  14926. 390.44 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  14927. 390.44 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  14928. 390.44 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  14929. 390.44 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  14930. 390.44 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  14931. 390.44 s [unordered-containers] Missing documentation for:
  14932. 390.44 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  14933. 390.44 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  14934. 390.44 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  14935. 390.44 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  14936. 390.44 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  14937. 390.44 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  14938. 390.44 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14939. 390.44 s [unordered-containers] by specifying the type/value namespace explicitly.
  14940. 390.44 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  14941. 390.45 s [unordered-containers] Warning: 'at' is out of scope.
  14942. 390.45 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14943. 390.46 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  14944. 390.46 s [unordered-containers] Missing documentation for:
  14945. 390.46 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  14946. 390.46 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1859)
  14947. 390.46 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
  14948. 390.47 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:513)
  14949. 390.47 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:497)
  14950. 390.47 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:680)
  14951. 390.47 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  14952. 390.47 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:662)
  14953. 390.47 s [unordered-containers] insert' (Data/HashMap/Internal.hs:808)
  14954. 390.47 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1126)
  14955. 390.47 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:850)
  14956. 390.47 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:885)
  14957. 390.47 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  14958. 390.47 s [unordered-containers] Missing documentation for:
  14959. 390.47 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  14960. 390.47 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  14961. 390.47 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  14962. 390.47 s [unordered-containers] Warning: 'lookup' is out of scope.
  14963. 390.47 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14964. 390.47 s [unordered-containers] Warning: 'at' is out of scope.
  14965. 390.47 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14966. 390.48 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  14967. 390.48 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  14968. 390.48 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  14969. 390.48 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  14970. 390.48 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14971. 390.48 s [unordered-containers] by specifying the type/value namespace explicitly.
  14972. 390.48 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  14973. 390.48 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  14974. 390.49 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  14975. 390.49 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  14976. 390.49 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  14977. 390.49 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14978. 390.49 s [unordered-containers] by specifying the type/value namespace explicitly.
  14979. 390.49 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  14980. 390.49 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  14981. 390.49 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  14982. 390.49 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  14983. 397.71 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
  14984. 397.71 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  14985. 397.79 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  14986. 397.80 s [unordered-containers] Phase: installPhase
  14987. 397.89 s [unordered-containers] Installing library in /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  14988. 398.33 s [unordered-containers] Phase: fixupPhase
  14989. 398.35 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1
  14990. 398.36 s [unordered-containers] shrinking /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSunordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq-ghc9.10.3.so
  14991. 398.37 s [unordered-containers] checking for references to /build/ in /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1...
  14992. 398.39 s [unordered-containers] patching script interpreter paths in /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1
  14993. 398.40 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1/lib
  14994. 398.54 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc
  14995. 398.55 s [unordered-containers] checking for references to /build/ in /nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc...
  14996. 398.58 s [unordered-containers] patching script interpreter paths in /nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc
  14997. 398.70 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1 /nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc
  14998. 399.22 s [unordered-containers:post-build] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  14999. 399.22 s [unordered-containers:post-build]
  15000. 399.57 s [unordered-containers:post-build] Pushing /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1 (9.33 MiB)
  15001. 399.66 s [unordered-containers:post-build] Pushing /nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc (4.46 MiB)
  15002. 400.67 s [unordered-containers:post-build]
  15003. 400.67 s [unordered-containers:post-build] All done.
  15004. 400.70 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1 /nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc
  15005. 400.76 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15006. 401.02 s [unordered-containers:post-build] copying 2 paths...
  15007. 401.02 s [unordered-containers:post-build] copying path '/nix/store/gnbapz2xj9c6s80ij0g93c0h9rhvjrhn-unordered-containers-0.2.20.1-doc' to 'https://cache.nix-ci.com'...
  15008. 401.60 s [unordered-containers:post-build] copying path '/nix/store/aizm4kx473gkmycvya3rfmibcxn8zzal-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  15009. 404.06 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15010. 404.30 s [unordered-containers:post-build] copying 1 paths...
  15011. 404.35 s [unordered-containers:post-build] copying path '/nix/store/924f0jc8vckgh1byfg683lax1s9a3yn1-unordered-containers-0.2.20.1.drv' to 'https://cache.nix-ci.com'...
  15012. 404.54 s Progress: 7 of 15 built, 36 of 36 downloaded from cache
  15013. 404.57 s Building /nix/store/nzdj8v73vqbrcsb7iarjbb0y5nmfgn9b-quickcheck-instances-0.3.33.drv
  15014. 404.71 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  15015. 404.71 s [quickcheck-instances] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  15016. 404.89 s [quickcheck-instances] Phase: unpackPhase
  15017. 404.90 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  15018. 404.91 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  15019. 404.91 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  15020. 404.92 s [quickcheck-instances] Phase: patchPhase
  15021. 404.92 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  15022. 404.93 s [quickcheck-instances] Phase: compileBuildDriverPhase
  15023. 404.93 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.ZZkaCt9oGW/setup-package.conf.d -threaded
  15024. 405.00 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.ZZkaCt9oGW/Main.o )
  15025. 405.06 s [quickcheck-instances] [2 of 2] Linking Setup
  15026. 406.47 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  15027. 406.48 s [quickcheck-instances] Phase: configurePhase
  15028. 406.49 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.ZZkaCt9oGW/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  15029. 406.50 s [quickcheck-instances] Using Parsec parser
  15030. 406.50 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  15031. 407.10 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  15032. 407.10 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  15033. 407.10 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  15034. 407.10 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.20.2.0
  15035. 407.10 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.2.0
  15036. 407.11 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  15037. 407.11 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.7
  15038. 407.11 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  15039. 407.11 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
  15040. 407.11 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  15041. 407.11 s [quickcheck-instances] integer-logarithms-1.0.4
  15042. 407.11 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  15043. 407.11 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  15044. 407.11 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  15045. 407.11 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  15046. 407.11 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  15047. 407.11 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  15048. 407.11 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.3
  15049. 407.11 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  15050. 407.11 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  15051. 407.11 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  15052. 407.11 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.1
  15053. 407.11 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  15054. 407.11 s [quickcheck-instances] unordered-containers-0.2.20.1
  15055. 407.11 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  15056. 407.11 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  15057. 407.11 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  15058. 407.11 s [quickcheck-instances] Dependency base: using base-4.20.2.0
  15059. 407.11 s [quickcheck-instances] Dependency containers: using containers-0.7
  15060. 407.11 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  15061. 407.11 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  15062. 407.11 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  15063. 407.11 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  15064. 407.11 s [quickcheck-instances] Source component graph:
  15065. 407.11 s [quickcheck-instances] component lib
  15066. 407.11 s [quickcheck-instances] component test:self-test dependency lib
  15067. 407.11 s [quickcheck-instances] Configured component graph:
  15068. 407.11 s [quickcheck-instances] component quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15069. 407.11 s [quickcheck-instances] include OneTuple-0.4.2-GRtegyTHdcp8cc3WBaYWdG
  15070. 407.11 s [quickcheck-instances] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15071. 407.11 s [quickcheck-instances] include array-0.5.8.0-68f3
  15072. 407.11 s [quickcheck-instances] include base-4.20.2.0-64da
  15073. 407.11 s [quickcheck-instances] include bytestring-0.12.2.0-262e
  15074. 407.11 s [quickcheck-instances] include case-insensitive-1.2.1.0-C41e1ocD1IuGyG9IKrgA8Z
  15075. 407.11 s [quickcheck-instances] include containers-0.7-504a
  15076. 407.11 s [quickcheck-instances] include data-fix-0.3.4-Ity9RnZlpNYBToUDyG6f10
  15077. 407.11 s [quickcheck-instances] include hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  15078. 407.11 s [quickcheck-instances] include integer-logarithms-1.0.4-H7Rfid5I6Ecy5a2peKb9I
  15079. 407.11 s [quickcheck-instances] include old-time-1.1.0.4-LamKvQxcXvGIaPGAUxqrFE
  15080. 407.11 s [quickcheck-instances] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  15081. 407.11 s [quickcheck-instances] include scientific-0.3.8.0-208EAotcHKuKK3a0uMgoFR
  15082. 407.11 s [quickcheck-instances] include splitmix-0.1.3.1-5QjYMYUxA5CmrSLc1zIZY
  15083. 407.11 s [quickcheck-instances] include strict-0.5.1-34kyIfF1hqWEKGfMyT7By0
  15084. 407.11 s [quickcheck-instances] include tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  15085. 407.11 s [quickcheck-instances] include text-2.1.3-c691
  15086. 407.11 s [quickcheck-instances] include text-short-0.1.6-8mYoeU8VnAzKZcCnBOoo5y
  15087. 407.11 s [quickcheck-instances] include these-1.2.1-9ZdFnb52yDo6MFOrFYcqPa
  15088. 407.11 s [quickcheck-instances] include time-compat-1.9.8-741uIWoYvbfKIgMssLvXzT
  15089. 407.11 s [quickcheck-instances] include transformers-0.6.1.1-6a26
  15090. 407.11 s [quickcheck-instances] include unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  15091. 407.11 s [quickcheck-instances] include uuid-types-1.0.6-8nkYmL0K8Y3HTguibVst46
  15092. 407.11 s [quickcheck-instances] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  15093. 407.11 s [quickcheck-instances] component quickcheck-instances-0.3.33-4Np47pFNrQdBiRgwYkf2Vq-self-test
  15094. 407.11 s [quickcheck-instances] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15095. 407.11 s [quickcheck-instances] include base-4.20.2.0-64da
  15096. 407.11 s [quickcheck-instances] include containers-0.7-504a
  15097. 407.11 s [quickcheck-instances] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  15098. 407.11 s [quickcheck-instances] include quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15099. 407.11 s [quickcheck-instances] include tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  15100. 407.11 s [quickcheck-instances] include uuid-types-1.0.6-8nkYmL0K8Y3HTguibVst46
  15101. 407.11 s [quickcheck-instances] Linked component graph:
  15102. 407.11 s [quickcheck-instances] unit quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15103. 407.11 s [quickcheck-instances] include OneTuple-0.4.2-GRtegyTHdcp8cc3WBaYWdG
  15104. 407.11 s [quickcheck-instances] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15105. 407.11 s [quickcheck-instances] include array-0.5.8.0-68f3
  15106. 407.11 s [quickcheck-instances] include base-4.20.2.0-64da
  15107. 407.11 s [quickcheck-instances] include bytestring-0.12.2.0-262e
  15108. 407.11 s [quickcheck-instances] include case-insensitive-1.2.1.0-C41e1ocD1IuGyG9IKrgA8Z
  15109. 407.11 s [quickcheck-instances] include containers-0.7-504a
  15110. 407.11 s [quickcheck-instances] include data-fix-0.3.4-Ity9RnZlpNYBToUDyG6f10
  15111. 407.11 s [quickcheck-instances] include hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  15112. 407.11 s [quickcheck-instances] include integer-logarithms-1.0.4-H7Rfid5I6Ecy5a2peKb9I
  15113. 407.11 s [quickcheck-instances] include old-time-1.1.0.4-LamKvQxcXvGIaPGAUxqrFE
  15114. 407.11 s [quickcheck-instances] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  15115. 407.11 s [quickcheck-instances] include scientific-0.3.8.0-208EAotcHKuKK3a0uMgoFR
  15116. 407.11 s [quickcheck-instances] include splitmix-0.1.3.1-5QjYMYUxA5CmrSLc1zIZY
  15117. 407.11 s [quickcheck-instances] include strict-0.5.1-34kyIfF1hqWEKGfMyT7By0
  15118. 407.11 s [quickcheck-instances] include tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  15119. 407.11 s [quickcheck-instances] include text-2.1.3-c691
  15120. 407.11 s [quickcheck-instances] include text-short-0.1.6-8mYoeU8VnAzKZcCnBOoo5y
  15121. 407.11 s [quickcheck-instances] include these-1.2.1-9ZdFnb52yDo6MFOrFYcqPa
  15122. 407.11 s [quickcheck-instances] include time-compat-1.9.8-741uIWoYvbfKIgMssLvXzT
  15123. 407.11 s [quickcheck-instances] include transformers-0.6.1.1-6a26
  15124. 407.11 s [quickcheck-instances] include unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  15125. 407.11 s [quickcheck-instances] include uuid-types-1.0.6-8nkYmL0K8Y3HTguibVst46
  15126. 407.11 s [quickcheck-instances] include vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  15127. 407.11 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq:Test.QuickCheck.Instances.Void
  15128. 407.11 s [quickcheck-instances] unit quickcheck-instances-0.3.33-4Np47pFNrQdBiRgwYkf2Vq-self-test
  15129. 407.11 s [quickcheck-instances] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15130. 407.12 s [quickcheck-instances] include base-4.20.2.0-64da
  15131. 407.12 s [quickcheck-instances] include containers-0.7-504a
  15132. 407.12 s [quickcheck-instances] include primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  15133. 407.12 s [quickcheck-instances] include quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15134. 407.12 s [quickcheck-instances] include tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  15135. 407.12 s [quickcheck-instances] include uuid-types-1.0.6-8nkYmL0K8Y3HTguibVst46
  15136. 407.12 s [quickcheck-instances] Ready component graph:
  15137. 407.12 s [quickcheck-instances] definite quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15138. 407.12 s [quickcheck-instances] depends OneTuple-0.4.2-GRtegyTHdcp8cc3WBaYWdG
  15139. 407.12 s [quickcheck-instances] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15140. 407.12 s [quickcheck-instances] depends array-0.5.8.0-68f3
  15141. 407.12 s [quickcheck-instances] depends base-4.20.2.0-64da
  15142. 407.12 s [quickcheck-instances] depends bytestring-0.12.2.0-262e
  15143. 407.12 s [quickcheck-instances] depends case-insensitive-1.2.1.0-C41e1ocD1IuGyG9IKrgA8Z
  15144. 407.12 s [quickcheck-instances] depends containers-0.7-504a
  15145. 407.12 s [quickcheck-instances] depends data-fix-0.3.4-Ity9RnZlpNYBToUDyG6f10
  15146. 407.12 s [quickcheck-instances] depends hashable-1.5.0.0-HOT2SU7kjP9HxgwMjYLBlH
  15147. 407.12 s [quickcheck-instances] depends integer-logarithms-1.0.4-H7Rfid5I6Ecy5a2peKb9I
  15148. 407.12 s [quickcheck-instances] depends old-time-1.1.0.4-LamKvQxcXvGIaPGAUxqrFE
  15149. 407.12 s [quickcheck-instances] depends primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  15150. 407.12 s [quickcheck-instances] depends scientific-0.3.8.0-208EAotcHKuKK3a0uMgoFR
  15151. 407.12 s [quickcheck-instances] depends splitmix-0.1.3.1-5QjYMYUxA5CmrSLc1zIZY
  15152. 407.12 s [quickcheck-instances] depends strict-0.5.1-34kyIfF1hqWEKGfMyT7By0
  15153. 407.12 s [quickcheck-instances] depends tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  15154. 407.12 s [quickcheck-instances] depends text-2.1.3-c691
  15155. 407.12 s [quickcheck-instances] depends text-short-0.1.6-8mYoeU8VnAzKZcCnBOoo5y
  15156. 407.12 s [quickcheck-instances] depends these-1.2.1-9ZdFnb52yDo6MFOrFYcqPa
  15157. 407.12 s [quickcheck-instances] depends time-compat-1.9.8-741uIWoYvbfKIgMssLvXzT
  15158. 407.12 s [quickcheck-instances] depends transformers-0.6.1.1-6a26
  15159. 407.12 s [quickcheck-instances] depends unordered-containers-0.2.20.1-Hyybquf0Bcb9PKX3IZT0vq
  15160. 407.12 s [quickcheck-instances] depends uuid-types-1.0.6-8nkYmL0K8Y3HTguibVst46
  15161. 407.12 s [quickcheck-instances] depends vector-0.13.2.0-GDUCoiHhVuq2SKPTzzTr3a
  15162. 407.12 s [quickcheck-instances] definite quickcheck-instances-0.3.33-4Np47pFNrQdBiRgwYkf2Vq-self-test
  15163. 407.12 s [quickcheck-instances] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15164. 407.12 s [quickcheck-instances] depends base-4.20.2.0-64da
  15165. 407.12 s [quickcheck-instances] depends containers-0.7-504a
  15166. 407.12 s [quickcheck-instances] depends primitive-0.9.1.0-AmfBaMNeb29tXqBxzqSe7
  15167. 407.12 s [quickcheck-instances] depends quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15168. 407.12 s [quickcheck-instances] depends tagged-0.8.9-2lRcSwpaJI2Fr2hjnfc0dc
  15169. 407.12 s [quickcheck-instances] depends uuid-types-1.0.6-8nkYmL0K8Y3HTguibVst46
  15170. 407.12 s [quickcheck-instances] Using Cabal-3.12.1.0 compiled by ghc-9.10
  15171. 407.12 s [quickcheck-instances] Using compiler: ghc-9.10.3
  15172. 407.12 s [quickcheck-instances] Using install prefix:
  15173. 407.12 s [quickcheck-instances] /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33
  15174. 407.12 s [quickcheck-instances] Executables installed in:
  15175. 407.12 s [quickcheck-instances] /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/bin
  15176. 407.12 s [quickcheck-instances] Libraries installed in:
  15177. 407.12 s [quickcheck-instances] /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15178. 407.12 s [quickcheck-instances] Dynamic Libraries installed in:
  15179. 407.12 s [quickcheck-instances] /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  15180. 407.12 s [quickcheck-instances] Private executables installed in:
  15181. 407.12 s [quickcheck-instances] /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.10.3-05f6/quickcheck-instances-0.3.33
  15182. 407.12 s [quickcheck-instances] Data files installed in:
  15183. 407.12 s [quickcheck-instances] /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.10.3-05f6/quickcheck-instances-0.3.33
  15184. 407.12 s [quickcheck-instances] Documentation installed in:
  15185. 407.12 s [quickcheck-instances] /nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  15186. 407.12 s [quickcheck-instances] Configuration files installed in:
  15187. 407.12 s [quickcheck-instances] /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/etc
  15188. 407.12 s [quickcheck-instances] No alex found
  15189. 407.12 s [quickcheck-instances] Using ar found on system at:
  15190. 407.12 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  15191. 407.12 s [quickcheck-instances] No c2hs found
  15192. 407.12 s [quickcheck-instances] No cpphs found
  15193. 407.12 s [quickcheck-instances] No doctest found
  15194. 407.12 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  15195. 407.12 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  15196. 407.12 s [quickcheck-instances] Using ghc version 9.10.3 found on system at:
  15197. 407.12 s [quickcheck-instances] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  15198. 407.12 s [quickcheck-instances] Using ghc-pkg version 9.10.3 found on system at:
  15199. 407.12 s [quickcheck-instances] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  15200. 407.12 s [quickcheck-instances] No ghcjs found
  15201. 407.12 s [quickcheck-instances] No ghcjs-pkg found
  15202. 407.12 s [quickcheck-instances] No greencard found
  15203. 407.12 s [quickcheck-instances] Using haddock version 2.31.1 found on system at:
  15204. 407.12 s [quickcheck-instances] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  15205. 407.12 s [quickcheck-instances] No happy found
  15206. 407.12 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  15207. 407.12 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  15208. 407.12 s [quickcheck-instances] No hmake found
  15209. 407.12 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  15210. 407.12 s [quickcheck-instances] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  15211. 407.12 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  15212. 407.12 s [quickcheck-instances] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  15213. 407.12 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  15214. 407.12 s [quickcheck-instances] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  15215. 407.12 s [quickcheck-instances] No jhc found
  15216. 407.12 s [quickcheck-instances] Using ld found on system at:
  15217. 407.12 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  15218. 407.12 s [quickcheck-instances] No pkg-config found
  15219. 407.12 s [quickcheck-instances] Using runghc version 9.10.3 found on system at:
  15220. 407.12 s [quickcheck-instances] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  15221. 407.12 s [quickcheck-instances] Using strip version 2.44 found on system at:
  15222. 407.12 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  15223. 407.12 s [quickcheck-instances] Using tar found on system at:
  15224. 407.12 s [quickcheck-instances] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  15225. 407.12 s [quickcheck-instances] No uhc found
  15226. 407.34 s [quickcheck-instances] Phase: buildPhase
  15227. 407.39 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  15228. 407.40 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33...
  15229. 407.51 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 )
  15230. 407.55 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 )
  15231. 407.56 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 )
  15232. 407.82 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 )
  15233. 407.83 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 )
  15234. 408.09 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 )
  15235. 408.09 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 )
  15236. 408.09 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 )
  15237. 408.09 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 )
  15238. 408.09 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 )
  15239. 408.09 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 )
  15240. 408.09 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 )
  15241. 408.09 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 )
  15242. 408.10 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 )
  15243. 408.10 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 )
  15244. 408.27 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 )
  15245. 408.27 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 )
  15246. 408.27 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 )
  15247. 408.27 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 )
  15248. 408.27 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 )
  15249. 408.57 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 )
  15250. 408.57 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 )
  15251. 408.57 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 )
  15252. 408.57 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 )
  15253. 408.57 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 )
  15254. 408.57 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 )
  15255. 408.91 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 )
  15256. 409.05 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 )
  15257. 409.08 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 )
  15258. 409.54 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 )
  15259. 409.64 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 )
  15260. 409.96 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 )
  15261. 409.96 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 )
  15262. 409.96 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 )
  15263. 409.96 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 )
  15264. 410.01 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 )
  15265. 410.01 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 )
  15266. 410.01 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 )
  15267. 410.01 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 )
  15268. 410.01 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 )
  15269. 410.01 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 )
  15270. 410.01 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 )
  15271. 410.01 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 )
  15272. 410.01 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 )
  15273. 410.01 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 )
  15274. 410.08 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 )
  15275. 410.45 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 )
  15276. 410.45 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 )
  15277. 410.45 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 )
  15278. 410.45 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 )
  15279. 410.45 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 )
  15280. 410.45 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  15281. 412.01 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  15282. 412.01 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33...
  15283. 412.08 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  15284. 412.32 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  15285. 413.04 s [quickcheck-instances] Phase: checkPhase
  15286. 413.25 s [quickcheck-instances] Running 1 test suites...
  15287. 413.25 s [quickcheck-instances] Test suite self-test: RUNNING...
  15288. 413.26 s [quickcheck-instances] +++ OK, passed 100 tests.
  15289. 413.26 s [quickcheck-instances] +++ OK, passed 100 tests.
  15290. 413.26 s [quickcheck-instances] +++ OK, passed 100 tests.
  15291. 413.26 s [quickcheck-instances] +++ OK, passed 100 tests.
  15292. 413.26 s [quickcheck-instances] +++ OK, passed 100 tests.
  15293. 413.26 s [quickcheck-instances] Test suite self-test: PASS
  15294. 413.26 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  15295. 413.26 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  15296. 413.27 s [quickcheck-instances] Phase: haddockPhase
  15297. 413.39 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  15298. 413.39 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33...
  15299. 413.39 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  15300. 413.39 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  15301. 413.61 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
  15302. 413.62 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
  15303. 413.64 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
  15304. 413.74 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
  15305. 413.77 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
  15306. 413.80 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
  15307. 413.81 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
  15308. 413.82 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
  15309. 413.82 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
  15310. 413.85 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
  15311. 413.97 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
  15312. 413.98 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
  15313. 413.98 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
  15314. 414.00 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
  15315. 414.01 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
  15316. 414.04 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
  15317. 414.08 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
  15318. 414.09 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
  15319. 414.09 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
  15320. 414.11 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
  15321. 414.18 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
  15322. 414.20 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
  15323. 414.20 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
  15324. 414.22 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
  15325. 414.38 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
  15326. 414.39 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
  15327. 414.39 s [quickcheck-instances] Haddock coverage:
  15328. 414.39 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  15329. 414.39 s [quickcheck-instances] Missing documentation for:
  15330. 414.39 s [quickcheck-instances] Module header
  15331. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  15332. 414.40 s [quickcheck-instances] Missing documentation for:
  15333. 414.40 s [quickcheck-instances] Module header
  15334. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  15335. 414.40 s [quickcheck-instances] Missing documentation for:
  15336. 414.40 s [quickcheck-instances] Module header
  15337. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  15338. 414.40 s [quickcheck-instances] Missing documentation for:
  15339. 414.40 s [quickcheck-instances] Module header
  15340. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  15341. 414.40 s [quickcheck-instances] Missing documentation for:
  15342. 414.40 s [quickcheck-instances] Module header
  15343. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  15344. 414.40 s [quickcheck-instances] Missing documentation for:
  15345. 414.40 s [quickcheck-instances] Module header
  15346. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  15347. 414.40 s [quickcheck-instances] Missing documentation for:
  15348. 414.40 s [quickcheck-instances] Module header
  15349. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  15350. 414.40 s [quickcheck-instances] Missing documentation for:
  15351. 414.40 s [quickcheck-instances] Module header
  15352. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  15353. 414.40 s [quickcheck-instances] Missing documentation for:
  15354. 414.40 s [quickcheck-instances] Module header
  15355. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  15356. 414.40 s [quickcheck-instances] Missing documentation for:
  15357. 414.40 s [quickcheck-instances] Module header
  15358. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  15359. 414.40 s [quickcheck-instances] Missing documentation for:
  15360. 414.40 s [quickcheck-instances] Module header
  15361. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  15362. 414.40 s [quickcheck-instances] Missing documentation for:
  15363. 414.40 s [quickcheck-instances] Module header
  15364. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  15365. 414.40 s [quickcheck-instances] Missing documentation for:
  15366. 414.40 s [quickcheck-instances] Module header
  15367. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  15368. 414.40 s [quickcheck-instances] Missing documentation for:
  15369. 414.40 s [quickcheck-instances] Module header
  15370. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  15371. 414.40 s [quickcheck-instances] Missing documentation for:
  15372. 414.40 s [quickcheck-instances] Module header
  15373. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  15374. 414.40 s [quickcheck-instances] Missing documentation for:
  15375. 414.40 s [quickcheck-instances] Module header
  15376. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  15377. 414.40 s [quickcheck-instances] Missing documentation for:
  15378. 414.40 s [quickcheck-instances] Module header
  15379. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  15380. 414.40 s [quickcheck-instances] Missing documentation for:
  15381. 414.40 s [quickcheck-instances] Module header
  15382. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  15383. 414.40 s [quickcheck-instances] Missing documentation for:
  15384. 414.40 s [quickcheck-instances] Module header
  15385. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  15386. 414.40 s [quickcheck-instances] Missing documentation for:
  15387. 414.40 s [quickcheck-instances] Module header
  15388. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  15389. 414.40 s [quickcheck-instances] Missing documentation for:
  15390. 414.40 s [quickcheck-instances] Module header
  15391. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  15392. 414.40 s [quickcheck-instances] Missing documentation for:
  15393. 414.40 s [quickcheck-instances] Module header
  15394. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  15395. 414.40 s [quickcheck-instances] Missing documentation for:
  15396. 414.40 s [quickcheck-instances] Module header
  15397. 414.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  15398. 414.40 s [quickcheck-instances] Missing documentation for:
  15399. 414.40 s [quickcheck-instances] Module header
  15400. 414.40 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  15401. 415.01 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  15402. 415.10 s [quickcheck-instances] - Data.Vector.Vector
  15403. 415.10 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  15404. 415.10 s [quickcheck-instances] - Data.Vector.Storable.Vector
  15405. 415.10 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  15406. 415.10 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  15407. 415.10 s [quickcheck-instances] - Data.Vector.Strict.Vector
  15408. 420.05 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
  15409. 420.05 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  15410. 420.10 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  15411. 420.11 s [quickcheck-instances] Phase: installPhase
  15412. 420.16 s [quickcheck-instances] Installing library in /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15413. 420.63 s [quickcheck-instances] Phase: fixupPhase
  15414. 420.64 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33
  15415. 420.66 s [quickcheck-instances] shrinking /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSquickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq-ghc9.10.3.so
  15416. 420.67 s [quickcheck-instances] checking for references to /build/ in /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33...
  15417. 420.71 s [quickcheck-instances] patching script interpreter paths in /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33
  15418. 420.71 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33/lib
  15419. 420.84 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc
  15420. 420.85 s [quickcheck-instances] checking for references to /build/ in /nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc...
  15421. 420.87 s [quickcheck-instances] patching script interpreter paths in /nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc
  15422. 420.99 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33
  15423. 421.50 s [quickcheck-instances:post-build] Pushing 2 paths (132 are already present) using zstd to cache sellout ⏳
  15424. 421.50 s [quickcheck-instances:post-build]
  15425. 421.89 s [quickcheck-instances:post-build] Pushing /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33 (5.51 MiB)
  15426. 422.01 s [quickcheck-instances:post-build] Pushing /nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc (1.51 MiB)
  15427. 423.07 s [quickcheck-instances:post-build]
  15428. 423.07 s [quickcheck-instances:post-build] All done.
  15429. 423.10 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc /nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33
  15430. 423.17 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15431. 423.39 s [quickcheck-instances:post-build] copying 2 paths...
  15432. 423.39 s [quickcheck-instances:post-build] copying path '/nix/store/75k390wr0mq0bpy8yzhnip847n5qjcf3-quickcheck-instances-0.3.33-doc' to 'https://cache.nix-ci.com'...
  15433. 423.88 s [quickcheck-instances:post-build] copying path '/nix/store/dbl3a9f5zgabfbaq17ahkh8px3pq0hnd-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  15434. 425.75 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15435. 426.06 s [quickcheck-instances:post-build] copying 1 paths...
  15436. 426.10 s [quickcheck-instances:post-build] copying path '/nix/store/nzdj8v73vqbrcsb7iarjbb0y5nmfgn9b-quickcheck-instances-0.3.33.drv' to 'https://cache.nix-ci.com'...
  15437. 426.31 s Progress: 8 of 15 built, 36 of 36 downloaded from cache
  15438. 426.36 s Building /nix/store/bz161fnf57cqvgzf0f4j7qs4pl5dmgs5-extra-1.8.1.drv
  15439. 426.51 s [extra] Phase: setupCompilerEnvironmentPhase
  15440. 426.51 s [extra] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  15441. 426.74 s [extra] Phase: unpackPhase
  15442. 426.74 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  15443. 426.75 s [extra] source root is extra-1.8.1
  15444. 426.76 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  15445. 426.76 s [extra] Phase: patchPhase
  15446. 426.77 s [extra] Phase: compileBuildDriverPhase
  15447. 426.78 s [extra] setupCompileFlags: -package-db=/build/tmp.7jZoD807IN/setup-package.conf.d -threaded
  15448. 426.85 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.7jZoD807IN/Main.o )
  15449. 426.93 s [extra] [2 of 2] Linking Setup
  15450. 428.52 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  15451. 428.53 s [extra] Phase: configurePhase
  15452. 428.54 s [extra] configureFlags: --verbose --prefix=/nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.7jZoD807IN/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  15453. 428.54 s [extra] Using Parsec parser
  15454. 428.54 s [extra] Configuring extra-1.8.1...
  15455. 429.22 s [extra] Dependency base >=4.9 && <5: using base-4.20.2.0
  15456. 429.22 s [extra] Dependency clock >=0.7: using clock-0.8.4
  15457. 429.22 s [extra] Dependency directory: using directory-1.3.8.5
  15458. 429.22 s [extra] Dependency filepath: using filepath-1.5.4.0
  15459. 429.22 s [extra] Dependency process: using process-1.6.26.1
  15460. 429.22 s [extra] Dependency time: using time-1.12.2
  15461. 429.22 s [extra] Dependency unix: using unix-2.8.7.0
  15462. 429.22 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  15463. 429.22 s [extra] Dependency base >=4 && <5: using base-4.20.2.0
  15464. 429.22 s [extra] Dependency directory: using directory-1.3.8.5
  15465. 429.22 s [extra] Dependency extra: using extra-1.8.1
  15466. 429.22 s [extra] Dependency filepath: using filepath-1.5.4.0
  15467. 429.22 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  15468. 429.22 s [extra] Dependency unix: using unix-2.8.7.0
  15469. 429.22 s [extra] Source component graph:
  15470. 429.22 s [extra] component lib
  15471. 429.22 s [extra] component test:extra-test dependency lib
  15472. 429.22 s [extra] Configured component graph:
  15473. 429.22 s [extra] component extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  15474. 429.22 s [extra] include base-4.20.2.0-64da
  15475. 429.22 s [extra] include clock-0.8.4-DESOrX5zfVt4al9hSRThI9
  15476. 429.22 s [extra] include directory-1.3.8.5-c84a
  15477. 429.22 s [extra] include filepath-1.5.4.0-e600
  15478. 429.22 s [extra] include process-1.6.26.1-ccf0
  15479. 429.22 s [extra] include time-1.12.2-652a
  15480. 429.22 s [extra] include unix-2.8.7.0-da6a
  15481. 429.22 s [extra] component extra-1.8.1-7HOE6hcxmLi39jdFVDdKEp-extra-test
  15482. 429.22 s [extra] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15483. 429.22 s [extra] include base-4.20.2.0-64da
  15484. 429.22 s [extra] include directory-1.3.8.5-c84a
  15485. 429.22 s [extra] include extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  15486. 429.22 s [extra] include filepath-1.5.4.0-e600
  15487. 429.22 s [extra] include quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15488. 429.22 s [extra] include unix-2.8.7.0-da6a
  15489. 429.22 s [extra] Linked component graph:
  15490. 429.22 s [extra] unit extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  15491. 429.22 s [extra] include base-4.20.2.0-64da
  15492. 429.22 s [extra] include clock-0.8.4-DESOrX5zfVt4al9hSRThI9
  15493. 429.22 s [extra] include directory-1.3.8.5-c84a
  15494. 429.22 s [extra] include filepath-1.5.4.0-e600
  15495. 429.22 s [extra] include process-1.6.26.1-ccf0
  15496. 429.22 s [extra] include time-1.12.2-652a
  15497. 429.22 s [extra] include unix-2.8.7.0-da6a
  15498. 429.22 s [extra] Control.Concurrent.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Data.Version.Extra,Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Extra,Numeric.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Numeric.Extra,System.Directory.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:System.Environment.Extra,System.IO.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:System.IO.Extra,System.Info.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:System.Info.Extra,System.Process.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:System.Process.Extra,System.Time.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:System.Time.Extra,Text.Read.Extra=extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1:Text.Read.Extra
  15499. 429.22 s [extra] unit extra-1.8.1-7HOE6hcxmLi39jdFVDdKEp-extra-test
  15500. 429.22 s [extra] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15501. 429.22 s [extra] include base-4.20.2.0-64da
  15502. 429.22 s [extra] include directory-1.3.8.5-c84a
  15503. 429.22 s [extra] include extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  15504. 429.22 s [extra] include filepath-1.5.4.0-e600
  15505. 429.22 s [extra] include quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15506. 429.22 s [extra] include unix-2.8.7.0-da6a
  15507. 429.22 s [extra] Ready component graph:
  15508. 429.22 s [extra] definite extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  15509. 429.22 s [extra] depends base-4.20.2.0-64da
  15510. 429.22 s [extra] depends clock-0.8.4-DESOrX5zfVt4al9hSRThI9
  15511. 429.22 s [extra] depends directory-1.3.8.5-c84a
  15512. 429.22 s [extra] depends filepath-1.5.4.0-e600
  15513. 429.22 s [extra] depends process-1.6.26.1-ccf0
  15514. 429.22 s [extra] depends time-1.12.2-652a
  15515. 429.22 s [extra] depends unix-2.8.7.0-da6a
  15516. 429.22 s [extra] definite extra-1.8.1-7HOE6hcxmLi39jdFVDdKEp-extra-test
  15517. 429.22 s [extra] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  15518. 429.22 s [extra] depends base-4.20.2.0-64da
  15519. 429.22 s [extra] depends directory-1.3.8.5-c84a
  15520. 429.22 s [extra] depends extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  15521. 429.22 s [extra] depends filepath-1.5.4.0-e600
  15522. 429.22 s [extra] depends quickcheck-instances-0.3.33-ANU7t7jSxnjFPvTf69Etqq
  15523. 429.22 s [extra] depends unix-2.8.7.0-da6a
  15524. 429.22 s [extra] Using Cabal-3.12.1.0 compiled by ghc-9.10
  15525. 429.22 s [extra] Using compiler: ghc-9.10.3
  15526. 429.22 s [extra] Using install prefix: /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1
  15527. 429.22 s [extra] Executables installed in:
  15528. 429.22 s [extra] /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/bin
  15529. 429.22 s [extra] Libraries installed in:
  15530. 429.22 s [extra] /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  15531. 429.22 s [extra] Dynamic Libraries installed in:
  15532. 429.22 s [extra] /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  15533. 429.22 s [extra] Private executables installed in:
  15534. 429.22 s [extra] /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/libexec/x86_64-linux-ghc-9.10.3-05f6/extra-1.8.1
  15535. 429.22 s [extra] Data files installed in:
  15536. 429.22 s [extra] /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/share/x86_64-linux-ghc-9.10.3-05f6/extra-1.8.1
  15537. 429.22 s [extra] Documentation installed in:
  15538. 429.22 s [extra] /nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc/share/doc/extra-1.8.1
  15539. 429.22 s [extra] Configuration files installed in:
  15540. 429.22 s [extra] /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/etc
  15541. 429.22 s [extra] No alex found
  15542. 429.22 s [extra] Using ar found on system at:
  15543. 429.22 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  15544. 429.22 s [extra] No c2hs found
  15545. 429.22 s [extra] No cpphs found
  15546. 429.22 s [extra] No doctest found
  15547. 429.22 s [extra] Using gcc version 14.3.0 given by user at:
  15548. 429.22 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  15549. 429.22 s [extra] Using ghc version 9.10.3 found on system at:
  15550. 429.22 s [extra] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  15551. 429.22 s [extra] Using ghc-pkg version 9.10.3 found on system at:
  15552. 429.22 s [extra] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  15553. 429.22 s [extra] No ghcjs found
  15554. 429.22 s [extra] No ghcjs-pkg found
  15555. 429.22 s [extra] No greencard found
  15556. 429.22 s [extra] Using haddock version 2.31.1 found on system at:
  15557. 429.22 s [extra] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  15558. 429.22 s [extra] No happy found
  15559. 429.22 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  15560. 429.22 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  15561. 429.22 s [extra] No hmake found
  15562. 429.22 s [extra] Using hpc version 0.69 found on system at:
  15563. 429.22 s [extra] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  15564. 429.22 s [extra] Using hsc2hs version 0.68.10 found on system at:
  15565. 429.22 s [extra] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  15566. 429.22 s [extra] Using hscolour version 1.25 found on system at:
  15567. 429.22 s [extra] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  15568. 429.22 s [extra] No jhc found
  15569. 429.22 s [extra] Using ld found on system at:
  15570. 429.22 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  15571. 429.22 s [extra] No pkg-config found
  15572. 429.22 s [extra] Using runghc version 9.10.3 found on system at:
  15573. 429.22 s [extra] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  15574. 429.22 s [extra] Using strip version 2.44 found on system at:
  15575. 429.22 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  15576. 429.22 s [extra] Using tar found on system at:
  15577. 429.22 s [extra] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  15578. 429.22 s [extra] No uhc found
  15579. 429.45 s [extra] Phase: buildPhase
  15580. 429.51 s [extra] Preprocessing library for extra-1.8.1...
  15581. 429.52 s [extra] Building library for extra-1.8.1...
  15582. 429.81 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 )
  15583. 429.97 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 )
  15584. 429.97 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 )
  15585. 429.99 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 )
  15586. 429.99 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  15587. 429.99 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  15588. 429.99 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 )
  15589. 430.94 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 )
  15590. 430.99 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 )
  15591. 431.06 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 )
  15592. 431.15 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 )
  15593. 431.15 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 )
  15594. 431.23 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 )
  15595. 431.29 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 )
  15596. 431.43 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 )
  15597. 431.43 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 )
  15598. 431.43 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 )
  15599. 431.58 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 )
  15600. 431.58 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 )
  15601. 431.62 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 )
  15602. 431.62 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  15603. 431.68 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 )
  15604. 432.05 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  15605. 432.23 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  15606. 432.23 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  15607. 432.26 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  15608. 432.26 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  15609. 432.26 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  15610. 432.26 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  15611. 433.38 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  15612. 433.54 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  15613. 433.63 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  15614. 433.63 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  15615. 433.63 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  15616. 433.89 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  15617. 434.04 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  15618. 434.17 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  15619. 434.17 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  15620. 434.17 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  15621. 434.51 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  15622. 434.51 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  15623. 434.77 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  15624. 434.77 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  15625. 434.99 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  15626. 436.24 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  15627. 436.24 s [extra] Building test suite 'extra-test' for extra-1.8.1...
  15628. 436.31 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  15629. 436.66 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  15630. 438.35 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  15631. 438.35 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  15632. 438.64 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  15633. 439.39 s [extra] Phase: checkPhase
  15634. 439.61 s [extra] Running 1 test suites...
  15635. 439.61 s [extra] Test suite extra-test: RUNNING...
  15636. 439.62 s [extra] withTempFile
  15637. 439.62 s [extra] +++ OK, passed 100 tests.
  15638. 439.62 s [extra] captureOutput
  15639. 439.62 s [extra] +++ OK, passed 100 tests.
  15640. 439.62 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  15641. 439.64 s [extra] +++ OK, passed 100 tests.
  15642. 439.64 s [extra] \(x :: IO Int) -> join (once x) == x
  15643. 439.67 s [extra] +++ OK, passed 100 tests.
  15644. 439.67 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  15645. 439.71 s [extra] +++ OK, passed 100 tests.
  15646. 439.71 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  15647. 439.74 s [extra] +++ OK, passed 100 tests.
  15648. 439.74 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  15649. 439.78 s [extra] +++ OK, passed 100 tests.
  15650. 439.78 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  15651. 439.81 s [extra] +++ OK, passed 100 tests.
  15652. 439.81 s [extra] stringException "test" == pure "test"
  15653. 439.81 s [extra] +++ OK, passed 100 tests.
  15654. 439.81 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  15655. 439.81 s [extra] +++ OK, passed 100 tests.
  15656. 439.81 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  15657. 439.81 s [extra] +++ OK, passed 100 tests.
  15658. 439.81 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  15659. 439.81 s [extra] +++ OK, passed 100 tests.
  15660. 439.81 s [extra] ignore (print 1) == print 1
  15661. 439.81 s [extra] +++ OK, passed 100 tests.
  15662. 439.81 s [extra] ignore (fail "die") == pure ()
  15663. 439.81 s [extra] +++ OK, passed 100 tests.
  15664. 439.81 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  15665. 439.81 s [extra] +++ OK, passed 100 tests.
  15666. 439.82 s [extra] seq (errorIO "foo") (print 1) == print 1
  15667. 439.82 s [extra] +++ OK, passed 100 tests.
  15668. 439.82 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  15669. 439.82 s [extra] +++ OK, passed 100 tests.
  15670. 439.82 s [extra] seq (assertIO False) (print 1) == print 1
  15671. 439.82 s [extra] +++ OK, passed 100 tests.
  15672. 439.82 s [extra] retry 1 (print "x") == print "x"
  15673. 439.82 s [extra] +++ OK, passed 100 tests.
  15674. 439.82 s [extra] retry 3 (fail "die") == fail "die"
  15675. 439.82 s [extra] +++ OK, passed 100 tests.
  15676. 439.82 s [extra] whenJust Nothing print == pure ()
  15677. 439.82 s [extra] +++ OK, passed 100 tests.
  15678. 439.82 s [extra] whenJust (Just 1) print == print 1
  15679. 439.82 s [extra] +++ OK, passed 100 tests.
  15680. 439.82 s [extra] pureIf @Maybe True 5 == Just 5
  15681. 439.82 s [extra] +++ OK, passed 100 tests.
  15682. 439.82 s [extra] pureIf @Maybe False 5 == Nothing
  15683. 439.82 s [extra] +++ OK, passed 100 tests.
  15684. 439.82 s [extra] pureIf @[] True 5 == [5]
  15685. 439.82 s [extra] +++ OK, passed 100 tests.
  15686. 439.82 s [extra] pureIf @[] False 5 == []
  15687. 439.82 s [extra] +++ OK, passed 100 tests.
  15688. 439.82 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  15689. 439.82 s [extra] +++ OK, passed 100 tests.
  15690. 439.82 s [extra] whenMaybe False (print 1) == pure Nothing
  15691. 439.82 s [extra] +++ OK, passed 100 tests.
  15692. 439.82 s [extra] \(x :: Maybe ()) -> unit x == x
  15693. 439.82 s [extra] +++ OK, passed 100 tests.
  15694. 439.82 s [extra] guarded even 2 == [2]
  15695. 439.82 s [extra] +++ OK, passed 100 tests.
  15696. 439.82 s [extra] guarded odd 2 == Nothing
  15697. 439.82 s [extra] +++ OK, passed 100 tests.
  15698. 439.82 s [extra] guarded (not.null) "My Name" == Just "My Name"
  15699. 439.82 s [extra] +++ OK, passed 100 tests.
  15700. 439.82 s [extra] guardedA (return . even) 42 == Just [42]
  15701. 439.82 s [extra] +++ OK, passed 100 tests.
  15702. 439.82 s [extra] guardedA (return . odd) 42 == Just []
  15703. 439.82 s [extra] +++ OK, passed 100 tests.
  15704. 439.82 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  15705. 439.82 s [extra] +++ OK, passed 100 tests.
  15706. 439.82 s [extra] fold1M (\x y -> Just x) [] == undefined
  15707. 439.82 s [extra] +++ OK, passed 100 tests.
  15708. 439.82 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  15709. 439.82 s [extra] +++ OK, passed 100 tests.
  15710. 439.82 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  15711. 439.82 s [extra] +++ OK, passed 100 tests.
  15712. 439.82 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  15713. 439.82 s [extra] +++ OK, passed 100 tests.
  15714. 439.82 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  15715. 439.82 s [extra] +++ OK, passed 100 tests.
  15716. 439.82 s [extra] Just True ||^ undefined == Just True
  15717. 439.82 s [extra] +++ OK, passed 100 tests.
  15718. 439.82 s [extra] Just False ||^ Just True == Just True
  15719. 439.82 s [extra] +++ OK, passed 100 tests.
  15720. 439.82 s [extra] Just False ||^ Just False == Just False
  15721. 439.82 s [extra] +++ OK, passed 100 tests.
  15722. 439.82 s [extra] Just False &&^ undefined == Just False
  15723. 439.82 s [extra] +++ OK, passed 100 tests.
  15724. 439.82 s [extra] Just True &&^ Just True == Just True
  15725. 439.82 s [extra] +++ OK, passed 100 tests.
  15726. 439.82 s [extra] Just True &&^ Just False == Just False
  15727. 439.82 s [extra] +++ OK, passed 100 tests.
  15728. 439.82 s [extra] anyM Just [False,True ,undefined] == Just True
  15729. 439.82 s [extra] +++ OK, passed 100 tests.
  15730. 439.82 s [extra] anyM Just [False,False,undefined] == undefined
  15731. 439.82 s [extra] +++ OK, passed 100 tests.
  15732. 439.82 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  15733. 439.82 s [extra] +++ OK, passed 100 tests.
  15734. 439.82 s [extra] allM Just [True,False,undefined] == Just False
  15735. 439.82 s [extra] +++ OK, passed 100 tests.
  15736. 439.83 s [extra] allM Just [True,True ,undefined] == undefined
  15737. 439.83 s [extra] +++ OK, passed 100 tests.
  15738. 439.83 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  15739. 439.83 s [extra] +++ OK, passed 100 tests.
  15740. 439.83 s [extra] orM [Just False,Just True ,undefined] == Just True
  15741. 439.83 s [extra] +++ OK, passed 100 tests.
  15742. 439.83 s [extra] orM [Just False,Just False,undefined] == undefined
  15743. 439.83 s [extra] +++ OK, passed 100 tests.
  15744. 439.83 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  15745. 439.83 s [extra] +++ OK, passed 100 tests.
  15746. 439.83 s [extra] andM [Just True,Just False,undefined] == Just False
  15747. 439.83 s [extra] +++ OK, passed 100 tests.
  15748. 439.83 s [extra] andM [Just True,Just True ,undefined] == undefined
  15749. 439.83 s [extra] +++ OK, passed 100 tests.
  15750. 439.83 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  15751. 439.83 s [extra] +++ OK, passed 100 tests.
  15752. 439.83 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  15753. 439.83 s [extra] +++ OK, passed 100 tests.
  15754. 439.83 s [extra] findM (Just . isUpper) "test" == Just Nothing
  15755. 439.83 s [extra] +++ OK, passed 100 tests.
  15756. 439.83 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  15757. 439.83 s [extra] +++ OK, passed 100 tests.
  15758. 439.83 s [extra] fromLeft 1 (Left 3) == 3
  15759. 439.83 s [extra] +++ OK, passed 100 tests.
  15760. 439.83 s [extra] fromLeft 1 (Right "foo") == 1
  15761. 439.83 s [extra] +++ OK, passed 100 tests.
  15762. 439.83 s [extra] fromRight 1 (Right 3) == 3
  15763. 439.83 s [extra] +++ OK, passed 100 tests.
  15764. 439.83 s [extra] fromRight 1 (Left "foo") == 1
  15765. 439.83 s [extra] +++ OK, passed 100 tests.
  15766. 439.83 s [extra] \x -> fromLeft' (Left x) == x
  15767. 439.83 s [extra] +++ OK, passed 100 tests.
  15768. 439.83 s [extra] \x -> fromLeft' (Right x) == undefined
  15769. 439.83 s [extra] +++ OK, passed 100 tests.
  15770. 439.83 s [extra] \x -> fromRight' (Right x) == x
  15771. 439.83 s [extra] +++ OK, passed 100 tests.
  15772. 439.83 s [extra] \x -> fromRight' (Left x) == undefined
  15773. 439.83 s [extra] +++ OK, passed 100 tests.
  15774. 439.83 s [extra] \x -> fromEither (Left x ) == x
  15775. 439.83 s [extra] +++ OK, passed 100 tests.
  15776. 439.83 s [extra] \x -> fromEither (Right x) == x
  15777. 439.84 s [extra] +++ OK, passed 100 tests.
  15778. 439.84 s [extra] \a b -> maybeToEither a (Just b) == Right b
  15779. 439.84 s [extra] +++ OK, passed 100 tests.
  15780. 439.84 s [extra] \a -> maybeToEither a Nothing == Left a
  15781. 439.84 s [extra] +++ OK, passed 100 tests.
  15782. 439.84 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  15783. 439.84 s [extra] +++ OK, passed 100 tests.
  15784. 439.84 s [extra] \x -> eitherToMaybe (Right x) == Just x
  15785. 439.84 s [extra] +++ OK, passed 100 tests.
  15786. 439.84 s [extra] mapLeft show (Left 1) == Left "1"
  15787. 439.84 s [extra] +++ OK, passed 100 tests.
  15788. 439.84 s [extra] mapLeft show (Right True) == Right True
  15789. 439.84 s [extra] +++ OK, passed 100 tests.
  15790. 439.84 s [extra] mapRight show (Left 1) == Left 1
  15791. 439.84 s [extra] +++ OK, passed 100 tests.
  15792. 439.84 s [extra] mapRight show (Right True) == Right "True"
  15793. 439.84 s [extra] +++ OK, passed 100 tests.
  15794. 439.84 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  15795. 439.84 s [extra] +++ OK, passed 100 tests.
  15796. 439.84 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  15797. 439.84 s [extra] +++ OK, passed 100 tests.
  15798. 439.84 s [extra] \xs -> repeatedly line1 xs == lines xs
  15799. 439.84 s [extra] +++ OK, passed 100 tests.
  15800. 439.84 s [extra] disjoint [1,2,3] [4,5] == True
  15801. 439.84 s [extra] +++ OK, passed 100 tests.
  15802. 439.84 s [extra] disjoint [1,2,3] [4,1] == False
  15803. 439.84 s [extra] +++ OK, passed 100 tests.
  15804. 439.84 s [extra] disjointOrd [1,2,3] [4,5] == True
  15805. 439.84 s [extra] +++ OK, passed 100 tests.
  15806. 439.84 s [extra] disjointOrd [1,2,3] [4,1] == False
  15807. 439.84 s [extra] +++ OK, passed 100 tests.
  15808. 439.84 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  15809. 439.84 s [extra] +++ OK, passed 100 tests.
  15810. 439.84 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  15811. 439.84 s [extra] +++ OK, passed 100 tests.
  15812. 439.84 s [extra] anySame [1,1,2] == True
  15813. 439.84 s [extra] +++ OK, passed 100 tests.
  15814. 439.84 s [extra] anySame [1,2,3] == False
  15815. 439.84 s [extra] +++ OK, passed 100 tests.
  15816. 439.84 s [extra] anySame (1:2:1:undefined) == True
  15817. 439.84 s [extra] +++ OK, passed 100 tests.
  15818. 439.84 s [extra] anySame [] == False
  15819. 439.84 s [extra] +++ OK, passed 100 tests.
  15820. 439.84 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  15821. 439.84 s [extra] +++ OK, passed 100 tests.
  15822. 439.84 s [extra] allSame [1,1,2] == False
  15823. 439.84 s [extra] +++ OK, passed 100 tests.
  15824. 439.84 s [extra] allSame [1,1,1] == True
  15825. 439.84 s [extra] +++ OK, passed 100 tests.
  15826. 439.84 s [extra] allSame [1] == True
  15827. 439.84 s [extra] +++ OK, passed 100 tests.
  15828. 439.84 s [extra] allSame [] == True
  15829. 439.84 s [extra] +++ OK, passed 100 tests.
  15830. 439.84 s [extra] allSame (1:1:2:undefined) == False
  15831. 439.84 s [extra] +++ OK, passed 100 tests.
  15832. 439.84 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  15833. 439.84 s [extra] +++ OK, passed 100 tests.
  15834. 439.84 s [extra] headDef 1 [] == 1
  15835. 439.84 s [extra] +++ OK, passed 100 tests.
  15836. 439.84 s [extra] headDef 1 [2,3,4] == 2
  15837. 439.84 s [extra] +++ OK, passed 100 tests.
  15838. 439.84 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  15839. 439.84 s [extra] +++ OK, passed 100 tests.
  15840. 439.84 s [extra] lastDef 1 [] == 1
  15841. 439.84 s [extra] +++ OK, passed 100 tests.
  15842. 439.84 s [extra] lastDef 1 [2,3,4] == 4
  15843. 439.84 s [extra] +++ OK, passed 100 tests.
  15844. 439.84 s [extra] \x xs -> lastDef x xs == last (x:xs)
  15845. 439.84 s [extra] +++ OK, passed 100 tests.
  15846. 439.84 s [extra] [2,3,4] !? 1 == Just 3
  15847. 439.84 s [extra] +++ OK, passed 100 tests.
  15848. 439.84 s [extra] [2,3,4] !? (-1) == Nothing
  15849. 439.84 s [extra] +++ OK, passed 100 tests.
  15850. 439.84 s [extra] [] !? 0 == Nothing
  15851. 439.84 s [extra] +++ OK, passed 100 tests.
  15852. 439.84 s [extra] notNull [] == False
  15853. 439.84 s [extra] +++ OK, passed 100 tests.
  15854. 439.84 s [extra] notNull [1] == True
  15855. 439.84 s [extra] +++ OK, passed 100 tests.
  15856. 439.84 s [extra] \xs -> notNull xs == not (null xs)
  15857. 439.84 s [extra] +++ OK, passed 100 tests.
  15858. 439.84 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  15859. 439.84 s [extra] +++ OK, passed 100 tests.
  15860. 439.84 s [extra] list 1 (\v _ -> v - 2) [] == 1
  15861. 439.84 s [extra] +++ OK, passed 100 tests.
  15862. 439.84 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  15863. 439.85 s [extra] +++ OK, passed 100 tests.
  15864. 439.85 s [extra] unsnoc "test" == Just ("tes",'t')
  15865. 439.85 s [extra] +++ OK, passed 100 tests.
  15866. 439.85 s [extra] unsnoc "" == Nothing
  15867. 439.85 s [extra] +++ OK, passed 100 tests.
  15868. 439.85 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  15869. 439.85 s [extra] +++ OK, passed 100 tests.
  15870. 439.85 s [extra] cons 't' "est" == "test"
  15871. 439.85 s [extra] +++ OK, passed 100 tests.
  15872. 439.85 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  15873. 439.85 s [extra] +++ OK, passed 100 tests.
  15874. 439.85 s [extra] snoc "tes" 't' == "test"
  15875. 439.85 s [extra] +++ OK, passed 100 tests.
  15876. 439.85 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  15877. 439.85 s [extra] +++ OK, passed 100 tests.
  15878. 439.85 s [extra] enumerate == [False, True]
  15879. 439.85 s [extra] +++ OK, passed 100 tests.
  15880. 439.85 s [extra] takeEnd 3 "hello" == "llo"
  15881. 439.85 s [extra] +++ OK, passed 100 tests.
  15882. 439.85 s [extra] takeEnd 5 "bye" == "bye"
  15883. 439.85 s [extra] +++ OK, passed 100 tests.
  15884. 439.85 s [extra] takeEnd (-1) "bye" == ""
  15885. 439.85 s [extra] +++ OK, passed 100 tests.
  15886. 439.85 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  15887. 439.85 s [extra] +++ OK, passed 100 tests.
  15888. 439.85 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  15889. 439.85 s [extra] +++ OK, passed 100 tests.
  15890. 439.85 s [extra] dropEnd 3 "hello" == "he"
  15891. 439.85 s [extra] +++ OK, passed 100 tests.
  15892. 439.85 s [extra] dropEnd 5 "bye" == ""
  15893. 439.85 s [extra] +++ OK, passed 100 tests.
  15894. 439.85 s [extra] dropEnd (-1) "bye" == "bye"
  15895. 439.85 s [extra] +++ OK, passed 100 tests.
  15896. 439.85 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  15897. 439.85 s [extra] +++ OK, passed 100 tests.
  15898. 439.85 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  15899. 439.85 s [extra] +++ OK, passed 100 tests.
  15900. 439.85 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  15901. 439.85 s [extra] +++ OK, passed 100 tests.
  15902. 439.85 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  15903. 439.85 s [extra] +++ OK, passed 100 tests.
  15904. 439.85 s [extra] splitAtEnd 3 "he" == ("", "he")
  15905. 439.85 s [extra] +++ OK, passed 100 tests.
  15906. 439.85 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  15907. 439.85 s [extra] +++ OK, passed 100 tests.
  15908. 439.85 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  15909. 439.85 s [extra] +++ OK, passed 100 tests.
  15910. 439.85 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  15911. 439.85 s [extra] +++ OK, passed 100 tests.
  15912. 439.85 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  15913. 439.85 s [extra] +++ OK, passed 100 tests.
  15914. 439.85 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  15915. 439.85 s [extra] +++ OK, passed 100 tests.
  15916. 439.85 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  15917. 439.85 s [extra] +++ OK, passed 100 tests.
  15918. 439.85 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  15919. 439.85 s [extra] +++ OK, passed 100 tests.
  15920. 439.85 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  15921. 439.85 s [extra] +++ OK, passed 100 tests.
  15922. 439.85 s [extra] trim " hello " == "hello"
  15923. 439.85 s [extra] +++ OK, passed 100 tests.
  15924. 439.85 s [extra] trimStart " hello " == "hello "
  15925. 439.85 s [extra] +++ OK, passed 100 tests.
  15926. 439.85 s [extra] trimEnd " hello " == " hello"
  15927. 439.85 s [extra] +++ OK, passed 100 tests.
  15928. 439.85 s [extra] \s -> trim s == trimEnd (trimStart s)
  15929. 439.85 s [extra] +++ OK, passed 100 tests.
  15930. 439.85 s [extra] lower "This is A TEST" == "this is a test"
  15931. 439.85 s [extra] +++ OK, passed 100 tests.
  15932. 439.85 s [extra] lower "" == ""
  15933. 439.85 s [extra] +++ OK, passed 100 tests.
  15934. 439.85 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  15935. 439.85 s [extra] +++ OK, passed 100 tests.
  15936. 439.85 s [extra] upper "" == ""
  15937. 439.85 s [extra] +++ OK, passed 100 tests.
  15938. 439.85 s [extra] word1 "" == ("", "")
  15939. 439.85 s [extra] +++ OK, passed 100 tests.
  15940. 439.85 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  15941. 439.85 s [extra] +++ OK, passed 100 tests.
  15942. 439.85 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  15943. 439.85 s [extra] +++ OK, passed 100 tests.
  15944. 439.85 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  15945. 439.86 s [extra] +++ OK, passed 100 tests.
  15946. 439.86 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  15947. 439.86 s [extra] +++ OK, passed 100 tests.
  15948. 439.86 s [extra] line1 "" == ("", "")
  15949. 439.86 s [extra] +++ OK, passed 100 tests.
  15950. 439.86 s [extra] line1 "test" == ("test","")
  15951. 439.86 s [extra] +++ OK, passed 100 tests.
  15952. 439.86 s [extra] line1 "test\n" == ("test","")
  15953. 439.86 s [extra] +++ OK, passed 100 tests.
  15954. 439.86 s [extra] line1 "test\nrest" == ("test","rest")
  15955. 439.86 s [extra] +++ OK, passed 100 tests.
  15956. 439.86 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  15957. 439.86 s [extra] +++ OK, passed 100 tests.
  15958. 439.86 s [extra] escapeHTML "this is a test" == "this is a test"
  15959. 439.86 s [extra] +++ OK, passed 100 tests.
  15960. 439.86 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  15961. 439.86 s [extra] +++ OK, passed 100 tests.
  15962. 439.86 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  15963. 439.86 s [extra] +++ OK, passed 100 tests.
  15964. 439.86 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  15965. 439.86 s [extra] +++ OK, passed 100 tests.
  15966. 439.86 s [extra] escapeJSON "this is a test" == "this is a test"
  15967. 439.86 s [extra] +++ OK, passed 100 tests.
  15968. 439.86 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  15969. 439.86 s [extra] +++ OK, passed 100 tests.
  15970. 439.86 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  15971. 439.86 s [extra] +++ OK, passed 100 tests.
  15972. 439.86 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  15973. 439.86 s [extra] +++ OK, passed 100 tests.
  15974. 439.86 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  15975. 439.86 s [extra] +++ OK, passed 100 tests.
  15976. 439.86 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  15977. 439.86 s [extra] +++ OK, passed 100 tests.
  15978. 439.86 s [extra] maximumOn id [] == undefined
  15979. 439.86 s [extra] +++ OK, passed 100 tests.
  15980. 439.86 s [extra] maximumOn length ["test","extra","a"] == "extra"
  15981. 439.86 s [extra] +++ OK, passed 100 tests.
  15982. 439.86 s [extra] minimumOn id [] == undefined
  15983. 439.86 s [extra] +++ OK, passed 100 tests.
  15984. 439.86 s [extra] minimumOn length ["test","extra","a"] == "a"
  15985. 439.86 s [extra] +++ OK, passed 100 tests.
  15986. 439.86 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  15987. 439.86 s [extra] +++ OK, passed 100 tests.
  15988. 439.86 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  15989. 439.86 s [extra] +++ OK, passed 100 tests.
  15990. 439.86 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  15991. 439.87 s [extra] +++ OK, passed 100 tests.
  15992. 439.87 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  15993. 439.87 s [extra] +++ OK, passed 100 tests.
  15994. 439.87 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  15995. 439.87 s [extra] +++ OK, passed 100 tests.
  15996. 439.87 s [extra] sum' [1, 2, 3] == 6
  15997. 439.87 s [extra] +++ OK, passed 100 tests.
  15998. 439.87 s [extra] sumOn' read ["1", "2", "3"] == 6
  15999. 439.87 s [extra] +++ OK, passed 100 tests.
  16000. 439.87 s [extra] product' [1, 2, 4] == 8
  16001. 439.87 s [extra] +++ OK, passed 100 tests.
  16002. 439.87 s [extra] productOn' read ["1", "2", "4"] == 8
  16003. 439.87 s [extra] +++ OK, passed 100 tests.
  16004. 439.87 s [extra] merge "ace" "bd" == "abcde"
  16005. 439.87 s [extra] +++ OK, passed 100 tests.
  16006. 439.87 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  16007. 439.87 s [extra] +++ OK, passed 100 tests.
  16008. 439.87 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  16009. 439.87 s [extra] +++ OK, passed 100 tests.
  16010. 439.87 s [extra] replace "el" "e" "Hello" == "Helo"
  16011. 439.87 s [extra] +++ OK, passed 100 tests.
  16012. 439.87 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  16013. 439.87 s [extra] +++ OK, passed 100 tests.
  16014. 439.87 s [extra] replace "" "x" "" == "x"
  16015. 439.87 s [extra] +++ OK, passed 100 tests.
  16016. 439.87 s [extra] \xs ys -> replace xs xs ys == ys
  16017. 439.87 s [extra] +++ OK, passed 100 tests.
  16018. 439.87 s [extra] breakEnd isLower "youRE" == ("you","RE")
  16019. 439.87 s [extra] +++ OK, passed 100 tests.
  16020. 439.87 s [extra] breakEnd isLower "youre" == ("youre","")
  16021. 439.87 s [extra] +++ OK, passed 100 tests.
  16022. 439.87 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  16023. 439.87 s [extra] +++ OK, passed 100 tests.
  16024. 439.87 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  16025. 439.87 s [extra] +++ OK, passed 100 tests.
  16026. 439.87 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  16027. 439.87 s [extra] +++ OK, passed 100 tests.
  16028. 439.87 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  16029. 439.87 s [extra] +++ OK, passed 100 tests.
  16030. 439.87 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  16031. 439.87 s [extra] +++ OK, passed 100 tests.
  16032. 439.87 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  16033. 439.87 s [extra] +++ OK, passed 100 tests.
  16034. 439.87 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  16035. 439.87 s [extra] +++ OK, passed 100 tests.
  16036. 439.87 s [extra] \s -> wordsBy isSpace s == words s
  16037. 439.87 s [extra] +++ OK, passed 100 tests.
  16038. 439.87 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  16039. 439.88 s [extra] +++ OK, passed 100 tests.
  16040. 439.88 s [extra] \s -> linesBy (== '\n') s == lines s
  16041. 439.88 s [extra] +++ OK, passed 100 tests.
  16042. 439.88 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  16043. 439.88 s [extra] +++ OK, passed 100 tests.
  16044. 439.88 s [extra] firstJust id [Nothing,Just 3] == Just 3
  16045. 439.88 s [extra] +++ OK, passed 100 tests.
  16046. 439.88 s [extra] firstJust id [Nothing,Nothing] == Nothing
  16047. 439.88 s [extra] +++ OK, passed 100 tests.
  16048. 439.88 s [extra] drop1 "" == ""
  16049. 439.88 s [extra] +++ OK, passed 100 tests.
  16050. 439.88 s [extra] drop1 "test" == "est"
  16051. 439.88 s [extra] +++ OK, passed 100 tests.
  16052. 439.88 s [extra] \xs -> drop 1 xs == drop1 xs
  16053. 439.88 s [extra] +++ OK, passed 100 tests.
  16054. 439.88 s [extra] dropEnd1 "" == ""
  16055. 439.88 s [extra] +++ OK, passed 100 tests.
  16056. 439.88 s [extra] dropEnd1 "test" == "tes"
  16057. 439.88 s [extra] +++ OK, passed 100 tests.
  16058. 439.88 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  16059. 439.88 s [extra] +++ OK, passed 100 tests.
  16060. 439.88 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  16061. 439.88 s [extra] +++ OK, passed 100 tests.
  16062. 439.88 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  16063. 439.89 s [extra] +++ OK, passed 100 tests.
  16064. 439.89 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  16065. 439.89 s [extra] +++ OK, passed 100 tests.
  16066. 439.89 s [extra] breakOn "/" "foobar" == ("foobar", "")
  16067. 439.89 s [extra] +++ OK, passed 100 tests.
  16068. 439.89 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  16069. 439.89 s [extra] +++ OK, passed 100 tests.
  16070. 439.89 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  16071. 439.89 s [extra] +++ OK, passed 100 tests.
  16072. 439.89 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  16073. 439.89 s [extra] +++ OK, passed 100 tests.
  16074. 439.89 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  16075. 439.89 s [extra] +++ OK, passed 100 tests.
  16076. 439.89 s [extra] splitOn "x" "x" == ["",""]
  16077. 439.89 s [extra] +++ OK, passed 100 tests.
  16078. 439.89 s [extra] splitOn "x" "" == [""]
  16079. 439.89 s [extra] +++ OK, passed 100 tests.
  16080. 439.89 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  16081. 439.89 s [extra] +++ OK, passed 100 tests; 13 discarded.
  16082. 439.89 s [extra] \c x -> splitOn [c] x == split (==c) x
  16083. 439.89 s [extra] +++ OK, passed 100 tests.
  16084. 439.89 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  16085. 439.89 s [extra] +++ OK, passed 100 tests.
  16086. 439.89 s [extra] split (== 'a') "" == [""]
  16087. 439.89 s [extra] +++ OK, passed 100 tests.
  16088. 439.89 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  16089. 439.89 s [extra] +++ OK, passed 100 tests.
  16090. 439.89 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  16091. 439.89 s [extra] +++ OK, passed 100 tests.
  16092. 439.89 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  16093. 439.89 s [extra] +++ OK, passed 100 tests.
  16094. 439.89 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  16095. 439.89 s [extra] +++ OK, passed 100 tests.
  16096. 439.89 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  16097. 439.89 s [extra] +++ OK, passed 100 tests.
  16098. 439.89 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  16099. 439.89 s [extra] +++ OK, passed 100 tests.
  16100. 439.89 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  16101. 439.89 s [extra] +++ OK, passed 100 tests.
  16102. 439.89 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  16103. 439.89 s [extra] +++ OK, passed 100 tests.
  16104. 439.89 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  16105. 439.89 s [extra] +++ OK, passed 100 tests.
  16106. 439.89 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  16107. 439.89 s [extra] +++ OK, passed 100 tests.
  16108. 439.89 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  16109. 439.89 s [extra] +++ OK, passed 100 tests.
  16110. 439.89 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  16111. 439.89 s [extra] +++ OK, passed 100 tests.
  16112. 439.89 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  16113. 439.89 s [extra] +++ OK, passed 100 tests.
  16114. 439.89 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  16115. 439.89 s [extra] +++ OK, passed 100 tests.
  16116. 439.89 s [extra] stripSuffix "" "baz" == Just "baz"
  16117. 439.89 s [extra] +++ OK, passed 100 tests.
  16118. 439.89 s [extra] stripSuffix "foo" "quux" == Nothing
  16119. 439.89 s [extra] +++ OK, passed 100 tests.
  16120. 439.89 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  16121. 439.89 s [extra] +++ OK, passed 100 tests.
  16122. 439.89 s [extra] stripInfix "/" "foobar" == Nothing
  16123. 439.89 s [extra] +++ OK, passed 100 tests.
  16124. 439.89 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  16125. 439.89 s [extra] +++ OK, passed 100 tests.
  16126. 439.89 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  16127. 439.89 s [extra] +++ OK, passed 100 tests.
  16128. 439.89 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  16129. 439.89 s [extra] +++ OK, passed 100 tests.
  16130. 439.89 s [extra] chunksOf 8 "" == []
  16131. 439.89 s [extra] +++ OK, passed 100 tests.
  16132. 439.89 s [extra] chunksOf 0 "test" == undefined
  16133. 439.89 s [extra] +++ OK, passed 100 tests.
  16134. 439.89 s [extra] nubSort "this is a test" == " aehist"
  16135. 439.89 s [extra] +++ OK, passed 100 tests.
  16136. 439.89 s [extra] \xs -> nubSort xs == nub (sort xs)
  16137. 439.90 s [extra] +++ OK, passed 100 tests.
  16138. 439.90 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  16139. 439.90 s [extra] +++ OK, passed 100 tests.
  16140. 439.90 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  16141. 439.90 s [extra] +++ OK, passed 100 tests.
  16142. 439.90 s [extra] nubOrd "this is a test" == "this ae"
  16143. 439.90 s [extra] +++ OK, passed 100 tests.
  16144. 439.90 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  16145. 439.90 s [extra] +++ OK, passed 100 tests.
  16146. 439.90 s [extra] \xs -> nubOrd xs == nub xs
  16147. 439.90 s [extra] +++ OK, passed 100 tests.
  16148. 439.90 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  16149. 439.90 s [extra] +++ OK, passed 100 tests.
  16150. 439.90 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  16151. 439.90 s [extra] +++ OK, passed 100 tests.
  16152. 439.90 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  16153. 439.90 s [extra] +++ OK, passed 100 tests.
  16154. 439.90 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  16155. 439.90 s [extra] +++ OK, passed 100 tests.
  16156. 439.90 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  16157. 439.90 s [extra] +++ OK, passed 100 tests.
  16158. 439.90 s [extra] comparingLength [1,2,3] [False] == GT
  16159. 439.90 s [extra] +++ OK, passed 100 tests.
  16160. 439.90 s [extra] comparingLength [1,2] "ab" == EQ
  16161. 439.90 s [extra] +++ OK, passed 100 tests.
  16162. 439.90 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  16163. 439.90 s [extra] +++ OK, passed 100 tests.
  16164. 439.90 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  16165. 439.90 s [extra] +++ OK, passed 100 tests.
  16166. 439.90 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  16167. 439.90 s [extra] +++ OK, passed 100 tests.
  16168. 439.90 s [extra] mwhen True "test" == "test"
  16169. 439.90 s [extra] +++ OK, passed 100 tests.
  16170. 439.90 s [extra] mwhen False "test" == ""
  16171. 439.90 s [extra] +++ OK, passed 100 tests.
  16172. 439.90 s [extra] first succ (1,"test") == (2,"test")
  16173. 439.90 s [extra] +++ OK, passed 100 tests.
  16174. 439.90 s [extra] second reverse (1,"test") == (1,"tset")
  16175. 439.90 s [extra] +++ OK, passed 100 tests.
  16176. 439.90 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  16177. 439.90 s [extra] +++ OK, passed 100 tests.
  16178. 439.90 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  16179. 439.90 s [extra] +++ OK, passed 100 tests.
  16180. 439.90 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  16181. 439.90 s [extra] +++ OK, passed 100 tests.
  16182. 439.90 s [extra] (succ &&& pred) 1 == (2,0)
  16183. 439.90 s [extra] +++ OK, passed 100 tests.
  16184. 439.90 s [extra] dupe 12 == (12, 12)
  16185. 439.90 s [extra] +++ OK, passed 100 tests.
  16186. 439.90 s [extra] both succ (1,2) == (2,3)
  16187. 439.90 s [extra] +++ OK, passed 100 tests.
  16188. 439.90 s [extra] first3 succ (1,1,1) == (2,1,1)
  16189. 439.90 s [extra] +++ OK, passed 100 tests.
  16190. 439.90 s [extra] second3 succ (1,1,1) == (1,2,1)
  16191. 439.90 s [extra] +++ OK, passed 100 tests.
  16192. 439.90 s [extra] third3 succ (1,1,1) == (1,1,2)
  16193. 439.90 s [extra] +++ OK, passed 100 tests.
  16194. 439.90 s [extra] \x -> readVersion (showVersion x) == x
  16195. 439.90 s [extra] +++ OK, passed 100 tests.
  16196. 439.90 s [extra] readVersion "hello" == undefined
  16197. 439.90 s [extra] +++ OK, passed 100 tests.
  16198. 439.90 s [extra] showDP 4 pi == "3.1416"
  16199. 439.90 s [extra] +++ OK, passed 100 tests.
  16200. 439.90 s [extra] showDP 0 pi == "3"
  16201. 439.90 s [extra] +++ OK, passed 100 tests.
  16202. 439.90 s [extra] showDP 2 3 == "3.00"
  16203. 439.90 s [extra] +++ OK, passed 100 tests.
  16204. 439.90 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  16205. 439.90 s [extra] +++ OK, passed 100 tests.
  16206. 439.90 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  16207. 439.90 s [extra] +++ OK, passed 100 tests.
  16208. 439.90 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  16209. 439.90 s [extra] +++ OK, passed 100 tests.
  16210. 439.90 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  16211. 439.90 s [extra] +++ OK, passed 100 tests.
  16212. 439.90 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  16213. 439.90 s [extra] +++ OK, passed 100 tests.
  16214. 439.90 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  16215. 439.90 s [extra] +++ OK, passed 100 tests.
  16216. 439.90 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  16217. 439.90 s [extra] +++ OK, passed 100 tests.
  16218. 439.90 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  16219. 439.90 s [extra] +++ OK, passed 100 tests.
  16220. 439.91 s [extra] isWindows == (os == "mingw32")
  16221. 439.91 s [extra] +++ OK, passed 100 tests.
  16222. 439.91 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  16223. 439.92 s [extra] +++ OK, passed 100 tests.
  16224. 439.92 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  16225. 439.94 s [extra] +++ OK, passed 100 tests.
  16226. 439.94 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  16227. 439.95 s [extra] +++ OK, passed 100 tests.
  16228. 439.95 s [extra] captureOutput (print 1) == pure ("1\n",())
  16229. 439.95 s [extra] +++ OK, passed 100 tests.
  16230. 439.95 s [extra] withTempFile doesFileExist == pure True
  16231. 439.96 s [extra] +++ OK, passed 100 tests.
  16232. 439.96 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  16233. 439.96 s [extra] +++ OK, passed 100 tests.
  16234. 439.96 s [extra] withTempFile readFile' == pure ""
  16235. 439.96 s [extra] +++ OK, passed 100 tests.
  16236. 439.96 s [extra] withTempDir doesDirectoryExist == pure True
  16237. 439.96 s [extra] +++ OK, passed 100 tests.
  16238. 439.96 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  16239. 439.96 s [extra] +++ OK, passed 100 tests.
  16240. 439.96 s [extra] withTempDir listFiles == pure []
  16241. 439.96 s [extra] +++ OK, passed 100 tests.
  16242. 439.96 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  16243. 439.96 s [extra] +++ OK, passed 100 tests.
  16244. 439.96 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  16245. 439.96 s [extra] +++ OK, passed 100 tests.
  16246. 439.96 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  16247. 439.96 s [extra] +++ OK, passed 100 tests.
  16248. 439.96 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  16249. 439.96 s [extra] +++ OK, passed 100 tests.
  16250. 439.96 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  16251. 439.96 s [extra] +++ OK, passed 100 tests.
  16252. 439.96 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  16253. 439.96 s [extra] +++ OK, passed 100 tests.
  16254. 439.96 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  16255. 440.96 s [extra] +++ OK, passed 100 tests.
  16256. 440.96 s [extra] timeout (-3) (print 1) == pure Nothing
  16257. 440.96 s [extra] +++ OK, passed 100 tests.
  16258. 440.96 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  16259. 440.96 s [extra] +++ OK, passed 100 tests.
  16260. 440.96 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  16261. 441.06 s [extra] 0.100342102
  16262. 441.06 s [extra] +++ OK, passed 100 tests.
  16263. 441.06 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  16264. 441.16 s [extra] +++ OK, passed 100 tests.
  16265. 441.16 s [extra] showDuration 3.435 == "3.44s"
  16266. 441.16 s [extra] +++ OK, passed 100 tests.
  16267. 441.16 s [extra] showDuration 623.8 == "10m24s"
  16268. 441.16 s [extra] +++ OK, passed 100 tests.
  16269. 441.16 s [extra] showDuration 62003.8 == "17h13m"
  16270. 441.16 s [extra] +++ OK, passed 100 tests.
  16271. 441.16 s [extra] showDuration 1e8 == "27777h47m"
  16272. 441.16 s [extra] +++ OK, passed 100 tests.
  16273. 441.16 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  16274. 441.16 s [extra] +++ OK, passed 100 tests.
  16275. 441.16 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  16276. 442.16 s [extra] +++ OK, passed 100 tests.
  16277. 442.16 s [extra] Extra export
  16278. 442.16 s [extra] +++ OK, passed 100 tests.
  16279. 442.16 s [extra] withTempFile
  16280. 442.17 s [extra] ....done
  16281. 442.33 s [extra] withTempDir
  16282. 442.33 s [extra] ....done
  16283. 442.33 s [extra] retry
  16284. 442.33 s [extra] +++ OK, passed 100 tests.
  16285. 442.33 s [extra] barrier
  16286. 442.33 s [extra] Success (325 tests)
  16287. 442.33 s [extra] Test suite extra-test: PASS
  16288. 442.33 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  16289. 442.33 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  16290. 442.33 s [extra] Phase: haddockPhase
  16291. 442.36 s [extra] Preprocessing library for extra-1.8.1...
  16292. 442.36 s [extra] Running Haddock on library for extra-1.8.1...
  16293. 442.71 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
  16294. 442.73 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
  16295. 442.74 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
  16296. 442.77 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
  16297. 442.77 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing )
  16298. 442.84 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
  16299. 442.85 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
  16300. 442.96 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
  16301. 442.97 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
  16302. 443.03 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
  16303. 443.04 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
  16304. 443.07 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
  16305. 443.11 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
  16306. 443.13 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
  16307. 443.15 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
  16308. 443.17 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
  16309. 443.18 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
  16310. 443.28 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
  16311. 443.28 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
  16312. 443.29 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
  16313. 443.31 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing )
  16314. 443.37 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
  16315. 443.37 s [extra] Haddock coverage:
  16316. 443.37 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  16317. 443.37 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  16318. 443.37 s [extra] Warning: 'Arrow' is out of scope.
  16319. 443.37 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16320. 443.37 s [extra] 100% ( 22 / 22) in 'Data.Tuple.Extra'
  16321. 443.37 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  16322. 443.37 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  16323. 443.38 s [extra] Warning: '(:)' is out of scope.
  16324. 443.38 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16325. 443.38 s [extra] Warning: 'unzip' is ambiguous. It is defined
  16326. 443.38 s [extra] * in ‘GHC.Internal.Data.Functor’
  16327. 443.38 s [extra] * in ‘GHC.Internal.List’
  16328. 443.38 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16329. 443.38 s [extra] by specifying the type/value namespace explicitly.
  16330. 443.38 s [extra] Defaulting to the one defined in ‘GHC.Internal.List’
  16331. 443.38 s [extra] Warning: 'firstJustM' is out of scope.
  16332. 443.38 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16333. 443.39 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  16334. 443.39 s [extra] Warning: 'Version' is ambiguous. It is defined
  16335. 443.39 s [extra] * in ‘GHC.Internal.Data.Version’
  16336. 443.39 s [extra] * in ‘GHC.Internal.Data.Version’
  16337. 443.39 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16338. 443.39 s [extra] by specifying the type/value namespace explicitly.
  16339. 443.39 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Version’
  16340. 443.39 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  16341. 443.39 s [extra] Warning: 'length' is ambiguous. It is defined
  16342. 443.39 s [extra] * in ‘Data.List.NonEmpty’
  16343. 443.39 s [extra] * in ‘GHC.Internal.Data.Foldable’
  16344. 443.39 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16345. 443.39 s [extra] by specifying the type/value namespace explicitly.
  16346. 443.39 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Foldable’
  16347. 443.39 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  16348. 443.39 s [extra] Warning: 'fromJust' is out of scope.
  16349. 443.39 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16350. 443.39 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  16351. 443.39 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  16352. 443.39 s [extra] * in ‘GHC.Internal.Exception’
  16353. 443.39 s [extra] * in ‘GHC.Internal.Exception’
  16354. 443.39 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16355. 443.39 s [extra] by specifying the type/value namespace explicitly.
  16356. 443.39 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception’
  16357. 443.39 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  16358. 443.39 s [extra] * in ‘GHC.Internal.IO.Exception’
  16359. 443.39 s [extra] * in ‘GHC.Internal.IO.Exception’
  16360. 443.39 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16361. 443.39 s [extra] by specifying the type/value namespace explicitly.
  16362. 443.39 s [extra] Defaulting to the one defined in ‘GHC.Internal.IO.Exception’
  16363. 443.39 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  16364. 443.39 s [extra] * in ‘GHC.Internal.Exception.Type’
  16365. 443.39 s [extra] * in ‘GHC.Internal.Exception.Type’
  16366. 443.39 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16367. 443.39 s [extra] by specifying the type/value namespace explicitly.
  16368. 443.39 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  16369. 443.39 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  16370. 443.39 s [extra] Warning: 'partition' is out of scope.
  16371. 443.39 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16372. 443.39 s [extra] Warning: 'mconcatMap' is out of scope.
  16373. 443.39 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16374. 443.40 s [extra] Warning: 'find' is out of scope.
  16375. 443.40 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16376. 443.40 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  16377. 443.40 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  16378. 443.40 s [extra] Missing documentation for:
  16379. 443.40 s [extra] Module header
  16380. 443.40 s [extra] Warning: 'Lock' is ambiguous. It is defined
  16381. 443.40 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  16382. 443.40 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  16383. 443.40 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16384. 443.40 s [extra] by specifying the type/value namespace explicitly.
  16385. 443.40 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  16386. 443.40 s [extra] Warning: 'Var' is ambiguous. It is defined
  16387. 443.40 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  16388. 443.40 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  16389. 443.40 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16390. 443.40 s [extra] by specifying the type/value namespace explicitly.
  16391. 443.40 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  16392. 443.40 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  16393. 443.40 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  16394. 443.40 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  16395. 443.40 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16396. 443.40 s [extra] by specifying the type/value namespace explicitly.
  16397. 443.40 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  16398. 443.40 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  16399. 443.40 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  16400. 443.40 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  16401. 443.40 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  16402. 443.41 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  16403. 443.41 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  16404. 443.41 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  16405. 443.41 s [extra] 100% (270 /270) in 'Extra'
  16406. 443.41 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  16407. 448.13 s [extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
  16408. 448.19 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  16409. 448.28 s [extra] Phase: installPhase
  16410. 448.28 s [extra] Installing library in /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  16411. 448.69 s [extra] Phase: fixupPhase
  16412. 448.70 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1
  16413. 448.72 s [extra] shrinking /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSextra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1-ghc9.10.3.so
  16414. 448.72 s [extra] checking for references to /build/ in /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1...
  16415. 448.75 s [extra] patching script interpreter paths in /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1
  16416. 448.76 s [extra] stripping (with command strip and flags -S -p) in /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1/lib
  16417. 448.87 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc
  16418. 448.88 s [extra] checking for references to /build/ in /nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc...
  16419. 448.91 s [extra] patching script interpreter paths in /nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc
  16420. 449.02 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1 /nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc
  16421. 449.58 s [extra:post-build] Pushing 3 paths (71 are already present) using zstd to cache sellout ⏳
  16422. 449.58 s [extra:post-build]
  16423. 450.00 s [extra:post-build] Pushing /nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc (3.00 MiB)
  16424. 450.02 s [extra:post-build] Pushing /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1 (4.15 MiB)
  16425. 450.03 s [extra:post-build] Pushing /nix/store/lf793zr9yfa0dpph8jlxbbdnvnahvq8b-zlib-1.3.2 (129.50 KiB)
  16426. 451.00 s [extra:post-build]
  16427. 451.00 s [extra:post-build] All done.
  16428. 451.02 s [extra:post-build] Uploading to the NixCI cache: /nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1 /nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc
  16429. 451.06 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16430. 451.31 s [extra:post-build] copying 2 paths...
  16431. 451.31 s [extra:post-build] copying path '/nix/store/7hmv0pl6yh5ximfwldc5kz0vpgbapyw9-extra-1.8.1-doc' to 'https://cache.nix-ci.com'...
  16432. 451.77 s [extra:post-build] copying path '/nix/store/37wmj9v9bz1l5zyikn58aymcl7n49wfc-extra-1.8.1' to 'https://cache.nix-ci.com'...
  16433. 453.19 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16434. 453.45 s [extra:post-build] copying 1 paths...
  16435. 453.49 s [extra:post-build] copying path '/nix/store/bz161fnf57cqvgzf0f4j7qs4pl5dmgs5-extra-1.8.1.drv' to 'https://cache.nix-ci.com'...
  16436. 453.70 s Progress: 9 of 15 built, 36 of 36 downloaded from cache
  16437. 453.75 s Building /nix/store/wip2nh33hcl5kpqgrwz4lwk1ki34w3y6-algebraic-graphs-0.7.drv
  16438. 453.83 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  16439. 453.83 s [algebraic-graphs] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  16440. 453.99 s [algebraic-graphs] Phase: unpackPhase
  16441. 454.00 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  16442. 454.00 s [algebraic-graphs] source root is algebraic-graphs-0.7
  16443. 454.01 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  16444. 454.02 s [algebraic-graphs] Phase: patchPhase
  16445. 454.02 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  16446. 454.03 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  16447. 454.03 s [algebraic-graphs] patching file algebraic-graphs.cabal
  16448. 454.03 s [algebraic-graphs] Phase: compileBuildDriverPhase
  16449. 454.03 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.ux6cyPET3v/setup-package.conf.d -threaded
  16450. 454.09 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.ux6cyPET3v/Main.o )
  16451. 454.15 s [algebraic-graphs] [2 of 2] Linking Setup
  16452. 455.55 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  16453. 455.57 s [algebraic-graphs] Phase: configurePhase
  16454. 455.57 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.ux6cyPET3v/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/lib
  16455. 455.58 s [algebraic-graphs] Using Parsec parser
  16456. 455.58 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  16457. 456.20 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  16458. 456.20 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.20.2.0
  16459. 456.20 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  16460. 456.20 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  16461. 456.20 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
  16462. 456.20 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  16463. 456.20 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  16464. 456.20 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  16465. 456.20 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.20.2.0
  16466. 456.20 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  16467. 456.20 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  16468. 456.20 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  16469. 456.20 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  16470. 456.20 s [algebraic-graphs] inspection-testing-0.6.2
  16471. 456.20 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
  16472. 456.20 s [algebraic-graphs] Source component graph:
  16473. 456.20 s [algebraic-graphs] component lib
  16474. 456.20 s [algebraic-graphs] component test:main dependency lib
  16475. 456.20 s [algebraic-graphs] Configured component graph:
  16476. 456.20 s [algebraic-graphs] component algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  16477. 456.20 s [algebraic-graphs] include array-0.5.8.0-68f3
  16478. 456.20 s [algebraic-graphs] include base-4.20.2.0-64da
  16479. 456.20 s [algebraic-graphs] include containers-0.7-504a
  16480. 456.20 s [algebraic-graphs] include deepseq-1.5.0.0-9a2c
  16481. 456.20 s [algebraic-graphs] include transformers-0.6.1.1-6a26
  16482. 456.20 s [algebraic-graphs] component algebraic-graphs-0.7-ARq344kEjdO7L4GacV0ChU-main
  16483. 456.20 s [algebraic-graphs] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  16484. 456.20 s [algebraic-graphs] include algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  16485. 456.20 s [algebraic-graphs] include array-0.5.8.0-68f3
  16486. 456.20 s [algebraic-graphs] include base-4.20.2.0-64da
  16487. 456.20 s [algebraic-graphs] include containers-0.7-504a
  16488. 456.20 s [algebraic-graphs] include deepseq-1.5.0.0-9a2c
  16489. 456.20 s [algebraic-graphs] include extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  16490. 456.20 s [algebraic-graphs] include inspection-testing-0.6.2-KcDosfOAyZc48KShLAksRA
  16491. 456.20 s [algebraic-graphs] include transformers-0.6.1.1-6a26
  16492. 456.20 s [algebraic-graphs] Linked component graph:
  16493. 456.20 s [algebraic-graphs] unit algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  16494. 456.20 s [algebraic-graphs] include array-0.5.8.0-68f3
  16495. 456.20 s [algebraic-graphs] include base-4.20.2.0-64da
  16496. 456.20 s [algebraic-graphs] include containers-0.7-504a
  16497. 456.20 s [algebraic-graphs] include deepseq-1.5.0.0-9a2c
  16498. 456.20 s [algebraic-graphs] include transformers-0.6.1.1-6a26
  16499. 456.20 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF:Data.Graph.Typed
  16500. 456.20 s [algebraic-graphs] unit algebraic-graphs-0.7-ARq344kEjdO7L4GacV0ChU-main
  16501. 456.20 s [algebraic-graphs] include QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  16502. 456.20 s [algebraic-graphs] include algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  16503. 456.20 s [algebraic-graphs] include array-0.5.8.0-68f3
  16504. 456.20 s [algebraic-graphs] include base-4.20.2.0-64da
  16505. 456.20 s [algebraic-graphs] include containers-0.7-504a
  16506. 456.20 s [algebraic-graphs] include deepseq-1.5.0.0-9a2c
  16507. 456.20 s [algebraic-graphs] include extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  16508. 456.20 s [algebraic-graphs] include inspection-testing-0.6.2-KcDosfOAyZc48KShLAksRA
  16509. 456.20 s [algebraic-graphs] include transformers-0.6.1.1-6a26
  16510. 456.20 s [algebraic-graphs] Ready component graph:
  16511. 456.20 s [algebraic-graphs] definite algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  16512. 456.20 s [algebraic-graphs] depends array-0.5.8.0-68f3
  16513. 456.20 s [algebraic-graphs] depends base-4.20.2.0-64da
  16514. 456.20 s [algebraic-graphs] depends containers-0.7-504a
  16515. 456.20 s [algebraic-graphs] depends deepseq-1.5.0.0-9a2c
  16516. 456.20 s [algebraic-graphs] depends transformers-0.6.1.1-6a26
  16517. 456.20 s [algebraic-graphs] definite algebraic-graphs-0.7-ARq344kEjdO7L4GacV0ChU-main
  16518. 456.20 s [algebraic-graphs] depends QuickCheck-2.15.0.1-8fVC1qSJKj9H9pvMjJXUwU
  16519. 456.20 s [algebraic-graphs] depends algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  16520. 456.20 s [algebraic-graphs] depends array-0.5.8.0-68f3
  16521. 456.20 s [algebraic-graphs] depends base-4.20.2.0-64da
  16522. 456.20 s [algebraic-graphs] depends containers-0.7-504a
  16523. 456.20 s [algebraic-graphs] depends deepseq-1.5.0.0-9a2c
  16524. 456.20 s [algebraic-graphs] depends extra-1.8.1-Hmk3rzVkP6uBs1ly2SzVb1
  16525. 456.20 s [algebraic-graphs] depends inspection-testing-0.6.2-KcDosfOAyZc48KShLAksRA
  16526. 456.20 s [algebraic-graphs] depends transformers-0.6.1.1-6a26
  16527. 456.20 s [algebraic-graphs] Using Cabal-3.12.1.0 compiled by ghc-9.10
  16528. 456.20 s [algebraic-graphs] Using compiler: ghc-9.10.3
  16529. 456.20 s [algebraic-graphs] Using install prefix:
  16530. 456.20 s [algebraic-graphs] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7
  16531. 456.20 s [algebraic-graphs] Executables installed in:
  16532. 456.20 s [algebraic-graphs] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/bin
  16533. 456.20 s [algebraic-graphs] Libraries installed in:
  16534. 456.20 s [algebraic-graphs] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  16535. 456.20 s [algebraic-graphs] Dynamic Libraries installed in:
  16536. 456.20 s [algebraic-graphs] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  16537. 456.20 s [algebraic-graphs] Private executables installed in:
  16538. 456.20 s [algebraic-graphs] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.10.3-05f6/algebraic-graphs-0.7
  16539. 456.20 s [algebraic-graphs] Data files installed in:
  16540. 456.20 s [algebraic-graphs] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.10.3-05f6/algebraic-graphs-0.7
  16541. 456.20 s [algebraic-graphs] Documentation installed in:
  16542. 456.20 s [algebraic-graphs] /nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  16543. 456.20 s [algebraic-graphs] Configuration files installed in:
  16544. 456.20 s [algebraic-graphs] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/etc
  16545. 456.20 s [algebraic-graphs] No alex found
  16546. 456.20 s [algebraic-graphs] Using ar found on system at:
  16547. 456.20 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  16548. 456.20 s [algebraic-graphs] No c2hs found
  16549. 456.20 s [algebraic-graphs] No cpphs found
  16550. 456.20 s [algebraic-graphs] No doctest found
  16551. 456.20 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  16552. 456.20 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  16553. 456.20 s [algebraic-graphs] Using ghc version 9.10.3 found on system at:
  16554. 456.20 s [algebraic-graphs] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  16555. 456.20 s [algebraic-graphs] Using ghc-pkg version 9.10.3 found on system at:
  16556. 456.20 s [algebraic-graphs] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  16557. 456.20 s [algebraic-graphs] No ghcjs found
  16558. 456.20 s [algebraic-graphs] No ghcjs-pkg found
  16559. 456.20 s [algebraic-graphs] No greencard found
  16560. 456.20 s [algebraic-graphs] Using haddock version 2.31.1 found on system at:
  16561. 456.20 s [algebraic-graphs] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  16562. 456.20 s [algebraic-graphs] No happy found
  16563. 456.20 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  16564. 456.20 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16565. 456.20 s [algebraic-graphs] No hmake found
  16566. 456.20 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  16567. 456.21 s [algebraic-graphs] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  16568. 456.21 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  16569. 456.21 s [algebraic-graphs] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  16570. 456.21 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  16571. 456.21 s [algebraic-graphs] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  16572. 456.21 s [algebraic-graphs] No jhc found
  16573. 456.21 s [algebraic-graphs] Using ld found on system at:
  16574. 456.21 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  16575. 456.21 s [algebraic-graphs] No pkg-config found
  16576. 456.21 s [algebraic-graphs] Using runghc version 9.10.3 found on system at:
  16577. 456.21 s [algebraic-graphs] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  16578. 456.21 s [algebraic-graphs] Using strip version 2.44 found on system at:
  16579. 456.21 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  16580. 456.21 s [algebraic-graphs] Using tar found on system at:
  16581. 456.21 s [algebraic-graphs] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  16582. 456.21 s [algebraic-graphs] No uhc found
  16583. 456.39 s [algebraic-graphs] Phase: buildPhase
  16584. 456.44 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  16585. 456.44 s [algebraic-graphs] Building library for algebraic-graphs-0.7...
  16586. 456.54 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 )
  16587. 457.48 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 )
  16588. 458.19 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 )
  16589. 458.49 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 )
  16590. 458.57 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  16591. 459.61 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 )
  16592. 459.82 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 )
  16593. 460.34 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 )
  16594. 460.94 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 )
  16595. 460.94 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 )
  16596. 460.94 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 )
  16597. 460.94 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  16598. 460.94 s [algebraic-graphs] In the use of ‘head’
  16599. 460.94 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16600. 460.94 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16601. 460.94 s [algebraic-graphs] |
  16602. 460.94 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  16603. 460.94 s [algebraic-graphs] | ^^^^
  16604. 460.94 s [algebraic-graphs]
  16605. 460.94 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  16606. 460.94 s [algebraic-graphs] In the use of ‘tail’
  16607. 460.94 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16608. 460.94 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16609. 460.94 s [algebraic-graphs] |
  16610. 460.94 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  16611. 460.94 s [algebraic-graphs] | ^^^^
  16612. 460.94 s [algebraic-graphs]
  16613. 460.94 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  16614. 460.94 s [algebraic-graphs] In the use of ‘head’
  16615. 460.94 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16616. 460.94 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16617. 460.94 s [algebraic-graphs] |
  16618. 460.94 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  16619. 460.94 s [algebraic-graphs] | ^^^^
  16620. 460.94 s [algebraic-graphs]
  16621. 460.94 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  16622. 460.94 s [algebraic-graphs] In the use of ‘tail’
  16623. 460.94 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16624. 460.94 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16625. 460.94 s [algebraic-graphs] |
  16626. 460.94 s [algebraic-graphs] 397 | bnd' = tail bnd
  16627. 460.94 s [algebraic-graphs] | ^^^^
  16628. 460.94 s [algebraic-graphs]
  16629. 460.94 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 )
  16630. 460.94 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 )
  16631. 460.94 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16632. 460.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16633. 460.94 s [algebraic-graphs] will become an error in a future GHC release.
  16634. 460.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16635. 460.94 s [algebraic-graphs] |
  16636. 460.94 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  16637. 460.94 s [algebraic-graphs] | ^
  16638. 460.94 s [algebraic-graphs]
  16639. 460.94 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16640. 460.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16641. 460.94 s [algebraic-graphs] will become an error in a future GHC release.
  16642. 460.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16643. 460.94 s [algebraic-graphs] |
  16644. 460.94 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16645. 460.94 s [algebraic-graphs] | ^
  16646. 460.94 s [algebraic-graphs]
  16647. 460.94 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16648. 460.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16649. 460.94 s [algebraic-graphs] will become an error in a future GHC release.
  16650. 460.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16651. 460.94 s [algebraic-graphs] |
  16652. 460.94 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16653. 460.94 s [algebraic-graphs] | ^
  16654. 460.94 s [algebraic-graphs]
  16655. 460.94 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16656. 460.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16657. 460.94 s [algebraic-graphs] will become an error in a future GHC release.
  16658. 460.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16659. 460.94 s [algebraic-graphs] |
  16660. 460.94 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16661. 460.94 s [algebraic-graphs] | ^
  16662. 460.94 s [algebraic-graphs]
  16663. 460.94 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16664. 460.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16665. 460.94 s [algebraic-graphs] will become an error in a future GHC release.
  16666. 460.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16667. 460.94 s [algebraic-graphs] |
  16668. 460.94 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16669. 460.94 s [algebraic-graphs] | ^
  16670. 460.94 s [algebraic-graphs]
  16671. 460.94 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16672. 460.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16673. 460.94 s [algebraic-graphs] will become an error in a future GHC release.
  16674. 460.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16675. 460.94 s [algebraic-graphs] |
  16676. 460.94 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16677. 460.94 s [algebraic-graphs] | ^
  16678. 460.94 s [algebraic-graphs]
  16679. 460.94 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16680. 460.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16681. 460.94 s [algebraic-graphs] will become an error in a future GHC release.
  16682. 460.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16683. 460.94 s [algebraic-graphs] |
  16684. 460.94 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16685. 460.94 s [algebraic-graphs] | ^
  16686. 460.94 s [algebraic-graphs]
  16687. 460.94 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 )
  16688. 461.05 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 )
  16689. 461.37 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 )
  16690. 461.37 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 )
  16691. 461.37 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 )
  16692. 461.82 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 )
  16693. 461.97 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 )
  16694. 462.20 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 )
  16695. 462.20 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16696. 462.20 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16697. 462.20 s [algebraic-graphs] will become an error in a future GHC release.
  16698. 462.20 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16699. 462.20 s [algebraic-graphs] |
  16700. 462.20 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  16701. 462.20 s [algebraic-graphs] | ^
  16702. 462.20 s [algebraic-graphs]
  16703. 462.20 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 )
  16704. 462.20 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16705. 462.20 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16706. 462.20 s [algebraic-graphs] will become an error in a future GHC release.
  16707. 462.20 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16708. 462.20 s [algebraic-graphs] |
  16709. 462.20 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  16710. 462.20 s [algebraic-graphs] | ^
  16711. 462.20 s [algebraic-graphs]
  16712. 462.20 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16713. 462.20 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16714. 462.20 s [algebraic-graphs] will become an error in a future GHC release.
  16715. 462.20 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16716. 462.20 s [algebraic-graphs] |
  16717. 462.20 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  16718. 462.20 s [algebraic-graphs] | ^
  16719. 462.20 s [algebraic-graphs]
  16720. 462.20 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 )
  16721. 462.20 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 )
  16722. 462.20 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 )
  16723. 462.20 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 )
  16724. 462.20 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 )
  16725. 462.20 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 )
  16726. 462.23 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 )
  16727. 462.58 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  16728. 463.75 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  16729. 464.56 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 )
  16730. 465.02 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  16731. 465.02 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  16732. 466.10 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 )
  16733. 466.42 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 )
  16734. 466.87 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 )
  16735. 467.56 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  16736. 467.56 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 )
  16737. 467.56 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 )
  16738. 467.56 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  16739. 467.56 s [algebraic-graphs] In the use of ‘head’
  16740. 467.56 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16741. 467.56 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16742. 467.56 s [algebraic-graphs] |
  16743. 467.56 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  16744. 467.56 s [algebraic-graphs] | ^^^^
  16745. 467.56 s [algebraic-graphs]
  16746. 467.56 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  16747. 467.56 s [algebraic-graphs] In the use of ‘tail’
  16748. 467.56 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16749. 467.56 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16750. 467.56 s [algebraic-graphs] |
  16751. 467.56 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  16752. 467.56 s [algebraic-graphs] | ^^^^
  16753. 467.56 s [algebraic-graphs]
  16754. 467.56 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  16755. 467.56 s [algebraic-graphs] In the use of ‘head’
  16756. 467.56 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16757. 467.56 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16758. 467.56 s [algebraic-graphs] |
  16759. 467.56 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  16760. 467.56 s [algebraic-graphs] | ^^^^
  16761. 467.56 s [algebraic-graphs]
  16762. 467.56 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  16763. 467.56 s [algebraic-graphs] In the use of ‘tail’
  16764. 467.56 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16765. 467.56 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16766. 467.56 s [algebraic-graphs] |
  16767. 467.56 s [algebraic-graphs] 397 | bnd' = tail bnd
  16768. 467.56 s [algebraic-graphs] | ^^^^
  16769. 467.56 s [algebraic-graphs]
  16770. 467.56 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 )
  16771. 467.56 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  16772. 467.56 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16773. 467.56 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16774. 467.56 s [algebraic-graphs] will become an error in a future GHC release.
  16775. 467.56 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16776. 467.56 s [algebraic-graphs] |
  16777. 467.56 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  16778. 467.57 s [algebraic-graphs] | ^
  16779. 467.57 s [algebraic-graphs]
  16780. 467.57 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16781. 467.57 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16782. 467.57 s [algebraic-graphs] will become an error in a future GHC release.
  16783. 467.57 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16784. 467.57 s [algebraic-graphs] |
  16785. 467.57 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16786. 467.57 s [algebraic-graphs] | ^
  16787. 467.57 s [algebraic-graphs]
  16788. 467.57 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16789. 467.57 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16790. 467.57 s [algebraic-graphs] will become an error in a future GHC release.
  16791. 467.57 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16792. 467.57 s [algebraic-graphs] |
  16793. 467.57 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16794. 467.57 s [algebraic-graphs] | ^
  16795. 467.57 s [algebraic-graphs]
  16796. 467.57 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16797. 467.57 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16798. 467.57 s [algebraic-graphs] will become an error in a future GHC release.
  16799. 467.57 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16800. 467.57 s [algebraic-graphs] |
  16801. 467.57 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16802. 467.57 s [algebraic-graphs] | ^
  16803. 467.57 s [algebraic-graphs]
  16804. 467.57 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16805. 467.57 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16806. 467.57 s [algebraic-graphs] will become an error in a future GHC release.
  16807. 467.57 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16808. 467.57 s [algebraic-graphs] |
  16809. 467.57 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16810. 467.57 s [algebraic-graphs] | ^
  16811. 467.57 s [algebraic-graphs]
  16812. 467.57 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16813. 467.57 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16814. 467.57 s [algebraic-graphs] will become an error in a future GHC release.
  16815. 467.57 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16816. 467.57 s [algebraic-graphs] |
  16817. 467.57 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16818. 467.57 s [algebraic-graphs] | ^
  16819. 467.57 s [algebraic-graphs]
  16820. 467.57 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16821. 467.57 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16822. 467.57 s [algebraic-graphs] will become an error in a future GHC release.
  16823. 467.57 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16824. 467.57 s [algebraic-graphs] |
  16825. 467.57 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16826. 467.57 s [algebraic-graphs] | ^
  16827. 467.57 s [algebraic-graphs]
  16828. 467.57 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  16829. 467.76 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 )
  16830. 468.21 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  16831. 468.21 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 )
  16832. 468.21 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  16833. 468.57 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 )
  16834. 468.85 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 )
  16835. 468.97 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  16836. 468.97 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16837. 468.97 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16838. 468.97 s [algebraic-graphs] will become an error in a future GHC release.
  16839. 468.97 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16840. 468.97 s [algebraic-graphs] |
  16841. 468.97 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  16842. 468.97 s [algebraic-graphs] | ^
  16843. 468.97 s [algebraic-graphs]
  16844. 468.97 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 )
  16845. 468.97 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16846. 468.97 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16847. 468.97 s [algebraic-graphs] will become an error in a future GHC release.
  16848. 468.97 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16849. 468.97 s [algebraic-graphs] |
  16850. 468.97 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  16851. 468.97 s [algebraic-graphs] | ^
  16852. 468.97 s [algebraic-graphs]
  16853. 468.97 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16854. 468.97 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16855. 468.97 s [algebraic-graphs] will become an error in a future GHC release.
  16856. 468.97 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16857. 468.97 s [algebraic-graphs] |
  16858. 468.97 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  16859. 468.97 s [algebraic-graphs] | ^
  16860. 468.97 s [algebraic-graphs]
  16861. 468.97 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  16862. 468.97 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  16863. 468.98 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 )
  16864. 469.16 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 )
  16865. 469.16 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 )
  16866. 469.16 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 )
  16867. 469.18 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  16868. 470.35 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  16869. 470.35 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7...
  16870. 470.46 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 )
  16871. 471.57 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 )
  16872. 473.92 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 )
  16873. 473.97 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 )
  16874. 474.06 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 )
  16875. 475.81 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 )
  16876. 475.81 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 )
  16877. 475.81 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 )
  16878. 479.26 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 )
  16879. 479.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 )
  16880. 479.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 )
  16881. 480.21 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 )
  16882. 480.21 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 )
  16883. 480.21 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 )
  16884. 481.27 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 )
  16885. 481.27 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 )
  16886. 481.27 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 )
  16887. 481.27 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 )
  16888. 481.27 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 )
  16889. 481.27 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 )
  16890. 481.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  16891. 481.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  16892. 481.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  16893. 481.27 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  16894. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  16895. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  16896. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  16897. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  16898. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  16899. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  16900. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  16901. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  16902. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  16903. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  16904. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  16905. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  16906. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  16907. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  16908. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  16909. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  16910. 481.28 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  16911. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  16912. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  16913. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16914. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  16915. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16916. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  16917. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  16918. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  16919. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  16920. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  16921. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  16922. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  16923. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  16924. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  16925. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  16926. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  16927. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16928. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  16929. 481.29 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  16930. 481.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16931. 481.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  16932. 481.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  16933. 481.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  16934. 481.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  16935. 481.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  16936. 481.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  16937. 481.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  16938. 481.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  16939. 481.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  16940. 481.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  16941. 481.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  16942. 481.30 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  16943. 481.32 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  16944. 481.32 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  16945. 481.32 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  16946. 481.32 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  16947. 481.32 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  16948. 481.32 s [algebraic-graphs] inspection testing successful
  16949. 481.32 s [algebraic-graphs] expected successes: 58
  16950. 481.32 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 )
  16951. 481.32 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 )
  16952. 481.32 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 )
  16953. 482.32 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  16954. 483.29 s [algebraic-graphs] Phase: checkPhase
  16955. 483.50 s [algebraic-graphs] Running 1 test suites...
  16956. 483.50 s [algebraic-graphs] Test suite main: RUNNING...
  16957. 492.75 s [algebraic-graphs]
  16958. 492.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  16959. 492.79 s [algebraic-graphs] OK: show empty == "empty"
  16960. 492.79 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  16961. 492.79 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  16962. 492.79 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  16963. 492.79 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  16964. 492.79 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  16965. 492.79 s [algebraic-graphs]
  16966. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  16967. 492.79 s [algebraic-graphs] OK: fromAcyclic empty == empty
  16968. 492.79 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  16969. 492.79 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  16970. 492.79 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  16971. 492.79 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  16972. 492.79 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  16973. 492.79 s [algebraic-graphs]
  16974. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  16975. 492.79 s [algebraic-graphs] OK: isEmpty empty == True
  16976. 492.79 s [algebraic-graphs] OK: hasVertex x empty == False
  16977. 492.79 s [algebraic-graphs] OK: vertexCount empty == 0
  16978. 492.79 s [algebraic-graphs] OK: edgeCount empty == 0
  16979. 492.79 s [algebraic-graphs]
  16980. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  16981. 492.79 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16982. 492.79 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16983. 492.79 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16984. 492.79 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16985. 492.79 s [algebraic-graphs]
  16986. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  16987. 492.79 s [algebraic-graphs] OK: vertices [] == empty
  16988. 492.79 s [algebraic-graphs] OK: vertices [x] == vertex x
  16989. 492.79 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  16990. 492.79 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  16991. 492.79 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16992. 492.79 s [algebraic-graphs]
  16993. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  16994. 492.79 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  16995. 492.79 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  16996. 492.79 s [algebraic-graphs]
  16997. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  16998. 492.79 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  16999. 492.79 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  17000. 492.79 s [algebraic-graphs]
  17001. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  17002. 492.79 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17003. 492.79 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17004. 492.79 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17005. 492.79 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  17006. 492.79 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17007. 492.79 s [algebraic-graphs]
  17008. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  17009. 492.79 s [algebraic-graphs] OK: isEmpty empty == True
  17010. 492.79 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17011. 492.79 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17012. 492.79 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  17013. 492.79 s [algebraic-graphs]
  17014. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  17015. 492.79 s [algebraic-graphs] OK: hasVertex x empty == False
  17016. 492.79 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17017. 492.79 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17018. 492.79 s [algebraic-graphs]
  17019. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  17020. 492.79 s [algebraic-graphs] OK: hasEdge x y empty == False
  17021. 492.79 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17022. 492.79 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  17023. 492.79 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17024. 492.79 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17025. 492.79 s [algebraic-graphs]
  17026. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  17027. 492.79 s [algebraic-graphs] OK: vertexCount empty == 0
  17028. 492.79 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17029. 492.79 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17030. 492.79 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17031. 492.79 s [algebraic-graphs]
  17032. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  17033. 492.79 s [algebraic-graphs] OK: edgeCount empty == 0
  17034. 492.79 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17035. 492.79 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  17036. 492.79 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17037. 492.79 s [algebraic-graphs]
  17038. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  17039. 492.79 s [algebraic-graphs] OK: vertexList empty == []
  17040. 492.79 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17041. 492.79 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17042. 492.79 s [algebraic-graphs]
  17043. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  17044. 492.79 s [algebraic-graphs] OK: edgeList empty == []
  17045. 492.79 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17046. 492.79 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  17047. 492.79 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17048. 492.79 s [algebraic-graphs]
  17049. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  17050. 492.79 s [algebraic-graphs] OK: adjacencyList empty == []
  17051. 492.79 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17052. 492.79 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  17053. 492.79 s [algebraic-graphs]
  17054. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  17055. 492.79 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17056. 492.79 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17057. 492.79 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17058. 492.79 s [algebraic-graphs]
  17059. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  17060. 492.79 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17061. 492.79 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17062. 492.79 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  17063. 492.79 s [algebraic-graphs]
  17064. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  17065. 492.79 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17066. 492.79 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17067. 492.79 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  17068. 492.79 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  17069. 492.79 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  17070. 492.79 s [algebraic-graphs]
  17071. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  17072. 492.79 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17073. 492.79 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17074. 492.79 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  17075. 492.79 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  17076. 492.79 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  17077. 492.79 s [algebraic-graphs]
  17078. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  17079. 492.79 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17080. 492.79 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17081. 492.79 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  17082. 492.79 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17083. 492.79 s [algebraic-graphs]
  17084. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  17085. 492.79 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  17086. 492.79 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17087. 492.79 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17088. 492.79 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  17089. 492.79 s [algebraic-graphs]
  17090. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  17091. 492.79 s [algebraic-graphs] OK: transpose empty == empty
  17092. 492.79 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17093. 492.79 s [algebraic-graphs] OK: transpose . transpose == id
  17094. 492.79 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17095. 492.79 s [algebraic-graphs]
  17096. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  17097. 492.79 s [algebraic-graphs] OK: induce (const True ) x == x
  17098. 492.79 s [algebraic-graphs] OK: induce (const False) x == empty
  17099. 492.79 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17100. 492.79 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17101. 492.79 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17102. 492.79 s [algebraic-graphs]
  17103. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  17104. 492.79 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  17105. 492.79 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  17106. 492.79 s [algebraic-graphs]
  17107. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  17108. 492.79 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  17109. 492.79 s [algebraic-graphs]
  17110. 492.79 s [algebraic-graphs] OK: box x y ~~ box y x
  17111. 492.79 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  17112. 492.79 s [algebraic-graphs] OK: box x empty ~~ empty
  17113. 492.79 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  17114. 492.79 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  17115. 492.79 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  17116. 492.79 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  17117. 492.79 s [algebraic-graphs]
  17118. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  17119. 492.79 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17120. 492.79 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17121. 492.79 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  17122. 492.79 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17123. 492.79 s [algebraic-graphs]
  17124. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  17125. 492.79 s [algebraic-graphs] OK: topSort empty == []
  17126. 492.79 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  17127. 492.79 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  17128. 492.79 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  17129. 492.79 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  17130. 492.79 s [algebraic-graphs]
  17131. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  17132. 492.79 s [algebraic-graphs] OK: scc empty == empty
  17133. 492.79 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  17134. 492.79 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  17135. 492.79 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  17136. 492.79 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  17137. 492.79 s [algebraic-graphs]
  17138. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  17139. 492.79 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  17140. 492.79 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  17141. 492.79 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  17142. 492.79 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  17143. 492.79 s [algebraic-graphs]
  17144. 492.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  17145. 492.79 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  17146. 492.79 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  17147. 492.79 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  17148. 492.79 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  17149. 492.79 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  17150. 492.79 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  17151. 497.66 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  17152. 497.66 s [algebraic-graphs]
  17153. 497.66 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  17154. 497.66 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  17155. 497.66 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  17156. 497.66 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  17157. 497.66 s [algebraic-graphs]
  17158. 497.66 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  17159. 497.66 s [algebraic-graphs] OK: Arbitrary
  17160. 497.66 s [algebraic-graphs] OK: empty
  17161. 497.66 s [algebraic-graphs] OK: vertex
  17162. 497.66 s [algebraic-graphs] OK: vertices
  17163. 497.66 s [algebraic-graphs] OK: union
  17164. 497.66 s [algebraic-graphs] OK: join
  17165. 497.66 s [algebraic-graphs] OK: transpose
  17166. 497.66 s [algebraic-graphs] OK: box
  17167. 497.66 s [algebraic-graphs] OK: transitiveClosure
  17168. 497.66 s [algebraic-graphs] OK: scc
  17169. 497.66 s [algebraic-graphs] OK: toAcyclic
  17170. 497.66 s [algebraic-graphs] OK: toAcyclicOrd
  17171. 497.66 s [algebraic-graphs]
  17172. 497.66 s [algebraic-graphs] ============ AdjacencyIntMap ============
  17173. 497.66 s [algebraic-graphs] OK: Axioms of graphs
  17174. 497.66 s [algebraic-graphs]
  17175. 497.66 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  17176. 497.66 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  17177. 497.66 s [algebraic-graphs]
  17178. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  17179. 497.67 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  17180. 497.67 s [algebraic-graphs]
  17181. 497.67 s [algebraic-graphs] OK: consistent empty == True
  17182. 497.67 s [algebraic-graphs] OK: consistent (vertex x) == True
  17183. 497.67 s [algebraic-graphs] OK: consistent (overlay x y) == True
  17184. 497.67 s [algebraic-graphs] OK: consistent (connect x y) == True
  17185. 497.67 s [algebraic-graphs] OK: consistent (edge x y) == True
  17186. 497.67 s [algebraic-graphs] OK: consistent (edges xs) == True
  17187. 497.67 s [algebraic-graphs] OK: consistent (stars xs) == True
  17188. 497.67 s [algebraic-graphs]
  17189. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  17190. 497.67 s [algebraic-graphs] OK: show (empty ) == "empty"
  17191. 497.67 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  17192. 497.67 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  17193. 497.67 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  17194. 497.67 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  17195. 497.67 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  17196. 497.67 s [algebraic-graphs]
  17197. 497.67 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  17198. 497.67 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  17199. 497.67 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  17200. 497.67 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  17201. 497.67 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  17202. 497.67 s [algebraic-graphs]
  17203. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  17204. 497.67 s [algebraic-graphs] OK: vertex 1 < vertex 2
  17205. 497.67 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  17206. 497.67 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  17207. 497.67 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  17208. 497.67 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  17209. 497.67 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  17210. 497.67 s [algebraic-graphs] OK: x <= x + y
  17211. 497.67 s [algebraic-graphs] OK: x + y <= x * y
  17212. 497.67 s [algebraic-graphs]
  17213. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  17214. 497.67 s [algebraic-graphs] OK: isEmpty empty == True
  17215. 497.67 s [algebraic-graphs] OK: hasVertex x empty == False
  17216. 497.67 s [algebraic-graphs] OK: vertexCount empty == 0
  17217. 497.67 s [algebraic-graphs] OK: edgeCount empty == 0
  17218. 497.67 s [algebraic-graphs]
  17219. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  17220. 497.67 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17221. 497.67 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17222. 497.67 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17223. 497.67 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17224. 497.67 s [algebraic-graphs]
  17225. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  17226. 497.67 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  17227. 497.67 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17228. 497.67 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17229. 497.67 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  17230. 497.67 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17231. 497.67 s [algebraic-graphs]
  17232. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  17233. 497.67 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17234. 497.67 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17235. 497.67 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17236. 497.67 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17237. 497.67 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17238. 497.67 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17239. 497.67 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17240. 497.67 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17241. 497.67 s [algebraic-graphs]
  17242. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  17243. 497.67 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17244. 497.67 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17245. 497.67 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17246. 497.67 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17247. 497.67 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17248. 497.67 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17249. 497.67 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17250. 497.67 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17251. 497.67 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17252. 497.67 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17253. 497.67 s [algebraic-graphs]
  17254. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  17255. 497.67 s [algebraic-graphs] OK: vertices [] == empty
  17256. 497.67 s [algebraic-graphs] OK: vertices [x] == vertex x
  17257. 497.67 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17258. 497.67 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17259. 497.67 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17260. 497.67 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17261. 497.67 s [algebraic-graphs]
  17262. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  17263. 497.67 s [algebraic-graphs] OK: edges [] == empty
  17264. 497.67 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17265. 497.67 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17266. 497.67 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17267. 497.67 s [algebraic-graphs]
  17268. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  17269. 497.67 s [algebraic-graphs] OK: overlays [] == empty
  17270. 497.67 s [algebraic-graphs] OK: overlays [x] == x
  17271. 497.67 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17272. 497.67 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17273. 497.67 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17274. 497.67 s [algebraic-graphs]
  17275. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  17276. 497.67 s [algebraic-graphs] OK: connects [] == empty
  17277. 497.67 s [algebraic-graphs] OK: connects [x] == x
  17278. 497.67 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17279. 497.67 s [algebraic-graphs] OK: connects == foldr connect empty
  17280. 497.67 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17281. 497.67 s [algebraic-graphs]
  17282. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  17283. 497.67 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  17284. 497.67 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  17285. 497.67 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  17286. 497.67 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  17287. 497.67 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  17288. 497.67 s [algebraic-graphs]
  17289. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  17290. 497.67 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17291. 497.67 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17292. 497.67 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  17293. 497.67 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17294. 497.67 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  17295. 497.67 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17296. 497.67 s [algebraic-graphs]
  17297. 497.67 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  17298. 497.67 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  17299. 497.67 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  17300. 497.67 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  17301. 497.67 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  17302. 497.67 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  17303. 497.67 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  17304. 497.67 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  17305. 497.67 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  17306. 497.67 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  17307. 497.67 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  17308. 497.67 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  17309. 497.67 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  17310. 497.67 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  17311. 497.67 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  17312. 497.67 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  17313. 497.67 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  17314. 497.67 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  17315. 497.67 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  17316. 497.67 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  17317. 497.67 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  17318. 497.67 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  17319. 497.67 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  17320. 497.67 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  17321. 497.67 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  17322. 497.67 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  17323. 497.67 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  17324. 497.67 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  17325. 497.67 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  17326. 497.67 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17327. 497.67 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  17328. 497.67 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  17329. 497.67 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  17330. 497.67 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  17331. 497.67 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  17332. 498.59 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17333. 498.59 s [algebraic-graphs]
  17334. 498.59 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  17335. 498.69 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  17336. 498.69 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  17337. 498.69 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  17338. 498.69 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  17339. 498.69 s [algebraic-graphs]
  17340. 498.69 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  17341. 498.69 s [algebraic-graphs] OK: isEmpty empty == True
  17342. 498.69 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17343. 498.69 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17344. 498.69 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17345. 498.69 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  17346. 498.69 s [algebraic-graphs]
  17347. 498.69 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  17348. 498.69 s [algebraic-graphs] OK: hasVertex x empty == False
  17349. 498.69 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17350. 498.69 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17351. 498.69 s [algebraic-graphs]
  17352. 498.69 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  17353. 498.69 s [algebraic-graphs] OK: hasEdge x y empty == False
  17354. 498.69 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17355. 498.69 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17356. 498.69 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17357. 498.69 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17358. 498.69 s [algebraic-graphs]
  17359. 498.69 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  17360. 498.70 s [algebraic-graphs] OK: vertexCount empty == 0
  17361. 498.70 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17362. 498.70 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17363. 498.70 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17364. 498.70 s [algebraic-graphs]
  17365. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  17366. 498.70 s [algebraic-graphs] OK: edgeCount empty == 0
  17367. 498.70 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17368. 498.70 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17369. 498.70 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17370. 498.70 s [algebraic-graphs]
  17371. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  17372. 498.70 s [algebraic-graphs] OK: vertexList empty == []
  17373. 498.70 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17374. 498.70 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17375. 498.70 s [algebraic-graphs]
  17376. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  17377. 498.70 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17378. 498.70 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17379. 498.70 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17380. 498.70 s [algebraic-graphs]
  17381. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  17382. 498.70 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  17383. 498.70 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  17384. 498.70 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  17385. 498.70 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  17386. 498.70 s [algebraic-graphs]
  17387. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  17388. 498.70 s [algebraic-graphs] OK: edgeList empty == []
  17389. 498.70 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17390. 498.70 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  17391. 498.70 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  17392. 498.70 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  17393. 498.70 s [algebraic-graphs]
  17394. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  17395. 498.70 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17396. 498.70 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17397. 498.70 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  17398. 498.70 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  17399. 498.70 s [algebraic-graphs]
  17400. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  17401. 498.70 s [algebraic-graphs] OK: adjacencyList empty == []
  17402. 498.70 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17403. 498.70 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  17404. 498.70 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  17405. 498.70 s [algebraic-graphs]
  17406. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  17407. 498.70 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17408. 498.70 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17409. 498.70 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  17410. 498.70 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  17411. 498.70 s [algebraic-graphs]
  17412. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  17413. 498.70 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  17414. 498.70 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  17415. 498.70 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  17416. 498.70 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  17417. 498.70 s [algebraic-graphs]
  17418. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  17419. 498.70 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17420. 498.70 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17421. 498.70 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  17422. 498.70 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  17423. 498.70 s [algebraic-graphs]
  17424. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  17425. 498.70 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  17426. 498.70 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  17427. 498.70 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  17428. 498.70 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  17429. 498.70 s [algebraic-graphs]
  17430. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  17431. 498.70 s [algebraic-graphs] OK: path [] == empty
  17432. 498.70 s [algebraic-graphs] OK: path [x] == vertex x
  17433. 498.70 s [algebraic-graphs] OK: path [x,y] == edge x y
  17434. 498.70 s [algebraic-graphs]
  17435. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  17436. 498.70 s [algebraic-graphs] OK: circuit [] == empty
  17437. 498.70 s [algebraic-graphs] OK: circuit [x] == edge x x
  17438. 498.70 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  17439. 498.70 s [algebraic-graphs]
  17440. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  17441. 498.70 s [algebraic-graphs] OK: clique [] == empty
  17442. 498.70 s [algebraic-graphs] OK: clique [x] == vertex x
  17443. 498.70 s [algebraic-graphs] OK: clique [x,y] == edge x y
  17444. 498.70 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  17445. 498.70 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  17446. 498.70 s [algebraic-graphs]
  17447. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  17448. 498.70 s [algebraic-graphs] OK: biclique [] [] == empty
  17449. 498.70 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  17450. 498.70 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  17451. 498.70 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  17452. 498.70 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  17453. 498.70 s [algebraic-graphs]
  17454. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  17455. 498.70 s [algebraic-graphs] OK: star x [] == vertex x
  17456. 498.70 s [algebraic-graphs] OK: star x [y] == edge x y
  17457. 498.70 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  17458. 498.70 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  17459. 498.70 s [algebraic-graphs]
  17460. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  17461. 498.70 s [algebraic-graphs] OK: stars [] == empty
  17462. 498.70 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  17463. 498.70 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  17464. 498.70 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  17465. 498.70 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  17466. 498.70 s [algebraic-graphs] OK: stars . adjacencyList == id
  17467. 498.70 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  17468. 498.70 s [algebraic-graphs]
  17469. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  17470. 498.70 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  17471. 498.70 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  17472. 498.70 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  17473. 498.70 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  17474. 498.70 s [algebraic-graphs]
  17475. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  17476. 498.70 s [algebraic-graphs] OK: forest [] == empty
  17477. 498.70 s [algebraic-graphs] OK: forest [x] == tree x
  17478. 498.70 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  17479. 498.70 s [algebraic-graphs] OK: forest == overlays . map tree
  17480. 498.70 s [algebraic-graphs]
  17481. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  17482. 498.70 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17483. 498.70 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17484. 498.70 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  17485. 498.70 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  17486. 498.70 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17487. 498.70 s [algebraic-graphs]
  17488. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  17489. 498.70 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  17490. 498.70 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17491. 498.70 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17492. 498.70 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  17493. 498.70 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  17494. 498.70 s [algebraic-graphs]
  17495. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  17496. 498.70 s [algebraic-graphs] OK: replaceVertex x x == id
  17497. 498.70 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  17498. 498.70 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  17499. 498.70 s [algebraic-graphs]
  17500. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  17501. 498.70 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  17502. 498.70 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  17503. 498.70 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  17504. 498.70 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  17505. 498.70 s [algebraic-graphs]
  17506. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  17507. 498.70 s [algebraic-graphs] OK: transpose empty == empty
  17508. 498.70 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17509. 498.70 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  17510. 498.70 s [algebraic-graphs] OK: transpose . transpose == id
  17511. 498.70 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17512. 498.70 s [algebraic-graphs]
  17513. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  17514. 498.70 s [algebraic-graphs] OK: gmap f empty == empty
  17515. 498.70 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  17516. 498.70 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  17517. 498.70 s [algebraic-graphs] OK: gmap id == id
  17518. 498.70 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  17519. 498.70 s [algebraic-graphs]
  17520. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  17521. 498.70 s [algebraic-graphs] OK: induce (const True ) x == x
  17522. 498.70 s [algebraic-graphs] OK: induce (const False) x == empty
  17523. 498.70 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17524. 498.70 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17525. 498.70 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17526. 498.70 s [algebraic-graphs]
  17527. 498.70 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  17528. 498.70 s [algebraic-graphs] OK: compose empty x == empty
  17529. 498.70 s [algebraic-graphs] OK: compose x empty == empty
  17530. 498.70 s [algebraic-graphs] OK: compose (vertex x) y == empty
  17531. 498.70 s [algebraic-graphs] OK: compose x (vertex y) == empty
  17532. 498.70 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  17533. 498.70 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  17534. 498.87 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  17535. 498.87 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  17536. 498.87 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  17537. 498.87 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  17538. 498.87 s [algebraic-graphs]
  17539. 498.87 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  17540. 498.87 s [algebraic-graphs] OK: closure empty == empty
  17541. 498.87 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  17542. 498.87 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  17543. 498.87 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17544. 498.87 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  17545. 498.87 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  17546. 498.87 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  17547. 498.87 s [algebraic-graphs] OK: closure . closure == closure
  17548. 498.87 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  17549. 498.87 s [algebraic-graphs]
  17550. 498.87 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  17551. 498.87 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  17552. 498.87 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  17553. 498.87 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  17554. 498.87 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17555. 498.87 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  17556. 498.87 s [algebraic-graphs]
  17557. 498.87 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  17558. 498.87 s [algebraic-graphs] OK: symmetricClosure empty == empty
  17559. 498.87 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  17560. 498.87 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  17561. 498.87 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  17562. 498.87 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  17563. 498.87 s [algebraic-graphs]
  17564. 498.87 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  17565. 498.87 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17566. 498.87 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17567. 498.87 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  17568. 498.87 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  17569. 498.87 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17570. 498.87 s [algebraic-graphs]
  17571. 498.87 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  17572. 498.87 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  17573. 498.87 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  17574. 498.87 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  17575. 498.87 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  17576. 498.87 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  17577. 498.87 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  17578. 498.87 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  17579. 498.87 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  17580. 498.87 s [algebraic-graphs] OK: bfsForest x [] == []
  17581. 498.87 s [algebraic-graphs] OK: bfsForest empty vs == []
  17582. 498.87 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17583. 498.87 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  17584. 498.87 s [algebraic-graphs]
  17585. 498.87 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  17586. 498.87 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  17587. 498.87 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  17588. 498.87 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  17589. 498.87 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  17590. 498.87 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  17591. 498.87 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  17592. 498.87 s [algebraic-graphs] OK: bfs empty vs == []
  17593. 498.87 s [algebraic-graphs] OK: bfs x [] == []
  17594. 498.87 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  17595. 498.87 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  17596. 498.87 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  17597. 498.87 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  17598. 498.87 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  17599. 498.87 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  17600. 498.87 s [algebraic-graphs]
  17601. 498.87 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  17602. 498.87 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  17603. 498.87 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  17604. 498.87 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  17605. 498.87 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  17606. 498.87 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  17607. 498.87 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  17608. 498.87 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  17609. 498.87 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  17610. 498.87 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  17611. 498.87 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  17612. 498.87 s [algebraic-graphs]
  17613. 498.87 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  17614. 498.87 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  17615. 498.87 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  17616. 498.87 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  17617. 498.87 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  17618. 498.87 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  17619. 498.87 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  17620. 498.87 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  17621. 498.87 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  17622. 498.87 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  17623. 498.87 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  17624. 498.88 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  17625. 498.88 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17626. 498.88 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  17627. 498.88 s [algebraic-graphs]
  17628. 498.88 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  17629. 498.88 s [algebraic-graphs] OK: dfs empty vs == []
  17630. 498.88 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  17631. 498.88 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  17632. 498.88 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  17633. 498.88 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  17634. 498.88 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  17635. 498.88 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  17636. 498.88 s [algebraic-graphs] OK: dfs x [] == []
  17637. 498.88 s [algebraic-graphs]
  17638. 498.88 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  17639. 498.88 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  17640. 498.88 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  17641. 498.88 s [algebraic-graphs]
  17642. 498.88 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  17643. 498.88 s [algebraic-graphs] OK: reachable empty x == []
  17644. 498.88 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  17645. 498.88 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  17646. 498.88 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  17647. 498.88 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  17648. 498.88 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  17649. 498.88 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  17650. 498.88 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  17651. 498.88 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  17652. 498.88 s [algebraic-graphs]
  17653. 498.88 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  17654. 498.88 s [algebraic-graphs]
  17655. 498.88 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  17656. 498.88 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  17657. 498.88 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  17658. 498.88 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  17659. 498.88 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  17660. 498.88 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  17661. 498.88 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  17662. 498.88 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  17663. 498.88 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  17664. 498.88 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  17665. 498.88 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  17666. 498.88 s [algebraic-graphs]
  17667. 498.88 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  17668. 498.88 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  17669. 498.88 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  17670. 498.88 s [algebraic-graphs] OK: isAcyclic . circuit == null
  17671. 498.88 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  17672. 498.88 s [algebraic-graphs]
  17673. 498.88 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  17674. 498.88 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  17675. 498.88 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  17676. 498.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  17677. 498.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  17678. 498.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  17679. 498.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  17680. 498.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  17681. 498.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  17682. 498.88 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  17683. 498.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  17684. 498.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  17685. 498.88 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  17686. 498.88 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  17687. 505.53 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  17688. 505.53 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  17689. 505.56 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  17690. 505.56 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  17691. 505.56 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  17692. 505.56 s [algebraic-graphs]
  17693. 505.56 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  17694. 505.56 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  17695. 505.56 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  17696. 505.56 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  17697. 505.56 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  17698. 505.56 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  17699. 505.56 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  17700. 505.56 s [algebraic-graphs]
  17701. 505.56 s [algebraic-graphs] ============ AdjacencyMap ============
  17702. 505.56 s [algebraic-graphs] OK: Axioms of graphs
  17703. 505.56 s [algebraic-graphs]
  17704. 505.56 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  17705. 505.56 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  17706. 505.56 s [algebraic-graphs]
  17707. 505.56 s [algebraic-graphs] OK: consistent empty == True
  17708. 505.56 s [algebraic-graphs] OK: consistent (vertex x) == True
  17709. 505.56 s [algebraic-graphs] OK: consistent (overlay x y) == True
  17710. 505.56 s [algebraic-graphs] OK: consistent (connect x y) == True
  17711. 505.56 s [algebraic-graphs] OK: consistent (edge x y) == True
  17712. 505.56 s [algebraic-graphs] OK: consistent (edges xs) == True
  17713. 505.56 s [algebraic-graphs] OK: consistent (stars xs) == True
  17714. 505.56 s [algebraic-graphs]
  17715. 505.56 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  17716. 505.56 s [algebraic-graphs] OK: show (empty ) == "empty"
  17717. 505.56 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  17718. 505.56 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  17719. 505.56 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  17720. 505.56 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  17721. 505.56 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  17722. 505.56 s [algebraic-graphs]
  17723. 505.56 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  17724. 505.56 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  17725. 505.56 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  17726. 505.56 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  17727. 505.56 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  17728. 505.56 s [algebraic-graphs]
  17729. 505.56 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  17730. 505.56 s [algebraic-graphs] OK: vertex 1 < vertex 2
  17731. 505.56 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  17732. 505.56 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  17733. 505.56 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  17734. 505.56 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  17735. 505.56 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  17736. 505.56 s [algebraic-graphs] OK: x <= x + y
  17737. 505.56 s [algebraic-graphs] OK: x + y <= x * y
  17738. 505.56 s [algebraic-graphs]
  17739. 505.56 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  17740. 505.56 s [algebraic-graphs] OK: isEmpty empty == True
  17741. 505.56 s [algebraic-graphs] OK: hasVertex x empty == False
  17742. 505.56 s [algebraic-graphs] OK: vertexCount empty == 0
  17743. 505.56 s [algebraic-graphs] OK: edgeCount empty == 0
  17744. 505.56 s [algebraic-graphs]
  17745. 505.56 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  17746. 505.57 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17747. 505.57 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17748. 505.57 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17749. 505.57 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17750. 505.57 s [algebraic-graphs]
  17751. 505.57 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  17752. 505.57 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  17753. 505.57 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17754. 505.57 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17755. 505.57 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  17756. 505.57 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17757. 505.57 s [algebraic-graphs]
  17758. 505.57 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  17759. 505.57 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17760. 505.57 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17761. 505.57 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17762. 505.57 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17763. 505.57 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17764. 505.57 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17765. 505.57 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17766. 505.57 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17767. 505.57 s [algebraic-graphs]
  17768. 505.57 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  17769. 505.57 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17770. 505.57 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17771. 505.57 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17772. 505.57 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17773. 505.57 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17774. 505.57 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17775. 505.57 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17776. 505.57 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17777. 505.57 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17778. 505.57 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17779. 505.57 s [algebraic-graphs]
  17780. 505.57 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  17781. 505.57 s [algebraic-graphs] OK: vertices [] == empty
  17782. 505.57 s [algebraic-graphs] OK: vertices [x] == vertex x
  17783. 505.57 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17784. 505.57 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17785. 505.57 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17786. 505.57 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17787. 505.57 s [algebraic-graphs]
  17788. 505.57 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  17789. 505.57 s [algebraic-graphs] OK: edges [] == empty
  17790. 505.57 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17791. 505.57 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17792. 505.57 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17793. 505.57 s [algebraic-graphs]
  17794. 505.57 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  17795. 505.57 s [algebraic-graphs] OK: overlays [] == empty
  17796. 505.57 s [algebraic-graphs] OK: overlays [x] == x
  17797. 505.57 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17798. 505.57 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17799. 505.57 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17800. 505.57 s [algebraic-graphs]
  17801. 505.57 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  17802. 505.57 s [algebraic-graphs] OK: connects [] == empty
  17803. 505.57 s [algebraic-graphs] OK: connects [x] == x
  17804. 505.57 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17805. 505.57 s [algebraic-graphs] OK: connects == foldr connect empty
  17806. 505.57 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17807. 505.57 s [algebraic-graphs]
  17808. 505.57 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  17809. 505.57 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  17810. 505.57 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  17811. 505.57 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  17812. 505.57 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  17813. 505.57 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  17814. 505.57 s [algebraic-graphs]
  17815. 505.57 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  17816. 505.57 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17817. 505.57 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17818. 505.57 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  17819. 505.57 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17820. 505.57 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  17821. 505.57 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17822. 505.57 s [algebraic-graphs]
  17823. 505.57 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  17824. 505.57 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  17825. 505.57 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  17826. 505.57 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  17827. 505.57 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  17828. 505.57 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  17829. 505.57 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  17830. 505.57 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  17831. 505.57 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  17832. 505.57 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  17833. 505.57 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  17834. 505.57 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  17835. 505.57 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  17836. 505.57 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  17837. 505.57 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  17838. 505.57 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  17839. 505.57 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  17840. 505.57 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  17841. 505.57 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  17842. 505.57 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  17843. 505.57 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  17844. 505.57 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  17845. 505.57 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  17846. 505.57 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  17847. 505.57 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  17848. 505.57 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  17849. 505.57 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  17850. 505.57 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  17851. 505.57 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  17852. 505.57 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17853. 505.57 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  17854. 505.57 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  17855. 505.57 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  17856. 505.57 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  17857. 507.52 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  17858. 507.52 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17859. 507.52 s [algebraic-graphs]
  17860. 507.52 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  17861. 507.52 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  17862. 507.52 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  17863. 507.52 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  17864. 507.52 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  17865. 507.52 s [algebraic-graphs]
  17866. 507.52 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  17867. 507.52 s [algebraic-graphs] OK: isEmpty empty == True
  17868. 507.52 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17869. 507.52 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17870. 507.52 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17871. 507.52 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  17872. 507.52 s [algebraic-graphs]
  17873. 507.52 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  17874. 507.52 s [algebraic-graphs] OK: hasVertex x empty == False
  17875. 507.52 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17876. 507.52 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17877. 507.52 s [algebraic-graphs]
  17878. 507.52 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  17879. 507.52 s [algebraic-graphs] OK: hasEdge x y empty == False
  17880. 507.52 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17881. 507.52 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17882. 507.52 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17883. 507.52 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17884. 507.52 s [algebraic-graphs]
  17885. 507.52 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  17886. 507.52 s [algebraic-graphs] OK: vertexCount empty == 0
  17887. 507.52 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17888. 507.52 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17889. 507.52 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17890. 507.52 s [algebraic-graphs]
  17891. 507.52 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  17892. 507.52 s [algebraic-graphs] OK: edgeCount empty == 0
  17893. 507.52 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17894. 507.52 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17895. 507.52 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17896. 507.52 s [algebraic-graphs]
  17897. 507.52 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  17898. 507.52 s [algebraic-graphs] OK: vertexList empty == []
  17899. 507.52 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17900. 507.52 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17901. 507.52 s [algebraic-graphs]
  17902. 507.52 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  17903. 507.52 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17904. 507.52 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17905. 507.52 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17906. 507.52 s [algebraic-graphs]
  17907. 507.52 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  17908. 507.52 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  17909. 507.52 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  17910. 507.52 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  17911. 507.52 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  17912. 507.52 s [algebraic-graphs]
  17913. 507.52 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  17914. 507.52 s [algebraic-graphs] OK: edgeList empty == []
  17915. 507.52 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17916. 507.52 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  17917. 507.52 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  17918. 507.52 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  17919. 507.52 s [algebraic-graphs]
  17920. 507.52 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  17921. 507.52 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17922. 507.52 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17923. 507.52 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  17924. 507.52 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  17925. 507.52 s [algebraic-graphs]
  17926. 507.52 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  17927. 507.52 s [algebraic-graphs] OK: adjacencyList empty == []
  17928. 507.52 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17929. 507.52 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  17930. 507.52 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  17931. 507.52 s [algebraic-graphs]
  17932. 507.52 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  17933. 507.52 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17934. 507.52 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17935. 507.52 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  17936. 507.52 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  17937. 507.52 s [algebraic-graphs]
  17938. 507.52 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  17939. 507.52 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  17940. 507.52 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  17941. 507.52 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  17942. 507.52 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  17943. 507.52 s [algebraic-graphs]
  17944. 507.52 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  17945. 507.52 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17946. 507.52 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17947. 507.52 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  17948. 507.52 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  17949. 507.52 s [algebraic-graphs]
  17950. 507.52 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  17951. 507.52 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  17952. 507.52 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  17953. 507.52 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  17954. 507.52 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  17955. 507.52 s [algebraic-graphs]
  17956. 507.52 s [algebraic-graphs] ============ AdjacencyMap.path ============
  17957. 507.52 s [algebraic-graphs] OK: path [] == empty
  17958. 507.52 s [algebraic-graphs] OK: path [x] == vertex x
  17959. 507.52 s [algebraic-graphs] OK: path [x,y] == edge x y
  17960. 507.52 s [algebraic-graphs]
  17961. 507.52 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  17962. 507.52 s [algebraic-graphs] OK: circuit [] == empty
  17963. 507.52 s [algebraic-graphs] OK: circuit [x] == edge x x
  17964. 507.52 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  17965. 507.52 s [algebraic-graphs]
  17966. 507.52 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  17967. 507.52 s [algebraic-graphs] OK: clique [] == empty
  17968. 507.52 s [algebraic-graphs] OK: clique [x] == vertex x
  17969. 507.52 s [algebraic-graphs] OK: clique [x,y] == edge x y
  17970. 507.52 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  17971. 507.52 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  17972. 507.52 s [algebraic-graphs]
  17973. 507.52 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  17974. 507.52 s [algebraic-graphs] OK: biclique [] [] == empty
  17975. 507.52 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  17976. 507.52 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  17977. 507.52 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  17978. 507.52 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  17979. 507.52 s [algebraic-graphs]
  17980. 507.52 s [algebraic-graphs] ============ AdjacencyMap.star ============
  17981. 507.52 s [algebraic-graphs] OK: star x [] == vertex x
  17982. 507.52 s [algebraic-graphs] OK: star x [y] == edge x y
  17983. 507.52 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  17984. 507.52 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  17985. 507.52 s [algebraic-graphs]
  17986. 507.52 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  17987. 507.52 s [algebraic-graphs] OK: stars [] == empty
  17988. 507.52 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  17989. 507.52 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  17990. 507.53 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  17991. 507.53 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  17992. 507.53 s [algebraic-graphs] OK: stars . adjacencyList == id
  17993. 507.53 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  17994. 507.53 s [algebraic-graphs]
  17995. 507.53 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  17996. 507.53 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  17997. 507.53 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  17998. 507.53 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  17999. 507.53 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  18000. 507.53 s [algebraic-graphs]
  18001. 507.53 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  18002. 507.53 s [algebraic-graphs] OK: forest [] == empty
  18003. 507.53 s [algebraic-graphs] OK: forest [x] == tree x
  18004. 507.53 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  18005. 507.53 s [algebraic-graphs] OK: forest == overlays . map tree
  18006. 507.53 s [algebraic-graphs]
  18007. 507.53 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  18008. 507.53 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  18009. 507.53 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  18010. 507.53 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  18011. 507.53 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  18012. 507.53 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  18013. 507.53 s [algebraic-graphs]
  18014. 507.53 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  18015. 507.53 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  18016. 507.53 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18017. 507.53 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  18018. 507.53 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  18019. 507.53 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  18020. 507.53 s [algebraic-graphs]
  18021. 507.53 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  18022. 507.53 s [algebraic-graphs] OK: replaceVertex x x == id
  18023. 507.53 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  18024. 507.53 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  18025. 507.53 s [algebraic-graphs]
  18026. 507.53 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  18027. 507.53 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  18028. 507.53 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  18029. 507.53 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  18030. 507.53 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  18031. 507.53 s [algebraic-graphs]
  18032. 507.53 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  18033. 507.53 s [algebraic-graphs] OK: transpose empty == empty
  18034. 507.53 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  18035. 507.53 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  18036. 507.53 s [algebraic-graphs] OK: transpose . transpose == id
  18037. 507.53 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  18038. 507.53 s [algebraic-graphs]
  18039. 507.53 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  18040. 507.53 s [algebraic-graphs] OK: gmap f empty == empty
  18041. 507.53 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  18042. 507.53 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  18043. 507.53 s [algebraic-graphs] OK: gmap id == id
  18044. 507.53 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  18045. 507.53 s [algebraic-graphs]
  18046. 507.53 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  18047. 507.53 s [algebraic-graphs] OK: induce (const True ) x == x
  18048. 507.53 s [algebraic-graphs] OK: induce (const False) x == empty
  18049. 507.53 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  18050. 507.53 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  18051. 507.53 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  18052. 507.53 s [algebraic-graphs]
  18053. 507.53 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  18054. 507.53 s [algebraic-graphs] OK: compose empty x == empty
  18055. 507.53 s [algebraic-graphs] OK: compose x empty == empty
  18056. 507.53 s [algebraic-graphs] OK: compose (vertex x) y == empty
  18057. 507.53 s [algebraic-graphs] OK: compose x (vertex y) == empty
  18058. 507.53 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  18059. 507.53 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  18060. 511.50 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  18061. 511.50 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  18062. 511.58 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  18063. 511.58 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  18064. 511.58 s [algebraic-graphs]
  18065. 511.58 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  18066. 511.58 s [algebraic-graphs] OK: closure empty == empty
  18067. 511.58 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  18068. 511.58 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  18069. 511.58 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18070. 511.58 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  18071. 511.58 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  18072. 511.58 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  18073. 511.58 s [algebraic-graphs] OK: closure . closure == closure
  18074. 511.59 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  18075. 511.59 s [algebraic-graphs]
  18076. 511.59 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  18077. 511.59 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  18078. 511.59 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  18079. 511.59 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  18080. 511.59 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18081. 511.59 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  18082. 511.59 s [algebraic-graphs]
  18083. 511.59 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  18084. 511.59 s [algebraic-graphs] OK: symmetricClosure empty == empty
  18085. 511.59 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  18086. 511.59 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  18087. 511.59 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  18088. 511.59 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  18089. 511.59 s [algebraic-graphs]
  18090. 511.59 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  18091. 511.59 s [algebraic-graphs] OK: transitiveClosure empty == empty
  18092. 511.59 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  18093. 511.59 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  18094. 511.59 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  18095. 511.59 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  18096. 511.59 s [algebraic-graphs]
  18097. 511.59 s [algebraic-graphs] ============ AdjacencyMap.box ============
  18098. 511.59 s [algebraic-graphs] OK: box x y ~~ box y x
  18099. 511.59 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  18100. 511.59 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  18101. 511.59 s [algebraic-graphs] OK: box x empty ~~ empty
  18102. 511.59 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18103. 511.59 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  18104. 511.59 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  18105. 511.59 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18106. 511.59 s [algebraic-graphs]
  18107. 511.59 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  18108. 511.59 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  18109. 511.59 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  18110. 511.59 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  18111. 511.59 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  18112. 511.59 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  18113. 511.59 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  18114. 511.59 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  18115. 511.59 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  18116. 511.59 s [algebraic-graphs] OK: bfsForest x [] == []
  18117. 511.59 s [algebraic-graphs] OK: bfsForest empty vs == []
  18118. 511.59 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18119. 511.59 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  18120. 511.59 s [algebraic-graphs]
  18121. 511.59 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  18122. 511.59 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  18123. 511.59 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  18124. 511.59 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  18125. 511.59 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  18126. 511.59 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  18127. 511.59 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  18128. 511.59 s [algebraic-graphs] OK: bfs empty vs == []
  18129. 511.59 s [algebraic-graphs] OK: bfs x [] == []
  18130. 511.59 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  18131. 511.59 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  18132. 511.59 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  18133. 511.59 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  18134. 511.59 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  18135. 511.59 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  18136. 511.59 s [algebraic-graphs]
  18137. 511.59 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  18138. 511.59 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  18139. 511.59 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  18140. 511.59 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  18141. 511.59 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  18142. 511.59 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  18143. 511.59 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  18144. 511.59 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  18145. 511.59 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  18146. 511.59 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  18147. 511.59 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  18148. 511.59 s [algebraic-graphs]
  18149. 511.59 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  18150. 511.59 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  18151. 511.59 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  18152. 511.59 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  18153. 511.59 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  18154. 511.59 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  18155. 511.59 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  18156. 511.59 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  18157. 511.59 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  18158. 511.59 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  18159. 511.59 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  18160. 511.59 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  18161. 511.59 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18162. 511.59 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  18163. 511.59 s [algebraic-graphs]
  18164. 511.59 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  18165. 511.59 s [algebraic-graphs] OK: dfs empty vs == []
  18166. 511.59 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  18167. 511.59 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  18168. 511.59 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  18169. 511.59 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  18170. 511.59 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  18171. 511.59 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  18172. 511.59 s [algebraic-graphs] OK: dfs x [] == []
  18173. 511.59 s [algebraic-graphs]
  18174. 511.59 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  18175. 511.59 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  18176. 511.59 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  18177. 511.59 s [algebraic-graphs]
  18178. 511.59 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  18179. 511.59 s [algebraic-graphs] OK: reachable empty x == []
  18180. 511.59 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  18181. 511.59 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  18182. 511.59 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  18183. 511.59 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  18184. 511.59 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  18185. 511.59 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  18186. 511.59 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  18187. 511.59 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  18188. 511.59 s [algebraic-graphs]
  18189. 511.59 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  18190. 511.59 s [algebraic-graphs]
  18191. 511.59 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  18192. 511.59 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  18193. 511.59 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  18194. 511.59 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  18195. 511.59 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  18196. 511.59 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  18197. 511.59 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  18198. 511.59 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  18199. 511.59 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  18200. 511.59 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  18201. 511.59 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  18202. 511.59 s [algebraic-graphs]
  18203. 511.59 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  18204. 511.59 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  18205. 511.59 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  18206. 511.59 s [algebraic-graphs] OK: isAcyclic . circuit == null
  18207. 511.59 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  18208. 511.59 s [algebraic-graphs]
  18209. 511.59 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  18210. 511.59 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  18211. 511.59 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  18212. 511.59 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  18213. 511.59 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  18214. 511.59 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  18215. 511.59 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  18216. 511.59 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  18217. 519.70 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  18218. 519.70 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  18219. 519.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  18220. 519.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  18221. 519.73 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  18222. 519.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  18223. 519.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  18224. 519.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  18225. 519.73 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  18226. 519.74 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  18227. 519.74 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  18228. 519.74 s [algebraic-graphs]
  18229. 519.74 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  18230. 519.74 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  18231. 519.74 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  18232. 519.74 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  18233. 519.74 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  18234. 519.74 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  18235. 519.74 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  18236. 519.74 s [algebraic-graphs]
  18237. 519.74 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  18238. 519.74 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  18239. 519.74 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  18240. 519.74 s [algebraic-graphs] OK: induceJust . gmap Just == id
  18241. 519.74 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  18242. 519.74 s [algebraic-graphs]
  18243. 519.74 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  18244. 519.74 s [algebraic-graphs] OK: scc empty == empty
  18245. 519.74 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  18246. 519.74 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  18247. 519.74 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  18248. 519.74 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  18249. 519.74 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  18250. 519.74 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  18251. 519.74 s [algebraic-graphs] OK: isAcyclic . scc == const True
  18252. 519.74 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  18253. 519.74 s [algebraic-graphs] OK: scc g == KL.scc g
  18254. 519.74 s [algebraic-graphs]
  18255. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  18256. 519.74 s [algebraic-graphs] OK: 0 == rightVertex 0
  18257. 519.74 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  18258. 519.74 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  18259. 519.74 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  18260. 519.74 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  18261. 519.74 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  18262. 519.74 s [algebraic-graphs]
  18263. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  18264. 519.74 s [algebraic-graphs] OK: show empty == "empty"
  18265. 519.74 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  18266. 519.74 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  18267. 519.74 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  18268. 519.74 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  18269. 519.74 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  18270. 519.74 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  18271. 519.74 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  18272. 519.74 s [algebraic-graphs]
  18273. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  18274. 519.74 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  18275. 519.74 s [algebraic-graphs]
  18276. 519.74 s [algebraic-graphs] OK: x + y == y + x
  18277. 519.74 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  18278. 519.74 s [algebraic-graphs] OK: x * empty == x
  18279. 519.74 s [algebraic-graphs] OK: empty * x == x
  18280. 519.74 s [algebraic-graphs] OK: x * y == y * x
  18281. 519.74 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  18282. 519.74 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  18283. 519.74 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  18284. 519.74 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  18285. 519.74 s [algebraic-graphs] OK: x + empty == x
  18286. 519.74 s [algebraic-graphs] OK: empty + x == x
  18287. 519.74 s [algebraic-graphs] OK: x + x == x
  18288. 519.74 s [algebraic-graphs] OK: x * y + x + y == x * y
  18289. 519.74 s [algebraic-graphs] OK: x * x * x == x * x
  18290. 519.74 s [algebraic-graphs]
  18291. 519.74 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  18292. 519.74 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  18293. 519.74 s [algebraic-graphs]
  18294. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  18295. 519.74 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  18296. 519.74 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  18297. 519.74 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  18298. 519.74 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  18299. 519.74 s [algebraic-graphs]
  18300. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  18301. 519.74 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  18302. 519.74 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  18303. 519.74 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  18304. 519.74 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  18305. 519.74 s [algebraic-graphs]
  18306. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  18307. 519.74 s [algebraic-graphs] OK: isEmpty empty == True
  18308. 519.74 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  18309. 519.74 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  18310. 519.74 s [algebraic-graphs] OK: hasVertex x empty == False
  18311. 519.74 s [algebraic-graphs]
  18312. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  18313. 519.74 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  18314. 519.74 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  18315. 519.74 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  18316. 519.74 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  18317. 519.74 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  18318. 519.74 s [algebraic-graphs]
  18319. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  18320. 519.74 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  18321. 519.74 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  18322. 519.74 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  18323. 519.74 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  18324. 519.74 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  18325. 519.74 s [algebraic-graphs]
  18326. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  18327. 519.74 s [algebraic-graphs] OK: vertex . Left == leftVertex
  18328. 519.74 s [algebraic-graphs] OK: vertex . Right == rightVertex
  18329. 519.74 s [algebraic-graphs]
  18330. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  18331. 519.74 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  18332. 519.74 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  18333. 519.74 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  18334. 519.74 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18335. 519.74 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  18336. 519.74 s [algebraic-graphs]
  18337. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  18338. 519.74 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18339. 519.74 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18340. 519.74 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18341. 519.74 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18342. 519.74 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18343. 519.74 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18344. 519.74 s [algebraic-graphs]
  18345. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  18346. 519.74 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  18347. 519.74 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  18348. 519.74 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  18349. 519.74 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  18350. 519.74 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  18351. 519.74 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18352. 519.74 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18353. 519.74 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18354. 519.74 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18355. 519.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18356. 519.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  18357. 519.74 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  18358. 519.74 s [algebraic-graphs]
  18359. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  18360. 519.74 s [algebraic-graphs] OK: vertices [] [] == empty
  18361. 519.74 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  18362. 519.74 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  18363. 519.74 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  18364. 519.74 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  18365. 519.74 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  18366. 519.74 s [algebraic-graphs]
  18367. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  18368. 519.74 s [algebraic-graphs] OK: edges [] == empty
  18369. 519.74 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18370. 519.74 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18371. 519.74 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  18372. 519.74 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18373. 519.74 s [algebraic-graphs]
  18374. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  18375. 519.74 s [algebraic-graphs] OK: overlays [] == empty
  18376. 519.74 s [algebraic-graphs] OK: overlays [x] == x
  18377. 519.74 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18378. 519.74 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18379. 519.74 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18380. 519.74 s [algebraic-graphs]
  18381. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  18382. 519.74 s [algebraic-graphs] OK: connects [] == empty
  18383. 519.74 s [algebraic-graphs] OK: connects [x] == x
  18384. 519.74 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18385. 519.74 s [algebraic-graphs] OK: connects == foldr connect empty
  18386. 519.74 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18387. 519.74 s [algebraic-graphs]
  18388. 519.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  18389. 521.38 s [algebraic-graphs] OK: swap empty == empty
  18390. 521.38 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  18391. 521.38 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  18392. 521.38 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  18393. 521.38 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  18394. 521.38 s [algebraic-graphs] OK: swap . swap == id
  18395. 521.38 s [algebraic-graphs]
  18396. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  18397. 521.38 s [algebraic-graphs] OK: toBipartite empty == empty
  18398. 521.38 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  18399. 521.38 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  18400. 521.38 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  18401. 521.38 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  18402. 521.38 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  18403. 521.38 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  18404. 521.38 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  18405. 521.38 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  18406. 521.38 s [algebraic-graphs]
  18407. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  18408. 521.38 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  18409. 521.38 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  18410. 521.38 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  18411. 521.38 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  18412. 521.38 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  18413. 521.38 s [algebraic-graphs]
  18414. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  18415. 521.38 s [algebraic-graphs] OK: fromBipartite empty == empty
  18416. 521.38 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  18417. 521.38 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  18418. 521.38 s [algebraic-graphs]
  18419. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  18420. 521.38 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  18421. 521.38 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  18422. 521.38 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  18423. 521.38 s [algebraic-graphs]
  18424. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  18425. 521.38 s [algebraic-graphs] OK: isEmpty empty == True
  18426. 521.38 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18427. 521.38 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18428. 521.38 s [algebraic-graphs] OK: isEmpty == (==) empty
  18429. 521.38 s [algebraic-graphs]
  18430. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  18431. 521.38 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  18432. 521.38 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  18433. 521.38 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  18434. 521.38 s [algebraic-graphs]
  18435. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  18436. 521.38 s [algebraic-graphs] OK: hasRightVertex x empty == False
  18437. 521.38 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  18438. 521.38 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  18439. 521.38 s [algebraic-graphs]
  18440. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  18441. 521.38 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  18442. 521.38 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  18443. 521.38 s [algebraic-graphs]
  18444. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  18445. 521.38 s [algebraic-graphs] OK: hasEdge x y empty == False
  18446. 521.38 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18447. 521.38 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18448. 521.38 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18449. 521.38 s [algebraic-graphs]
  18450. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  18451. 521.38 s [algebraic-graphs] OK: leftVertexCount empty == 0
  18452. 521.38 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  18453. 521.38 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  18454. 521.38 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  18455. 521.38 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  18456. 521.38 s [algebraic-graphs]
  18457. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  18458. 521.38 s [algebraic-graphs] OK: rightVertexCount empty == 0
  18459. 521.38 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  18460. 521.38 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  18461. 521.38 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  18462. 521.38 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  18463. 521.38 s [algebraic-graphs]
  18464. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  18465. 521.38 s [algebraic-graphs] OK: vertexCount empty == 0
  18466. 521.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18467. 521.38 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  18468. 521.38 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  18469. 521.38 s [algebraic-graphs]
  18470. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  18471. 521.38 s [algebraic-graphs] OK: edgeCount empty == 0
  18472. 521.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18473. 521.38 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18474. 521.38 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18475. 521.38 s [algebraic-graphs]
  18476. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  18477. 521.38 s [algebraic-graphs] OK: leftVertexList empty == []
  18478. 521.38 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  18479. 521.38 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  18480. 521.38 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  18481. 521.38 s [algebraic-graphs]
  18482. 521.38 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  18483. 521.39 s [algebraic-graphs] OK: rightVertexList empty == []
  18484. 521.39 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  18485. 521.39 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  18486. 521.39 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  18487. 521.39 s [algebraic-graphs]
  18488. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  18489. 521.39 s [algebraic-graphs] OK: vertexList empty == []
  18490. 521.39 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18491. 521.39 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  18492. 521.39 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  18493. 521.39 s [algebraic-graphs]
  18494. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  18495. 521.39 s [algebraic-graphs] OK: edgeList empty == []
  18496. 521.39 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18497. 521.39 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18498. 521.39 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18499. 521.39 s [algebraic-graphs]
  18500. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  18501. 521.39 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  18502. 521.39 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  18503. 521.39 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  18504. 521.39 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  18505. 521.39 s [algebraic-graphs]
  18506. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  18507. 521.39 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  18508. 521.39 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  18509. 521.39 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  18510. 521.39 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  18511. 521.39 s [algebraic-graphs]
  18512. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  18513. 521.39 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18514. 521.39 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18515. 521.39 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  18516. 521.39 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  18517. 521.39 s [algebraic-graphs]
  18518. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  18519. 521.39 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18520. 521.39 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18521. 521.39 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18522. 521.39 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18523. 521.39 s [algebraic-graphs]
  18524. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  18525. 521.39 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  18526. 521.39 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  18527. 521.39 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  18528. 521.39 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  18529. 521.39 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  18530. 521.39 s [algebraic-graphs]
  18531. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  18532. 521.39 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  18533. 521.39 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  18534. 521.39 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  18535. 521.39 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  18536. 521.39 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  18537. 521.39 s [algebraic-graphs]
  18538. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  18539. 521.39 s [algebraic-graphs] OK: evenList [] == Nil
  18540. 521.39 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  18541. 521.39 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  18542. 521.39 s [algebraic-graphs]
  18543. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  18544. 521.39 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  18545. 521.39 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  18546. 521.39 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  18547. 521.39 s [algebraic-graphs]
  18548. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  18549. 521.39 s [algebraic-graphs] OK: path Nil == empty
  18550. 521.39 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  18551. 521.39 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  18552. 521.39 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  18553. 521.39 s [algebraic-graphs]
  18554. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  18555. 521.39 s [algebraic-graphs] OK: circuit [] == empty
  18556. 521.39 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  18557. 521.39 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  18558. 521.39 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  18559. 521.39 s [algebraic-graphs]
  18560. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  18561. 521.39 s [algebraic-graphs] OK: biclique [] [] == empty
  18562. 521.39 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  18563. 521.39 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  18564. 521.39 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  18565. 521.39 s [algebraic-graphs]
  18566. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  18567. 521.39 s [algebraic-graphs] OK: star x [] == leftVertex x
  18568. 521.39 s [algebraic-graphs] OK: star x [y] == edge x y
  18569. 521.39 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18570. 521.39 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  18571. 521.39 s [algebraic-graphs]
  18572. 521.39 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  18573. 521.39 s [algebraic-graphs] OK: stars [] == empty
  18574. 521.39 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  18575. 521.39 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18576. 521.39 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18577. 537.56 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18578. 537.60 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18579. 537.60 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18580. 537.60 s [algebraic-graphs]
  18581. 537.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  18582. 537.60 s [algebraic-graphs] OK: mesh xs [] == empty
  18583. 537.60 s [algebraic-graphs] OK: mesh [] ys == empty
  18584. 537.60 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  18585. 537.60 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  18586. 537.60 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  18587. 537.60 s [algebraic-graphs]
  18588. 537.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  18589. 537.60 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  18590. 537.60 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  18591. 537.60 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  18592. 537.60 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  18593. 537.60 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  18594. 537.60 s [algebraic-graphs]
  18595. 537.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  18596. 537.60 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  18597. 537.60 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  18598. 537.60 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  18599. 537.60 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  18600. 537.60 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  18601. 537.60 s [algebraic-graphs]
  18602. 537.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  18603. 537.60 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  18604. 537.60 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18605. 537.60 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  18606. 537.60 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  18607. 537.60 s [algebraic-graphs]
  18608. 537.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  18609. 537.60 s [algebraic-graphs] OK: bimap f g empty == empty
  18610. 537.60 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  18611. 537.60 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  18612. 537.60 s [algebraic-graphs] OK: bimap id id == id
  18613. 537.60 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  18614. 537.60 s [algebraic-graphs]
  18615. 537.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  18616. 537.60 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  18617. 537.60 s [algebraic-graphs]
  18618. 537.60 s [algebraic-graphs] OK: box x y ~~ box y x
  18619. 537.60 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18620. 537.60 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18621. 537.60 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  18622. 537.60 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  18623. 537.60 s [algebraic-graphs] OK: box x empty ~~ empty
  18624. 537.60 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  18625. 537.60 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18626. 537.60 s [algebraic-graphs]
  18627. 537.60 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  18628. 537.60 s [algebraic-graphs]
  18629. 537.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  18630. 537.60 s [algebraic-graphs] OK: consistent empty == True
  18631. 537.60 s [algebraic-graphs] OK: consistent (vertex x) == True
  18632. 537.60 s [algebraic-graphs] OK: consistent (edge x y) == True
  18633. 537.60 s [algebraic-graphs] OK: consistent (edges x) == True
  18634. 537.60 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  18635. 537.60 s [algebraic-graphs] OK: consistent (swap x) == True
  18636. 537.60 s [algebraic-graphs] OK: consistent (circuit xs) == True
  18637. 537.60 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  18638. 537.60 s [algebraic-graphs]
  18639. 537.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  18640. 537.60 s [algebraic-graphs] OK: detectParts empty == Right empty
  18641. 537.60 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  18642. 537.60 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  18643. 537.60 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  18644. 537.60 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  18645. 537.60 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  18646. 537.60 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  18647. 537.60 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  18648. 537.60 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  18649. 537.60 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  18650. 537.60 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  18651. 537.60 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  18652. 537.60 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  18653. 537.60 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  18654. 537.60 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  18655. 537.60 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  18656. 537.60 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  18657. 537.60 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  18658. 537.60 s [algebraic-graphs]
  18659. 537.60 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  18660. 537.60 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  18661. 537.60 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  18662. 537.60 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  18663. 537.60 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  18664. 537.60 s [algebraic-graphs]
  18665. 537.60 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  18666. 537.60 s [algebraic-graphs] OK: show (matching []) == "matching []"
  18667. 537.60 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  18668. 537.60 s [algebraic-graphs]
  18669. 537.60 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  18670. 537.60 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  18671. 537.60 s [algebraic-graphs]
  18672. 537.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  18673. 537.60 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  18674. 537.60 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  18675. 537.60 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  18676. 537.60 s [algebraic-graphs]
  18677. 537.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  18678. 537.60 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  18679. 537.60 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  18680. 537.60 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  18681. 537.60 s [algebraic-graphs]
  18682. 537.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  18683. 537.60 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  18684. 537.60 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  18685. 537.60 s [algebraic-graphs]
  18686. 537.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  18687. 537.60 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  18688. 537.60 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  18689. 537.60 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  18690. 537.60 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  18691. 537.60 s [algebraic-graphs]
  18692. 537.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  18693. 537.60 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  18694. 537.60 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  18695. 537.60 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  18696. 537.60 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  18697. 537.61 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  18698. 537.61 s [algebraic-graphs]
  18699. 537.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  18700. 537.61 s [algebraic-graphs] OK: maxMatching empty == matching []
  18701. 537.61 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  18702. 537.61 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  18703. 537.61 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  18704. 537.61 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  18705. 537.61 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  18706. 537.61 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  18707. 537.61 s [algebraic-graphs]
  18708. 537.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  18709. 537.61 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  18710. 537.61 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  18711. 537.61 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  18712. 537.61 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  18713. 537.61 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  18714. 537.61 s [algebraic-graphs]
  18715. 537.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  18716. 537.61 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  18717. 539.74 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  18718. 539.74 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  18719. 539.74 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  18720. 539.74 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  18721. 539.74 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  18722. 539.74 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  18723. 539.74 s [algebraic-graphs]
  18724. 539.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  18725. 539.74 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  18726. 539.74 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  18727. 539.74 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  18728. 539.74 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  18729. 539.74 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  18730. 539.74 s [algebraic-graphs]
  18731. 539.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  18732. 539.74 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  18733. 539.74 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  18734. 539.74 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  18735. 539.74 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  18736. 539.74 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  18737. 539.74 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  18738. 539.74 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  18739. 539.74 s [algebraic-graphs]
  18740. 539.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  18741. 539.74 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  18742. 539.74 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  18743. 539.74 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  18744. 539.74 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  18745. 539.74 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  18746. 539.74 s [algebraic-graphs]
  18747. 539.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  18748. 539.74 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  18749. 539.74 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  18750. 539.74 s [algebraic-graphs]
  18751. 539.74 s [algebraic-graphs] ============ Export.Eq ============
  18752. 539.74 s [algebraic-graphs] OK: mempty /= literal ""
  18753. 539.74 s [algebraic-graphs]
  18754. 539.74 s [algebraic-graphs] ============ Export.Ord ============
  18755. 539.74 s [algebraic-graphs] OK: mempty < literal ""
  18756. 539.74 s [algebraic-graphs]
  18757. 539.74 s [algebraic-graphs] ============ Export.isEmpty ============
  18758. 539.74 s [algebraic-graphs] OK: isEmpty mempty == True
  18759. 539.74 s [algebraic-graphs] OK: isEmpty (literal "") == False
  18760. 539.74 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  18761. 539.74 s [algebraic-graphs]
  18762. 539.74 s [algebraic-graphs] ============ Export.literal ============
  18763. 539.74 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  18764. 539.74 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  18765. 539.74 s [algebraic-graphs] OK: render . literal == id
  18766. 539.74 s [algebraic-graphs]
  18767. 539.74 s [algebraic-graphs] ============ Export.render ============
  18768. 539.74 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  18769. 539.74 s [algebraic-graphs] OK: render mempty == mempty
  18770. 539.74 s [algebraic-graphs]
  18771. 539.74 s [algebraic-graphs] ============ Export.<+> ============
  18772. 539.74 s [algebraic-graphs] OK: x <+> mempty == x
  18773. 539.74 s [algebraic-graphs] OK: mempty <+> x == x
  18774. 539.74 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  18775. 539.74 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  18776. 539.74 s [algebraic-graphs]
  18777. 539.74 s [algebraic-graphs] ============ Export.brackets ============
  18778. 539.74 s [algebraic-graphs] OK: brackets "i" == "[i]"
  18779. 539.74 s [algebraic-graphs] OK: brackets mempty == "[]"
  18780. 539.74 s [algebraic-graphs]
  18781. 539.74 s [algebraic-graphs] ============ Export.doubleQuotes ============
  18782. 539.74 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  18783. 539.74 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  18784. 539.74 s [algebraic-graphs]
  18785. 539.74 s [algebraic-graphs] ============ Export.indent ============
  18786. 539.75 s [algebraic-graphs] OK: indent 0 == id
  18787. 539.75 s [algebraic-graphs] OK: indent 1 mempty == " "
  18788. 539.75 s [algebraic-graphs]
  18789. 539.75 s [algebraic-graphs] ============ Export.unlines ============
  18790. 539.75 s [algebraic-graphs] OK: unlines [] == mempty
  18791. 539.75 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  18792. 539.75 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  18793. 539.75 s [algebraic-graphs]
  18794. 539.75 s [algebraic-graphs] ============ Export.export ============
  18795. 539.75 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  18796. 539.75 s [algebraic-graphs]
  18797. 539.75 s [algebraic-graphs] ============ Export.Dot.export ============
  18798. 539.75 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  18799. 539.75 s [algebraic-graphs]
  18800. 539.75 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  18801. 539.75 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  18802. 539.75 s [algebraic-graphs]
  18803. 539.75 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  18804. 539.75 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  18805. 539.75 s [algebraic-graphs]
  18806. 539.75 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  18807. 539.75 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  18808. 539.75 s [algebraic-graphs]
  18809. 539.75 s [algebraic-graphs] ============ Graph ============
  18810. 539.75 s [algebraic-graphs] OK: Axioms of graphs
  18811. 539.75 s [algebraic-graphs] OK: Theorems of graphs
  18812. 539.75 s [algebraic-graphs]
  18813. 539.75 s [algebraic-graphs] ============ Graph.Ord ============
  18814. 539.75 s [algebraic-graphs] OK: vertex 1 < vertex 2
  18815. 539.75 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  18816. 539.75 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  18817. 539.75 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  18818. 539.75 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  18819. 539.75 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  18820. 539.75 s [algebraic-graphs] OK: x <= x + y
  18821. 539.75 s [algebraic-graphs] OK: x + y <= x * y
  18822. 539.75 s [algebraic-graphs]
  18823. 539.75 s [algebraic-graphs] ============ Graph.empty ============
  18824. 539.75 s [algebraic-graphs] OK: isEmpty empty == True
  18825. 539.75 s [algebraic-graphs] OK: hasVertex x empty == False
  18826. 539.75 s [algebraic-graphs] OK: vertexCount empty == 0
  18827. 539.75 s [algebraic-graphs] OK: edgeCount empty == 0
  18828. 539.75 s [algebraic-graphs]
  18829. 539.75 s [algebraic-graphs] ============ Graph.vertex ============
  18830. 539.75 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18831. 539.75 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18832. 539.75 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18833. 539.75 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18834. 539.75 s [algebraic-graphs]
  18835. 539.75 s [algebraic-graphs] ============ Graph.edge ============
  18836. 539.75 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  18837. 539.75 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18838. 539.75 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18839. 539.75 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  18840. 539.75 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  18841. 539.75 s [algebraic-graphs]
  18842. 539.75 s [algebraic-graphs] ============ Graph.overlay ============
  18843. 539.75 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18844. 539.75 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18845. 539.75 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18846. 539.75 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18847. 539.75 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18848. 539.75 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18849. 539.75 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  18850. 539.75 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  18851. 539.75 s [algebraic-graphs]
  18852. 539.75 s [algebraic-graphs] ============ Graph.connect ============
  18853. 539.75 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18854. 539.75 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18855. 539.75 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18856. 539.75 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18857. 539.75 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18858. 539.75 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  18859. 539.75 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  18860. 539.75 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  18861. 539.75 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  18862. 539.75 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  18863. 539.75 s [algebraic-graphs]
  18864. 539.75 s [algebraic-graphs] ============ Graph.vertices ============
  18865. 539.75 s [algebraic-graphs] OK: vertices [] == empty
  18866. 539.75 s [algebraic-graphs] OK: vertices [x] == vertex x
  18867. 539.75 s [algebraic-graphs] OK: vertices == overlays . map vertex
  18868. 539.75 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  18869. 539.75 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  18870. 539.75 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18871. 539.75 s [algebraic-graphs]
  18872. 539.75 s [algebraic-graphs] ============ Graph.edges ============
  18873. 539.75 s [algebraic-graphs] OK: edges [] == empty
  18874. 539.75 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18875. 539.75 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18876. 539.75 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18877. 539.75 s [algebraic-graphs]
  18878. 539.75 s [algebraic-graphs] ============ Graph.overlays ============
  18879. 539.75 s [algebraic-graphs] OK: overlays [] == empty
  18880. 539.75 s [algebraic-graphs] OK: overlays [x] == x
  18881. 539.75 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18882. 539.75 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18883. 539.75 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18884. 539.75 s [algebraic-graphs]
  18885. 539.75 s [algebraic-graphs] ============ Graph.connects ============
  18886. 539.75 s [algebraic-graphs] OK: connects [] == empty
  18887. 539.75 s [algebraic-graphs] OK: connects [x] == x
  18888. 539.75 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18889. 539.75 s [algebraic-graphs] OK: connects == foldr connect empty
  18890. 539.75 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18891. 539.75 s [algebraic-graphs]
  18892. 539.75 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  18893. 539.75 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  18894. 539.75 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  18895. 539.75 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  18896. 539.75 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  18897. 539.75 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  18898. 539.75 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  18899. 539.75 s [algebraic-graphs]
  18900. 539.75 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  18901. 539.75 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  18902. 539.75 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  18903. 539.75 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  18904. 539.75 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  18905. 539.75 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  18906. 539.75 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  18907. 539.75 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  18908. 539.75 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  18909. 539.75 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  18910. 540.42 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  18911. 540.42 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  18912. 540.42 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  18913. 540.42 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  18914. 540.42 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  18915. 540.42 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  18916. 540.42 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  18917. 540.42 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  18918. 540.42 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  18919. 540.42 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  18920. 540.42 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  18921. 540.42 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  18922. 540.42 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  18923. 540.42 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  18924. 540.42 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  18925. 540.42 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  18926. 540.42 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  18927. 540.42 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  18928. 540.42 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  18929. 540.42 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18930. 540.42 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  18931. 540.42 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  18932. 540.42 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  18933. 540.42 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  18934. 540.42 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  18935. 540.42 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18936. 540.42 s [algebraic-graphs]
  18937. 540.42 s [algebraic-graphs] ============ Graph.foldg ============
  18938. 540.42 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  18939. 540.42 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  18940. 540.42 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  18941. 540.42 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  18942. 540.42 s [algebraic-graphs]
  18943. 540.42 s [algebraic-graphs] ============ Graph.isEmpty ============
  18944. 540.43 s [algebraic-graphs] OK: isEmpty empty == True
  18945. 540.43 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18946. 540.43 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18947. 540.43 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  18948. 540.43 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  18949. 540.43 s [algebraic-graphs]
  18950. 540.43 s [algebraic-graphs] ============ Graph.hasVertex ============
  18951. 540.43 s [algebraic-graphs] OK: hasVertex x empty == False
  18952. 540.43 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18953. 540.43 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  18954. 540.43 s [algebraic-graphs]
  18955. 540.43 s [algebraic-graphs] ============ Graph.hasEdge ============
  18956. 540.43 s [algebraic-graphs] OK: hasEdge x y empty == False
  18957. 540.43 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18958. 540.43 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18959. 540.43 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  18960. 540.43 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18961. 540.43 s [algebraic-graphs]
  18962. 540.43 s [algebraic-graphs] ============ Graph.vertexCount ============
  18963. 540.43 s [algebraic-graphs] OK: vertexCount empty == 0
  18964. 540.43 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18965. 540.43 s [algebraic-graphs] OK: vertexCount == length . vertexList
  18966. 540.43 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  18967. 540.43 s [algebraic-graphs]
  18968. 540.43 s [algebraic-graphs] ============ Graph.edgeCount ============
  18969. 540.43 s [algebraic-graphs] OK: edgeCount empty == 0
  18970. 540.43 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18971. 540.43 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18972. 540.43 s [algebraic-graphs] OK: edgeCount == length . edgeList
  18973. 540.43 s [algebraic-graphs]
  18974. 540.43 s [algebraic-graphs] ============ Graph.vertexList ============
  18975. 540.43 s [algebraic-graphs] OK: vertexList empty == []
  18976. 540.43 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18977. 540.43 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  18978. 540.43 s [algebraic-graphs]
  18979. 540.43 s [algebraic-graphs] ============ Graph.vertexSet ============
  18980. 540.43 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18981. 540.43 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18982. 540.43 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18983. 540.43 s [algebraic-graphs]
  18984. 540.43 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  18985. 540.43 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  18986. 540.43 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  18987. 540.43 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  18988. 540.43 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  18989. 540.43 s [algebraic-graphs]
  18990. 540.43 s [algebraic-graphs] ============ Graph.edgeList ============
  18991. 540.43 s [algebraic-graphs] OK: edgeList empty == []
  18992. 540.43 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18993. 540.43 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18994. 540.43 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  18995. 540.43 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18996. 540.43 s [algebraic-graphs]
  18997. 540.43 s [algebraic-graphs] ============ Graph.edgeSet ============
  18998. 540.43 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18999. 540.43 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19000. 540.43 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19001. 540.43 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  19002. 540.43 s [algebraic-graphs]
  19003. 540.43 s [algebraic-graphs] ============ Graph.adjacencyList ============
  19004. 540.43 s [algebraic-graphs] OK: adjacencyList empty == []
  19005. 540.43 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  19006. 540.43 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  19007. 540.43 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  19008. 540.43 s [algebraic-graphs]
  19009. 540.43 s [algebraic-graphs] ============ Graph.preSet ============
  19010. 540.43 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19011. 540.43 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19012. 540.43 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  19013. 540.43 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  19014. 540.43 s [algebraic-graphs]
  19015. 540.43 s [algebraic-graphs] ============ Graph.preIntSet ============
  19016. 540.43 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  19017. 540.43 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  19018. 540.43 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  19019. 540.43 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  19020. 540.43 s [algebraic-graphs]
  19021. 540.43 s [algebraic-graphs] ============ Graph.postSet ============
  19022. 540.43 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19023. 540.43 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19024. 540.43 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  19025. 540.43 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  19026. 540.43 s [algebraic-graphs]
  19027. 540.43 s [algebraic-graphs] ============ Graph.postIntSet ============
  19028. 540.43 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  19029. 540.43 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  19030. 540.43 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  19031. 540.43 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  19032. 540.43 s [algebraic-graphs]
  19033. 540.43 s [algebraic-graphs] ============ Graph.size ============
  19034. 540.43 s [algebraic-graphs] OK: size empty == 1
  19035. 540.43 s [algebraic-graphs] OK: size (vertex x) == 1
  19036. 540.43 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19037. 540.43 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19038. 540.43 s [algebraic-graphs] OK: size x >= 1
  19039. 540.43 s [algebraic-graphs] OK: size x >= vertexCount x
  19040. 540.43 s [algebraic-graphs]
  19041. 540.43 s [algebraic-graphs] ============ Graph.path ============
  19042. 540.43 s [algebraic-graphs] OK: path [] == empty
  19043. 540.43 s [algebraic-graphs] OK: path [x] == vertex x
  19044. 540.43 s [algebraic-graphs] OK: path [x,y] == edge x y
  19045. 540.43 s [algebraic-graphs]
  19046. 540.43 s [algebraic-graphs] ============ Graph.circuit ============
  19047. 540.43 s [algebraic-graphs] OK: circuit [] == empty
  19048. 540.43 s [algebraic-graphs] OK: circuit [x] == edge x x
  19049. 540.43 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  19050. 540.43 s [algebraic-graphs]
  19051. 540.43 s [algebraic-graphs] ============ Graph.clique ============
  19052. 540.43 s [algebraic-graphs] OK: clique [] == empty
  19053. 540.43 s [algebraic-graphs] OK: clique [x] == vertex x
  19054. 540.43 s [algebraic-graphs] OK: clique [x,y] == edge x y
  19055. 540.43 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  19056. 540.43 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  19057. 540.43 s [algebraic-graphs]
  19058. 540.43 s [algebraic-graphs] ============ Graph.biclique ============
  19059. 540.43 s [algebraic-graphs] OK: biclique [] [] == empty
  19060. 540.43 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  19061. 540.43 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  19062. 540.43 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19063. 540.43 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  19064. 540.43 s [algebraic-graphs]
  19065. 540.43 s [algebraic-graphs] ============ Graph.star ============
  19066. 540.43 s [algebraic-graphs] OK: star x [] == vertex x
  19067. 540.43 s [algebraic-graphs] OK: star x [y] == edge x y
  19068. 540.43 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  19069. 540.43 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  19070. 540.43 s [algebraic-graphs]
  19071. 540.43 s [algebraic-graphs] ============ Graph.stars ============
  19072. 540.43 s [algebraic-graphs] OK: stars [] == empty
  19073. 540.43 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  19074. 540.43 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  19075. 540.43 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  19076. 540.43 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  19077. 540.43 s [algebraic-graphs] OK: stars . adjacencyList == id
  19078. 540.43 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  19079. 540.43 s [algebraic-graphs]
  19080. 540.43 s [algebraic-graphs] ============ Graph.tree ============
  19081. 540.43 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19082. 540.43 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  19083. 540.43 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19084. 540.43 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  19085. 540.43 s [algebraic-graphs]
  19086. 540.43 s [algebraic-graphs] ============ Graph.forest ============
  19087. 540.43 s [algebraic-graphs] OK: forest [] == empty
  19088. 540.43 s [algebraic-graphs] OK: forest [x] == tree x
  19089. 540.43 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  19090. 540.43 s [algebraic-graphs] OK: forest == overlays . map tree
  19091. 540.43 s [algebraic-graphs]
  19092. 540.43 s [algebraic-graphs] ============ Graph.removeVertex ============
  19093. 544.38 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19094. 544.38 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19095. 544.38 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  19096. 544.52 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  19097. 544.52 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19098. 544.52 s [algebraic-graphs]
  19099. 544.52 s [algebraic-graphs] ============ Graph.removeEdge ============
  19100. 544.52 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  19101. 544.52 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19102. 544.52 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19103. 544.52 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19104. 544.52 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19105. 544.52 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  19106. 544.52 s [algebraic-graphs]
  19107. 544.52 s [algebraic-graphs] ============ Graph.replaceVertex ============
  19108. 544.52 s [algebraic-graphs] OK: replaceVertex x x == id
  19109. 544.52 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19110. 544.52 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19111. 544.52 s [algebraic-graphs]
  19112. 544.52 s [algebraic-graphs] ============ Graph.mergeVertices ============
  19113. 544.52 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19114. 544.52 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19115. 544.52 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19116. 544.52 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19117. 544.52 s [algebraic-graphs]
  19118. 544.52 s [algebraic-graphs] ============ Graph.transpose ============
  19119. 544.52 s [algebraic-graphs] OK: transpose empty == empty
  19120. 544.52 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19121. 544.52 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  19122. 544.52 s [algebraic-graphs] OK: transpose . transpose == id
  19123. 544.52 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19124. 544.52 s [algebraic-graphs]
  19125. 544.52 s [algebraic-graphs] ============ Graph.gmap ============
  19126. 544.52 s [algebraic-graphs] OK: gmap f empty == empty
  19127. 544.52 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19128. 544.52 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  19129. 544.52 s [algebraic-graphs] OK: gmap id == id
  19130. 544.52 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19131. 544.52 s [algebraic-graphs]
  19132. 544.52 s [algebraic-graphs] ============ Graph.induce ============
  19133. 544.52 s [algebraic-graphs] OK: induce (const True ) x == x
  19134. 544.52 s [algebraic-graphs] OK: induce (const False) x == empty
  19135. 544.52 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19136. 544.52 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19137. 544.52 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19138. 544.52 s [algebraic-graphs]
  19139. 544.52 s [algebraic-graphs] ============ Graph.induceJust ============
  19140. 544.52 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19141. 544.52 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19142. 544.52 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19143. 544.52 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19144. 544.52 s [algebraic-graphs]
  19145. 544.52 s [algebraic-graphs] ============ Graph.compose ============
  19146. 544.52 s [algebraic-graphs] OK: compose empty x == empty
  19147. 544.52 s [algebraic-graphs] OK: compose x empty == empty
  19148. 544.52 s [algebraic-graphs] OK: compose (vertex x) y == empty
  19149. 544.52 s [algebraic-graphs] OK: compose x (vertex y) == empty
  19150. 544.52 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  19151. 544.52 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  19152. 544.52 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  19153. 544.52 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  19154. 544.52 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  19155. 544.52 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  19156. 544.52 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  19157. 544.52 s [algebraic-graphs]
  19158. 544.52 s [algebraic-graphs] ============ Graph.(===) ============
  19159. 544.52 s [algebraic-graphs] OK: x === x == True
  19160. 544.52 s [algebraic-graphs] OK: x === x + empty == False
  19161. 544.52 s [algebraic-graphs] OK: x + y === x + y == True
  19162. 544.52 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  19163. 544.52 s [algebraic-graphs] OK: x + y === x * y == False
  19164. 544.52 s [algebraic-graphs]
  19165. 544.52 s [algebraic-graphs] ============ Graph.mesh ============
  19166. 544.52 s [algebraic-graphs] OK: mesh xs [] == empty
  19167. 544.52 s [algebraic-graphs] OK: mesh [] ys == empty
  19168. 544.52 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  19169. 544.52 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  19170. 544.52 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  19171. 544.52 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  19172. 544.52 s [algebraic-graphs]
  19173. 544.52 s [algebraic-graphs] ============ Graph.torus ============
  19174. 544.52 s [algebraic-graphs] OK: torus xs [] == empty
  19175. 544.52 s [algebraic-graphs] OK: torus [] ys == empty
  19176. 544.52 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  19177. 544.52 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  19178. 544.52 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  19179. 544.52 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  19180. 544.52 s [algebraic-graphs]
  19181. 544.52 s [algebraic-graphs] ============ Graph.deBruijn ============
  19182. 544.52 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  19183. 544.52 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  19184. 544.52 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  19185. 544.52 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  19186. 544.52 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  19187. 544.52 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  19188. 544.52 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  19189. 544.52 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  19190. 544.52 s [algebraic-graphs]
  19191. 544.52 s [algebraic-graphs] ============ Graph.splitVertex ============
  19192. 544.52 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  19193. 544.52 s [algebraic-graphs] OK: splitVertex x [x] == id
  19194. 544.52 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  19195. 544.52 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  19196. 544.52 s [algebraic-graphs]
  19197. 544.52 s [algebraic-graphs] ============ Graph.bind ============
  19198. 544.52 s [algebraic-graphs] OK: bind empty f == empty
  19199. 544.52 s [algebraic-graphs] OK: bind (vertex x) f == f x
  19200. 544.52 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  19201. 544.52 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  19202. 544.52 s [algebraic-graphs] OK: bind x (const empty) == empty
  19203. 544.52 s [algebraic-graphs] OK: bind x vertex == x
  19204. 544.52 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  19205. 544.52 s [algebraic-graphs]
  19206. 544.52 s [algebraic-graphs] ============ Graph.simplify ============
  19207. 544.52 s [algebraic-graphs] OK: simplify == id
  19208. 544.52 s [algebraic-graphs] OK: size (simplify x) <= size x
  19209. 544.52 s [algebraic-graphs]
  19210. 544.52 s [algebraic-graphs] ============ Graph.box ============
  19211. 544.52 s [algebraic-graphs] OK: box x y ~~ box y x
  19212. 544.52 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  19213. 544.52 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  19214. 544.52 s [algebraic-graphs] OK: box x empty ~~ empty
  19215. 544.52 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19216. 544.52 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19217. 544.52 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  19218. 544.52 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19219. 544.52 s [algebraic-graphs]
  19220. 544.52 s [algebraic-graphs] ============ Graph.sparsify ============
  19221. 544.52 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  19222. 544.52 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  19223. 544.52 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  19224. 544.52 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  19225. 544.52 s [algebraic-graphs]
  19226. 544.52 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  19227. 544.52 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  19228. 544.52 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  19229. 544.52 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  19230. 544.52 s [algebraic-graphs]
  19231. 544.52 s [algebraic-graphs] ============ Graph.context ============
  19232. 544.52 s [algebraic-graphs] OK: context (const False) x == Nothing
  19233. 544.52 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  19234. 544.52 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  19235. 544.52 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  19236. 544.52 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  19237. 544.52 s [algebraic-graphs]
  19238. 544.52 s [algebraic-graphs] ============ Graph.buildg ============
  19239. 544.52 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  19240. 544.52 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  19241. 544.52 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
  19242. 544.52 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
  19243. 544.52 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  19244. 544.52 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  19245. 544.52 s [algebraic-graphs]
  19246. 544.52 s [algebraic-graphs] ============ Internal.List ============
  19247. 544.52 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  19248. 544.52 s [algebraic-graphs]
  19249. 544.52 s [algebraic-graphs] ============ Graph.Label ============
  19250. 544.52 s [algebraic-graphs]
  19251. 544.52 s [algebraic-graphs] ============ Any: instances ============
  19252. 544.52 s [algebraic-graphs] OK: Semiring
  19253. 544.52 s [algebraic-graphs] OK: StarSemiring
  19254. 544.52 s [algebraic-graphs] OK: Dioid
  19255. 544.52 s [algebraic-graphs]
  19256. 544.52 s [algebraic-graphs] ============ Distance Int: instances ============
  19257. 544.52 s [algebraic-graphs] OK: Semiring
  19258. 544.52 s [algebraic-graphs] OK: StarSemiring
  19259. 544.52 s [algebraic-graphs] OK: Dioid
  19260. 544.52 s [algebraic-graphs]
  19261. 544.52 s [algebraic-graphs] ============ Capacity Int: instances ============
  19262. 544.52 s [algebraic-graphs] OK: Semiring
  19263. 544.52 s [algebraic-graphs] OK: StarSemiring
  19264. 544.52 s [algebraic-graphs] OK: Dioid
  19265. 544.52 s [algebraic-graphs]
  19266. 544.52 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  19267. 544.52 s [algebraic-graphs] OK: LeftNearRing
  19268. 544.52 s [algebraic-graphs]
  19269. 544.52 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  19270. 544.52 s [algebraic-graphs] OK: Semiring
  19271. 544.52 s [algebraic-graphs] OK: Dioid
  19272. 544.52 s [algebraic-graphs]
  19273. 544.52 s [algebraic-graphs] ============ Count Int: instances ============
  19274. 544.52 s [algebraic-graphs] OK: Semiring
  19275. 544.52 s [algebraic-graphs] OK: StarSemiring
  19276. 544.52 s [algebraic-graphs]
  19277. 544.52 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  19278. 544.52 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  19279. 544.52 s [algebraic-graphs] OK: empty
  19280. 544.52 s [algebraic-graphs] OK: vertex
  19281. 544.52 s [algebraic-graphs] OK: edge
  19282. 544.52 s [algebraic-graphs] OK: overlay
  19283. 544.52 s [algebraic-graphs] OK: connect
  19284. 544.52 s [algebraic-graphs] OK: vertices
  19285. 544.52 s [algebraic-graphs] OK: edges
  19286. 544.52 s [algebraic-graphs] OK: overlays
  19287. 544.52 s [algebraic-graphs] OK: fromAdjacencyMaps
  19288. 544.52 s [algebraic-graphs] OK: removeVertex
  19289. 544.52 s [algebraic-graphs] OK: removeEdge
  19290. 544.52 s [algebraic-graphs] OK: replaceVertex
  19291. 544.52 s [algebraic-graphs] OK: replaceEdge
  19292. 544.52 s [algebraic-graphs] OK: transpose
  19293. 544.52 s [algebraic-graphs] OK: gmap
  19294. 544.53 s [algebraic-graphs] OK: emap
  19295. 544.53 s [algebraic-graphs] OK: induce
  19296. 544.53 s [algebraic-graphs] OK: closure
  19297. 544.53 s [algebraic-graphs] OK: reflexiveClosure
  19298. 544.53 s [algebraic-graphs] OK: symmetricClosure
  19299. 544.53 s [algebraic-graphs] OK: transitiveClosure
  19300. 544.53 s [algebraic-graphs]
  19301. 544.53 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  19302. 544.53 s [algebraic-graphs] OK: isEmpty empty == True
  19303. 544.53 s [algebraic-graphs] OK: hasVertex x empty == False
  19304. 544.53 s [algebraic-graphs] OK: vertexCount empty == 0
  19305. 544.53 s [algebraic-graphs] OK: edgeCount empty == 0
  19306. 544.53 s [algebraic-graphs]
  19307. 544.53 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  19308. 544.53 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19309. 544.53 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19310. 544.53 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19311. 544.53 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19312. 544.53 s [algebraic-graphs]
  19313. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  19314. 546.95 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  19315. 546.95 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  19316. 546.95 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  19317. 546.95 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19318. 546.95 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  19319. 546.95 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  19320. 546.95 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  19321. 546.95 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  19322. 546.95 s [algebraic-graphs]
  19323. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  19324. 546.95 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19325. 546.95 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19326. 546.95 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19327. 546.95 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19328. 546.95 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19329. 546.95 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19330. 546.95 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19331. 546.95 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19332. 546.95 s [algebraic-graphs]
  19333. 546.95 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  19334. 546.95 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  19335. 546.95 s [algebraic-graphs]
  19336. 546.95 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  19337. 546.95 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  19338. 546.95 s [algebraic-graphs]
  19339. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  19340. 546.95 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  19341. 546.95 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  19342. 546.95 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  19343. 546.95 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  19344. 546.95 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19345. 546.95 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  19346. 546.95 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  19347. 546.95 s [algebraic-graphs]
  19348. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  19349. 546.95 s [algebraic-graphs] OK: vertices [] == empty
  19350. 546.95 s [algebraic-graphs] OK: vertices [x] == vertex x
  19351. 546.95 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19352. 546.95 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19353. 546.95 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19354. 546.95 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19355. 546.95 s [algebraic-graphs]
  19356. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  19357. 546.95 s [algebraic-graphs] OK: edges [] == empty
  19358. 546.95 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  19359. 546.95 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  19360. 546.95 s [algebraic-graphs]
  19361. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  19362. 546.95 s [algebraic-graphs] OK: overlays [] == empty
  19363. 546.95 s [algebraic-graphs] OK: overlays [x] == x
  19364. 546.95 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19365. 546.95 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19366. 546.95 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19367. 546.95 s [algebraic-graphs]
  19368. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  19369. 546.95 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  19370. 546.95 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  19371. 546.95 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  19372. 546.95 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  19373. 546.95 s [algebraic-graphs]
  19374. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  19375. 546.95 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19376. 546.95 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19377. 546.95 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19378. 546.95 s [algebraic-graphs]
  19379. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  19380. 546.95 s [algebraic-graphs] OK: isEmpty empty == True
  19381. 546.95 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19382. 546.95 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19383. 546.95 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19384. 546.95 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  19385. 546.95 s [algebraic-graphs]
  19386. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  19387. 546.95 s [algebraic-graphs] OK: hasVertex x empty == False
  19388. 546.95 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19389. 546.95 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19390. 546.95 s [algebraic-graphs]
  19391. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  19392. 546.95 s [algebraic-graphs] OK: hasEdge x y empty == False
  19393. 546.95 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19394. 546.95 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  19395. 546.95 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19396. 546.95 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  19397. 546.95 s [algebraic-graphs]
  19398. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  19399. 546.95 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  19400. 546.95 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  19401. 546.95 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19402. 546.95 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  19403. 546.95 s [algebraic-graphs]
  19404. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  19405. 546.95 s [algebraic-graphs] OK: vertexCount empty == 0
  19406. 546.95 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19407. 546.95 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19408. 546.95 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19409. 546.95 s [algebraic-graphs]
  19410. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  19411. 546.95 s [algebraic-graphs] OK: edgeCount empty == 0
  19412. 546.95 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19413. 546.95 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  19414. 546.95 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19415. 546.95 s [algebraic-graphs]
  19416. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  19417. 546.95 s [algebraic-graphs] OK: vertexList empty == []
  19418. 546.95 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19419. 546.95 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19420. 546.95 s [algebraic-graphs]
  19421. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  19422. 546.95 s [algebraic-graphs] OK: edgeList empty == []
  19423. 546.95 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19424. 546.95 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  19425. 546.95 s [algebraic-graphs]
  19426. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  19427. 546.95 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19428. 546.95 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19429. 546.95 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19430. 546.95 s [algebraic-graphs]
  19431. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  19432. 546.95 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19433. 546.95 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19434. 546.95 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  19435. 546.95 s [algebraic-graphs]
  19436. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  19437. 546.95 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19438. 546.95 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19439. 546.95 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  19440. 546.95 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  19441. 546.95 s [algebraic-graphs]
  19442. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  19443. 546.95 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19444. 546.95 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19445. 546.95 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  19446. 546.95 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  19447. 546.95 s [algebraic-graphs]
  19448. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  19449. 546.95 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  19450. 546.95 s [algebraic-graphs]
  19451. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  19452. 546.95 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19453. 546.95 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19454. 546.95 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  19455. 546.95 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  19456. 546.95 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19457. 546.95 s [algebraic-graphs]
  19458. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  19459. 546.95 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  19460. 546.95 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19461. 546.95 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19462. 546.95 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19463. 546.95 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19464. 546.95 s [algebraic-graphs]
  19465. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  19466. 546.95 s [algebraic-graphs] OK: replaceVertex x x == id
  19467. 546.95 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19468. 546.95 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  19469. 546.95 s [algebraic-graphs]
  19470. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  19471. 546.95 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  19472. 546.95 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  19473. 546.95 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  19474. 546.95 s [algebraic-graphs]
  19475. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  19476. 546.95 s [algebraic-graphs] OK: transpose empty == empty
  19477. 546.95 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19478. 546.95 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  19479. 546.95 s [algebraic-graphs] OK: transpose . transpose == id
  19480. 546.95 s [algebraic-graphs]
  19481. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  19482. 546.95 s [algebraic-graphs] OK: gmap f empty == empty
  19483. 546.95 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19484. 546.95 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  19485. 546.95 s [algebraic-graphs] OK: gmap id == id
  19486. 546.95 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19487. 546.95 s [algebraic-graphs]
  19488. 546.95 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  19489. 546.96 s [algebraic-graphs] OK: emap h empty == empty
  19490. 546.96 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  19491. 546.96 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  19492. 546.96 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  19493. 546.96 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  19494. 546.96 s [algebraic-graphs] OK: emap id == id
  19495. 546.96 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  19496. 546.96 s [algebraic-graphs]
  19497. 546.96 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  19498. 546.96 s [algebraic-graphs] OK: induce (const True ) x == x
  19499. 546.96 s [algebraic-graphs] OK: induce (const False) x == empty
  19500. 546.96 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19501. 546.96 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19502. 546.96 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19503. 546.96 s [algebraic-graphs]
  19504. 546.96 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  19505. 548.23 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19506. 548.23 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19507. 548.23 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19508. 548.23 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19509. 548.23 s [algebraic-graphs]
  19510. 548.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  19511. 548.23 s [algebraic-graphs] OK: closure empty == empty
  19512. 548.23 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  19513. 548.24 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  19514. 548.24 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19515. 548.24 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19516. 548.24 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19517. 548.24 s [algebraic-graphs] OK: closure . closure == closure
  19518. 548.24 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19519. 548.24 s [algebraic-graphs]
  19520. 548.24 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  19521. 548.24 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  19522. 548.24 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  19523. 548.24 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  19524. 548.24 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19525. 548.24 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19526. 548.24 s [algebraic-graphs]
  19527. 548.24 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  19528. 548.24 s [algebraic-graphs] OK: symmetricClosure empty == empty
  19529. 548.24 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19530. 548.24 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  19531. 548.24 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19532. 548.24 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19533. 548.24 s [algebraic-graphs]
  19534. 548.24 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  19535. 548.24 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19536. 548.24 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19537. 548.24 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  19538. 548.24 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19539. 548.24 s [algebraic-graphs]
  19540. 548.24 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  19541. 548.24 s [algebraic-graphs] OK: isEmpty empty == True
  19542. 548.24 s [algebraic-graphs] OK: hasVertex x empty == False
  19543. 548.24 s [algebraic-graphs] OK: vertexCount empty == 0
  19544. 548.24 s [algebraic-graphs] OK: edgeCount empty == 0
  19545. 548.24 s [algebraic-graphs]
  19546. 548.24 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  19547. 548.24 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19548. 548.24 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19549. 548.24 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19550. 548.24 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19551. 548.24 s [algebraic-graphs]
  19552. 548.24 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  19553. 548.24 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  19554. 548.24 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  19555. 548.24 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  19556. 548.24 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19557. 548.24 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  19558. 548.24 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  19559. 548.24 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  19560. 548.24 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  19561. 548.24 s [algebraic-graphs]
  19562. 548.24 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  19563. 548.24 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19564. 548.24 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19565. 548.24 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19566. 548.24 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19567. 548.24 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19568. 548.24 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19569. 548.24 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19570. 548.24 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19571. 548.24 s [algebraic-graphs]
  19572. 548.24 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  19573. 548.24 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  19574. 548.24 s [algebraic-graphs]
  19575. 548.24 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  19576. 548.24 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  19577. 548.24 s [algebraic-graphs]
  19578. 548.24 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  19579. 548.24 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  19580. 548.24 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  19581. 548.24 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  19582. 548.24 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  19583. 548.24 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19584. 548.24 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  19585. 548.24 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  19586. 548.24 s [algebraic-graphs]
  19587. 548.24 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  19588. 548.24 s [algebraic-graphs] OK: vertices [] == empty
  19589. 548.24 s [algebraic-graphs] OK: vertices [x] == vertex x
  19590. 548.24 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19591. 548.24 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19592. 548.24 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19593. 548.24 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19594. 548.24 s [algebraic-graphs]
  19595. 548.24 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  19596. 548.24 s [algebraic-graphs] OK: edges [] == empty
  19597. 548.24 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  19598. 548.24 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  19599. 548.24 s [algebraic-graphs]
  19600. 548.24 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  19601. 548.24 s [algebraic-graphs] OK: overlays [] == empty
  19602. 548.24 s [algebraic-graphs] OK: overlays [x] == x
  19603. 548.24 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19604. 548.24 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19605. 548.24 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19606. 548.24 s [algebraic-graphs]
  19607. 548.24 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  19608. 548.24 s [algebraic-graphs] OK: foldg empty vertex connect == id
  19609. 548.24 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  19610. 548.24 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  19611. 548.24 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  19612. 548.24 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  19613. 548.24 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  19614. 548.24 s [algebraic-graphs]
  19615. 548.24 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  19616. 548.24 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  19617. 548.24 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  19618. 548.24 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  19619. 548.24 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  19620. 548.24 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  19621. 548.24 s [algebraic-graphs]
  19622. 548.24 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  19623. 548.24 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19624. 548.24 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19625. 548.24 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19626. 548.24 s [algebraic-graphs]
  19627. 548.24 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  19628. 548.24 s [algebraic-graphs] OK: isEmpty empty == True
  19629. 548.24 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19630. 548.24 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19631. 548.24 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19632. 548.24 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  19633. 548.24 s [algebraic-graphs]
  19634. 548.24 s [algebraic-graphs] ============ Labelled.Graph.size ============
  19635. 548.24 s [algebraic-graphs] OK: size empty == 1
  19636. 548.24 s [algebraic-graphs] OK: size (vertex x) == 1
  19637. 548.24 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19638. 548.24 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19639. 548.24 s [algebraic-graphs] OK: size x >= 1
  19640. 548.24 s [algebraic-graphs] OK: size x >= vertexCount x
  19641. 548.24 s [algebraic-graphs]
  19642. 548.24 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  19643. 548.24 s [algebraic-graphs] OK: hasVertex x empty == False
  19644. 548.24 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19645. 548.24 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19646. 548.24 s [algebraic-graphs]
  19647. 548.24 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  19648. 548.24 s [algebraic-graphs] OK: hasEdge x y empty == False
  19649. 548.24 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19650. 548.24 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  19651. 548.24 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19652. 548.24 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  19653. 548.24 s [algebraic-graphs]
  19654. 548.24 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  19655. 548.24 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  19656. 548.24 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  19657. 548.24 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19658. 548.24 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  19659. 548.24 s [algebraic-graphs]
  19660. 548.24 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  19661. 548.24 s [algebraic-graphs] OK: vertexCount empty == 0
  19662. 548.24 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19663. 548.24 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19664. 548.24 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19665. 548.24 s [algebraic-graphs]
  19666. 548.24 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  19667. 548.24 s [algebraic-graphs] OK: edgeCount empty == 0
  19668. 548.24 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19669. 548.24 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  19670. 548.24 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19671. 548.24 s [algebraic-graphs]
  19672. 548.24 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  19673. 548.24 s [algebraic-graphs] OK: vertexList empty == []
  19674. 548.24 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19675. 548.24 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19676. 548.24 s [algebraic-graphs]
  19677. 548.24 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  19678. 548.24 s [algebraic-graphs] OK: edgeList empty == []
  19679. 548.24 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19680. 548.24 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  19681. 548.24 s [algebraic-graphs]
  19682. 548.24 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  19683. 548.24 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19684. 548.24 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19685. 548.24 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19686. 548.24 s [algebraic-graphs]
  19687. 548.24 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  19688. 548.24 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19689. 548.24 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19690. 548.24 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  19691. 548.24 s [algebraic-graphs]
  19692. 548.24 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  19693. 548.24 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19694. 548.24 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19695. 551.06 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  19696. 551.19 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  19697. 551.19 s [algebraic-graphs]
  19698. 551.19 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  19699. 551.19 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19700. 551.19 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19701. 551.19 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  19702. 551.19 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  19703. 551.19 s [algebraic-graphs]
  19704. 551.19 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  19705. 551.19 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19706. 551.19 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19707. 551.19 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  19708. 551.19 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  19709. 551.19 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19710. 551.19 s [algebraic-graphs]
  19711. 551.19 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  19712. 551.19 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  19713. 551.19 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19714. 551.19 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19715. 551.19 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19716. 551.19 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19717. 551.19 s [algebraic-graphs]
  19718. 551.19 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  19719. 551.19 s [algebraic-graphs] OK: replaceVertex x x == id
  19720. 551.19 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19721. 551.19 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  19722. 551.19 s [algebraic-graphs]
  19723. 551.19 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  19724. 551.19 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  19725. 551.19 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  19726. 551.19 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  19727. 551.19 s [algebraic-graphs]
  19728. 551.19 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  19729. 551.19 s [algebraic-graphs] OK: transpose empty == empty
  19730. 551.19 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19731. 551.19 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  19732. 551.19 s [algebraic-graphs] OK: transpose . transpose == id
  19733. 551.19 s [algebraic-graphs]
  19734. 551.19 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  19735. 551.19 s [algebraic-graphs] OK: fmap f empty == empty
  19736. 551.19 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  19737. 551.19 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  19738. 551.19 s [algebraic-graphs] OK: fmap id == id
  19739. 551.19 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  19740. 551.19 s [algebraic-graphs]
  19741. 551.19 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  19742. 551.19 s [algebraic-graphs] OK: emap h empty == empty
  19743. 551.19 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  19744. 551.19 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  19745. 551.19 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  19746. 551.19 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  19747. 551.19 s [algebraic-graphs] OK: emap id == id
  19748. 551.19 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  19749. 551.19 s [algebraic-graphs]
  19750. 551.19 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  19751. 551.19 s [algebraic-graphs] OK: induce (const True ) x == x
  19752. 551.19 s [algebraic-graphs] OK: induce (const False) x == empty
  19753. 551.19 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19754. 551.19 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19755. 551.19 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19756. 551.19 s [algebraic-graphs]
  19757. 551.19 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  19758. 551.19 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19759. 551.19 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19760. 551.19 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19761. 551.19 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19762. 551.19 s [algebraic-graphs]
  19763. 551.19 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  19764. 551.19 s [algebraic-graphs] OK: closure empty == empty
  19765. 551.19 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  19766. 551.19 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  19767. 551.19 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19768. 551.19 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19769. 551.19 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19770. 551.19 s [algebraic-graphs] OK: closure . closure == closure
  19771. 551.19 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19772. 551.19 s [algebraic-graphs]
  19773. 551.19 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  19774. 551.19 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  19775. 551.19 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  19776. 551.19 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  19777. 551.19 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19778. 551.19 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19779. 551.19 s [algebraic-graphs]
  19780. 551.19 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  19781. 551.19 s [algebraic-graphs] OK: symmetricClosure empty == empty
  19782. 551.19 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19783. 551.19 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  19784. 551.19 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19785. 551.19 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19786. 551.19 s [algebraic-graphs]
  19787. 551.19 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  19788. 551.19 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19789. 551.19 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19790. 551.19 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  19791. 551.19 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19792. 551.19 s [algebraic-graphs]
  19793. 551.19 s [algebraic-graphs] ============ Labelled.Graph.context ============
  19794. 551.19 s [algebraic-graphs] OK: context (const False) x == Nothing
  19795. 551.19 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  19796. 551.19 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  19797. 551.19 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  19798. 551.19 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  19799. 551.20 s [algebraic-graphs]
  19800. 551.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  19801. 551.20 s [algebraic-graphs] OK: Axioms of non-empty graphs
  19802. 551.20 s [algebraic-graphs] OK: Theorems of non-empty graphs
  19803. 551.20 s [algebraic-graphs]
  19804. 551.20 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  19805. 551.20 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19806. 551.20 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19807. 551.20 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19808. 551.20 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19809. 551.20 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19810. 551.20 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19811. 551.20 s [algebraic-graphs] OK: x <= x + y
  19812. 551.20 s [algebraic-graphs] OK: x + y <= x * y
  19813. 551.20 s [algebraic-graphs]
  19814. 551.20 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  19815. 551.20 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  19816. 551.20 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  19817. 551.20 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  19818. 551.20 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  19819. 551.20 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  19820. 551.20 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  19821. 551.20 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  19822. 551.20 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  19823. 551.20 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  19824. 551.20 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  19825. 551.20 s [algebraic-graphs]
  19826. 551.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  19827. 551.20 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  19828. 551.20 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  19829. 551.20 s [algebraic-graphs]
  19830. 551.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  19831. 551.20 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  19832. 551.20 s [algebraic-graphs]
  19833. 551.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  19834. 551.20 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19835. 551.20 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19836. 551.20 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19837. 551.20 s [algebraic-graphs]
  19838. 551.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  19839. 551.20 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19840. 551.20 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19841. 551.20 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19842. 551.20 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19843. 551.20 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19844. 551.20 s [algebraic-graphs]
  19845. 551.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  19846. 551.20 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19847. 551.20 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19848. 551.20 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19849. 551.20 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19850. 551.20 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19851. 551.20 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19852. 551.20 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19853. 551.20 s [algebraic-graphs]
  19854. 551.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  19855. 551.20 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19856. 551.20 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19857. 551.20 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19858. 551.20 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19859. 551.20 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19860. 551.20 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19861. 551.20 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19862. 551.20 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19863. 551.20 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19864. 551.20 s [algebraic-graphs]
  19865. 551.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  19866. 551.20 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  19867. 551.20 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  19868. 551.20 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  19869. 551.20 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19870. 551.20 s [algebraic-graphs]
  19871. 551.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  19872. 551.20 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  19873. 551.20 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  19874. 551.20 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  19875. 551.20 s [algebraic-graphs]
  19876. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  19877. 554.20 s [algebraic-graphs] OK: overlays1 [x] == x
  19878. 554.20 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  19879. 554.20 s [algebraic-graphs]
  19880. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  19881. 554.20 s [algebraic-graphs] OK: connects1 [x] == x
  19882. 554.20 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  19883. 554.20 s [algebraic-graphs]
  19884. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  19885. 554.20 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19886. 554.20 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19887. 554.20 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  19888. 554.20 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19889. 554.20 s [algebraic-graphs]
  19890. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  19891. 554.20 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19892. 554.20 s [algebraic-graphs]
  19893. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  19894. 554.20 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19895. 554.20 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19896. 554.20 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19897. 554.20 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19898. 554.20 s [algebraic-graphs]
  19899. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  19900. 554.20 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19901. 554.20 s [algebraic-graphs] OK: vertexCount x >= 1
  19902. 554.20 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  19903. 554.20 s [algebraic-graphs]
  19904. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  19905. 554.20 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19906. 554.20 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19907. 554.20 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19908. 554.20 s [algebraic-graphs]
  19909. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  19910. 554.20 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  19911. 554.20 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  19912. 554.20 s [algebraic-graphs]
  19913. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  19914. 554.20 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19915. 554.20 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19916. 554.20 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  19917. 554.20 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  19918. 554.20 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19919. 554.20 s [algebraic-graphs]
  19920. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  19921. 554.20 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19922. 554.20 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19923. 554.20 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  19924. 554.20 s [algebraic-graphs]
  19925. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  19926. 554.20 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19927. 554.20 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19928. 554.20 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  19929. 554.20 s [algebraic-graphs]
  19930. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  19931. 554.20 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19932. 554.20 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  19933. 554.20 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  19934. 554.20 s [algebraic-graphs]
  19935. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  19936. 554.20 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19937. 554.20 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  19938. 554.20 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  19939. 554.20 s [algebraic-graphs]
  19940. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  19941. 554.20 s [algebraic-graphs] OK: path1 [x] == vertex x
  19942. 554.20 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  19943. 554.20 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  19944. 554.20 s [algebraic-graphs]
  19945. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  19946. 554.20 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  19947. 554.20 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  19948. 554.20 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  19949. 554.20 s [algebraic-graphs]
  19950. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  19951. 554.20 s [algebraic-graphs] OK: clique1 [x] == vertex x
  19952. 554.20 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  19953. 554.20 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  19954. 554.20 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  19955. 554.20 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  19956. 554.20 s [algebraic-graphs]
  19957. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  19958. 554.20 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19959. 554.20 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  19960. 554.20 s [algebraic-graphs]
  19961. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  19962. 554.20 s [algebraic-graphs] OK: star x [] == vertex x
  19963. 554.20 s [algebraic-graphs] OK: star x [y] == edge x y
  19964. 554.20 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  19965. 554.20 s [algebraic-graphs]
  19966. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  19967. 554.20 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  19968. 554.20 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  19969. 554.20 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  19970. 554.20 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  19971. 554.20 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  19972. 554.20 s [algebraic-graphs]
  19973. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  19974. 554.20 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19975. 554.20 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  19976. 554.20 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19977. 554.20 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  19978. 554.20 s [algebraic-graphs]
  19979. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  19980. 554.20 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  19981. 554.20 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  19982. 554.20 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  19983. 554.20 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  19984. 554.20 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  19985. 554.20 s [algebraic-graphs]
  19986. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  19987. 554.20 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  19988. 554.20 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19989. 554.20 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19990. 554.20 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19991. 554.20 s [algebraic-graphs]
  19992. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  19993. 554.20 s [algebraic-graphs] OK: replaceVertex x x == id
  19994. 554.20 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19995. 554.20 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19996. 554.20 s [algebraic-graphs]
  19997. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  19998. 554.20 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19999. 554.20 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20000. 554.20 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20001. 554.20 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20002. 554.20 s [algebraic-graphs]
  20003. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  20004. 554.20 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20005. 554.20 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20006. 554.20 s [algebraic-graphs] OK: transpose . transpose == id
  20007. 554.20 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20008. 554.20 s [algebraic-graphs]
  20009. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  20010. 554.20 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20011. 554.20 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20012. 554.20 s [algebraic-graphs] OK: gmap id == id
  20013. 554.20 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20014. 554.20 s [algebraic-graphs]
  20015. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  20016. 554.20 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  20017. 554.20 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  20018. 554.20 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  20019. 554.20 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  20020. 554.20 s [algebraic-graphs]
  20021. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  20022. 554.20 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  20023. 554.20 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  20024. 554.20 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  20025. 554.20 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  20026. 554.20 s [algebraic-graphs]
  20027. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  20028. 554.20 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20029. 554.20 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20030. 554.20 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  20031. 554.20 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  20032. 554.20 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20033. 554.20 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20034. 554.20 s [algebraic-graphs] OK: closure . closure == closure
  20035. 554.20 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20036. 554.20 s [algebraic-graphs]
  20037. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  20038. 554.20 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20039. 554.20 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20040. 554.20 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  20041. 554.20 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20042. 554.20 s [algebraic-graphs]
  20043. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  20044. 554.20 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20045. 554.20 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  20046. 554.20 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20047. 554.20 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20048. 554.20 s [algebraic-graphs]
  20049. 554.20 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  20050. 554.20 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20051. 554.20 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20052. 554.20 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  20053. 554.20 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20054. 554.20 s [algebraic-graphs]
  20055. 554.20 s [algebraic-graphs] ============ NonEmpty.Graph.============
  20056. 554.20 s [algebraic-graphs] OK: Axioms of non-empty graphs
  20057. 554.20 s [algebraic-graphs] OK: Theorems of non-empty graphs
  20058. 554.20 s [algebraic-graphs]
  20059. 554.20 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  20060. 554.20 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20061. 554.20 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20062. 554.20 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20063. 554.20 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20064. 554.20 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20065. 554.20 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20066. 554.20 s [algebraic-graphs] OK: x <= x + y
  20067. 554.20 s [algebraic-graphs] OK: x + y <= x * y
  20068. 554.20 s [algebraic-graphs]
  20069. 554.20 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  20070. 554.20 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  20071. 554.20 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  20072. 554.20 s [algebraic-graphs] OK: fmap id == id
  20073. 554.20 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  20074. 554.20 s [algebraic-graphs]
  20075. 554.20 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  20076. 554.20 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  20077. 555.78 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  20078. 555.78 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  20079. 555.78 s [algebraic-graphs] OK: (x >>= vertex) == x
  20080. 555.78 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  20081. 555.78 s [algebraic-graphs]
  20082. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  20083. 555.78 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  20084. 555.78 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  20085. 555.78 s [algebraic-graphs]
  20086. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  20087. 555.78 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20088. 555.78 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20089. 555.78 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20090. 555.78 s [algebraic-graphs] OK: size (vertex x) == 1
  20091. 555.78 s [algebraic-graphs]
  20092. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  20093. 555.78 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20094. 555.78 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20095. 555.78 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20096. 555.78 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20097. 555.78 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20098. 555.78 s [algebraic-graphs]
  20099. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  20100. 555.78 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20101. 555.78 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20102. 555.78 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20103. 555.78 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20104. 555.78 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20105. 555.78 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  20106. 555.78 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20107. 555.78 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20108. 555.78 s [algebraic-graphs]
  20109. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  20110. 555.78 s [algebraic-graphs] OK: overlay1 empty x == x
  20111. 555.78 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  20112. 555.78 s [algebraic-graphs]
  20113. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  20114. 555.78 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20115. 555.78 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20116. 555.78 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20117. 555.78 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20118. 555.78 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20119. 555.78 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20120. 555.78 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20121. 555.78 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  20122. 555.78 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20123. 555.78 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20124. 555.78 s [algebraic-graphs]
  20125. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  20126. 555.78 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  20127. 555.78 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  20128. 555.78 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  20129. 555.78 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20130. 555.78 s [algebraic-graphs]
  20131. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  20132. 555.78 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  20133. 555.78 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  20134. 555.78 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  20135. 555.78 s [algebraic-graphs]
  20136. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  20137. 555.78 s [algebraic-graphs] OK: overlays1 [x] == x
  20138. 555.78 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  20139. 555.78 s [algebraic-graphs]
  20140. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  20141. 555.78 s [algebraic-graphs] OK: connects1 [x] == x
  20142. 555.78 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  20143. 555.78 s [algebraic-graphs]
  20144. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  20145. 555.78 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  20146. 555.78 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  20147. 555.78 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  20148. 555.78 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  20149. 555.78 s [algebraic-graphs]
  20150. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  20151. 555.78 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20152. 555.78 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20153. 555.78 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  20154. 555.78 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20155. 555.78 s [algebraic-graphs]
  20156. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  20157. 555.78 s [algebraic-graphs] OK: x === x == True
  20158. 555.78 s [algebraic-graphs] OK: x + y === x + y == True
  20159. 555.78 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  20160. 555.78 s [algebraic-graphs] OK: x + y === x * y == False
  20161. 555.78 s [algebraic-graphs]
  20162. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  20163. 555.78 s [algebraic-graphs] OK: size (vertex x) == 1
  20164. 555.78 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  20165. 555.78 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  20166. 555.78 s [algebraic-graphs] OK: size x >= 1
  20167. 555.78 s [algebraic-graphs] OK: size x >= vertexCount x
  20168. 555.78 s [algebraic-graphs]
  20169. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  20170. 555.78 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20171. 555.78 s [algebraic-graphs]
  20172. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  20173. 555.78 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20174. 555.78 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20175. 555.78 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20176. 555.78 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20177. 555.78 s [algebraic-graphs]
  20178. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  20179. 555.78 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20180. 555.78 s [algebraic-graphs] OK: vertexCount x >= 1
  20181. 555.78 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  20182. 555.78 s [algebraic-graphs]
  20183. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  20184. 555.78 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20185. 555.78 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20186. 555.78 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20187. 555.78 s [algebraic-graphs]
  20188. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  20189. 555.78 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  20190. 555.78 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  20191. 555.78 s [algebraic-graphs]
  20192. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  20193. 555.78 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20194. 555.78 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20195. 555.78 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20196. 555.78 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  20197. 555.78 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20198. 555.78 s [algebraic-graphs]
  20199. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  20200. 555.78 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20201. 555.78 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20202. 555.78 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  20203. 555.78 s [algebraic-graphs]
  20204. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  20205. 555.78 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20206. 555.78 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20207. 555.78 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  20208. 555.78 s [algebraic-graphs]
  20209. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  20210. 555.78 s [algebraic-graphs] OK: path1 [x] == vertex x
  20211. 555.78 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  20212. 555.78 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  20213. 555.78 s [algebraic-graphs]
  20214. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  20215. 555.78 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  20216. 555.78 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  20217. 555.78 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  20218. 555.78 s [algebraic-graphs]
  20219. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  20220. 555.78 s [algebraic-graphs] OK: clique1 [x] == vertex x
  20221. 555.78 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  20222. 555.78 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  20223. 555.78 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  20224. 555.78 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  20225. 555.78 s [algebraic-graphs]
  20226. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  20227. 555.78 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20228. 555.78 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  20229. 555.78 s [algebraic-graphs]
  20230. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  20231. 555.78 s [algebraic-graphs] OK: star x [] == vertex x
  20232. 555.78 s [algebraic-graphs] OK: star x [y] == edge x y
  20233. 555.78 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  20234. 555.78 s [algebraic-graphs]
  20235. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  20236. 555.78 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  20237. 555.78 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  20238. 555.78 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  20239. 555.78 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  20240. 555.78 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  20241. 555.78 s [algebraic-graphs]
  20242. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  20243. 555.78 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20244. 555.78 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  20245. 555.78 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20246. 555.78 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  20247. 555.78 s [algebraic-graphs]
  20248. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  20249. 555.78 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  20250. 555.78 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  20251. 555.78 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  20252. 555.78 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  20253. 555.78 s [algebraic-graphs]
  20254. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  20255. 555.78 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  20256. 555.78 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  20257. 555.78 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  20258. 555.78 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  20259. 555.78 s [algebraic-graphs]
  20260. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  20261. 555.78 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  20262. 555.78 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  20263. 555.78 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  20264. 555.78 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  20265. 555.78 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  20266. 555.78 s [algebraic-graphs]
  20267. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  20268. 555.78 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  20269. 555.78 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20270. 555.78 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20271. 555.78 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20272. 555.78 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  20273. 555.78 s [algebraic-graphs]
  20274. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  20275. 555.78 s [algebraic-graphs] OK: replaceVertex x x == id
  20276. 555.78 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20277. 555.78 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20278. 555.78 s [algebraic-graphs]
  20279. 555.78 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  20280. 555.78 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20281. 563.54 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20282. 563.54 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20283. 563.57 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20284. 563.57 s [algebraic-graphs]
  20285. 563.57 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  20286. 563.58 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  20287. 563.58 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  20288. 563.58 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  20289. 563.58 s [algebraic-graphs]
  20290. 563.58 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  20291. 563.58 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20292. 563.58 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20293. 563.58 s [algebraic-graphs] OK: transpose . transpose == id
  20294. 563.58 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20295. 563.58 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20296. 563.58 s [algebraic-graphs]
  20297. 563.58 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  20298. 563.58 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  20299. 563.58 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  20300. 563.58 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  20301. 563.58 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  20302. 563.58 s [algebraic-graphs]
  20303. 563.58 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  20304. 563.58 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  20305. 563.58 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  20306. 563.58 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  20307. 563.58 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  20308. 563.58 s [algebraic-graphs]
  20309. 563.58 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  20310. 563.58 s [algebraic-graphs] OK: simplify == id
  20311. 563.58 s [algebraic-graphs] OK: size (simplify x) <= size x
  20312. 563.58 s [algebraic-graphs] OK: simplify 1 === 1
  20313. 563.58 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  20314. 563.58 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  20315. 563.58 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  20316. 563.58 s [algebraic-graphs]
  20317. 563.58 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  20318. 563.58 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  20319. 563.58 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  20320. 563.58 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  20321. 563.58 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  20322. 563.58 s [algebraic-graphs]
  20323. 563.58 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  20324. 563.58 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  20325. 563.58 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  20326. 563.58 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  20327. 563.58 s [algebraic-graphs]
  20328. 563.58 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  20329. 563.58 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  20330. 563.58 s [algebraic-graphs] OK: box x y ~~ box y x
  20331. 563.58 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  20332. 563.58 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20333. 563.58 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20334. 563.58 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20335. 563.58 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20336. 563.58 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20337. 563.58 s [algebraic-graphs]
  20338. 563.58 s [algebraic-graphs] ============ Relation ============
  20339. 563.58 s [algebraic-graphs] OK: Axioms of graphs
  20340. 563.58 s [algebraic-graphs]
  20341. 563.58 s [algebraic-graphs] ============ Relation.consistent ============
  20342. 563.58 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20343. 563.58 s [algebraic-graphs]
  20344. 563.58 s [algebraic-graphs] OK: consistent empty == True
  20345. 563.58 s [algebraic-graphs] OK: consistent (vertex x) == True
  20346. 563.58 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20347. 563.58 s [algebraic-graphs] OK: consistent (connect x y) == True
  20348. 563.58 s [algebraic-graphs] OK: consistent (edge x y) == True
  20349. 563.58 s [algebraic-graphs] OK: consistent (edges xs) == True
  20350. 563.58 s [algebraic-graphs] OK: consistent (stars xs) == True
  20351. 563.58 s [algebraic-graphs]
  20352. 563.58 s [algebraic-graphs] ============ Relation.Show ============
  20353. 563.58 s [algebraic-graphs] OK: show (empty ) == "empty"
  20354. 563.58 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20355. 563.58 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20356. 563.58 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20357. 563.58 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20358. 563.58 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20359. 563.58 s [algebraic-graphs]
  20360. 563.58 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20361. 563.58 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20362. 563.58 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20363. 563.58 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20364. 563.58 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20365. 563.58 s [algebraic-graphs]
  20366. 563.58 s [algebraic-graphs] ============ Relation.Ord ============
  20367. 563.58 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20368. 563.58 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20369. 563.58 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20370. 563.58 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20371. 563.58 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20372. 563.58 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20373. 563.58 s [algebraic-graphs] OK: x <= x + y
  20374. 563.58 s [algebraic-graphs] OK: x + y <= x * y
  20375. 563.58 s [algebraic-graphs]
  20376. 563.58 s [algebraic-graphs] ============ Relation.empty ============
  20377. 563.58 s [algebraic-graphs] OK: isEmpty empty == True
  20378. 563.58 s [algebraic-graphs] OK: hasVertex x empty == False
  20379. 563.58 s [algebraic-graphs] OK: vertexCount empty == 0
  20380. 563.58 s [algebraic-graphs] OK: edgeCount empty == 0
  20381. 563.58 s [algebraic-graphs]
  20382. 563.58 s [algebraic-graphs] ============ Relation.vertex ============
  20383. 563.58 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20384. 563.58 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20385. 563.58 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20386. 563.58 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20387. 563.58 s [algebraic-graphs]
  20388. 563.58 s [algebraic-graphs] ============ Relation.edge ============
  20389. 563.58 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20390. 563.58 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20391. 563.58 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20392. 563.58 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20393. 563.58 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20394. 563.58 s [algebraic-graphs]
  20395. 563.58 s [algebraic-graphs] ============ Relation.overlay ============
  20396. 563.58 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20397. 563.58 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20398. 563.58 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20399. 563.58 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20400. 563.58 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20401. 563.58 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20402. 563.58 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20403. 563.58 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20404. 563.58 s [algebraic-graphs]
  20405. 563.58 s [algebraic-graphs] ============ Relation.connect ============
  20406. 563.58 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20407. 563.58 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20408. 563.58 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20409. 563.58 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20410. 563.58 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20411. 563.58 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20412. 563.58 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20413. 563.58 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20414. 563.58 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20415. 563.58 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20416. 563.58 s [algebraic-graphs]
  20417. 563.58 s [algebraic-graphs] ============ Relation.vertices ============
  20418. 563.58 s [algebraic-graphs] OK: vertices [] == empty
  20419. 563.58 s [algebraic-graphs] OK: vertices [x] == vertex x
  20420. 563.58 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20421. 563.58 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20422. 563.58 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20423. 563.58 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20424. 563.58 s [algebraic-graphs]
  20425. 563.58 s [algebraic-graphs] ============ Relation.edges ============
  20426. 563.58 s [algebraic-graphs] OK: edges [] == empty
  20427. 563.58 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20428. 563.58 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20429. 563.58 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20430. 563.58 s [algebraic-graphs]
  20431. 563.58 s [algebraic-graphs] ============ Relation.overlays ============
  20432. 563.58 s [algebraic-graphs] OK: overlays [] == empty
  20433. 563.58 s [algebraic-graphs] OK: overlays [x] == x
  20434. 563.58 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20435. 563.58 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20436. 563.58 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20437. 563.58 s [algebraic-graphs]
  20438. 563.58 s [algebraic-graphs] ============ Relation.connects ============
  20439. 563.58 s [algebraic-graphs] OK: connects [] == empty
  20440. 563.58 s [algebraic-graphs] OK: connects [x] == x
  20441. 563.58 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20442. 563.58 s [algebraic-graphs] OK: connects == foldr connect empty
  20443. 563.58 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20444. 563.58 s [algebraic-graphs]
  20445. 563.58 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  20446. 563.58 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20447. 563.58 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20448. 563.58 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20449. 563.58 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20450. 563.58 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20451. 563.58 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20452. 563.58 s [algebraic-graphs]
  20453. 563.58 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  20454. 563.58 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20455. 563.58 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20456. 563.58 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20457. 563.58 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20458. 563.58 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20459. 563.58 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20460. 563.58 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20461. 563.58 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20462. 563.58 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20463. 563.58 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20464. 563.58 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20465. 563.58 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20466. 563.58 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20467. 563.58 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20468. 563.58 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20469. 563.58 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20470. 563.58 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20471. 566.96 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20472. 566.96 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20473. 566.97 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20474. 566.97 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20475. 566.97 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20476. 566.97 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20477. 566.97 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20478. 566.97 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20479. 566.97 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20480. 566.97 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20481. 566.97 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20482. 566.97 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20483. 566.97 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20484. 566.97 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20485. 566.97 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20486. 566.97 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20487. 566.97 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20488. 566.97 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20489. 566.97 s [algebraic-graphs]
  20490. 566.97 s [algebraic-graphs] ============ Relation.foldg ============
  20491. 566.97 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20492. 566.97 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20493. 566.97 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20494. 566.97 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20495. 566.97 s [algebraic-graphs]
  20496. 566.97 s [algebraic-graphs] ============ Relation.isEmpty ============
  20497. 566.97 s [algebraic-graphs] OK: isEmpty empty == True
  20498. 566.97 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20499. 566.97 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20500. 566.97 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20501. 566.97 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20502. 566.97 s [algebraic-graphs]
  20503. 566.97 s [algebraic-graphs] ============ Relation.hasVertex ============
  20504. 566.97 s [algebraic-graphs] OK: hasVertex x empty == False
  20505. 566.97 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20506. 566.97 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20507. 566.97 s [algebraic-graphs]
  20508. 566.97 s [algebraic-graphs] ============ Relation.hasEdge ============
  20509. 566.97 s [algebraic-graphs] OK: hasEdge x y empty == False
  20510. 566.97 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20511. 566.97 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20512. 566.97 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20513. 566.97 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20514. 566.97 s [algebraic-graphs]
  20515. 566.97 s [algebraic-graphs] ============ Relation.vertexCount ============
  20516. 566.97 s [algebraic-graphs] OK: vertexCount empty == 0
  20517. 566.97 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20518. 566.97 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20519. 566.97 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20520. 566.97 s [algebraic-graphs]
  20521. 566.97 s [algebraic-graphs] ============ Relation.edgeCount ============
  20522. 566.97 s [algebraic-graphs] OK: edgeCount empty == 0
  20523. 566.97 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20524. 566.97 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20525. 566.97 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20526. 566.97 s [algebraic-graphs]
  20527. 566.97 s [algebraic-graphs] ============ Relation.vertexList ============
  20528. 566.97 s [algebraic-graphs] OK: vertexList empty == []
  20529. 566.97 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20530. 566.97 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20531. 566.97 s [algebraic-graphs]
  20532. 566.97 s [algebraic-graphs] ============ Relation.vertexSet ============
  20533. 566.97 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20534. 566.97 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20535. 566.97 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20536. 566.97 s [algebraic-graphs]
  20537. 566.97 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  20538. 566.97 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20539. 566.97 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20540. 566.97 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20541. 566.97 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20542. 566.97 s [algebraic-graphs]
  20543. 566.97 s [algebraic-graphs] ============ Relation.edgeList ============
  20544. 566.97 s [algebraic-graphs] OK: edgeList empty == []
  20545. 566.97 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20546. 566.97 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20547. 566.97 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20548. 566.97 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20549. 566.97 s [algebraic-graphs]
  20550. 566.97 s [algebraic-graphs] ============ Relation.edgeSet ============
  20551. 566.97 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20552. 566.97 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20553. 566.97 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20554. 566.97 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20555. 566.97 s [algebraic-graphs]
  20556. 566.97 s [algebraic-graphs] ============ Relation.adjacencyList ============
  20557. 566.97 s [algebraic-graphs] OK: adjacencyList empty == []
  20558. 566.97 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20559. 566.97 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20560. 566.97 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20561. 566.97 s [algebraic-graphs]
  20562. 566.97 s [algebraic-graphs] ============ Relation.preSet ============
  20563. 566.97 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20564. 566.97 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20565. 566.97 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20566. 566.97 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20567. 566.97 s [algebraic-graphs]
  20568. 566.97 s [algebraic-graphs] ============ Relation.preIntSet ============
  20569. 566.97 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20570. 566.97 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20571. 566.97 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20572. 566.97 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20573. 566.97 s [algebraic-graphs]
  20574. 566.97 s [algebraic-graphs] ============ Relation.postSet ============
  20575. 566.97 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20576. 566.97 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20577. 566.97 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20578. 566.98 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20579. 566.98 s [algebraic-graphs]
  20580. 566.98 s [algebraic-graphs] ============ Relation.postIntSet ============
  20581. 566.98 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20582. 566.98 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20583. 566.98 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20584. 566.98 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20585. 566.98 s [algebraic-graphs]
  20586. 566.98 s [algebraic-graphs] ============ Relation.path ============
  20587. 566.98 s [algebraic-graphs] OK: path [] == empty
  20588. 566.98 s [algebraic-graphs] OK: path [x] == vertex x
  20589. 566.98 s [algebraic-graphs] OK: path [x,y] == edge x y
  20590. 566.98 s [algebraic-graphs]
  20591. 566.98 s [algebraic-graphs] ============ Relation.circuit ============
  20592. 566.98 s [algebraic-graphs] OK: circuit [] == empty
  20593. 566.98 s [algebraic-graphs] OK: circuit [x] == edge x x
  20594. 566.98 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20595. 566.98 s [algebraic-graphs]
  20596. 566.98 s [algebraic-graphs] ============ Relation.clique ============
  20597. 566.98 s [algebraic-graphs] OK: clique [] == empty
  20598. 566.98 s [algebraic-graphs] OK: clique [x] == vertex x
  20599. 566.98 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20600. 566.98 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20601. 566.98 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20602. 566.98 s [algebraic-graphs]
  20603. 566.98 s [algebraic-graphs] ============ Relation.biclique ============
  20604. 566.98 s [algebraic-graphs] OK: biclique [] [] == empty
  20605. 566.98 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20606. 566.98 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20607. 566.98 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20608. 566.98 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20609. 566.98 s [algebraic-graphs]
  20610. 566.98 s [algebraic-graphs] ============ Relation.star ============
  20611. 566.98 s [algebraic-graphs] OK: star x [] == vertex x
  20612. 566.98 s [algebraic-graphs] OK: star x [y] == edge x y
  20613. 566.98 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20614. 566.98 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20615. 566.98 s [algebraic-graphs]
  20616. 566.98 s [algebraic-graphs] ============ Relation.stars ============
  20617. 566.99 s [algebraic-graphs] OK: stars [] == empty
  20618. 566.99 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20619. 566.99 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20620. 566.99 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20621. 566.99 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20622. 566.99 s [algebraic-graphs] OK: stars . adjacencyList == id
  20623. 566.99 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20624. 566.99 s [algebraic-graphs]
  20625. 566.99 s [algebraic-graphs] ============ Relation.tree ============
  20626. 566.99 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20627. 566.99 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20628. 566.99 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20629. 566.99 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20630. 566.99 s [algebraic-graphs]
  20631. 566.99 s [algebraic-graphs] ============ Relation.forest ============
  20632. 566.99 s [algebraic-graphs] OK: forest [] == empty
  20633. 566.99 s [algebraic-graphs] OK: forest [x] == tree x
  20634. 566.99 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20635. 566.99 s [algebraic-graphs] OK: forest == overlays . map tree
  20636. 566.99 s [algebraic-graphs]
  20637. 566.99 s [algebraic-graphs] ============ Relation.removeVertex ============
  20638. 566.99 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20639. 566.99 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20640. 566.99 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20641. 566.99 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20642. 566.99 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20643. 566.99 s [algebraic-graphs]
  20644. 566.99 s [algebraic-graphs] ============ Relation.removeEdge ============
  20645. 566.99 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20646. 566.99 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20647. 566.99 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20648. 566.99 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20649. 566.99 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20650. 566.99 s [algebraic-graphs]
  20651. 566.99 s [algebraic-graphs] ============ Relation.replaceVertex ============
  20652. 566.99 s [algebraic-graphs] OK: replaceVertex x x == id
  20653. 566.99 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20654. 566.99 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20655. 566.99 s [algebraic-graphs]
  20656. 566.99 s [algebraic-graphs] ============ Relation.mergeVertices ============
  20657. 566.99 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20658. 592.27 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20659. 592.27 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20660. 592.31 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20661. 592.31 s [algebraic-graphs]
  20662. 592.31 s [algebraic-graphs] ============ Relation.transpose ============
  20663. 592.31 s [algebraic-graphs] OK: transpose empty == empty
  20664. 592.31 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20665. 592.31 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20666. 592.31 s [algebraic-graphs] OK: transpose . transpose == id
  20667. 592.31 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20668. 592.31 s [algebraic-graphs]
  20669. 592.31 s [algebraic-graphs] ============ Relation.gmap ============
  20670. 592.31 s [algebraic-graphs] OK: gmap f empty == empty
  20671. 592.31 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20672. 592.31 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20673. 592.31 s [algebraic-graphs] OK: gmap id == id
  20674. 592.31 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20675. 592.31 s [algebraic-graphs]
  20676. 592.31 s [algebraic-graphs] ============ Relation.induce ============
  20677. 592.31 s [algebraic-graphs] OK: induce (const True ) x == x
  20678. 592.31 s [algebraic-graphs] OK: induce (const False) x == empty
  20679. 592.31 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20680. 592.31 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20681. 592.31 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20682. 592.31 s [algebraic-graphs]
  20683. 592.31 s [algebraic-graphs] ============ Relation.compose ============
  20684. 592.31 s [algebraic-graphs] OK: compose empty x == empty
  20685. 592.31 s [algebraic-graphs] OK: compose x empty == empty
  20686. 592.31 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20687. 592.31 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20688. 592.31 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20689. 592.31 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20690. 592.31 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20691. 592.31 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20692. 592.31 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20693. 592.31 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20694. 592.31 s [algebraic-graphs]
  20695. 592.31 s [algebraic-graphs] ============ Relation.closure ============
  20696. 592.31 s [algebraic-graphs] OK: closure empty == empty
  20697. 592.31 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20698. 592.32 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20699. 592.32 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20700. 592.32 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20701. 592.32 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20702. 592.32 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20703. 592.32 s [algebraic-graphs] OK: closure . closure == closure
  20704. 592.32 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20705. 592.32 s [algebraic-graphs]
  20706. 592.32 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  20707. 592.32 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20708. 592.32 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20709. 592.32 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20710. 592.32 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20711. 592.32 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20712. 592.32 s [algebraic-graphs]
  20713. 592.32 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  20714. 592.32 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20715. 592.32 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20716. 592.32 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20717. 592.32 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20718. 592.32 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20719. 592.32 s [algebraic-graphs]
  20720. 592.32 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  20721. 592.32 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20722. 592.32 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20723. 592.32 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20724. 592.32 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20725. 592.32 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20726. 592.32 s [algebraic-graphs]
  20727. 592.32 s [algebraic-graphs] ============ Relation.induceJust ============
  20728. 592.32 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20729. 592.32 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20730. 592.32 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20731. 592.32 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20732. 592.32 s [algebraic-graphs]
  20733. 592.32 s [algebraic-graphs] ============ ReflexiveRelation ============
  20734. 592.32 s [algebraic-graphs] OK: Axioms of reflexive graphs
  20735. 592.32 s [algebraic-graphs]
  20736. 592.32 s [algebraic-graphs] ============ TransitiveRelation ============
  20737. 592.32 s [algebraic-graphs] OK: Axioms of transitive graphs
  20738. 592.32 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  20739. 592.32 s [algebraic-graphs]
  20740. 592.32 s [algebraic-graphs] ============ PreorderRelation ============
  20741. 592.32 s [algebraic-graphs] OK: Axioms of preorder graphs
  20742. 592.32 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  20743. 592.32 s [algebraic-graphs]
  20744. 592.32 s [algebraic-graphs] ============ Symmetric.Relation ============
  20745. 592.32 s [algebraic-graphs] OK: Axioms of undirected graphs
  20746. 592.32 s [algebraic-graphs]
  20747. 592.32 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  20748. 592.32 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20749. 592.32 s [algebraic-graphs]
  20750. 592.32 s [algebraic-graphs] OK: consistent empty == True
  20751. 592.32 s [algebraic-graphs] OK: consistent (vertex x) == True
  20752. 592.32 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20753. 592.32 s [algebraic-graphs] OK: consistent (connect x y) == True
  20754. 592.32 s [algebraic-graphs] OK: consistent (edge x y) == True
  20755. 592.32 s [algebraic-graphs] OK: consistent (edges xs) == True
  20756. 592.32 s [algebraic-graphs] OK: consistent (stars xs) == True
  20757. 592.32 s [algebraic-graphs]
  20758. 592.32 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  20759. 592.32 s [algebraic-graphs] OK: show (empty ) == "empty"
  20760. 592.32 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20761. 592.32 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20762. 592.32 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20763. 592.32 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20764. 592.32 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20765. 592.32 s [algebraic-graphs]
  20766. 592.32 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20767. 592.32 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20768. 592.32 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20769. 592.32 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20770. 592.32 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20771. 592.32 s [algebraic-graphs]
  20772. 592.32 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  20773. 592.32 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  20774. 592.32 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  20775. 592.32 s [algebraic-graphs]
  20776. 592.32 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  20777. 592.32 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  20778. 592.32 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  20779. 592.32 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  20780. 592.32 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  20781. 592.32 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  20782. 592.32 s [algebraic-graphs]
  20783. 592.32 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  20784. 592.32 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  20785. 592.32 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  20786. 592.32 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  20787. 592.32 s [algebraic-graphs]
  20788. 592.32 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  20789. 592.32 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20790. 592.32 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20791. 592.32 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20792. 592.32 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20793. 592.32 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20794. 592.32 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  20795. 592.32 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  20796. 592.32 s [algebraic-graphs] OK: x <= x + y
  20797. 592.32 s [algebraic-graphs] OK: x + y <= x * y
  20798. 592.32 s [algebraic-graphs]
  20799. 592.32 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  20800. 592.32 s [algebraic-graphs] OK: isEmpty empty == True
  20801. 592.32 s [algebraic-graphs] OK: hasVertex x empty == False
  20802. 592.32 s [algebraic-graphs] OK: vertexCount empty == 0
  20803. 592.32 s [algebraic-graphs] OK: edgeCount empty == 0
  20804. 592.32 s [algebraic-graphs]
  20805. 592.32 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  20806. 592.32 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20807. 592.32 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20808. 592.32 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20809. 592.32 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20810. 592.32 s [algebraic-graphs]
  20811. 592.32 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  20812. 592.32 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20813. 592.33 s [algebraic-graphs] OK: edge x y == edge y x
  20814. 592.33 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  20815. 592.33 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20816. 592.33 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20817. 592.33 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20818. 592.33 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20819. 592.33 s [algebraic-graphs]
  20820. 592.33 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  20821. 592.33 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20822. 592.33 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20823. 592.33 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20824. 592.33 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20825. 592.33 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20826. 592.33 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20827. 592.33 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20828. 592.33 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20829. 592.33 s [algebraic-graphs]
  20830. 592.33 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  20831. 592.33 s [algebraic-graphs] OK: connect x y == connect y x
  20832. 592.33 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20833. 592.33 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20834. 592.33 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20835. 592.33 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20836. 592.33 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20837. 592.33 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20838. 592.33 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  20839. 592.33 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20840. 592.33 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20841. 592.33 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20842. 592.33 s [algebraic-graphs]
  20843. 592.33 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  20844. 592.33 s [algebraic-graphs] OK: vertices [] == empty
  20845. 592.33 s [algebraic-graphs] OK: vertices [x] == vertex x
  20846. 592.33 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20847. 592.33 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20848. 592.33 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20849. 592.33 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20850. 592.33 s [algebraic-graphs]
  20851. 592.33 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  20852. 592.33 s [algebraic-graphs] OK: edges [] == empty
  20853. 592.33 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20854. 592.33 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  20855. 592.33 s [algebraic-graphs]
  20856. 592.33 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  20857. 592.33 s [algebraic-graphs] OK: overlays [] == empty
  20858. 612.85 s [algebraic-graphs] OK: overlays [x] == x
  20859. 612.89 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20860. 612.89 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20861. 612.89 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20862. 612.89 s [algebraic-graphs]
  20863. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  20864. 612.89 s [algebraic-graphs] OK: connects [] == empty
  20865. 612.89 s [algebraic-graphs] OK: connects [x] == x
  20866. 612.89 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20867. 612.89 s [algebraic-graphs] OK: connects == foldr connect empty
  20868. 612.89 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20869. 612.89 s [algebraic-graphs] OK: connects == connects . reverse
  20870. 612.89 s [algebraic-graphs]
  20871. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  20872. 612.89 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20873. 612.89 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20874. 612.89 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20875. 612.89 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20876. 612.89 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20877. 612.89 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20878. 612.89 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  20879. 612.89 s [algebraic-graphs]
  20880. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  20881. 612.89 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20882. 612.89 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20883. 612.89 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20884. 612.89 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20885. 612.89 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20886. 612.89 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20887. 612.89 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20888. 612.89 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20889. 612.89 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20890. 612.89 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20891. 612.89 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20892. 612.89 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20893. 612.89 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20894. 612.89 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20895. 612.89 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20896. 612.89 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20897. 612.89 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20898. 612.89 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20899. 612.89 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20900. 612.89 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20901. 612.89 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20902. 612.89 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20903. 612.89 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20904. 612.89 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20905. 612.89 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20906. 612.89 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20907. 612.89 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20908. 612.89 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20909. 612.89 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20910. 612.89 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20911. 612.89 s [algebraic-graphs]
  20912. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  20913. 612.89 s [algebraic-graphs] OK: isEmpty empty == True
  20914. 612.89 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20915. 612.89 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20916. 612.89 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20917. 612.89 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20918. 612.89 s [algebraic-graphs]
  20919. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  20920. 612.89 s [algebraic-graphs] OK: hasVertex x empty == False
  20921. 612.89 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20922. 612.89 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20923. 612.89 s [algebraic-graphs]
  20924. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  20925. 612.89 s [algebraic-graphs] OK: hasEdge x y empty == False
  20926. 612.89 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20927. 612.89 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20928. 612.89 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  20929. 612.89 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20930. 612.89 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  20931. 612.89 s [algebraic-graphs]
  20932. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  20933. 612.89 s [algebraic-graphs] OK: vertexCount empty == 0
  20934. 612.89 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20935. 612.89 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20936. 612.89 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20937. 612.89 s [algebraic-graphs]
  20938. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  20939. 612.89 s [algebraic-graphs] OK: edgeCount empty == 0
  20940. 612.89 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20941. 612.89 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20942. 612.89 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20943. 612.89 s [algebraic-graphs]
  20944. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  20945. 612.89 s [algebraic-graphs] OK: vertexList empty == []
  20946. 612.89 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20947. 612.89 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20948. 612.89 s [algebraic-graphs]
  20949. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  20950. 612.89 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20951. 612.89 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20952. 612.89 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20953. 612.89 s [algebraic-graphs]
  20954. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  20955. 612.89 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20956. 612.89 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20957. 612.89 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20958. 612.89 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20959. 612.89 s [algebraic-graphs]
  20960. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  20961. 612.89 s [algebraic-graphs] OK: edgeList empty == []
  20962. 612.89 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20963. 612.89 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  20964. 612.89 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  20965. 612.89 s [algebraic-graphs]
  20966. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  20967. 612.89 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20968. 612.89 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20969. 612.89 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  20970. 612.89 s [algebraic-graphs]
  20971. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  20972. 612.89 s [algebraic-graphs] OK: adjacencyList empty == []
  20973. 612.89 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20974. 612.89 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  20975. 612.89 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  20976. 612.89 s [algebraic-graphs]
  20977. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  20978. 612.89 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  20979. 612.89 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  20980. 612.89 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  20981. 612.89 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  20982. 612.89 s [algebraic-graphs]
  20983. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  20984. 612.89 s [algebraic-graphs] OK: path [] == empty
  20985. 612.89 s [algebraic-graphs] OK: path [x] == vertex x
  20986. 612.89 s [algebraic-graphs] OK: path [x,y] == edge x y
  20987. 612.89 s [algebraic-graphs] OK: path == path . reverse
  20988. 612.89 s [algebraic-graphs]
  20989. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  20990. 612.89 s [algebraic-graphs] OK: circuit [] == empty
  20991. 612.89 s [algebraic-graphs] OK: circuit [x] == edge x x
  20992. 612.89 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20993. 612.89 s [algebraic-graphs] OK: circuit == circuit . reverse
  20994. 612.89 s [algebraic-graphs]
  20995. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  20996. 612.89 s [algebraic-graphs] OK: clique [] == empty
  20997. 612.89 s [algebraic-graphs] OK: clique [x] == vertex x
  20998. 612.89 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20999. 612.89 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21000. 612.89 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21001. 612.89 s [algebraic-graphs] OK: clique == clique . reverse
  21002. 612.89 s [algebraic-graphs]
  21003. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  21004. 612.89 s [algebraic-graphs] OK: biclique [] [] == empty
  21005. 612.89 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21006. 612.89 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21007. 612.89 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21008. 612.89 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21009. 612.89 s [algebraic-graphs]
  21010. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  21011. 612.89 s [algebraic-graphs] OK: star x [] == vertex x
  21012. 612.89 s [algebraic-graphs] OK: star x [y] == edge x y
  21013. 612.89 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21014. 612.89 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21015. 612.89 s [algebraic-graphs]
  21016. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  21017. 612.89 s [algebraic-graphs] OK: stars [] == empty
  21018. 612.89 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21019. 612.89 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21020. 612.89 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21021. 612.89 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21022. 612.89 s [algebraic-graphs] OK: stars . adjacencyList == id
  21023. 612.89 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21024. 612.89 s [algebraic-graphs]
  21025. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  21026. 612.89 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21027. 612.89 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21028. 612.89 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21029. 612.89 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21030. 612.89 s [algebraic-graphs]
  21031. 612.89 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  21032. 612.89 s [algebraic-graphs] OK: forest [] == empty
  21033. 621.31 s [algebraic-graphs] OK: forest [x] == tree x
  21034. 621.31 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21035. 621.35 s [algebraic-graphs] OK: forest == overlays . map tree
  21036. 621.35 s [algebraic-graphs]
  21037. 621.35 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  21038. 621.35 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21039. 621.35 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21040. 621.35 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21041. 621.35 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21042. 621.35 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21043. 621.35 s [algebraic-graphs]
  21044. 621.35 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  21045. 621.35 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21046. 621.35 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21047. 621.35 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21048. 621.35 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21049. 621.35 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21050. 621.35 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  21051. 621.35 s [algebraic-graphs]
  21052. 621.35 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  21053. 621.35 s [algebraic-graphs] OK: replaceVertex x x == id
  21054. 621.35 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21055. 621.35 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21056. 621.35 s [algebraic-graphs]
  21057. 621.35 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  21058. 621.35 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21059. 621.35 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21060. 621.35 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21061. 621.35 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21062. 621.35 s [algebraic-graphs]
  21063. 621.35 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  21064. 621.35 s [algebraic-graphs] OK: gmap f empty == empty
  21065. 621.35 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21066. 621.35 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21067. 621.35 s [algebraic-graphs] OK: gmap id == id
  21068. 621.35 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21069. 621.35 s [algebraic-graphs]
  21070. 621.35 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  21071. 621.35 s [algebraic-graphs] OK: induce (const True ) x == x
  21072. 621.35 s [algebraic-graphs] OK: induce (const False) x == empty
  21073. 621.35 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21074. 621.35 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21075. 621.35 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21076. 621.35 s [algebraic-graphs]
  21077. 621.35 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  21078. 621.35 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21079. 621.35 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21080. 621.35 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21081. 621.35 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21082. 621.35 s [algebraic-graphs]
  21083. 621.35 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  21084. 621.35 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  21085. 621.35 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  21086. 621.35 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  21087. 621.35 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  21088. 621.35 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  21089. 621.35 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  21090. 621.35 s [algebraic-graphs]
  21091. 621.35 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  21092. 621.35 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  21093. 621.35 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  21094. 621.35 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  21095. 621.35 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  21096. 621.35 s [algebraic-graphs]
  21097. 621.35 s [algebraic-graphs] ============ Typed ============
  21098. 621.35 s [algebraic-graphs]
  21099. 621.35 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  21100. 621.35 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  21101. 621.35 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  21102. 621.35 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  21103. 621.35 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  21104. 621.35 s [algebraic-graphs]
  21105. 621.35 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  21106. 621.35 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  21107. 621.35 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  21108. 621.35 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  21109. 621.35 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  21110. 621.35 s [algebraic-graphs]
  21111. 621.35 s [algebraic-graphs] ============ Typed.dfsForest ============
  21112. 621.35 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  21113. 621.35 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  21114. 621.35 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  21115. 621.35 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  21116. 621.35 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  21117. 621.35 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  21118. 621.35 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  21119. 621.35 s [algebraic-graphs]
  21120. 621.35 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  21121. 621.35 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  21122. 621.35 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  21123. 621.35 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  21124. 621.35 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  21125. 621.35 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  21126. 621.35 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  21127. 621.35 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  21128. 621.35 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  21129. 621.35 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  21130. 621.35 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  21131. 621.35 s [algebraic-graphs]
  21132. 621.35 s [algebraic-graphs] ============ Typed.dfs ============
  21133. 621.35 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  21134. 621.35 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  21135. 621.35 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  21136. 621.35 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  21137. 621.35 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  21138. 621.35 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  21139. 621.35 s [algebraic-graphs] OK: dfs % x $ [] == []
  21140. 621.35 s [algebraic-graphs]
  21141. 621.35 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  21142. 621.35 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  21143. 621.35 s [algebraic-graphs]
  21144. 621.35 s [algebraic-graphs] ============ Typed.topSort ============
  21145. 621.35 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  21146. 621.35 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  21147. 621.35 s [algebraic-graphs]
  21148. 621.35 s [algebraic-graphs] ============ Graph.Undirected ============
  21149. 621.35 s [algebraic-graphs] OK: Axioms of undirected graphs
  21150. 621.36 s [algebraic-graphs]
  21151. 621.36 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  21152. 621.36 s [algebraic-graphs] OK: show (empty ) == "empty"
  21153. 621.36 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  21154. 621.36 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  21155. 621.36 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  21156. 621.36 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  21157. 621.36 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  21158. 621.36 s [algebraic-graphs]
  21159. 621.36 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  21160. 621.36 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  21161. 621.36 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  21162. 621.36 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  21163. 621.36 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  21164. 621.36 s [algebraic-graphs]
  21165. 621.36 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  21166. 621.36 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  21167. 621.36 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  21168. 621.36 s [algebraic-graphs]
  21169. 621.36 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  21170. 621.36 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  21171. 621.36 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  21172. 621.36 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  21173. 621.36 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  21174. 621.36 s [algebraic-graphs]
  21175. 621.36 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  21176. 621.36 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  21177. 621.36 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  21178. 621.36 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  21179. 621.36 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  21180. 621.36 s [algebraic-graphs]
  21181. 621.36 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  21182. 621.36 s [algebraic-graphs] OK: complement empty == empty
  21183. 621.36 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  21184. 621.36 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  21185. 621.36 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  21186. 621.36 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  21187. 621.36 s [algebraic-graphs] OK: complement . complement == id
  21188. 621.36 s [algebraic-graphs]
  21189. 621.36 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  21190. 621.36 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21191. 621.36 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21192. 621.36 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21193. 621.36 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21194. 621.36 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21195. 621.36 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  21196. 621.36 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  21197. 621.36 s [algebraic-graphs] OK: x <= x + y
  21198. 621.36 s [algebraic-graphs] OK: x + y <= x * y
  21199. 621.36 s [algebraic-graphs]
  21200. 621.36 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  21201. 621.36 s [algebraic-graphs] OK: isEmpty empty == True
  21202. 621.36 s [algebraic-graphs] OK: hasVertex x empty == False
  21203. 621.36 s [algebraic-graphs] OK: vertexCount empty == 0
  21204. 621.36 s [algebraic-graphs] OK: edgeCount empty == 0
  21205. 621.36 s [algebraic-graphs]
  21206. 621.36 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  21207. 621.36 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21208. 621.36 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21209. 621.36 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21210. 621.36 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21211. 621.36 s [algebraic-graphs]
  21212. 621.36 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  21213. 621.36 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21214. 621.36 s [algebraic-graphs] OK: edge x y == edge y x
  21215. 631.21 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  21216. 631.21 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21217. 631.21 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21218. 631.25 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21219. 631.25 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21220. 631.25 s [algebraic-graphs]
  21221. 631.25 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  21222. 631.25 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21223. 631.25 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21224. 631.25 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21225. 631.25 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21226. 631.25 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21227. 631.25 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21228. 631.25 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21229. 631.25 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21230. 631.25 s [algebraic-graphs]
  21231. 631.25 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  21232. 631.25 s [algebraic-graphs] OK: connect x y == connect y x
  21233. 631.25 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21234. 631.25 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21235. 631.25 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21236. 631.25 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21237. 631.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21238. 631.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21239. 631.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  21240. 631.25 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21241. 631.25 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21242. 631.25 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21243. 631.25 s [algebraic-graphs]
  21244. 631.25 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  21245. 631.25 s [algebraic-graphs] OK: vertices [] == empty
  21246. 631.25 s [algebraic-graphs] OK: vertices [x] == vertex x
  21247. 631.25 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21248. 631.25 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21249. 631.25 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21250. 631.25 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21251. 631.25 s [algebraic-graphs]
  21252. 631.25 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  21253. 631.25 s [algebraic-graphs] OK: edges [] == empty
  21254. 631.25 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21255. 631.25 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  21256. 631.25 s [algebraic-graphs]
  21257. 631.25 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  21258. 631.25 s [algebraic-graphs] OK: overlays [] == empty
  21259. 631.25 s [algebraic-graphs] OK: overlays [x] == x
  21260. 631.25 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21261. 631.25 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21262. 631.25 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21263. 631.25 s [algebraic-graphs]
  21264. 631.25 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  21265. 631.25 s [algebraic-graphs] OK: connects [] == empty
  21266. 631.25 s [algebraic-graphs] OK: connects [x] == x
  21267. 631.25 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21268. 631.25 s [algebraic-graphs] OK: connects == foldr connect empty
  21269. 631.25 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21270. 631.25 s [algebraic-graphs] OK: connects == connects . reverse
  21271. 631.25 s [algebraic-graphs]
  21272. 631.25 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  21273. 631.25 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21274. 631.25 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21275. 631.25 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21276. 631.25 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21277. 631.25 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21278. 631.25 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21279. 631.25 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  21280. 631.25 s [algebraic-graphs]
  21281. 631.25 s [algebraic-graphs] ============ Graph.Undirected.path ============
  21282. 631.25 s [algebraic-graphs] OK: path [] == empty
  21283. 631.25 s [algebraic-graphs] OK: path [x] == vertex x
  21284. 631.25 s [algebraic-graphs] OK: path [x,y] == edge x y
  21285. 631.25 s [algebraic-graphs] OK: path == path . reverse
  21286. 631.25 s [algebraic-graphs]
  21287. 631.25 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  21288. 631.25 s [algebraic-graphs] OK: circuit [] == empty
  21289. 631.25 s [algebraic-graphs] OK: circuit [x] == edge x x
  21290. 631.25 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21291. 631.25 s [algebraic-graphs] OK: circuit == circuit . reverse
  21292. 631.25 s [algebraic-graphs]
  21293. 631.25 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  21294. 631.25 s [algebraic-graphs] OK: clique [] == empty
  21295. 631.25 s [algebraic-graphs] OK: clique [x] == vertex x
  21296. 631.25 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21297. 631.25 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21298. 631.25 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21299. 631.25 s [algebraic-graphs] OK: clique == clique . reverse
  21300. 631.25 s [algebraic-graphs]
  21301. 631.25 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  21302. 631.25 s [algebraic-graphs] OK: biclique [] [] == empty
  21303. 631.25 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21304. 631.25 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21305. 631.25 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21306. 631.25 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21307. 631.25 s [algebraic-graphs]
  21308. 631.25 s [algebraic-graphs] ============ Graph.Undirected.star ============
  21309. 631.25 s [algebraic-graphs] OK: star x [] == vertex x
  21310. 631.25 s [algebraic-graphs] OK: star x [y] == edge x y
  21311. 631.25 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21312. 631.25 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21313. 631.25 s [algebraic-graphs]
  21314. 631.25 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  21315. 631.25 s [algebraic-graphs] OK: stars [] == empty
  21316. 631.25 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21317. 631.25 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21318. 631.25 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21319. 631.25 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21320. 631.25 s [algebraic-graphs] OK: stars . adjacencyList == id
  21321. 631.25 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21322. 631.25 s [algebraic-graphs]
  21323. 631.25 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  21324. 631.25 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21325. 631.25 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21326. 631.25 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21327. 631.25 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21328. 631.25 s [algebraic-graphs]
  21329. 631.25 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  21330. 631.25 s [algebraic-graphs] OK: forest [] == empty
  21331. 631.25 s [algebraic-graphs] OK: forest [x] == tree x
  21332. 631.25 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21333. 631.25 s [algebraic-graphs] OK: forest == overlays . map tree
  21334. 631.25 s [algebraic-graphs]
  21335. 631.25 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  21336. 631.25 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21337. 631.25 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21338. 631.25 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21339. 631.25 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21340. 631.25 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21341. 631.25 s [algebraic-graphs]
  21342. 631.25 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  21343. 631.25 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21344. 631.25 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21345. 631.25 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21346. 631.25 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21347. 631.25 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21348. 631.25 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  21349. 631.25 s [algebraic-graphs]
  21350. 631.25 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  21351. 631.25 s [algebraic-graphs] OK: replaceVertex x x == id
  21352. 631.25 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21353. 631.25 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21354. 631.25 s [algebraic-graphs]
  21355. 631.25 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  21356. 631.25 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21357. 631.25 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21358. 631.25 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21359. 631.25 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21360. 631.25 s [algebraic-graphs]
  21361. 631.25 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  21362. 631.25 s [algebraic-graphs] OK: gmap f empty == empty
  21363. 631.25 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21364. 631.25 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21365. 631.25 s [algebraic-graphs] OK: gmap id == id
  21366. 631.25 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21367. 631.25 s [algebraic-graphs]
  21368. 631.25 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  21369. 631.25 s [algebraic-graphs] OK: induce (const True ) x == x
  21370. 631.25 s [algebraic-graphs] OK: induce (const False) x == empty
  21371. 631.25 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21372. 631.25 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21373. 631.25 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21374. 631.25 s [algebraic-graphs]
  21375. 631.25 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  21376. 631.25 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21377. 631.25 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21378. 631.25 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21379. 631.25 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21380. 631.25 s [algebraic-graphs] Test suite main: PASS
  21381. 631.25 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  21382. 631.25 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  21383. 631.25 s [algebraic-graphs] checkPhase completed in 2 minutes 28 seconds
  21384. 631.25 s [algebraic-graphs] Phase: haddockPhase
  21385. 631.36 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  21386. 631.36 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7...
  21387. 631.53 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
  21388. 631.98 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
  21389. 632.10 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
  21390. 632.27 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
  21391. 632.31 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
  21392. 632.50 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
  21393. 632.55 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
  21394. 632.82 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
  21395. 632.93 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
  21396. 633.26 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
  21397. 633.37 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
  21398. 633.56 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  21399. 633.56 s [algebraic-graphs] In the use of ‘head’
  21400. 633.56 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21401. 633.56 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  21402. 633.56 s [algebraic-graphs] |
  21403. 633.56 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  21404. 633.56 s [algebraic-graphs] | ^^^^
  21405. 633.56 s [algebraic-graphs]
  21406. 633.56 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  21407. 633.56 s [algebraic-graphs] In the use of ‘tail’
  21408. 633.56 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21409. 633.56 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  21410. 633.56 s [algebraic-graphs] |
  21411. 633.56 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  21412. 633.56 s [algebraic-graphs] | ^^^^
  21413. 633.56 s [algebraic-graphs]
  21414. 633.56 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  21415. 633.56 s [algebraic-graphs] In the use of ‘head’
  21416. 633.56 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21417. 633.56 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  21418. 633.57 s [algebraic-graphs] |
  21419. 633.57 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  21420. 633.57 s [algebraic-graphs] | ^^^^
  21421. 633.57 s [algebraic-graphs]
  21422. 633.57 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  21423. 633.57 s [algebraic-graphs] In the use of ‘tail’
  21424. 633.57 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21425. 633.57 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  21426. 633.57 s [algebraic-graphs] |
  21427. 633.57 s [algebraic-graphs] 397 | bnd' = tail bnd
  21428. 633.57 s [algebraic-graphs] | ^^^^
  21429. 633.57 s [algebraic-graphs]
  21430. 633.57 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
  21431. 633.71 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
  21432. 633.82 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21433. 633.82 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21434. 633.82 s [algebraic-graphs] will become an error in a future GHC release.
  21435. 633.82 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21436. 633.82 s [algebraic-graphs] |
  21437. 633.83 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  21438. 633.83 s [algebraic-graphs] | ^
  21439. 633.83 s [algebraic-graphs]
  21440. 633.83 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21441. 633.83 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21442. 633.83 s [algebraic-graphs] will become an error in a future GHC release.
  21443. 633.83 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21444. 633.83 s [algebraic-graphs] |
  21445. 633.83 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  21446. 633.83 s [algebraic-graphs] | ^
  21447. 633.83 s [algebraic-graphs]
  21448. 633.83 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21449. 633.83 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21450. 633.83 s [algebraic-graphs] will become an error in a future GHC release.
  21451. 633.83 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21452. 633.83 s [algebraic-graphs] |
  21453. 633.83 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  21454. 633.83 s [algebraic-graphs] | ^
  21455. 633.83 s [algebraic-graphs]
  21456. 633.84 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21457. 633.84 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21458. 633.84 s [algebraic-graphs] will become an error in a future GHC release.
  21459. 633.84 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21460. 633.84 s [algebraic-graphs] |
  21461. 633.84 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  21462. 633.84 s [algebraic-graphs] | ^
  21463. 633.84 s [algebraic-graphs]
  21464. 633.84 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21465. 633.84 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21466. 633.84 s [algebraic-graphs] will become an error in a future GHC release.
  21467. 633.84 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21468. 633.84 s [algebraic-graphs] |
  21469. 633.84 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  21470. 633.84 s [algebraic-graphs] | ^
  21471. 633.84 s [algebraic-graphs]
  21472. 633.84 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21473. 633.84 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21474. 633.84 s [algebraic-graphs] will become an error in a future GHC release.
  21475. 633.84 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21476. 633.84 s [algebraic-graphs] |
  21477. 633.84 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  21478. 633.84 s [algebraic-graphs] | ^
  21479. 633.84 s [algebraic-graphs]
  21480. 633.84 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21481. 633.84 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21482. 633.84 s [algebraic-graphs] will become an error in a future GHC release.
  21483. 633.84 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21484. 633.84 s [algebraic-graphs] |
  21485. 633.84 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  21486. 633.84 s [algebraic-graphs] | ^
  21487. 633.84 s [algebraic-graphs]
  21488. 633.85 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
  21489. 633.99 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
  21490. 634.09 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
  21491. 634.42 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
  21492. 634.59 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
  21493. 634.78 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
  21494. 634.79 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
  21495. 634.82 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
  21496. 634.94 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21497. 634.94 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21498. 634.94 s [algebraic-graphs] will become an error in a future GHC release.
  21499. 634.94 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21500. 634.94 s [algebraic-graphs] |
  21501. 634.94 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  21502. 634.94 s [algebraic-graphs] | ^
  21503. 634.94 s [algebraic-graphs]
  21504. 634.94 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
  21505. 634.97 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21506. 634.97 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21507. 634.97 s [algebraic-graphs] will become an error in a future GHC release.
  21508. 634.97 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21509. 634.97 s [algebraic-graphs] |
  21510. 634.97 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  21511. 634.97 s [algebraic-graphs] | ^
  21512. 634.97 s [algebraic-graphs]
  21513. 634.97 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21514. 634.97 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21515. 634.97 s [algebraic-graphs] will become an error in a future GHC release.
  21516. 634.97 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21517. 634.97 s [algebraic-graphs] |
  21518. 634.97 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  21519. 634.97 s [algebraic-graphs] | ^
  21520. 634.97 s [algebraic-graphs]
  21521. 634.97 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
  21522. 635.11 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
  21523. 635.21 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
  21524. 635.23 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
  21525. 635.25 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
  21526. 635.27 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
  21527. 635.29 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
  21528. 635.32 s [algebraic-graphs] Haddock coverage:
  21529. 635.33 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21530. 635.33 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21531. 635.33 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21532. 635.33 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21533. 635.33 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21534. 635.33 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21535. 635.33 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21536. 635.35 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  21537. 635.35 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21538. 635.35 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  21539. 635.35 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  21540. 635.35 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21541. 635.35 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21542. 635.35 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21543. 635.35 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  21544. 635.37 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  21545. 635.38 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21546. 635.38 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21547. 635.38 s [algebraic-graphs] Warning: 'sort' is out of scope.
  21548. 635.38 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21549. 635.38 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  21550. 635.38 s [algebraic-graphs] Missing documentation for:
  21551. 635.38 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  21552. 635.38 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  21553. 635.38 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  21554. 635.38 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  21555. 635.38 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21556. 635.38 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21557. 635.38 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  21558. 635.38 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  21559. 635.38 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21560. 635.38 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  21561. 635.38 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  21562. 635.38 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  21563. 635.38 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  21564. 635.38 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21565. 635.38 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21566. 635.38 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  21567. 635.40 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21568. 635.40 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  21569. 635.40 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21570. 635.40 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21571. 635.40 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21572. 635.40 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  21573. 635.42 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  21574. 635.42 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  21575. 635.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21576. 635.42 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  21577. 635.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21578. 635.42 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  21579. 635.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21580. 635.42 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  21581. 635.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21582. 635.42 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  21583. 635.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21584. 635.42 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  21585. 635.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21586. 635.42 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  21587. 635.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21588. 635.43 s [algebraic-graphs] Warning: 'box' is out of scope.
  21589. 635.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21590. 635.43 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  21591. 635.43 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21592. 635.43 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  21593. 635.44 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21594. 635.44 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21595. 635.44 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21596. 635.44 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21597. 635.44 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21598. 635.44 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21599. 635.44 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21600. 635.44 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21601. 635.44 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21602. 635.45 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  21603. 635.45 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  21604. 635.45 s [algebraic-graphs] * in ‘GHC.Internal.Data.Tuple’
  21605. 635.45 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21606. 635.45 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21607. 635.45 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  21608. 635.46 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  21609. 635.47 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  21610. 635.47 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21611. 635.47 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  21612. 635.47 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  21613. 635.47 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  21614. 635.47 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21615. 635.47 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21616. 635.47 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  21617. 635.47 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21618. 635.47 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21619. 635.47 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21620. 635.47 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21621. 635.47 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21622. 635.47 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21623. 635.47 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  21624. 635.47 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  21625. 635.47 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  21626. 635.47 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  21627. 635.47 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21628. 635.47 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21629. 635.47 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  21630. 635.48 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  21631. 635.48 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  21632. 635.48 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  21633. 635.48 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21634. 635.48 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21635. 635.48 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  21636. 635.48 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  21637. 635.48 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  21638. 635.48 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  21639. 635.48 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21640. 635.48 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21641. 635.48 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  21642. 635.48 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  21643. 635.48 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  21644. 635.48 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  21645. 635.48 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21646. 635.48 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21647. 635.48 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  21648. 635.48 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  21649. 635.48 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  21650. 635.48 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  21651. 635.48 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21652. 635.48 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21653. 635.48 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  21654. 635.48 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  21655. 635.48 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  21656. 635.48 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  21657. 635.49 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  21658. 635.49 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21659. 635.49 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21660. 635.49 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  21661. 635.49 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  21662. 635.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21663. 635.49 s [algebraic-graphs] Warning: 'empty' is out of scope.
  21664. 635.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21665. 635.49 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  21666. 635.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21667. 635.49 s [algebraic-graphs] Warning: 'edges' is out of scope.
  21668. 635.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21669. 635.49 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  21670. 635.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21671. 635.50 s [algebraic-graphs] Warning: 'stars' is out of scope.
  21672. 635.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21673. 635.50 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  21674. 635.60 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21675. 635.60 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21676. 635.60 s [algebraic-graphs] Warning: 'sort' is out of scope.
  21677. 635.60 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21678. 635.60 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21679. 635.60 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21680. 635.60 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  21681. 635.60 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21682. 635.60 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21683. 635.60 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  21684. 635.60 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  21685. 635.60 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  21686. 635.60 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  21687. 635.60 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21688. 635.60 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21689. 635.60 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  21690. 635.60 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  21691. 635.60 s [algebraic-graphs] Missing documentation for:
  21692. 635.60 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  21693. 635.61 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21694. 635.61 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  21695. 635.61 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21696. 635.61 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21697. 635.61 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21698. 635.61 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21699. 635.61 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21700. 635.61 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  21701. 635.61 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21702. 635.61 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21703. 635.61 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21704. 635.61 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21705. 635.61 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  21706. 635.61 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  21707. 635.61 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21708. 635.61 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21709. 635.61 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21710. 635.61 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21711. 635.61 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  21712. 635.61 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  21713. 635.61 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21714. 635.61 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21715. 635.61 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21716. 635.61 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21717. 635.62 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  21718. 635.62 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  21719. 635.62 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21720. 635.62 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21721. 635.62 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21722. 635.62 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21723. 635.62 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  21724. 635.62 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  21725. 635.62 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  21726. 635.62 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  21727. 635.62 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21728. 635.62 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21729. 635.62 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  21730. 635.63 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  21731. 635.63 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  21732. 635.63 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  21733. 635.63 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  21734. 635.63 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21735. 635.63 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21736. 635.63 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  21737. 635.64 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21738. 635.64 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  21739. 635.64 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21740. 635.64 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21741. 635.64 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21742. 635.64 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  21743. 635.65 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  21744. 635.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21745. 635.65 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  21746. 635.66 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  21747. 635.66 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  21748. 635.66 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  21749. 635.66 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21750. 635.66 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21751. 635.66 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  21752. 635.66 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  21753. 635.66 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  21754. 635.66 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  21755. 635.66 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21756. 635.66 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21757. 635.66 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  21758. 635.66 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21759. 635.66 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  21760. 635.66 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21761. 635.66 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21762. 635.66 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21763. 635.66 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  21764. 635.67 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  21765. 635.68 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  21766. 635.68 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21767. 635.69 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  21768. 635.69 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21769. 635.69 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  21770. 635.69 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21771. 635.70 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21772. 635.70 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21773. 635.70 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  21774. 635.70 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  21775. 635.70 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  21776. 635.70 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  21777. 635.70 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21778. 635.70 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21779. 635.70 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  21780. 635.70 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  21781. 635.71 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  21782. 635.71 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  21783. 635.71 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  21784. 635.71 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21785. 635.71 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21786. 635.71 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  21787. 635.71 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21788. 635.71 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  21789. 635.71 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21790. 635.71 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21791. 635.71 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21792. 635.71 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  21793. 635.72 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  21794. 635.72 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  21795. 635.72 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  21796. 635.72 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21797. 635.72 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21798. 635.72 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  21799. 635.72 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  21800. 635.72 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  21801. 635.72 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  21802. 635.73 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  21803. 635.73 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  21804. 635.73 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  21805. 635.73 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21806. 635.73 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21807. 635.73 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  21808. 635.73 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  21809. 635.73 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  21810. 635.73 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  21811. 635.73 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  21812. 635.73 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21813. 635.73 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21814. 635.73 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  21815. 635.73 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  21816. 635.73 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21817. 635.73 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  21818. 635.74 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21819. 635.74 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  21820. 635.74 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21821. 635.74 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21822. 635.74 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21823. 635.74 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  21824. 635.75 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  21825. 635.76 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  21826. 635.76 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  21827. 635.76 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  21828. 635.76 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  21829. 635.76 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21830. 635.76 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21831. 635.76 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  21832. 635.76 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  21833. 635.76 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21834. 635.76 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  21835. 635.76 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  21836. 635.76 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  21837. 635.76 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  21838. 635.76 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21839. 635.76 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21840. 635.76 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  21841. 635.76 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  21842. 635.76 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21843. 635.76 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  21844. 635.76 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  21845. 635.76 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  21846. 635.76 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  21847. 635.76 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21848. 635.76 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21849. 635.76 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  21850. 635.76 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  21851. 635.76 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21852. 635.76 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  21853. 635.76 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  21854. 635.76 s [algebraic-graphs] Missing documentation for:
  21855. 635.76 s [algebraic-graphs] Module header
  21856. 635.76 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  21857. 635.76 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  21858. 635.76 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  21859. 635.76 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  21860. 635.76 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  21861. 635.76 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  21862. 635.76 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  21863. 635.76 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  21864. 635.76 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  21865. 635.76 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  21866. 635.76 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21867. 635.76 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21868. 635.76 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  21869. 635.77 s [algebraic-graphs] Warning: 'array' is out of scope.
  21870. 635.77 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21871. 635.77 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  21872. 635.77 s [algebraic-graphs] Missing documentation for:
  21873. 635.77 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  21874. 636.02 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  21875. 636.02 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  21876. 636.03 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  21877. 636.03 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  21878. 636.04 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  21879. 636.04 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  21880. 636.05 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  21881. 636.05 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  21882. 636.05 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  21883. 636.06 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  21884. 636.06 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  21885. 636.07 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  21886. 636.07 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  21887. 636.32 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  21888. 636.32 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  21889. 636.46 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  21890. 636.46 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  21891. 636.46 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  21892. 636.46 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  21893. 642.20 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  21894. 642.20 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  21895. 642.28 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  21896. 642.29 s [algebraic-graphs] Phase: installPhase
  21897. 642.37 s [algebraic-graphs] Installing library in /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  21898. 643.43 s [algebraic-graphs] Phase: fixupPhase
  21899. 643.45 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7
  21900. 643.47 s [algebraic-graphs] shrinking /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSalgebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF-ghc9.10.3.so
  21901. 643.48 s [algebraic-graphs] checking for references to /build/ in /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7...
  21902. 643.52 s [algebraic-graphs] patching script interpreter paths in /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7
  21903. 643.53 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/lib
  21904. 643.80 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc
  21905. 643.82 s [algebraic-graphs] checking for references to /build/ in /nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc...
  21906. 643.85 s [algebraic-graphs] patching script interpreter paths in /nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc
  21907. 644.01 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7
  21908. 644.48 s [algebraic-graphs:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  21909. 644.48 s [algebraic-graphs:post-build]
  21910. 644.84 s [algebraic-graphs:post-build] Pushing /nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc (10.41 MiB)
  21911. 645.03 s [algebraic-graphs:post-build] Pushing /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7 (25.06 MiB)
  21912. 646.29 s [algebraic-graphs:post-build]
  21913. 646.29 s [algebraic-graphs:post-build] All done.
  21914. 646.32 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7
  21915. 646.36 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21916. 646.61 s [algebraic-graphs:post-build] copying 2 paths...
  21917. 646.61 s [algebraic-graphs:post-build] copying path '/nix/store/3xnkngnhvff6qk61xh5s6i5abaiym4hc-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  21918. 647.96 s [algebraic-graphs:post-build] copying path '/nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  21919. 655.05 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21920. 655.32 s [algebraic-graphs:post-build] copying 1 paths...
  21921. 655.36 s [algebraic-graphs:post-build] copying path '/nix/store/wip2nh33hcl5kpqgrwz4lwk1ki34w3y6-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  21922. 655.60 s Progress: 10 of 15 built, 36 of 36 downloaded from cache
  21923. 655.65 s Building /nix/store/27p59dzxgsasnm1l2qgih8lh7w4ly8s6-algebraic-graph-duoids-0.0.1.0.drv
  21924. 655.81 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  21925. 655.82 s [algebraic-graph-duoids] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  21926. 656.06 s [algebraic-graph-duoids] Phase: unpackPhase
  21927. 656.06 s [algebraic-graph-duoids] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./algebraic-graphs
  21928. 656.08 s [algebraic-graph-duoids] source root is algebraic-graphs
  21929. 656.09 s [algebraic-graph-duoids] Phase: patchPhase
  21930. 656.10 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  21931. 656.10 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.lLv1wDhW8G/setup-package.conf.d -threaded
  21932. 656.17 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.lLv1wDhW8G/Main.o )
  21933. 656.22 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  21934. 657.92 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  21935. 657.93 s [algebraic-graph-duoids] Phase: configurePhase
  21936. 658.07 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.lLv1wDhW8G/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/lib
  21937. 658.08 s [algebraic-graph-duoids] Using Parsec parser
  21938. 658.08 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  21939. 658.40 s [algebraic-graph-duoids] Flags chosen: lint=False, noisy-deprecations=True
  21940. 658.83 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.5 && <0.6 || >=0.6.1 && <0.9: using
  21941. 658.83 s [algebraic-graph-duoids] algebraic-graphs-0.7
  21942. 658.83 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  21943. 658.83 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  21944. 658.83 s [algebraic-graph-duoids] <4.23: using base-4.20.2.0
  21945. 658.83 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  21946. 658.83 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  21947. 658.83 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  21948. 658.83 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.5 && <0.6 || >=0.6.1 && <0.9: using
  21949. 658.83 s [algebraic-graph-duoids] algebraic-graphs-0.7
  21950. 658.83 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  21951. 658.83 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  21952. 658.83 s [algebraic-graph-duoids] <4.23: using base-4.20.2.0
  21953. 658.83 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  21954. 658.83 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  21955. 658.83 s [algebraic-graph-duoids] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  21956. 658.83 s [algebraic-graph-duoids] hedgehog-1.5
  21957. 658.83 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  21958. 658.83 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  21959. 658.83 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  21960. 658.83 s [algebraic-graph-duoids] <4.23: using base-4.20.2.0
  21961. 658.83 s [algebraic-graph-duoids] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  21962. 658.83 s [algebraic-graph-duoids] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  21963. 658.83 s [algebraic-graph-duoids] doctest-0.24.2
  21964. 658.83 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  21965. 658.83 s [algebraic-graph-duoids] Source component graph:
  21966. 658.83 s [algebraic-graph-duoids] component lib
  21967. 658.83 s [algebraic-graph-duoids] component test:doctests dependency lib
  21968. 658.83 s [algebraic-graph-duoids] component test:laws dependency lib
  21969. 658.83 s [algebraic-graph-duoids] Configured component graph:
  21970. 658.83 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  21971. 658.83 s [algebraic-graph-duoids] include algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  21972. 658.83 s [algebraic-graph-duoids] include base-4.20.2.0-64da
  21973. 658.83 s [algebraic-graph-duoids] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  21974. 658.83 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  21975. 658.83 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-9AaeaywO6vaWvAoMck7b7-doctests
  21976. 658.83 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  21977. 658.83 s [algebraic-graph-duoids] include base-4.20.2.0-64da
  21978. 658.83 s [algebraic-graph-duoids] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  21979. 658.83 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  21980. 658.83 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-5qIqiLWJtwP1i7RCUjDxOb-laws
  21981. 658.83 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  21982. 658.83 s [algebraic-graph-duoids] include algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  21983. 658.83 s [algebraic-graph-duoids] include base-4.20.2.0-64da
  21984. 658.83 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  21985. 658.83 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  21986. 658.83 s [algebraic-graph-duoids] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  21987. 658.83 s [algebraic-graph-duoids] Linked component graph:
  21988. 658.83 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  21989. 658.83 s [algebraic-graph-duoids] include algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  21990. 658.83 s [algebraic-graph-duoids] include base-4.20.2.0-64da
  21991. 658.83 s [algebraic-graph-duoids] include duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  21992. 658.83 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  21993. 658.83 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0:Algebra.Graph.Duoid.Orphans
  21994. 658.84 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-9AaeaywO6vaWvAoMck7b7-doctests
  21995. 658.84 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  21996. 658.84 s [algebraic-graph-duoids] include base-4.20.2.0-64da
  21997. 658.84 s [algebraic-graph-duoids] include doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  21998. 658.84 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  21999. 658.84 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-5qIqiLWJtwP1i7RCUjDxOb-laws
  22000. 658.84 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22001. 658.84 s [algebraic-graph-duoids] include algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  22002. 658.84 s [algebraic-graph-duoids] include base-4.20.2.0-64da
  22003. 658.84 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  22004. 658.84 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  22005. 658.84 s [algebraic-graph-duoids] include hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  22006. 658.84 s [algebraic-graph-duoids] Ready component graph:
  22007. 658.84 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22008. 658.84 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  22009. 658.84 s [algebraic-graph-duoids] depends base-4.20.2.0-64da
  22010. 658.84 s [algebraic-graph-duoids] depends duoids-0.0.1.0-LeUPMTQm7bXLK0EvZ8xQV4
  22011. 658.84 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  22012. 658.84 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-5qIqiLWJtwP1i7RCUjDxOb-laws
  22013. 658.84 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22014. 658.84 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-k8mmIHA1IL97lIsDqbcaF
  22015. 658.84 s [algebraic-graph-duoids] depends base-4.20.2.0-64da
  22016. 658.84 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-LlVxRHnBv93Ed3XuXoPr27
  22017. 658.84 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  22018. 658.84 s [algebraic-graph-duoids] depends hedgehog-1.5-1a3vYb8J3SX5GiTXBhj1zb
  22019. 658.84 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-9AaeaywO6vaWvAoMck7b7-doctests
  22020. 658.84 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22021. 658.84 s [algebraic-graph-duoids] depends base-4.20.2.0-64da
  22022. 658.84 s [algebraic-graph-duoids] depends doctest-0.24.2-3AlOWcyoxzU25BCXjZNoN8
  22023. 658.84 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-FfVU4e96H6pLj36sPPoZx3
  22024. 658.84 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.10
  22025. 658.84 s [algebraic-graph-duoids] Using compiler: ghc-9.10.3
  22026. 658.84 s [algebraic-graph-duoids] Using install prefix:
  22027. 658.84 s [algebraic-graph-duoids] /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0
  22028. 658.84 s [algebraic-graph-duoids] Executables installed in:
  22029. 658.84 s [algebraic-graph-duoids] /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/bin
  22030. 658.84 s [algebraic-graph-duoids] Libraries installed in:
  22031. 658.84 s [algebraic-graph-duoids] /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22032. 658.84 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  22033. 658.84 s [algebraic-graph-duoids] /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  22034. 658.84 s [algebraic-graph-duoids] Private executables installed in:
  22035. 658.84 s [algebraic-graph-duoids] /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.10.3-05f6/algebraic-graph-duoids-0.0.1.0
  22036. 658.84 s [algebraic-graph-duoids] Data files installed in:
  22037. 658.84 s [algebraic-graph-duoids] /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.10.3-05f6/algebraic-graph-duoids-0.0.1.0
  22038. 658.84 s [algebraic-graph-duoids] Documentation installed in:
  22039. 658.84 s [algebraic-graph-duoids] /nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  22040. 658.84 s [algebraic-graph-duoids] Configuration files installed in:
  22041. 658.84 s [algebraic-graph-duoids] /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/etc
  22042. 658.84 s [algebraic-graph-duoids] No alex found
  22043. 658.84 s [algebraic-graph-duoids] Using ar found on system at:
  22044. 658.84 s [algebraic-graph-duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  22045. 658.84 s [algebraic-graph-duoids] No c2hs found
  22046. 658.84 s [algebraic-graph-duoids] No cpphs found
  22047. 658.84 s [algebraic-graph-duoids] Using doctest version 0.24.2 found on system at:
  22048. 658.84 s [algebraic-graph-duoids] /nix/store/9xdq341h0a92bjkmic50786dys0rvy7s-doctest-0.24.2/bin/doctest
  22049. 658.84 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  22050. 658.84 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  22051. 658.84 s [algebraic-graph-duoids] Using ghc version 9.10.3 found on system at:
  22052. 658.84 s [algebraic-graph-duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  22053. 658.84 s [algebraic-graph-duoids] Using ghc-pkg version 9.10.3 found on system at:
  22054. 658.84 s [algebraic-graph-duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  22055. 658.84 s [algebraic-graph-duoids] No ghcjs found
  22056. 658.84 s [algebraic-graph-duoids] No ghcjs-pkg found
  22057. 658.84 s [algebraic-graph-duoids] No greencard found
  22058. 658.84 s [algebraic-graph-duoids] Using haddock version 2.31.1 found on system at:
  22059. 658.84 s [algebraic-graph-duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  22060. 658.84 s [algebraic-graph-duoids] No happy found
  22061. 658.84 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  22062. 658.84 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  22063. 658.84 s [algebraic-graph-duoids] No hmake found
  22064. 658.84 s [algebraic-graph-duoids] Using hpc version 0.69 found on system at:
  22065. 658.84 s [algebraic-graph-duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  22066. 658.84 s [algebraic-graph-duoids] Using hsc2hs version 0.68.10 found on system at:
  22067. 658.84 s [algebraic-graph-duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  22068. 658.84 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  22069. 658.84 s [algebraic-graph-duoids] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  22070. 658.84 s [algebraic-graph-duoids] No jhc found
  22071. 658.84 s [algebraic-graph-duoids] Using ld found on system at:
  22072. 658.84 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  22073. 658.84 s [algebraic-graph-duoids] No pkg-config found
  22074. 658.84 s [algebraic-graph-duoids] Using runghc version 9.10.3 found on system at:
  22075. 658.84 s [algebraic-graph-duoids] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  22076. 658.84 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  22077. 658.84 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  22078. 658.84 s [algebraic-graph-duoids] Using tar found on system at:
  22079. 658.84 s [algebraic-graph-duoids] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  22080. 658.84 s [algebraic-graph-duoids] No uhc found
  22081. 659.16 s [algebraic-graph-duoids] Phase: buildPhase
  22082. 659.25 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  22083. 659.25 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  22084. 659.43 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 )
  22085. 659.89 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 )
  22086. 661.02 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  22087. 661.80 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 )
  22088. 665.64 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22089. 665.64 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22090. 665.78 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  22091. 666.80 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  22092. 668.10 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22093. 668.10 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22094. 668.22 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 )
  22095. 668.71 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  22096. 669.46 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  22097. 673.33 s [algebraic-graph-duoids] Phase: checkPhase
  22098. 673.59 s [algebraic-graph-duoids] Running 2 test suites...
  22099. 673.59 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  22100. 673.64 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  22101. 673.64 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  22102. 673.64 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  22103. 673.64 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  22104. 673.64 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  22105. 673.64 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  22106. 673.64 s [algebraic-graph-duoids] ✓ 5 succeeded.
  22107. 673.64 s [algebraic-graph-duoids] Test suite laws: PASS
  22108. 673.64 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  22109. 673.64 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  22110. 674.16 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  22111. 674.20 s [algebraic-graph-duoids] NameLib Nothing
  22112. 674.20 s [algebraic-graph-duoids] ----------------------------------------
  22113. 674.21 s [algebraic-graph-duoids] Test suite doctests: PASS
  22114. 674.21 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  22115. 674.21 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  22116. 674.22 s [algebraic-graph-duoids] Phase: haddockPhase
  22117. 674.37 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  22118. 674.37 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  22119. 674.76 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing )
  22120. 675.25 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing )
  22121. 675.37 s [algebraic-graph-duoids] Haddock coverage:
  22122. 675.37 s [algebraic-graph-duoids] 100% ( 5 / 5) in 'Algebra.Graph.Duoid'
  22123. 675.37 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  22124. 685.28 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  22125. 685.28 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  22126. 685.35 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22127. 685.35 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22128. 685.36 s [algebraic-graph-duoids] Phase: installPhase
  22129. 685.47 s [algebraic-graph-duoids] Installing library in /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/algebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0
  22130. 685.75 s [algebraic-graph-duoids] Phase: fixupPhase
  22131. 685.77 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0
  22132. 685.77 s [algebraic-graph-duoids] shrinking /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSalgebraic-graph-duoids-0.0.1.0-1RVI2YWrsfl2tbUi13FxZ0-ghc9.10.3.so
  22133. 685.78 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0...
  22134. 685.80 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0
  22135. 685.81 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/lib
  22136. 685.86 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc
  22137. 685.87 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc...
  22138. 685.89 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc
  22139. 686.03 s [algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0 /nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc
  22140. 686.55 s [algebraic-graph-duoids:post-build] Pushing 2 paths (76 are already present) using zstd to cache sellout ⏳
  22141. 686.55 s [algebraic-graph-duoids:post-build]
  22142. 686.93 s [algebraic-graph-duoids:post-build] Pushing /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0 (1.23 MiB)
  22143. 687.08 s [algebraic-graph-duoids:post-build] Pushing /nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc (540.01 KiB)
  22144. 688.16 s [algebraic-graph-duoids:post-build]
  22145. 688.16 s [algebraic-graph-duoids:post-build] All done.
  22146. 688.18 s [algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0 /nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc
  22147. 688.23 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22148. 688.25 s [algebraic-graph-duoids:post-build] copying 2 paths...
  22149. 688.25 s [algebraic-graph-duoids:post-build] copying path '/nix/store/zvfqv8skw20as4g329naf8icrl1l1may-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  22150. 688.67 s [algebraic-graph-duoids:post-build] copying path '/nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  22151. 689.20 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22152. 689.44 s [algebraic-graph-duoids:post-build] copying 1 paths...
  22153. 689.44 s [algebraic-graph-duoids:post-build] copying path '/nix/store/27p59dzxgsasnm1l2qgih8lh7w4ly8s6-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  22154. 689.71 s Progress: 11 of 15 built, 36 of 36 downloaded from cache
  22155. 689.77 s Building /nix/store/1xihsvk0rgmw0jc33wyimrlylp6ma87b-ghc-9.10.3-with-packages.drv
  22156. 689.83 s [ghc-9.10.3-with-packages] /nix/store/3shlgq6nfak56nbnmad8l0mgbr232an7-duoidal-transformers-0.0.1.0/nix-support:
  22157. 689.83 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22158. 689.83 s [ghc-9.10.3-with-packages] /nix/store/a2rwrpl7czz4iiidrj82c1xppp0pl1d4-duoids-0.0.1.0/nix-support:
  22159. 689.83 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22160. 689.84 s [ghc-9.10.3-with-packages] /nix/store/88z7hh5090x820qgb8wni788p5wm7lyk-duoids-hedgehog-0.0.1.0/nix-support:
  22161. 689.84 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22162. 689.84 s [ghc-9.10.3-with-packages] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/nix-support:
  22163. 689.84 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22164. 689.85 s [ghc-9.10.3-with-packages] /nix/store/gz86ymmv6v8fqvzy474wvm3jzk23gz88-algebraic-graphs-0.7/nix-support:
  22165. 689.85 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22166. 689.85 s [ghc-9.10.3-with-packages] /nix/store/mca4hqdxwyqdqrcn2zi2iivca6yf9qhb-ghc-compat-plugin-0.1.0.1/nix-support:
  22167. 689.85 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22168. 689.85 s [ghc-9.10.3-with-packages] /nix/store/mca4hqdxwyqdqrcn2zi2iivca6yf9qhb-ghc-compat-plugin-0.1.0.1/nix-support:
  22169. 689.85 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22170. 689.85 s [ghc-9.10.3-with-packages] /nix/store/b0lrn2wipwvwzrxxdllwd82g27pa8483-hedgehog-1.5/nix-support:
  22171. 689.85 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22172. 689.86 s [ghc-9.10.3-with-packages] /nix/store/b0lrn2wipwvwzrxxdllwd82g27pa8483-hedgehog-1.5/nix-support:
  22173. 689.86 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22174. 689.86 s [ghc-9.10.3-with-packages] /nix/store/f147jf7r9k02q4r8r58yyy2d0pvni6qp-ansi-terminal-1.1.3/nix-support:
  22175. 689.86 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22176. 689.87 s [ghc-9.10.3-with-packages] /nix/store/f147jf7r9k02q4r8r58yyy2d0pvni6qp-ansi-terminal-1.1.3/nix-support:
  22177. 689.87 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22178. 689.87 s [ghc-9.10.3-with-packages] /nix/store/8zn2w7q66nk2d3l76mbsfgjdbkrxz35f-async-2.2.5/nix-support:
  22179. 689.87 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22180. 689.87 s [ghc-9.10.3-with-packages] /nix/store/8zn2w7q66nk2d3l76mbsfgjdbkrxz35f-async-2.2.5/nix-support:
  22181. 689.87 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22182. 689.87 s [ghc-9.10.3-with-packages] /nix/store/v4kk7n3dr39cglxrb3b3mnq3xhqr9ygq-barbies-2.1.1.0/nix-support:
  22183. 689.87 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22184. 689.88 s [ghc-9.10.3-with-packages] /nix/store/v4kk7n3dr39cglxrb3b3mnq3xhqr9ygq-barbies-2.1.1.0/nix-support:
  22185. 689.88 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22186. 689.88 s [ghc-9.10.3-with-packages] /nix/store/92mmmv96yx7xzbsi8r8c9mnz4hs7b2jg-concurrent-output-1.10.21/nix-support:
  22187. 689.88 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22188. 689.89 s [ghc-9.10.3-with-packages] /nix/store/92mmmv96yx7xzbsi8r8c9mnz4hs7b2jg-concurrent-output-1.10.21/nix-support:
  22189. 689.89 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22190. 689.89 s [ghc-9.10.3-with-packages] /nix/store/6vbk582bi1d1nhhzlxw705s7z7qsbrky-lifted-async-0.10.2.7/nix-support:
  22191. 689.89 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22192. 689.90 s [ghc-9.10.3-with-packages] /nix/store/6vbk582bi1d1nhhzlxw705s7z7qsbrky-lifted-async-0.10.2.7/nix-support:
  22193. 689.90 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22194. 689.90 s [ghc-9.10.3-with-packages] /nix/store/9msj85qq1gvwhcz908sbiilrfrdhq3lp-mmorph-1.2.1/nix-support:
  22195. 689.90 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22196. 689.90 s [ghc-9.10.3-with-packages] /nix/store/9msj85qq1gvwhcz908sbiilrfrdhq3lp-mmorph-1.2.1/nix-support:
  22197. 689.90 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22198. 689.90 s [ghc-9.10.3-with-packages] /nix/store/iillknnvv4x7b9m8853wgpj95fn6k2qf-monad-control-1.0.3.1/nix-support:
  22199. 689.90 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22200. 689.90 s [ghc-9.10.3-with-packages] /nix/store/iillknnvv4x7b9m8853wgpj95fn6k2qf-monad-control-1.0.3.1/nix-support:
  22201. 689.90 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22202. 689.90 s [ghc-9.10.3-with-packages] /nix/store/cfiih3l00fil2vi6fpvjxl1kll55h6j4-pretty-show-1.10/nix-support:
  22203. 689.90 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22204. 689.91 s [ghc-9.10.3-with-packages] /nix/store/cfiih3l00fil2vi6fpvjxl1kll55h6j4-pretty-show-1.10/nix-support:
  22205. 689.91 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22206. 689.91 s [ghc-9.10.3-with-packages] /nix/store/27n162kkviz2zwcsb1xc8hcwc8c9km67-primitive-0.9.1.0/nix-support:
  22207. 689.91 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22208. 689.92 s [ghc-9.10.3-with-packages] /nix/store/27n162kkviz2zwcsb1xc8hcwc8c9km67-primitive-0.9.1.0/nix-support:
  22209. 689.92 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22210. 689.92 s [ghc-9.10.3-with-packages] /nix/store/rsqv6kj134cgiyf311k8950imffs712n-random-1.2.1.3/nix-support:
  22211. 689.92 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22212. 689.92 s [ghc-9.10.3-with-packages] /nix/store/rsqv6kj134cgiyf311k8950imffs712n-random-1.2.1.3/nix-support:
  22213. 689.92 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22214. 689.92 s [ghc-9.10.3-with-packages] /nix/store/9gwczd0aw4yasspbyrggw32lgagp7q9f-resourcet-1.3.0/nix-support:
  22215. 689.92 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22216. 689.93 s [ghc-9.10.3-with-packages] /nix/store/9gwczd0aw4yasspbyrggw32lgagp7q9f-resourcet-1.3.0/nix-support:
  22217. 689.93 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22218. 689.93 s [ghc-9.10.3-with-packages] /nix/store/pfhmc6sgkrxknfzsl1hmnjkhvd0kwbcr-safe-exceptions-0.1.7.4/nix-support:
  22219. 689.93 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22220. 689.93 s [ghc-9.10.3-with-packages] /nix/store/pfhmc6sgkrxknfzsl1hmnjkhvd0kwbcr-safe-exceptions-0.1.7.4/nix-support:
  22221. 689.93 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22222. 689.93 s [ghc-9.10.3-with-packages] /nix/store/wb64jk3cmlv16vk3bxjcj9jd6021zad9-transformers-base-0.4.6/nix-support:
  22223. 689.93 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22224. 689.94 s [ghc-9.10.3-with-packages] /nix/store/wb64jk3cmlv16vk3bxjcj9jd6021zad9-transformers-base-0.4.6/nix-support:
  22225. 689.94 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22226. 689.94 s [ghc-9.10.3-with-packages] /nix/store/zjpkhy93qrkndn8ba1j1bs2270gzx36k-wl-pprint-annotated-0.1.0.1/nix-support:
  22227. 689.94 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22228. 689.94 s [ghc-9.10.3-with-packages] /nix/store/zjpkhy93qrkndn8ba1j1bs2270gzx36k-wl-pprint-annotated-0.1.0.1/nix-support:
  22229. 689.94 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22230. 689.94 s [ghc-9.10.3-with-packages] /nix/store/dn2zldw6k1a7hxqi0fs8n1zdfzfpg1rj-ansi-terminal-types-1.1.3/nix-support:
  22231. 689.94 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22232. 689.94 s [ghc-9.10.3-with-packages] /nix/store/dn2zldw6k1a7hxqi0fs8n1zdfzfpg1rj-ansi-terminal-types-1.1.3/nix-support:
  22233. 689.94 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22234. 689.95 s [ghc-9.10.3-with-packages] /nix/store/r3rsmiyfdiww3xw1jqx6rjz1k1fhzk5i-hashable-1.5.0.0/nix-support:
  22235. 689.95 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22236. 689.95 s [ghc-9.10.3-with-packages] /nix/store/r3rsmiyfdiww3xw1jqx6rjz1k1fhzk5i-hashable-1.5.0.0/nix-support:
  22237. 689.95 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22238. 689.96 s [ghc-9.10.3-with-packages] /nix/store/lcn9ndq73wfbx5fki5z4dsnskysqnx92-distributive-0.6.2.1/nix-support:
  22239. 689.96 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22240. 689.96 s [ghc-9.10.3-with-packages] /nix/store/lcn9ndq73wfbx5fki5z4dsnskysqnx92-distributive-0.6.2.1/nix-support:
  22241. 689.96 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22242. 689.97 s [ghc-9.10.3-with-packages] /nix/store/qcbcryh3b168hrs77lyr1a25dika56x0-constraints-0.14.2/nix-support:
  22243. 689.97 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22244. 689.97 s [ghc-9.10.3-with-packages] /nix/store/qcbcryh3b168hrs77lyr1a25dika56x0-constraints-0.14.2/nix-support:
  22245. 689.97 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22246. 689.97 s [ghc-9.10.3-with-packages] /nix/store/48csrd1s2gzcpf3d3s4j6g5052ya8n4w-lifted-base-0.2.3.12/nix-support:
  22247. 689.97 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22248. 689.97 s [ghc-9.10.3-with-packages] /nix/store/48csrd1s2gzcpf3d3s4j6g5052ya8n4w-lifted-base-0.2.3.12/nix-support:
  22249. 689.97 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22250. 689.98 s [ghc-9.10.3-with-packages] /nix/store/g5b8zbiw0dqhh2ckjz664ir10qljfvcy-transformers-compat-0.7.2/nix-support:
  22251. 689.98 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22252. 689.98 s [ghc-9.10.3-with-packages] /nix/store/g5b8zbiw0dqhh2ckjz664ir10qljfvcy-transformers-compat-0.7.2/nix-support:
  22253. 689.98 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22254. 689.99 s [ghc-9.10.3-with-packages] /nix/store/fac3a4hwqmhgmmx1ra67rf82sf77hmxh-splitmix-0.1.3.1/nix-support:
  22255. 689.99 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22256. 689.99 s [ghc-9.10.3-with-packages] /nix/store/fac3a4hwqmhgmmx1ra67rf82sf77hmxh-splitmix-0.1.3.1/nix-support:
  22257. 689.99 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22258. 689.99 s [ghc-9.10.3-with-packages] /nix/store/llbg63zgzyrq17fwz7q1y1vqnj6vj2fa-unliftio-core-0.2.1.0/nix-support:
  22259. 689.99 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22260. 689.99 s [ghc-9.10.3-with-packages] /nix/store/llbg63zgzyrq17fwz7q1y1vqnj6vj2fa-unliftio-core-0.2.1.0/nix-support:
  22261. 689.99 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22262. 690.00 s [ghc-9.10.3-with-packages] /nix/store/pamck590w5lych1dj4j31s57plvxb7pf-base-orphans-0.9.3/nix-support:
  22263. 690.00 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22264. 690.00 s [ghc-9.10.3-with-packages] /nix/store/pamck590w5lych1dj4j31s57plvxb7pf-base-orphans-0.9.3/nix-support:
  22265. 690.00 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22266. 690.00 s [ghc-9.10.3-with-packages] /nix/store/l6b1in1yfspmhzs386qa4yvdd1yw5d3v-tagged-0.8.9/nix-support:
  22267. 690.00 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22268. 690.00 s [ghc-9.10.3-with-packages] /nix/store/l6b1in1yfspmhzs386qa4yvdd1yw5d3v-tagged-0.8.9/nix-support:
  22269. 690.00 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22270. 690.00 s [ghc-9.10.3-with-packages] /nix/store/hykvsy2hdb9issxg3xm8ah8z48f7h30w-boring-0.2.2/nix-support:
  22271. 690.00 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22272. 690.01 s [ghc-9.10.3-with-packages] /nix/store/hykvsy2hdb9issxg3xm8ah8z48f7h30w-boring-0.2.2/nix-support:
  22273. 690.01 s [ghc-9.10.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/bkzbp002lzhcsxal1wqrl9y965nvfw2x-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22274. 690.98 s [ghc-9.10.3-with-packages] Warning: include-dirs: /nix/store/bcwhbqlv73axa65rnzjz500hfcycvrxs-ghc-9.10.3-with-packages/lib/ghc-9.10.3/lib/../lib/x86_64-linux-ghc-9.10.3/directory-1.3.8.5-c84a/include doesn't exist or isn't a directory
  22275. 692.20 s [ghc-9.10.3-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/bcwhbqlv73axa65rnzjz500hfcycvrxs-ghc-9.10.3-with-packages
  22276. 692.80 s [ghc-9.10.3-with-packages:post-build] Pushing 1 paths (144 are already present) using zstd to cache sellout ⏳
  22277. 692.80 s [ghc-9.10.3-with-packages:post-build]
  22278. 693.16 s [ghc-9.10.3-with-packages:post-build] Pushing /nix/store/bcwhbqlv73axa65rnzjz500hfcycvrxs-ghc-9.10.3-with-packages (4.95 MiB)
  22279. 694.87 s [ghc-9.10.3-with-packages:post-build]
  22280. 694.87 s [ghc-9.10.3-with-packages:post-build] All done.
  22281. 694.88 s [ghc-9.10.3-with-packages:post-build] Uploading to the NixCI cache: /nix/store/bcwhbqlv73axa65rnzjz500hfcycvrxs-ghc-9.10.3-with-packages
  22282. 694.93 s [ghc-9.10.3-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22283. 695.14 s [ghc-9.10.3-with-packages:post-build] copying 1 paths...
  22284. 695.15 s [ghc-9.10.3-with-packages:post-build] copying path '/nix/store/bcwhbqlv73axa65rnzjz500hfcycvrxs-ghc-9.10.3-with-packages' to 'https://cache.nix-ci.com'...
  22285. 696.38 s [ghc-9.10.3-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22286. 696.63 s [ghc-9.10.3-with-packages:post-build] copying 1 paths...
  22287. 696.63 s [ghc-9.10.3-with-packages:post-build] copying path '/nix/store/1xihsvk0rgmw0jc33wyimrlylp6ma87b-ghc-9.10.3-with-packages.drv' to 'https://cache.nix-ci.com'...
  22288. 696.88 s Progress: 12 of 14 built, 36 of 36 downloaded from cache
  22289. 696.93 s Building /nix/store/00m16dy0iydkipqgflspyiwwafn4mnaf-all-packages.drv
  22290. 696.99 s [all-packages] created 3 symlinks in user environment
  22291. 697.03 s [all-packages:post-build] Uploading to cachix cache "sellout": /nix/store/9xi8vbgphx6pmc809n9mwbakjylpry1v-all-packages
  22292. 697.59 s [all-packages:post-build] Pushing 1 paths (145 are already present) using zstd to cache sellout ⏳
  22293. 697.59 s [all-packages:post-build]
  22294. 697.95 s [all-packages:post-build] Pushing /nix/store/9xi8vbgphx6pmc809n9mwbakjylpry1v-all-packages (872.00 B)
  22295. 699.15 s [all-packages:post-build]
  22296. 699.15 s [all-packages:post-build] All done.
  22297. 699.17 s [all-packages:post-build] Uploading to the NixCI cache: /nix/store/9xi8vbgphx6pmc809n9mwbakjylpry1v-all-packages
  22298. 699.22 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22299. 699.44 s [all-packages:post-build] copying 1 paths...
  22300. 699.44 s [all-packages:post-build] copying path '/nix/store/9xi8vbgphx6pmc809n9mwbakjylpry1v-all-packages' to 'https://cache.nix-ci.com'...
  22301. 699.75 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22302. 699.98 s [all-packages:post-build] copying 1 paths...
  22303. 699.98 s [all-packages:post-build] copying path '/nix/store/00m16dy0iydkipqgflspyiwwafn4mnaf-all-packages.drv' to 'https://cache.nix-ci.com'...
  22304. 700.23 s Progress: 13 of 14 built, 36 of 36 downloaded from cache
  22305. 700.23 s Progress: 14 of 14 built, 36 of 36 downloaded from cache
  22306. 700.23 s /nix/store/9xi8vbgphx6pmc809n9mwbakjylpry1v-all-packages
  22307. 700.24 s Build succeeded.
Tail Raw Logs