/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox/benchmark/theBenchmark.hs # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty H-Termination with start terms of the given HASKELL could be disproven: (0) HASKELL (1) LR [EQUIVALENT, 0 ms] (2) HASKELL (3) BR [EQUIVALENT, 0 ms] (4) HASKELL (5) COR [EQUIVALENT, 0 ms] (6) HASKELL (7) LetRed [EQUIVALENT, 0 ms] (8) HASKELL (9) Narrow [COMPLETE, 0 ms] (10) QDP (11) NonTerminationLoopProof [COMPLETE, 0 ms] (12) NO ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\fs->Hugs_BlockThread (s . fromObj) m'" is transformed to "blockIO0 f s = Hugs_BlockThread (s . fromObj) m'; " ---------------------------------------- (2) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (3) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (4) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (5) COR (EQUIVALENT) Cond Reductions: The following Function with conditions "undefined |Falseundefined; " is transformed to "undefined = undefined1; " "undefined0 True = undefined; " "undefined1 = undefined0 False; " ---------------------------------------- (6) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (7) LetRed (EQUIVALENT) Let/Where Reductions: The bindings of the following Let/Where expression "IO blockIO0 where { blockIO0 f s = Hugs_BlockThread (s . fromObj) m'; ; m' k = threadToIOResult (m (k . toObj)); } " are unpacked to the following functions on top level "blockIOM' vy k = threadToIOResult (vy (k . toObj)); " "blockIOBlockIO0 vy f s = Hugs_BlockThread (s . fromObj) (blockIOM' vy); " ---------------------------------------- (8) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (9) Narrow (COMPLETE) Haskell To QDPs digraph dp_graph { node [outthreshold=100, inthreshold=100];1[label="blockIO",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="blockIO vz3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3]; 4[label="IO (blockIOBlockIO0 vz3)",fontsize=16,color="green",shape="box"];4 -> 5[label="",style="dashed", color="green", weight=3]; 5[label="blockIOBlockIO0 vz3",fontsize=16,color="grey",shape="box"];5 -> 6[label="",style="dashed", color="grey", weight=3]; 6[label="blockIOBlockIO0 vz3 vz4",fontsize=16,color="grey",shape="box"];6 -> 7[label="",style="dashed", color="grey", weight=3]; 7[label="blockIOBlockIO0 vz3 vz4 vz5",fontsize=16,color="black",shape="triangle"];7 -> 8[label="",style="solid", color="black", weight=3]; 8[label="Hugs_BlockThread (vz5 . fromObj) (blockIOM' vz3)",fontsize=16,color="green",shape="box"];8 -> 9[label="",style="dashed", color="green", weight=3]; 8 -> 10[label="",style="dashed", color="green", weight=3]; 9[label="vz5 . fromObj",fontsize=16,color="grey",shape="box"];9 -> 11[label="",style="dashed", color="grey", weight=3]; 10[label="blockIOM' vz3",fontsize=16,color="grey",shape="box"];10 -> 12[label="",style="dashed", color="grey", weight=3]; 11[label="vz5 . fromObj",fontsize=16,color="black",shape="triangle"];11 -> 13[label="",style="solid", color="black", weight=3]; 12[label="blockIOM' vz3 vz7",fontsize=16,color="black",shape="triangle"];12 -> 14[label="",style="solid", color="black", weight=3]; 13[label="vz5 (fromObj vz6)",fontsize=16,color="green",shape="box"];13 -> 15[label="",style="dashed", color="green", weight=3]; 14 -> 16[label="",style="dashed", color="red", weight=0]; 14[label="threadToIOResult (vz3 (vz7 . toObj))",fontsize=16,color="magenta"];14 -> 17[label="",style="dashed", color="magenta", weight=3]; 15[label="fromObj vz6",fontsize=16,color="black",shape="triangle"];15 -> 18[label="",style="solid", color="black", weight=3]; 17[label="vz3 (vz7 . toObj)",fontsize=16,color="green",shape="box"];17 -> 24[label="",style="dashed", color="green", weight=3]; 16[label="threadToIOResult vz8",fontsize=16,color="burlywood",shape="triangle"];39[label="vz8/IO vz80",fontsize=10,color="white",style="solid",shape="box"];16 -> 39[label="",style="solid", color="burlywood", weight=9]; 39 -> 20[label="",style="solid", color="burlywood", weight=3]; 40[label="vz8/AProVE_IO vz80",fontsize=10,color="white",style="solid",shape="box"];16 -> 40[label="",style="solid", color="burlywood", weight=9]; 40 -> 21[label="",style="solid", color="burlywood", weight=3]; 41[label="vz8/AProVE_Exception vz80",fontsize=10,color="white",style="solid",shape="box"];16 -> 41[label="",style="solid", color="burlywood", weight=9]; 41 -> 22[label="",style="solid", color="burlywood", weight=3]; 42[label="vz8/AProVE_Error vz80",fontsize=10,color="white",style="solid",shape="box"];16 -> 42[label="",style="solid", color="burlywood", weight=9]; 42 -> 23[label="",style="solid", color="burlywood", weight=3]; 18 -> 15[label="",style="dashed", color="red", weight=0]; 18[label="fromObj vz6",fontsize=16,color="magenta"];24[label="vz7 . toObj",fontsize=16,color="grey",shape="box"];24 -> 30[label="",style="dashed", color="grey", weight=3]; 20[label="threadToIOResult (IO vz80)",fontsize=16,color="black",shape="box"];20 -> 26[label="",style="solid", color="black", weight=3]; 21[label="threadToIOResult (AProVE_IO vz80)",fontsize=16,color="black",shape="box"];21 -> 27[label="",style="solid", color="black", weight=3]; 22[label="threadToIOResult (AProVE_Exception vz80)",fontsize=16,color="black",shape="box"];22 -> 28[label="",style="solid", color="black", weight=3]; 23[label="threadToIOResult (AProVE_Error vz80)",fontsize=16,color="black",shape="box"];23 -> 29[label="",style="solid", color="black", weight=3]; 30 -> 25[label="",style="dashed", color="red", weight=0]; 30[label="vz7 . toObj",fontsize=16,color="magenta"];30 -> 34[label="",style="dashed", color="magenta", weight=3]; 26[label="vz80 Hugs_Error (const Hugs_DeadThread)",fontsize=16,color="green",shape="box"];26 -> 32[label="",style="dashed", color="green", weight=3]; 26 -> 33[label="",style="dashed", color="green", weight=3]; 27[label="error []",fontsize=16,color="red",shape="box"];28[label="error []",fontsize=16,color="red",shape="box"];29[label="error []",fontsize=16,color="red",shape="box"];34[label="vz10",fontsize=16,color="green",shape="box"];25[label="vz7 . toObj",fontsize=16,color="black",shape="triangle"];25 -> 31[label="",style="solid", color="black", weight=3]; 32[label="Hugs_Error",fontsize=16,color="green",shape="box"];33[label="const Hugs_DeadThread",fontsize=16,color="grey",shape="box"];33 -> 36[label="",style="dashed", color="grey", weight=3]; 31[label="vz7 (toObj vz9)",fontsize=16,color="green",shape="box"];31 -> 35[label="",style="dashed", color="green", weight=3]; 36[label="const Hugs_DeadThread vz11",fontsize=16,color="black",shape="triangle"];36 -> 38[label="",style="solid", color="black", weight=3]; 35[label="toObj vz9",fontsize=16,color="black",shape="triangle"];35 -> 37[label="",style="solid", color="black", weight=3]; 38[label="Hugs_DeadThread",fontsize=16,color="green",shape="box"];37 -> 35[label="",style="dashed", color="red", weight=0]; 37[label="toObj vz9",fontsize=16,color="magenta"];} ---------------------------------------- (10) Obligation: Q DP problem: The TRS P consists of the following rules: new_fromObj(vz6, h, []) -> new_fromObj(vz6, h, []) R is empty. Q is empty. We have to consider all (P,Q,R)-chains. ---------------------------------------- (11) NonTerminationLoopProof (COMPLETE) We used the non-termination processor [FROCOS05] to show that the DP problem is infinite. Found a loop by semiunifying a rule from P directly. s = new_fromObj(vz6, h, []) evaluates to t =new_fromObj(vz6, h, []) Thus s starts an infinite chain as s semiunifies with t with the following substitutions: * Matcher: [ ] * Semiunifier: [ ] -------------------------------------------------------------------------------- Rewriting sequence The DP semiunifies directly so there is only one rewrite step from new_fromObj(vz6, h, []) to new_fromObj(vz6, h, []). ---------------------------------------- (12) NO