details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.38253 seconds
cpu usage	2.34372
user time	2.13651
system time	0.207211
max virtual memory	1.8273644E7
max residence set size	183512.0

stage attributes

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

output

2.11/1.35 WORST_CASE(?, O(1)) 2.11/1.36 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.11/1.36 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.11/1.36 2.11/1.36 2.11/1.36 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1). 2.11/1.36 2.11/1.36 (0) CpxIntTrs 2.11/1.36 (1) Koat Proof [FINISHED, 174 ms] 2.11/1.36 (2) BOUNDS(1, 1) 2.11/1.36 2.11/1.36 2.11/1.36 ---------------------------------------- 2.11/1.36 2.11/1.36 (0) 2.11/1.36 Obligation: 2.11/1.36 Complexity Int TRS consisting of the following rules: 2.11/1.36 eval_foo_start(v_.0, v_x, v_y) -> Com_1(eval_foo_bb0_in(v_.0, v_x, v_y)) :|: TRUE 2.11/1.36 eval_foo_bb0_in(v_.0, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_x, v_x, v_y)) :|: v_y > v_x 2.11/1.36 eval_foo_bb0_in(v_.0, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.0, v_x, v_y)) :|: v_y <= v_x 2.11/1.36 eval_foo_bb1_in(v_.0, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_x, v_y)) :|: v_.0 >= 0 2.11/1.36 eval_foo_bb1_in(v_.0, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.0, v_x, v_y)) :|: v_.0 < 0 2.11/1.36 eval_foo_bb2_in(v_.0, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.0 - v_y, v_x, v_y)) :|: TRUE 2.11/1.36 eval_foo_bb3_in(v_.0, v_x, v_y) -> Com_1(eval_foo_stop(v_.0, v_x, v_y)) :|: TRUE 2.11/1.36 2.11/1.36 The start-symbols are:[eval_foo_start_3] 2.11/1.36 2.11/1.36 2.11/1.36 ---------------------------------------- 2.11/1.36 2.11/1.36 (1) Koat Proof (FINISHED) 2.11/1.36 YES(?, 9) 2.11/1.36 2.11/1.36 2.11/1.36 2.11/1.36 Initial complexity problem: 2.11/1.36 2.11/1.36 1: T: 2.11/1.36 2.11/1.36 (Comp: ?, Cost: 1) evalfoostart(ar_0, ar_1, ar_2) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2)) 2.11/1.36 2.11/1.36 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_1)) [ ar_0 >= ar_1 + 1 ] 2.11/1.36 2.11/1.36 (Comp: ?, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2)) [ ar_1 >= ar_0 ] 2.11/1.36 2.11/1.36 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2)) [ ar_2 >= 0 ] 2.11/1.36 2.11/1.36 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_2 + 1 ] 2.11/1.36 2.11/1.36 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2 - ar_0)) 2.11/1.36 2.11/1.36 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2) -> Com_1(evalfoostop(ar_0, ar_1, ar_2)) 2.11/1.36 2.11/1.36 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalfoostart(ar_0, ar_1, ar_2)) [ 0 <= 0 ] 2.11/1.36 2.11/1.36 start location: koat_start 2.11/1.36 2.11/1.36 leaf cost: 0 2.11/1.36 2.11/1.36 2.11/1.36 2.11/1.36 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.11/1.36 2.11/1.36 2: T: 2.11/1.36 2.11/1.36 (Comp: 1, Cost: 1) evalfoostart(ar_0, ar_1, ar_2) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2)) 2.11/1.36 2.11/1.36 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_1)) [ ar_0 >= ar_1 + 1 ] 2.11/1.36 2.11/1.36 (Comp: 1, Cost: 1) evalfoobb0in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2)) [ ar_1 >= ar_0 ] 2.11/1.36 2.11/1.36 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2)) [ ar_2 >= 0 ] 2.11/1.36 2.11/1.36 (Comp: ?, Cost: 1) evalfoobb1in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_2 + 1 ] 2.11/1.36 2.11/1.36 (Comp: ?, Cost: 1) evalfoobb2in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb1in(ar_0, ar_1, ar_2 - ar_0)) 2.11/1.36 2.11/1.36 (Comp: ?, Cost: 1) evalfoobb3in(ar_0, ar_1, ar_2) -> Com_1(evalfoostop(ar_0, ar_1, ar_2)) 2.11/1.36 2.11/1.36 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalfoostart(ar_0, ar_1, ar_2)) [ 0 <= 0 ] 2.11/1.36 2.11/1.36 start location: koat_start 2.11/1.36 2.11/1.36 leaf cost: 0 2.11/1.36 2.11/1.36 2.11/1.36 2.11/1.36 A polynomial rank function with 2.11/1.36 2.11/1.36 Pol(evalfoostart) = 2 2.11/1.36 2.11/1.36 Pol(evalfoobb0in) = 2 2.11/1.36 2.11/1.36 Pol(evalfoobb1in) = 2 2.11/1.36 2.11/1.36 Pol(evalfoobb3in) = 1 2.11/1.36 2.11/1.36 Pol(evalfoobb2in) = 2 2.11/1.36 2.11/1.36 Pol(evalfoostop) = 0 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