Resolving dependencies... Build profile: -w ghc-9.8.4 -O0 In order, the following will be built (use -v for more details): - clock-0.8.4 (lib:clock) (requires build) - inspection-testing-0.6.3 (lib:inspection-testing) (requires build) - splitmix-0.1.3.2 (lib:splitmix) (requires build) - extra-1.8.1 (lib:extra) (requires build) - random-1.3.1 (lib:random) (requires build) - QuickCheck-2.15.0.1 (lib:QuickCheck) (requires build) - algebraic-graphs-0.8 (first run) Configuring clock-0.8.4... Preprocessing library for clock-0.8.4.. Building library for clock-0.8.4.. [1 of 2] Compiling System.Clock ( dist/build/System/Clock.hs, dist/build/System/Clock.o, dist/build/System/Clock.dyn_o ) [2 of 2] Compiling System.Clock.Seconds ( System/Clock/Seconds.hs, dist/build/System/Clock/Seconds.o, dist/build/System/Clock/Seconds.dyn_o ) Installing library in /tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/incoming/new-3326706/tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/clock-0.8.4-50567b232a8e29a643951f1741a5e46e3a9b91c0b9707decae64a8c4bd1cbb2b/lib Configuring inspection-testing-0.6.3... Preprocessing library for inspection-testing-0.6.3.. Building library for inspection-testing-0.6.3.. [1 of 3] Compiling Test.Inspection ( src/Test/Inspection.hs, dist/build/Test/Inspection.o, dist/build/Test/Inspection.dyn_o ) [2 of 3] Compiling Test.Inspection.Core ( src/Test/Inspection/Core.hs, dist/build/Test/Inspection/Core.o, dist/build/Test/Inspection/Core.dyn_o ) [3 of 3] Compiling Test.Inspection.Plugin ( src/Test/Inspection/Plugin.hs, dist/build/Test/Inspection/Plugin.o, dist/build/Test/Inspection/Plugin.dyn_o ) Installing library in /tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/incoming/new-3326706/tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/inspection-testing-0.6.3-92514d656fc1b832fe73e36afa3f035404337e60be207891f68f4c577735e5b2/lib Configuring splitmix-0.1.3.2... Preprocessing library for splitmix-0.1.3.2.. Building library for splitmix-0.1.3.2.. [1 of 3] Compiling System.Random.SplitMix.Init ( src/System/Random/SplitMix/Init.hs, dist/build/System/Random/SplitMix/Init.o, dist/build/System/Random/SplitMix/Init.dyn_o ) [2 of 3] Compiling System.Random.SplitMix ( src/System/Random/SplitMix.hs, dist/build/System/Random/SplitMix.o, dist/build/System/Random/SplitMix.dyn_o ) [3 of 3] Compiling System.Random.SplitMix32 ( src/System/Random/SplitMix32.hs, dist/build/System/Random/SplitMix32.o, dist/build/System/Random/SplitMix32.dyn_o ) Installing library in /tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/incoming/new-3326706/tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/splitmix-0.1.3.2-58699aacc13c4e36b3742000d11b8933a456dac329521aa0a8cb8d048d296d12/lib Configuring extra-1.8.1... Preprocessing library for extra-1.8.1.. Building library for extra-1.8.1.. [ 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 ) [ 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 ) [ 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 ) [ 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 ) [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o ) [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o ) [ 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 ) [ 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 ) [ 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 ) [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 ) [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 ) [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 ) [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 ) [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 ) [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 ) [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 ) [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 ) [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 ) [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 ) [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 ) [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o ) [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 ) Installing library in /tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/incoming/new-3326706/tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/extra-1.8.1-dd6e50270984ba2b8ab12a9a00da1f6c8e31f62ccf78538163f9a6a8bd208e7a/lib Configuring random-1.3.1... Preprocessing library for random-1.3.1.. Building library for random-1.3.1.. [1 of 6] Compiling System.Random.Array ( src/System/Random/Array.hs, dist/build/System/Random/Array.o, dist/build/System/Random/Array.dyn_o ) [2 of 6] Compiling System.Random.GFinite ( src/System/Random/GFinite.hs, dist/build/System/Random/GFinite.o, dist/build/System/Random/GFinite.dyn_o ) [3 of 6] Compiling System.Random.Internal ( src/System/Random/Internal.hs, dist/build/System/Random/Internal.o, dist/build/System/Random/Internal.dyn_o ) [4 of 6] Compiling System.Random.Seed ( src/System/Random/Seed.hs, dist/build/System/Random/Seed.o, dist/build/System/Random/Seed.dyn_o ) [5 of 6] Compiling System.Random ( src/System/Random.hs, dist/build/System/Random.o, dist/build/System/Random.dyn_o ) [6 of 6] Compiling System.Random.Stateful ( src/System/Random/Stateful.hs, dist/build/System/Random/Stateful.o, dist/build/System/Random/Stateful.dyn_o ) Installing library in /tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/incoming/new-3326706/tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/random-1.3.1-79b1fed16911015b00c8c7a45b14fb4ffea87308faf27dc110c73daa7a9a78c6/lib Configuring QuickCheck-2.15.0.1... Preprocessing library for QuickCheck-2.15.0.1.. Building library for QuickCheck-2.15.0.1.. [ 1 of 16] Compiling Test.QuickCheck.Exception ( src/Test/QuickCheck/Exception.hs, dist/build/Test/QuickCheck/Exception.o, dist/build/Test/QuickCheck/Exception.dyn_o ) [ 2 of 16] Compiling Test.QuickCheck.Random ( src/Test/QuickCheck/Random.hs, dist/build/Test/QuickCheck/Random.o, dist/build/Test/QuickCheck/Random.dyn_o ) src/Test/QuickCheck/Random.hs:50:37: warning: [GHC-68441] [-Wdeprecations] In the use of genShortByteString (imported from System.Random, but defined in System.Random.Internal): Deprecated: "In favor of `System.Random.uniformShortByteString`" | 50 | genShortByteString n = wrapQCGen (genShortByteString n) | ^^^^^^^^^^^^^^^^^^ src/Test/QuickCheck/Random.hs:83:16: warning: [GHC-68441] [-Wdeprecations] In the use of split (imported from System.Random, but defined in System.Random.Internal): Deprecated: "In favor of `splitGen`" | 83 | left = fst . split | ^^^^^ src/Test/QuickCheck/Random.hs:84:17: warning: [GHC-68441] [-Wdeprecations] In the use of split (imported from System.Random, but defined in System.Random.Internal): Deprecated: "In favor of `splitGen`" | 84 | right = snd . split | ^^^^^ [ 3 of 16] Compiling Test.QuickCheck.Gen ( src/Test/QuickCheck/Gen.hs, dist/build/Test/QuickCheck/Gen.o, dist/build/Test/QuickCheck/Gen.dyn_o ) src/Test/QuickCheck/Gen.hs:92:12: warning: [GHC-68441] [-Wdeprecations] In the use of split (imported from System.Random, but defined in System.Random.Internal): Deprecated: "In favor of `splitGen`" | 92 | case split r of | ^^^^^ [ 4 of 16] Compiling Test.QuickCheck.Gen.Unsafe ( src/Test/QuickCheck/Gen/Unsafe.hs, dist/build/Test/QuickCheck/Gen/Unsafe.o, dist/build/Test/QuickCheck/Gen/Unsafe.dyn_o ) [ 5 of 16] Compiling Test.QuickCheck.Arbitrary ( src/Test/QuickCheck/Arbitrary.hs, dist/build/Test/QuickCheck/Arbitrary.o, dist/build/Test/QuickCheck/Arbitrary.dyn_o ) [ 6 of 16] Compiling Test.QuickCheck.Poly ( src/Test/QuickCheck/Poly.hs, dist/build/Test/QuickCheck/Poly.o, dist/build/Test/QuickCheck/Poly.dyn_o ) [ 7 of 16] Compiling Test.QuickCheck.Modifiers ( src/Test/QuickCheck/Modifiers.hs, dist/build/Test/QuickCheck/Modifiers.o, dist/build/Test/QuickCheck/Modifiers.dyn_o ) [ 8 of 16] Compiling Test.QuickCheck.Function ( src/Test/QuickCheck/Function.hs, dist/build/Test/QuickCheck/Function.o, dist/build/Test/QuickCheck/Function.dyn_o ) [ 9 of 16] Compiling Test.QuickCheck.Text ( src/Test/QuickCheck/Text.hs, dist/build/Test/QuickCheck/Text.o, dist/build/Test/QuickCheck/Text.dyn_o ) [10 of 16] Compiling Test.QuickCheck.State ( src/Test/QuickCheck/State.hs, dist/build/Test/QuickCheck/State.o, dist/build/Test/QuickCheck/State.dyn_o ) [11 of 16] Compiling Test.QuickCheck.Property ( src/Test/QuickCheck/Property.hs, dist/build/Test/QuickCheck/Property.o, dist/build/Test/QuickCheck/Property.dyn_o ) [12 of 16] Compiling Test.QuickCheck.Test ( src/Test/QuickCheck/Test.hs, dist/build/Test/QuickCheck/Test.o, dist/build/Test/QuickCheck/Test.dyn_o ) src/Test/QuickCheck/Test.hs:501:17: warning: [GHC-68441] [-Wdeprecations] In the use of split (imported from System.Random, but defined in System.Random.Internal): Deprecated: "In favor of `splitGen`" | 501 | (rnd1,rnd2) = split (randomSeed st) | ^^^^^ [13 of 16] Compiling Test.QuickCheck.Monadic ( src/Test/QuickCheck/Monadic.hs, dist/build/Test/QuickCheck/Monadic.o, dist/build/Test/QuickCheck/Monadic.dyn_o ) [14 of 16] Compiling Test.QuickCheck.All ( src/Test/QuickCheck/All.hs, dist/build/Test/QuickCheck/All.o, dist/build/Test/QuickCheck/All.dyn_o ) [15 of 16] Compiling Test.QuickCheck.Features ( src/Test/QuickCheck/Features.hs, dist/build/Test/QuickCheck/Features.o, dist/build/Test/QuickCheck/Features.dyn_o ) [16 of 16] Compiling Test.QuickCheck ( src/Test/QuickCheck.hs, dist/build/Test/QuickCheck.o, dist/build/Test/QuickCheck.dyn_o ) Installing library in /tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/incoming/new-3326706/tmp/hackage-doc-builder/.local/state/cabal/store/ghc-9.8.4/QuickCheck-2.15.0.1-d08e72457aefbddbd89c07c36525d4dd83ca2912f566de09043e650fa635f13d/lib Configuring algebraic-graphs-0.8... Preprocessing library for algebraic-graphs-0.8.. Building library for algebraic-graphs-0.8.. [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyMap.dyn_o ) [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyIntMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyIntMap.dyn_o ) [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyIntMap/Algorithm.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyIntMap/Algorithm.dyn_o ) [ 4 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Bipartite/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Bipartite/AdjacencyMap.dyn_o ) [ 5 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.dyn_o ) [ 6 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Internal.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Internal.dyn_o ) [ 7 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph.dyn_o ) [ 8 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/HigherKinded/Class.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/HigherKinded/Class.dyn_o ) [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Label.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Label.dyn_o ) [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/NonEmpty/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/NonEmpty/AdjacencyMap.dyn_o ) [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyMap/Algorithm.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/AdjacencyMap/Algorithm.dyn_o ) [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Acyclic/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Acyclic/AdjacencyMap.dyn_o ) [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/ToGraph.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/ToGraph.dyn_o ) [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation.dyn_o ) [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Symmetric.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Symmetric.dyn_o ) [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/NonEmpty.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/NonEmpty.dyn_o ) [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled/AdjacencyMap.dyn_o ) [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled.dyn_o ) [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled/Example/Network.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled/Example/Network.dyn_o ) [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled/Example/Automaton.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Labelled/Example/Automaton.dyn_o ) [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Export.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Export.dyn_o ) [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Export/Dot.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Export/Dot.dyn_o ) [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Undirected.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Undirected.dyn_o ) [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Class.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Class.dyn_o ) [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Transitive.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Transitive.dyn_o ) [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Reflexive.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Reflexive.dyn_o ) [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Preorder.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Relation/Preorder.dyn_o ) [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Example/Todo.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Algebra/Graph/Example/Todo.dyn_o ) [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Data/Graph/Typed.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/Data/Graph/Typed.dyn_o ) Preprocessing test suite 'main' for algebraic-graphs-0.8.. Building test suite 'main' for algebraic-graphs-0.8.. [ 1 of 23] Compiling Algebra.Graph.Test.Arbitrary ( test/Algebra/Graph/Test/Arbitrary.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.dyn_o ) [ 2 of 23] Compiling Algebra.Graph.Test.API ( test/Algebra/Graph/Test/API.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/API.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/API.dyn_o ) [ 3 of 23] Compiling Algebra.Graph.Test ( test/Algebra/Graph/Test.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test.dyn_o ) [ 4 of 23] Compiling Algebra.Graph.Test.Acyclic.AdjacencyMap ( test/Algebra/Graph/Test/Acyclic/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.dyn_o ) [ 5 of 23] Compiling Algebra.Graph.Test.Bipartite.AdjacencyMap ( test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.dyn_o ) [ 6 of 23] Compiling Algebra.Graph.Test.Example.Todo ( test/Algebra/Graph/Test/Example/Todo.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.dyn_o ) [ 7 of 23] Compiling Algebra.Graph.Test.Export ( test/Algebra/Graph/Test/Export.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Export.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Export.dyn_o ) [ 8 of 23] Compiling Algebra.Graph.Test.Generic ( test/Algebra/Graph/Test/Generic.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Generic.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Generic.dyn_o ) [ 9 of 23] Compiling Algebra.Graph.Test.AdjacencyMap ( test/Algebra/Graph/Test/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.dyn_o ) [10 of 23] Compiling Algebra.Graph.Test.AdjacencyIntMap ( test/Algebra/Graph/Test/AdjacencyIntMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.dyn_o ) [11 of 23] Compiling Algebra.Graph.Test.Graph ( test/Algebra/Graph/Test/Graph.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Graph.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Graph.dyn_o ) [12 of 23] Compiling Algebra.Graph.Test.Internal ( test/Algebra/Graph/Test/Internal.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Internal.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Internal.dyn_o ) [13 of 23] Compiling Algebra.Graph.Test.Label ( test/Algebra/Graph/Test/Label.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Label.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Label.dyn_o ) [14 of 23] Compiling Algebra.Graph.Test.Labelled.AdjacencyMap ( test/Algebra/Graph/Test/Labelled/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.dyn_o ) [15 of 23] Compiling Algebra.Graph.Test.Labelled.Graph ( test/Algebra/Graph/Test/Labelled/Graph.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.dyn_o ) [16 of 23] Compiling Algebra.Graph.Test.NonEmpty.AdjacencyMap ( test/Algebra/Graph/Test/NonEmpty/AdjacencyMap.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.dyn_o ) [17 of 23] Compiling Algebra.Graph.Test.NonEmpty.Graph ( test/Algebra/Graph/Test/NonEmpty/Graph.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.dyn_o ) [18 of 23] Compiling Algebra.Graph.Test.Relation ( test/Algebra/Graph/Test/Relation.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Relation.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Relation.dyn_o ) [19 of 23] Compiling Algebra.Graph.Test.Relation.Symmetric ( test/Algebra/Graph/Test/Relation/Symmetric.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.dyn_o ) [20 of 23] Compiling Algebra.Graph.Test.RewriteRules ( test/Algebra/Graph/Test/RewriteRules.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.dyn_o ) test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR failed: inequal ticks LHS: emptyI = ... hpc hpc foldg @b @a (hpc e) (hpc ds_d59Gm) (hpc ds_d59Gn) (hpc ds_d59Go) ((hpc Algebra.Graph.Empty) @a) RHS: emptyIR = ... hpc hpc e test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR failed: inequal ticks LHS: vertexI = ... hpc hpc foldg @b @a (hpc ds_d59Gi) (hpc v) (hpc ds_d59Gj) (hpc ds_d59Gk) (hpc Algebra.Graph.Vertex @a (hpc x)) RHS: vertexIR = ... hpc hpc v (hpc x) test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR failed: inequal ticks LHS: overlayI = ... hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc Algebra.Graph.Overlay @a (hpc x) (hpc y)) RHS: overlayIR = ... hpc hpc o (hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc x)) (hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc y)) test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR failed: inequal ticks LHS: connectI = ... hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc Algebra.Graph.Connect @a (hpc x) (hpc y)) RHS: connectIR = ... hpc hpc c (hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc x)) (hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc y)) test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List failed: overlaysC :: forall a. Build (Graph a) -> Graph a [LclIdX, Arity=1, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=ALWAYS_IF(arity=1,unsat_ok=True,boring_ok=True)}] overlaysC = \ (@a) (xs :: Build (Graph a)) -> hpc hpc overlays @a (hpc build @(Graph a) (hpc xs)) test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR failed: inequal ticks LHS: overlaysP = ... hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc overlays @a (hpc xs)) RHS: overlaysPR = ... hpc hpc fromMaybe @b (hpc e) (hpc foldr @[] Data.Foldable.$fFoldableList @(Graph a) @(Maybe b) (hpc . @b @(Maybe b -> Maybe b) @(Graph a) (hpc maybeF @b @b (hpc o)) (hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c))) ((hpc GHC.Maybe.Nothing) @b) (hpc xs)) test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List failed: verticesCP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Build a -> b [LclIdX, Arity=5, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0] 80 0}] verticesCP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (xs :: Build a) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc vertices @a (hpc build @a (hpc xs))) test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph failed: verticesCP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Build a -> b [LclIdX, Arity=5, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0] 80 0}] verticesCP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (xs :: Build a) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc vertices @a (hpc build @a (hpc xs))) test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List failed: connectsC :: forall a. Build (Graph a) -> Graph a [LclIdX, Arity=1, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=ALWAYS_IF(arity=1,unsat_ok=True,boring_ok=True)}] connectsC = \ (@a) (xs :: Build (Graph a)) -> hpc hpc connects @a (hpc build @(Graph a) (hpc xs)) test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR failed: inequal ticks LHS: connectsP = ... hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc connects @a (hpc xs)) RHS: connectsPR = ... hpc hpc fromMaybe @b (hpc e) (hpc foldr @[] Data.Foldable.$fFoldableList @(Graph a) @(Maybe b) (hpc . @b @(Maybe b -> Maybe b) @(Graph a) (hpc maybeF @b @b (hpc c)) (hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c))) ((hpc GHC.Maybe.Nothing) @b) (hpc xs)) test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph failed: isSubgraphOfC :: forall a. Ord a => Buildg a -> Buildg a -> Bool [LclIdX, Arity=3, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0] 80 0}] isSubgraphOfC = \ (@a) ($dOrd_a4Qnl :: Ord a) (x :: Buildg a) (y :: Buildg a) -> hpc hpc isSubgraphOf @a $dOrd_a4Qnl (hpc buildg @a (hpc x)) (hpc buildg @a (hpc y)) test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List failed: cliqueCP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Build a -> b [LclIdX, Arity=5, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0] 80 0}] cliqueCP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (xs :: Build a) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc clique @a (hpc build @a (hpc xs))) test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph failed: cliqueCP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Build a -> b [LclIdX, Arity=5, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0] 80 0}] cliqueCP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (xs :: Build a) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc clique @a (hpc build @a (hpc xs))) test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List failed: edgesCP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Build (a, a) -> b [LclIdX, Arity=5, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0] 80 0}] edgesCP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (xs :: Build (a, a)) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc edges @a (hpc build @(a, a) (hpc xs))) test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph failed: edgesCP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Build (a, a) -> b [LclIdX, Arity=5, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0] 80 0}] edgesCP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (xs :: Build (a, a)) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc edges @a (hpc build @(a, a) (hpc xs))) test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List failed: starCP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> a -> Build a -> b [LclIdX, Arity=6, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0 0] 90 0}] starCP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (x :: a) (xs :: Build a) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc star @a (hpc x) (hpc build @a (hpc xs))) test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph failed: starCP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> a -> Build a -> b [LclIdX, Arity=6, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0 0] 90 0}] starCP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (x :: a) (xs :: Build a) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc star @a (hpc x) (hpc build @a (hpc xs))) test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph failed: fmapCP :: forall b a c. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> (c -> a) -> Buildg c -> b [LclIdX, Arity=6, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0 0] 120 0}] fmapCP = \ (@b) (@a) (@c) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (f :: c -> a) (g :: Buildg c) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc fmap @Graph $fFunctorGraph @c @a (hpc f) (hpc buildg @c (hpc g))) test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR failed: inequal ticks LHS: bindC = ... hpc hpc >>= @Graph Algebra.Graph.$fMonadGraph @a @b (hpc buildg @a (hpc g)) (hpc f) RHS: bindCR = ... hpc hpc g @(Graph b) ((hpc Algebra.Graph.Empty) @b) (hpc \ (x :: a) -> hpc f (hpc x)) (hpc \ (ds_d59G7 :: Graph b) (ds_d59G8 :: Graph b) -> Algebra.Graph.Overlay @b ds_d59G7 ds_d59G8) (hpc \ (ds_d59G9 :: Graph b) (ds_d59Ga :: Graph b) -> Algebra.Graph.Connect @b ds_d59G9 ds_d59Ga) test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR failed: inequal ticks LHS: bindP = ... hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc >>= @Graph Algebra.Graph.$fMonadGraph @c @a (hpc g) (hpc f)) RHS: bindPR = ... hpc hpc foldg @b @c (hpc e) (hpc . @(Graph a) @b @c (hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c)) (hpc f)) (hpc o) (hpc c) (hpc g) test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR failed: inequal ticks LHS: apC = ... hpc hpc <*> @Graph Algebra.Graph.$fApplicativeGraph @a @b (hpc buildg @(a -> b) (hpc f)) (hpc x) RHS: apCR = ... hpc hpc f @(Graph b) ((hpc Algebra.Graph.Empty) @b) (hpc \ (v :: a -> b) -> hpc foldg @(Graph b) @a ((hpc Algebra.Graph.Empty) @b) (hpc . @b @(Graph b) @a (hpc \ (ds_d59FY :: b) -> Algebra.Graph.Vertex @b ds_d59FY) (hpc v)) (hpc \ (ds_d59FZ :: Graph b) (ds_d59G0 :: Graph b) -> Algebra.Graph.Overlay @b ds_d59FZ ds_d59G0) (hpc \ (ds_d59G1 :: Graph b) (ds_d59G2 :: Graph b) -> Algebra.Graph.Connect @b ds_d59G1 ds_d59G2) (hpc x)) (hpc \ (ds_d59G3 :: Graph b) (ds_d59G4 :: Graph b) -> Algebra.Graph.Overlay @b ds_d59G3 ds_d59G4) (hpc \ (ds_d59G5 :: Graph b) (ds_d59G6 :: Graph b) -> Algebra.Graph.Connect @b ds_d59G5 ds_d59G6) test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR failed: inequal ticks LHS: apP = ... hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc <*> @Graph Algebra.Graph.$fApplicativeGraph @c @a (hpc f) (hpc x)) RHS: apPR = ... hpc hpc foldg @b @(c -> a) (hpc e) (hpc \ (w :: c -> a) -> hpc foldg @b @c (hpc e) (hpc . @a @b @c (hpc v) (hpc w)) (hpc o) (hpc c) (hpc x)) (hpc o) (hpc c) (hpc f) test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph failed: eqC :: forall a. Ord a => Buildg a -> Buildg a -> Bool [LclIdX, Arity=1, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0] 130 60}] eqC = \ (@a) ($dOrd_a4UYM :: Ord a) -> let { $dEq_a4UYP :: Eq (Graph a) [LclId, Unf=Unf{Src=, TopLvl=False, Value=False, ConLike=False, WorkFree=False, Expandable=True, Guidance=IF_ARGS [] 20 0}] $dEq_a4UYP = $fEqGraph @a $dOrd_a4UYM } in \ (x :: Buildg a) (y :: Buildg a) -> hpc hpc == @(Graph a) $dEq_a4UYP (hpc buildg @a (hpc x)) (hpc buildg @a (hpc y)) test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed. test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph failed: ordC :: forall a. Ord a => Buildg a -> Buildg a -> Ordering [LclIdX, Arity=1, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0] 130 60}] ordC = \ (@a) ($dOrd_a4VJv :: Ord a) -> let { $dOrd_a4VJy :: Ord (Graph a) [LclId, Unf=Unf{Src=, TopLvl=False, Value=False, ConLike=False, WorkFree=False, Expandable=True, Guidance=IF_ARGS [] 20 0}] $dOrd_a4VJy = $fOrdGraph @a $dOrd_a4VJv } in \ (x :: Buildg a) (y :: Buildg a) -> hpc hpc compare @(Graph a) $dOrd_a4VJy (hpc buildg @a (hpc x)) (hpc buildg @a (hpc y)) test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed. test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph failed: isEmptyC :: forall a. Buildg a -> Bool [LclIdX, Arity=1, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0] 40 0}] isEmptyC = \ (@a) (g :: Buildg a) -> hpc hpc isEmpty @a (hpc buildg @a (hpc g)) test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph failed: sizeC :: forall a. Buildg a -> Int [LclIdX, Arity=1, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0] 40 0}] sizeC = \ (@a) (g :: Buildg a) -> hpc hpc size @a (hpc buildg @a (hpc g)) test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph failed: vertexSetC :: forall a. Ord a => Buildg a -> Set a [LclIdX, Arity=2, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0] 50 0}] vertexSetC = \ (@a) ($dOrd_a4XmH :: Ord a) (g :: Buildg a) -> hpc hpc vertexSet @a $dOrd_a4XmH (hpc buildg @a (hpc g)) test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph failed: vertexSetC :: forall a. Ord a => Buildg a -> Set a [LclIdX, Arity=2, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0] 50 0}] vertexSetC = \ (@a) ($dOrd_a4XmH :: Ord a) (g :: Buildg a) -> hpc hpc vertexSet @a $dOrd_a4XmH (hpc buildg @a (hpc g)) test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed. test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph failed: edgeCountC :: forall a. Ord a => Buildg a -> Int [LclIdX, Arity=2, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0] 50 0}] edgeCountC = \ (@a) ($dOrd_a4Yy1 :: Ord a) (g :: Buildg a) -> hpc hpc edgeCount @a $dOrd_a4Yy1 (hpc buildg @a (hpc g)) test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed. test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph failed: vertexListCP :: forall a b. Ord a => (a -> b -> b) -> b -> Buildg a -> b [LclIdX, Arity=4, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0] 100 0}] vertexListCP = \ (@a) (@b) ($dOrd_a4Zlm :: Ord a) (k :: a -> b -> b) (c :: b) (g :: Buildg a) -> hpc hpc foldr @[] $fFoldableList @a @b (hpc k) (hpc c) (hpc vertexList @a $dOrd_a4Zlm (hpc buildg @a (hpc g))) test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List failed: vertexListCP :: forall a b. Ord a => (a -> b -> b) -> b -> Buildg a -> b [LclIdX, Arity=4, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0] 100 0}] vertexListCP = \ (@a) (@b) ($dOrd_a4Zlm :: Ord a) (k :: a -> b -> b) (c :: b) (g :: Buildg a) -> hpc hpc foldr @[] $fFoldableList @a @b (hpc k) (hpc c) (hpc vertexList @a $dOrd_a4Zlm (hpc buildg @a (hpc g))) test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed. test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph failed: edgeSetC :: forall a. Ord a => Buildg a -> Set (a, a) [LclIdX, Arity=2, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0] 50 0}] edgeSetC = \ (@a) ($dOrd_a50tE :: Ord a) (g :: Buildg a) -> hpc hpc edgeSet @a $dOrd_a50tE (hpc buildg @a (hpc g)) test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed. test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph failed: edgeListCP :: forall a b. Ord a => ((a, a) -> b -> b) -> b -> Buildg a -> b [LclIdX, Arity=4, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0] 100 0}] edgeListCP = \ (@a) (@b) ($dOrd_a51gz :: Ord a) (k :: (a, a) -> b -> b) (c :: b) (g :: Buildg a) -> hpc hpc foldr @[] $fFoldableList @(a, a) @b (hpc k) (hpc c) (hpc edgeList @a $dOrd_a51gz (hpc buildg @a (hpc g))) test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List failed: edgeListCP :: forall a b. Ord a => ((a, a) -> b -> b) -> b -> Buildg a -> b [LclIdX, Arity=4, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0] 100 0}] edgeListCP = \ (@a) (@b) ($dOrd_a51gz :: Ord a) (k :: (a, a) -> b -> b) (c :: b) (g :: Buildg a) -> hpc hpc foldr @[] $fFoldableList @(a, a) @b (hpc k) (hpc c) (hpc edgeList @a $dOrd_a51gz (hpc buildg @a (hpc g))) test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed. test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph failed: hasVertexC :: forall a. Eq a => a -> Buildg a -> Bool [LclIdX, Arity=3, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0] 60 0}] hasVertexC = \ (@a) ($dEq_a52rl :: Eq a) (x :: a) (g :: Buildg a) -> hpc hpc hasVertex @a $dEq_a52rl (hpc x) (hpc buildg @a (hpc g)) test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph failed: hasEdgeC :: forall a. Eq a => a -> a -> Buildg a -> Bool [LclIdX, Arity=4, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0] 70 0}] hasEdgeC = \ (@a) ($dEq_a52SA :: Eq a) (x :: a) (y :: a) (g :: Buildg a) -> hpc hpc hasEdge @a $dEq_a52SA (hpc x) (hpc y) (hpc buildg @a (hpc g)) test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph failed: adjacencyListC :: forall a. Ord a => Buildg a -> [(a, [a])] [LclIdX, Arity=2, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0] 50 0}] adjacencyListC = \ (@a) ($dOrd_a53hj :: Ord a) (g :: Buildg a) -> hpc hpc adjacencyList @a $dOrd_a53hj (hpc buildg @a (hpc g)) test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph failed: pathP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> [a] -> b [LclIdX, Arity=5, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0] 80 0}] pathP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (xs :: [a]) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc path @a (hpc xs)) test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph failed: circuitP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> [a] -> b [LclIdX, Arity=5, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0] 80 0}] circuitP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (xs :: [a]) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc circuit @a (hpc xs)) test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List failed: bicliqueCP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Build a -> Build a -> b [LclIdX, Arity=6, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0 0] 90 0}] bicliqueCP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (xs :: Build a) (ys :: Build a) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc biclique @a (hpc build @a (hpc xs)) (hpc build @a (hpc ys))) test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph failed: bicliqueCP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Build a -> Build a -> b [LclIdX, Arity=6, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0 0] 90 0}] bicliqueCP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (xs :: Build a) (ys :: Build a) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc biclique @a (hpc build @a (hpc xs)) (hpc build @a (hpc ys))) test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph failed: replaceVertexCP :: forall a b. Eq a => a -> a -> b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Buildg a -> b [LclIdX, Arity=8, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0 0 0 0] 130 0}] replaceVertexCP = \ (@a) (@b) ($dEq_a55e4 :: Eq a) (u :: a) (v :: a) (e :: b) (v' :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (g :: Buildg a) -> hpc hpc foldg @b @a (hpc e) (hpc v') (hpc o) (hpc c) (hpc replaceVertex @a $dEq_a55e4 (hpc u) (hpc v) (hpc buildg @a (hpc g))) test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph failed: mergeVerticesCP :: forall a b. (a -> Bool) -> a -> b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Buildg a -> b [LclIdX, Arity=7, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0 0 0] 120 0}] mergeVerticesCP = \ (@a) (@b) (p :: a -> Bool) (v :: a) (e :: b) (v' :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (g :: Buildg a) -> hpc hpc foldg @b @a (hpc e) (hpc v') (hpc o) (hpc c) (hpc mergeVertices @a (hpc p) (hpc v) (hpc buildg @a (hpc g))) test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List failed: splitVertexCP :: forall a b. Eq a => a -> Build a -> b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Buildg a -> b [LclIdX, Arity=8, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0 0 0 0] 130 0}] splitVertexCP = \ (@a) (@b) ($dEq_a563n :: Eq a) (x :: a) (us :: Build a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (g :: Buildg a) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc splitVertex @a $dEq_a563n (hpc x) (hpc build @a (hpc us)) (hpc buildg @a (hpc g))) test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph failed: splitVertexCP :: forall a b. Eq a => a -> Build a -> b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Buildg a -> b [LclIdX, Arity=8, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0 0 0 0] 130 0}] splitVertexCP = \ (@a) (@b) ($dEq_a563n :: Eq a) (x :: a) (us :: Build a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (g :: Buildg a) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc splitVertex @a $dEq_a563n (hpc x) (hpc build @a (hpc us)) (hpc buildg @a (hpc g))) test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph failed: transposeCP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Buildg a -> b [LclIdX, Arity=5, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0] 100 0}] transposeCP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (g :: Buildg a) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc transpose @a (hpc buildg @a (hpc g))) test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR failed: inequal terms: \ (g :: Buildg a) -> hpc hpc simplify @a $dOrd_a57eB (hpc buildg @a (hpc g)) and let { $dEq_a57fn :: Eq (Graph a) [LclId, Unf=Unf{Src=, TopLvl=False, Value=False, ConLike=False, WorkFree=False, Expandable=True, Guidance=IF_ARGS [] 20 0}] $dEq_a57fn = Algebra.Graph.$fEqGraph @a $dOrd_a57fd } in \ (g :: Buildg a) -> hpc hpc g @(Graph a) ((hpc Algebra.Graph.Empty) @a) (hpc \ (ds_d59Fk :: a) -> Algebra.Graph.Vertex @a ds_d59Fk) (let { op :: Graph a -> Graph a -> Graph a [LclId, Unf=Unf{Src=, TopLvl=False, Value=False, ConLike=False, WorkFree=False, Expandable=False, Guidance=IF_ARGS [] 30 60}] op = hpc \ (ds_d59Fl :: Graph a) (ds_d59Fm :: Graph a) -> Algebra.Graph.Overlay @a ds_d59Fl ds_d59Fm } in hpc \ (x :: Graph a) (y :: Graph a) -> let { z :: Graph a [LclId, Unf=Unf{Src=, TopLvl=False, Value=False, ConLike=False, WorkFree=False, Expandable=False, Guidance=IF_ARGS [] 30 0}] z = hpc hpc op (hpc x) (hpc y) } in hpc hpc case == @(Graph a) $dEq_a57fn (hpc x) (hpc z) of { False -> hpc hpc case == @(Graph a) $dEq_a57fn (hpc y) (hpc z) of { False -> hpc hpc hpc hpc z; True -> hpc hpc y }; True -> hpc hpc x }) (let { op :: Graph a -> Graph a -> Graph a [LclId, Unf=Unf{Src=, TopLvl=False, Value=False, ConLike=False, WorkFree=False, Expandable=False, Guidance=IF_ARGS [] 30 60}] op = hpc \ (ds_d59Fn :: Graph a) (ds_d59Fo :: Graph a) -> Algebra.Graph.Connect @a ds_d59Fn ds_d59Fo } in hpc \ (x :: Graph a) (y :: Graph a) -> let { z :: Graph a [LclId, Unf=Unf{Src=, TopLvl=False, Value=False, ConLike=False, WorkFree=False, Expandable=False, Guidance=IF_ARGS [] 30 0}] z = hpc hpc op (hpc x) (hpc y) } in hpc hpc case == @(Graph a) $dEq_a57fn (hpc x) (hpc z) of { False -> hpc hpc case == @(Graph a) $dEq_a57fn (hpc y) (hpc z) of { False -> hpc hpc hpc hpc z; True -> hpc hpc y }; True -> hpc hpc x }) LHS: simplifyC = ... \ (g :: Buildg a) -> hpc hpc simplify @a $dOrd_a57fd (hpc buildg @a (hpc g)) RHS: simplifyCR = ... let { $dEq_a57fn :: Eq (Graph a) [LclId, Unf=Unf{Src=, TopLvl=False, Value=False, ConLike=False, WorkFree=False, Expandable=True, Guidance=IF_ARGS [] 20 0}] $dEq_a57fn = Algebra.Graph.$fEqGraph @a $dOrd_a57fd } in \ (g :: Buildg a) -> hpc hpc g @(Graph a) ((hpc Algebra.Graph.Empty) @a) (hpc \ (ds_d59Fk :: a) -> Algebra.Graph.Vertex @a ds_d59Fk) (let { op :: Graph a -> Graph a -> Graph a [LclId, Unf=Unf{Src=, TopLvl=False, Value=False, ConLike=False, WorkFree=False, Expandable=False, Guidance=IF_ARGS [] 30 60}] op = hpc \ (ds_d59Fl :: Graph a) (ds_d59Fm :: Graph a) -> Algebra.Graph.Overlay @a ds_d59Fl ds_d59Fm } in hpc \ (x :: Graph a) (y :: Graph a) -> let { z :: Graph a [LclId, Unf=Unf{Src=, TopLvl=False, Value=False, ConLike=False, WorkFree=False, Expandable=False, Guidance=IF_ARGS [] 30 0}] z = hpc hpc op (hpc x) (hpc y) } in hpc hpc case == @(Graph a) $dEq_a57fn (hpc x) (hpc z) of { False -> hpc hpc case == @(Graph a) $dEq_a57fn (hpc y) (hpc z) of { False -> hpc hpc hpc hpc z; True -> hpc hpc y }; True -> hpc hpc x }) (let { op :: Graph a -> Graph a -> Graph a [LclId, Unf=Unf{Src=, TopLvl=False, Value=False, ConLike=False, WorkFree=False, Expandable=False, Guidance=IF_ARGS [] 30 60}] op = hpc \ (ds_d59Fn :: Graph a) (ds_d59Fo :: Graph a) -> Algebra.Graph.Connect @a ds_d59Fn ds_d59Fo } in hpc \ (x :: Graph a) (y :: Graph a) -> let { z :: Graph a [LclId, Unf=Unf{Src=, TopLvl=False, Value=False, ConLike=False, WorkFree=False, Expandable=False, Guidance=IF_ARGS [] 30 0}] z = hpc hpc op (hpc x) (hpc y) } in hpc hpc case == @(Graph a) $dEq_a57fn (hpc x) (hpc z) of { False -> hpc hpc case == @(Graph a) $dEq_a57fn (hpc y) (hpc z) of { False -> hpc hpc hpc hpc z; True -> hpc hpc y }; True -> hpc hpc x }) test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph failed: composeCP :: forall a b. Ord a => b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Buildg a -> Buildg a -> b [LclIdX, Arity=7, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0 0 0] 160 0}] composeCP = \ (@a) (@b) ($dOrd_a57EL :: Ord a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (x :: Buildg a) (y :: Buildg a) -> hpc hpc $ @LiftedRep @LiftedRep @(Graph a) @b (hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c)) (hpc compose @a $dOrd_a57EL (hpc buildg @a (hpc x)) (hpc buildg @a (hpc y))) test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph failed: induceCP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> (a -> Bool) -> Buildg a -> b [LclIdX, Arity=6, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0 0] 110 0}] induceCP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (p :: a -> Bool) (g :: Buildg a) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc induce @a (hpc p) (hpc buildg @a (hpc g))) test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph failed: induceJustCP :: forall b a. b -> (a -> b) -> (b -> b -> b) -> (b -> b -> b) -> Buildg (Maybe a) -> b [LclIdX, Arity=5, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0 0 0 0] 100 0}] induceJustCP = \ (@b) (@a) (e :: b) (v :: a -> b) (o :: b -> b -> b) (c :: b -> b -> b) (g :: Buildg (Maybe a)) -> hpc hpc foldg @b @a (hpc e) (hpc v) (hpc o) (hpc c) (hpc induceJust @a (hpc buildg @(Maybe a) (hpc g))) test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph failed: contextC :: forall a. (a -> Bool) -> Buildg a -> Maybe (Context a) [LclIdX, Arity=2, Unf=Unf{Src=, TopLvl=True, Value=True, ConLike=True, WorkFree=True, Expandable=True, Guidance=IF_ARGS [0 0] 50 0}] contextC = \ (@a) (p :: a -> Bool) (g :: Buildg a) -> hpc hpc context @a (hpc p) (hpc buildg @a (hpc g)) test/Algebra/Graph/Test/RewriteRules.hs: error: inspection testing unsuccessful expected successes: 7 unexpected failures: 51 : error: ExitFailure 1 [21 of 23] Compiling Algebra.Graph.Test.Undirected ( test/Algebra/Graph/Test/Undirected.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Undirected.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Algebra/Graph/Test/Undirected.dyn_o ) [22 of 23] Compiling Data.Graph.Test.Typed ( test/Data/Graph/Test/Typed.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Data/Graph/Test/Typed.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Data/Graph/Test/Typed.dyn_o ) [23 of 23] Compiling Main ( test/Main.hs, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Main.o, /var/lib/hackage-doc-builder/build-cache/tmp-install/dist-newstyle/build/x86_64-linux/ghc-9.8.4/algebraic-graphs-0.8/noopt/build/main/main-tmp/Main.dyn_o )