details

property	value
status	complete
benchmark	turing_typed.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n055.star.cs.uiowa.edu
space	Frederiksen_Glenstrup

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	3.28025507927 seconds
cpu usage	9.977530518
max memory	2.362298368E9

stage attributes

key	value
output-size	22079
starexec-result	WORST_CASE(NON_POLY, ?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(INF, INF). (0) CpxRelTRS (1) STerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 235 ms] (2) CpxRelTRS (3) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (4) TRS for Loop Detection (5) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (6) BEST (7) proven lower bound (8) LowerBoundPropagationProof [FINISHED, 0 ms] (9) BOUNDS(n^1, INF) (10) TRS for Loop Detection (11) InfiniteLowerBoundProof [FINISHED, 1199 ms] (12) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: turing(I(IfGoto(i1, i2), r), revltape, Cons(x, xs), prog) -> turing[Ite](!EQ(x, i1), I(IfGoto(i1, i2), r), revltape, Cons(x, xs), prog) turing(I(Goto(int), r), revltape, rtape, prog) -> turing(lookup(int, prog), revltape, rtape, prog) turing(I(Right, r), revltape, Cons(x, xs), prog) -> turing(r, Cons(x, revltape), xs, prog) turing(I(Right, r), revltape, Nil, prog) -> turing(r, Cons(0, revltape), Nil, prog) turing(I(Left, r), Cons(x, xs), rtape, prog) -> turing(r, xs, Cons(x, rtape), prog) turing(I(Left, r), Nil, rtape, prog) -> turing(r, Nil, Cons(0, rtape), prog) turing(I(Write(int), r), revltape, Cons(x, xs), prog) -> turing(r, revltape, Cons(int, xs), prog) turing(I(Halt, r), revltape, rtape, prog) -> rtape turing(Empty, revltape, rtape, prog) -> rtape lookup(S(x), I(l, r)) -> lookup(x, r) instrsConstrCheck(I(l1, r1), I(x, y)) -> True instrsConstrCheck(I(l1, r1), Empty) -> False instrsConstrCheck(Empty, I(x, y)) -> False instrsConstrCheck(Empty, Empty) -> True instrConstrCheck(IfGoto(igtNat1, igtNat2), IfGoto(igtNat12, igtNat22)) -> True instrConstrCheck(IfGoto(igtNat1, igtNat2), Goto(gtNat2)) -> False instrConstrCheck(IfGoto(igtNat1, igtNat2), Right) -> False instrConstrCheck(IfGoto(igtNat1, igtNat2), Left) -> False instrConstrCheck(IfGoto(igtNat1, igtNat2), Write(wNat2)) -> False instrConstrCheck(IfGoto(igtNat1, igtNat2), Halt) -> False instrConstrCheck(Goto(gtNat), IfGoto(igtNat12, igtNat22)) -> False instrConstrCheck(Goto(gtNat), Goto(gtNat2)) -> True instrConstrCheck(Goto(gtNat), Right) -> False instrConstrCheck(Goto(gtNat), Left) -> False instrConstrCheck(Goto(gtNat), Write(wNat2)) -> False instrConstrCheck(Goto(gtNat), Halt) -> False instrConstrCheck(Right, IfGoto(igtNat12, igtNat22)) -> False instrConstrCheck(Right, Goto(gtNat2)) -> False instrConstrCheck(Right, Right) -> True instrConstrCheck(Right, Left) -> False instrConstrCheck(Right, Write(wNat2)) -> False instrConstrCheck(Right, Halt) -> False instrConstrCheck(Left, IfGoto(igtNat12, igtNat22)) -> False instrConstrCheck(Left, Goto(gtNat2)) -> False instrConstrCheck(Left, Right) -> False instrConstrCheck(Left, Left) -> True instrConstrCheck(Left, Write(wNat2)) -> False instrConstrCheck(Left, Halt) -> False instrConstrCheck(Write(wNat), IfGoto(igtNat12, igtNat22)) -> False instrConstrCheck(Write(wNat), Goto(gtNat2)) -> False instrConstrCheck(Write(wNat), Right) -> False instrConstrCheck(Write(wNat), Left) -> False instrConstrCheck(Write(wNat), Write(wNat2)) -> True instrConstrCheck(Write(wNat), Halt) -> False instrConstrCheck(Halt, IfGoto(igtNat12, igtNat22)) -> False instrConstrCheck(Halt, Goto(gtNat2)) -> False instrConstrCheck(Halt, Right) -> False instrConstrCheck(Halt, Left) -> False instrConstrCheck(Halt, Write(wNat2)) -> False instrConstrCheck(Halt, Halt) -> True notEmpty(Cons(x, xs)) -> True notEmpty(Nil) -> False lookup(0, instrs) -> instrs instrsSecond(I(l, r)) -> r instrsFirst(I(l, r)) -> l getWrite(Write(int)) -> int getGotoSecond(IfGoto(i1, i2)) -> i2 getGotoFirst(IfGoto(i1, i2)) -> i1 getGoto(Goto(int)) -> int run(prog, tapeinput) -> turing(prog, Nil, tapeinput, prog) The (relative) TRS S consists of the following rules: popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807