Haskell pair #487599397

details

property	value
status	complete
benchmark	Prelude_basicIORun_1.hs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n145.star.cs.uiowa.edu
space	full_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.6409008503 seconds
cpu usage	11.525241024
max memory	6.16476672E8

stage attributes

key	value
output-size	54626
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


MAYBE
proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


H-Termination with start terms of the given HASKELL could not be shown:

(0) HASKELL
(1) LR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) CR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) BR [EQUIVALENT, 0 ms]
(6) HASKELL
(7) COR [EQUIVALENT, 0 ms]
(8) HASKELL
(9) LetRed [EQUIVALENT, 0 ms]
(10) HASKELL
(11) Narrow [SOUND, 0 ms]
(12) AND
    (13) QDP
        (14) MRRProof [EQUIVALENT, 58 ms]
        (15) QDP
        (16) MRRProof [EQUIVALENT, 0 ms]
        (17) QDP
        (18) QReductionProof [EQUIVALENT, 0 ms]
        (19) QDP
        (20) MNOCProof [EQUIVALENT, 0 ms]
        (21) QDP
        (22) NonTerminationLoopProof [COMPLETE, 0 ms]
        (23) NO
    (24) QDP
        (25) DependencyGraphProof [EQUIVALENT, 0 ms]
        (26) QDP
        (27) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (28) YES
    (29) QDP
        (30) NonTerminationLoopProof [COMPLETE, 0 ms]
        (31) NO
    (32) QDP
        (33) NonTerminationLoopProof [COMPLETE, 0 ms]
        (34) NO
    (35) QDP
        (36) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (37) YES
    (38) QDP
        (39) NonTerminationLoopProof [COMPLETE, 0 ms]
        (40) NO
(41) Narrow [COMPLETE, 0 ms]
(42) TRUE


----------------------------------------

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
}

----------------------------------------

(1) LR (EQUIVALENT)
Lambda Reductions:
The following Lambda expression
"\x->Hugs_Catch (a x) f1 f2 s"
is transformed to
"hugs_catch0 a f1 f2 s x = Hugs_Catch (a x) f1 f2 s;
"

----------------------------------------

(2)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
}

----------------------------------------

(3) CR (EQUIVALENT)
Case Reductions:
The following Case expression
"case primCatchException (catch' m) of {
Left exn  -> f1 exn;
Right (Hugs_Return a)  -> s a;
Right (Hugs_Error e)  -> f2 e;
Right (Hugs_ForkThread a b)  -> Hugs_ForkThread (Hugs_Catch a f1 f2 s) b;
Right (Hugs_YieldThread a)  -> Hugs_YieldThread (Hugs_Catch a f1 f2 s);
Right (Hugs_BlockThread a b)  -> Hugs_BlockThread (hugs_catch0 a f1 f2 s) b;
Right r  -> r}
"

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to Haskell