details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.7263379097 seconds
cpu usage	2.677988892
max memory	3.0007296E8

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_c_complexity /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) proof of /export/starexec/sandbox/output/output_files/bench.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 480 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speed_pldi10_ex3_start(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb0_in(v_.0, v_.1, v_3, v_n)) :|: TRUE eval_speed_pldi10_ex3_bb0_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb1_in(v_n, v_.1, v_3, v_n)) :|: TRUE eval_speed_pldi10_ex3_bb1_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb2_in(v_.0, v_.1, v_3, v_n)) :|: v_.0 > 0 eval_speed_pldi10_ex3_bb1_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb6_in(v_.0, v_.1, v_3, v_n)) :|: v_.0 <= 0 eval_speed_pldi10_ex3_bb2_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb3_in(v_.0, v_.0 - 1, v_3, v_n)) :|: TRUE eval_speed_pldi10_ex3_bb3_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb4_in(v_.0, v_.1, v_3, v_n)) :|: v_.1 > 0 eval_speed_pldi10_ex3_bb3_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb1_in(v_.1, v_.1, v_3, v_n)) :|: v_.1 <= 0 eval_speed_pldi10_ex3_bb4_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_2(v_.0, v_.1, v_3, v_n)) :|: TRUE eval_speed_pldi10_ex3_2(v_.0, v_.1, v_3, v_n) -> Com_2(eval_nondet_start(v_.0, v_.1, v_3, v_n), eval_speed_pldi10_ex3_3(v_.0, v_.1, nondef.0, v_n)) :|: TRUE eval_speed_pldi10_ex3_3(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb1_in(v_.1, v_.1, v_3, v_n)) :|: v_3 > 0 eval_speed_pldi10_ex3_3(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb5_in(v_.0, v_.1, v_3, v_n)) :|: v_3 <= 0 eval_speed_pldi10_ex3_bb5_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_bb3_in(v_.0, v_.1 - 1, v_3, v_n)) :|: TRUE eval_speed_pldi10_ex3_bb6_in(v_.0, v_.1, v_3, v_n) -> Com_1(eval_speed_pldi10_ex3_stop(v_.0, v_.1, v_3, v_n)) :|: TRUE The start-symbols are:[eval_speed_pldi10_ex3_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 88*ar_1 + 6) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalspeedpldi10ex3start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalspeedpldi10ex3bb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb1in(ar_1, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalspeedpldi10ex3bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb2in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalspeedpldi10ex3bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb6in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalspeedpldi10ex3bb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb3in(ar_0, ar_1, ar_0 - 1, ar_3, ar_4)) (Comp: ?, Cost: 1) evalspeedpldi10ex3bb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_2 >= 1 ] (Comp: ?, Cost: 1) evalspeedpldi10ex3bb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb1in(ar_2, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_2 ] (Comp: ?, Cost: 1) evalspeedpldi10ex3bb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex32(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalspeedpldi10ex320(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalspeedpldi10ex321(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex33(ar_0, ar_1, ar_2, ar_4, ar_4)) (Comp: ?, Cost: 1) evalspeedpldi10ex32(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_2(evalspeedpldi10ex320(ar_0, ar_1, ar_2, ar_3, f), evalspeedpldi10ex321(ar_0, ar_1, ar_2, ar_3, f)) (Comp: ?, Cost: 1) evalspeedpldi10ex33(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb1in(ar_2, ar_1, ar_2, ar_3, ar_4)) [ ar_3 >= 1 ] (Comp: ?, Cost: 1) evalspeedpldi10ex33(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb5in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_3 ] (Comp: ?, Cost: 1) evalspeedpldi10ex3bb5in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb3in(ar_0, ar_1, ar_2 - 1, ar_3, ar_4)) (Comp: ?, Cost: 1) evalspeedpldi10ex3bb6in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3stop(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3start(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: (Comp: 1, Cost: 1) evalspeedpldi10ex3start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: 1, Cost: 1) evalspeedpldi10ex3bb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb1in(ar_1, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalspeedpldi10ex3bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb2in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalspeedpldi10ex3bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpldi10ex3bb6in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_0 ] popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445