details

property	value
status	complete
benchmark	speed_pldi10_ex4.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n127.star.cs.uiowa.edu
space	C4B_examples

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.34837 seconds
cpu usage	2.31814
user time	2.14932
system time	0.168818
max virtual memory	1.8273644E7
max residence set size	180780.0

stage attributes

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

output

2.13/1.30 WORST_CASE(?, O(n^1)) 2.13/1.31 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.13/1.31 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.13/1.31 2.13/1.31 2.13/1.31 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.13/1.31 2.13/1.31 (0) CpxIntTrs 2.13/1.31 (1) Koat Proof [FINISHED, 75 ms] 2.13/1.31 (2) BOUNDS(1, n^1) 2.13/1.31 2.13/1.31 2.13/1.31 ---------------------------------------- 2.13/1.31 2.13/1.31 (0) 2.13/1.31 Obligation: 2.13/1.31 Complexity Int TRS consisting of the following rules: 2.13/1.31 eval_speed_pldi10_ex4_start(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_bb0_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n)) :|: TRUE 2.13/1.31 eval_speed_pldi10_ex4_bb0_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_bb1_in(v_n, v_.1, 1, v_flag.1, v_n)) :|: TRUE 2.13/1.31 eval_speed_pldi10_ex4_bb1_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_bb2_in(v_.0, v_.0, v_flag.0, 0, v_n)) :|: v_flag.0 > 0 2.13/1.31 eval_speed_pldi10_ex4_bb1_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_bb4_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n)) :|: v_flag.0 <= 0 2.13/1.31 eval_speed_pldi10_ex4_bb2_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_bb3_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n)) :|: v_.1 > 0 2.13/1.31 eval_speed_pldi10_ex4_bb2_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_bb1_in(v_.1, v_.1, v_flag.1, v_flag.1, v_n)) :|: v_.1 <= 0 2.13/1.31 eval_speed_pldi10_ex4_bb3_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_bb2_in(v_.0, v_.1 - 1, v_flag.0, 1, v_n)) :|: TRUE 2.13/1.31 eval_speed_pldi10_ex4_bb4_in(v_.0, v_.1, v_flag.0, v_flag.1, v_n) -> Com_1(eval_speed_pldi10_ex4_stop(v_.0, v_.1, v_flag.0, v_flag.1, v_n)) :|: TRUE 2.13/1.31 2.13/1.31 The start-symbols are:[eval_speed_pldi10_ex4_start_5] 2.13/1.31 2.13/1.31 2.13/1.31 ---------------------------------------- 2.13/1.31 2.13/1.31 (1) Koat Proof (FINISHED) 2.13/1.31 YES(?, 5*ar_1 + 8) 2.13/1.31 2.13/1.31 2.13/1.31 2.13/1.31 Initial complexity problem: 2.13/1.31 2.13/1.31 1: T: 2.13/1.31 2.13/1.31 (Comp: ?, Cost: 1) evalspeedpldi10ex4start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.13/1.31 2.13/1.31 (Comp: ?, Cost: 1) evalspeedpldi10ex4bb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb1in(ar_1, ar_1, 1, ar_3, ar_4)) 2.13/1.31 2.13/1.31 (Comp: ?, Cost: 1) evalspeedpldi10ex4bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_0, 0)) [ ar_2 >= 1 ] 2.13/1.31 2.13/1.31 (Comp: ?, Cost: 1) evalspeedpldi10ex4bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_2 ] 2.13/1.31 2.13/1.31 (Comp: ?, Cost: 1) evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb3in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_3 >= 1 ] 2.13/1.31 2.13/1.31 (Comp: ?, Cost: 1) evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb1in(ar_3, ar_1, ar_4, ar_3, ar_4)) [ 0 >= ar_3 ] 2.13/1.31 2.13/1.31 (Comp: ?, Cost: 1) evalspeedpldi10ex4bb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_3 - 1, 1)) 2.13/1.31 2.13/1.31 (Comp: ?, Cost: 1) evalspeedpldi10ex4bb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4stop(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.13/1.31 2.13/1.31 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4start(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 <= 0 ] 2.13/1.31 2.13/1.31 start location: koat_start 2.13/1.31 2.13/1.31 leaf cost: 0 2.13/1.31 2.13/1.31 2.13/1.31 2.13/1.31 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.13/1.31 2.13/1.31 2: T: 2.13/1.31 2.13/1.31 (Comp: 1, Cost: 1) evalspeedpldi10ex4start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.13/1.31 2.13/1.31 (Comp: 1, Cost: 1) evalspeedpldi10ex4bb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb1in(ar_1, ar_1, 1, ar_3, ar_4)) 2.13/1.31 2.13/1.31 (Comp: ?, Cost: 1) evalspeedpldi10ex4bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_0, 0)) [ ar_2 >= 1 ] 2.13/1.31 2.13/1.31 (Comp: ?, Cost: 1) evalspeedpldi10ex4bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_2 ] 2.13/1.31 2.13/1.31 (Comp: ?, Cost: 1) evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb3in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_3 >= 1 ] 2.13/1.31 2.13/1.31 (Comp: ?, Cost: 1) evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb1in(ar_3, ar_1, ar_4, ar_3, ar_4)) [ 0 >= ar_3 ] 2.13/1.31 2.13/1.31 (Comp: ?, Cost: 1) evalspeedpldi10ex4bb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4bb2in(ar_0, ar_1, ar_2, ar_3 - 1, 1)) 2.13/1.31 2.13/1.31 (Comp: ?, Cost: 1) evalspeedpldi10ex4bb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4stop(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.13/1.31 2.13/1.31 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex4start(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 <= 0 ] 2.13/1.31 2.13/1.31 start location: koat_start 2.13/1.31 2.13/1.31 leaf cost: 0 2.13/1.31 2.13/1.31 2.13/1.31 2.13/1.31 A polynomial rank function with 2.13/1.31 2.13/1.31 Pol(evalspeedpldi10ex4start) = 2 2.13/1.31 2.13/1.31 Pol(evalspeedpldi10ex4bb0in) = 2 2.13/1.31 2.13/1.31 Pol(evalspeedpldi10ex4bb1in) = 2 2.13/1.31 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