details

property	value
status	complete
benchmark	aaron2_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n034.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	2.12623 seconds
cpu usage	3.26407
user time	2.9503
system time	0.313767
max virtual memory	1.8542672E7
max residence set size	210788.0

stage attributes

key	value
starexec-result	WORST_CASE(?, O(n^1))

output

3.16/2.10 WORST_CASE(?, O(n^1)) 3.16/2.11 proof of /export/starexec/sandbox/output/output_files/bench.koat 3.16/2.11 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.16/2.11 3.16/2.11 3.16/2.11 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 3.16/2.11 3.16/2.11 (0) CpxIntTrs 3.16/2.11 (1) Koat Proof [FINISHED, 873 ms] 3.16/2.11 (2) BOUNDS(1, n^1) 3.16/2.11 3.16/2.11 3.16/2.11 ---------------------------------------- 3.16/2.11 3.16/2.11 (0) 3.16/2.11 Obligation: 3.16/2.11 Complexity Int TRS consisting of the following rules: 3.16/2.11 eval_foo_start(v_.0, v_.01, v_3, v_tx, v_x, v_y) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_3, v_tx, v_x, v_y)) :|: TRUE 3.16/2.11 eval_foo_bb0_in(v_.0, v_.01, v_3, v_tx, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_x, v_y, v_3, v_tx, v_x, v_y)) :|: TRUE 3.16/2.11 eval_foo_bb1_in(v_.0, v_.01, v_3, v_tx, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_3, v_tx, v_x, v_y)) :|: v_.0 >= v_.01 && v_tx >= 0 3.16/2.11 eval_foo_bb1_in(v_.0, v_.01, v_3, v_tx, v_x, v_y) -> Com_1(eval_foo_bb5_in(v_.0, v_.01, v_3, v_tx, v_x, v_y)) :|: v_.0 < v_.01 3.16/2.11 eval_foo_bb1_in(v_.0, v_.01, v_3, v_tx, v_x, v_y) -> Com_1(eval_foo_bb5_in(v_.0, v_.01, v_3, v_tx, v_x, v_y)) :|: v_tx < 0 3.16/2.11 eval_foo_bb2_in(v_.0, v_.01, v_3, v_tx, v_x, v_y) -> Com_1(eval_foo_0(v_.0, v_.01, v_3, v_tx, v_x, v_y)) :|: TRUE 3.16/2.11 eval_foo_0(v_.0, v_.01, v_3, v_tx, v_x, v_y) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_.01, v_3, v_tx, v_x, v_y), eval_foo_1(v_.0, v_.01, nondef.0, v_tx, v_x, v_y)) :|: TRUE 3.16/2.11 eval_foo_1(v_.0, v_.01, v_3, v_tx, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_3, v_tx, v_x, v_y)) :|: v_3 < 0 3.16/2.11 eval_foo_1(v_.0, v_.01, v_3, v_tx, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_3, v_tx, v_x, v_y)) :|: v_3 > 0 3.16/2.11 eval_foo_1(v_.0, v_.01, v_3, v_tx, v_x, v_y) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_3, v_tx, v_x, v_y)) :|: v_3 >= 0 && v_3 <= 0 3.16/2.11 eval_foo_bb3_in(v_.0, v_.01, v_3, v_tx, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.0 - v_tx - 1, v_.01, v_3, v_tx, v_x, v_y)) :|: TRUE 3.16/2.11 eval_foo_bb4_in(v_.0, v_.01, v_3, v_tx, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.0, v_.01 + v_tx + 1, v_3, v_tx, v_x, v_y)) :|: TRUE 3.16/2.11 eval_foo_bb5_in(v_.0, v_.01, v_3, v_tx, v_x, v_y) -> Com_1(eval_foo_stop(v_.0, v_.01, v_3, v_tx, v_x, v_y)) :|: TRUE 3.16/2.11 3.16/2.11 The start-symbols are:[eval_foo_start_6] 3.16/2.11 3.16/2.11 3.16/2.11 ---------------------------------------- 3.16/2.11 3.16/2.11 (1) Koat Proof (FINISHED) 3.16/2.11 YES(?, 70*ar_1 + 70*ar_3 + 78) 3.16/2.11 3.16/2.11 3.16/2.11 3.16/2.11 Initial complexity problem: 3.16/2.11 3.16/2.11 1: T: 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5, ar_6)) 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_0 >= ar_2 /\ ar_4 >= 0 ] 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_2 >= ar_0 + 1 ] 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_4 + 1 ] 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoo0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoo00(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoo01(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoo1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_6, ar_6)) 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoo0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_2(evalfoo00(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, h), evalfoo01(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, h)) 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoo1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_5 + 1 ] 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoo1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_5 >= 1 ] 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoo1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_5 = 0 ] 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb1in(ar_0 - ar_4 - 1, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoobb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2 + ar_4 + 1, ar_3, ar_4, ar_5, ar_6)) 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) 3.16/2.11 3.16/2.11 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 <= 0 ] 3.16/2.11 3.16/2.11 start location: koat_start 3.16/2.11 3.16/2.11 leaf cost: 0 3.16/2.11 3.16/2.11 3.16/2.11 3.16/2.11 Repeatedly propagating knowledge in problem 1 produces the following problem: 3.16/2.11 3.16/2.11 2: T: 3.16/2.11 3.16/2.11 (Comp: 1, Cost: 1) evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) 3.16/2.11 3.16/2.11 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5, ar_6)) 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_0 >= ar_2 /\ ar_4 >= 0 ] 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_2 >= ar_0 + 1 ] 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoobb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_4 + 1 ] 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalfoo0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) 3.16/2.11 3.16/2.11 (Comp: ?, Cost: 1) evalfoo00(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) popout

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

job log

popout

actions

all output return to Complexity_C_Integer 2019-03-21 04.38