details

property	value
status	complete
benchmark	speed_pldi09_fig4_5.c.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n097.star.cs.uiowa.edu
space	Flores-Montoya_16

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	3.52666807175 seconds
cpu usage	7.983416697
max memory	3.53705984E8

stage attributes

key	value
output-size	150550
starexec-result	WORST_CASE(Omega(n^1), O(n^2))

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^2)) proof of /export/starexec/sandbox/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, n^2). (0) CpxIntTrs (1) Koat Proof [FINISHED, 1519 ms] (2) BOUNDS(1, n^2) (3) Loat Proof [FINISHED, 924 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_start_start(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_bb0_in(v_dir, v_i_0, v_m, v_n)) :|: TRUE eval_start_bb0_in(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_0(v_dir, v_i_0, v_m, v_n)) :|: TRUE eval_start_0(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_1(v_dir, v_i_0, v_m, v_n)) :|: TRUE eval_start_1(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_2(v_dir, v_i_0, v_m, v_n)) :|: TRUE eval_start_2(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_3(v_dir, v_i_0, v_m, v_n)) :|: TRUE eval_start_3(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_bb1_in(v_dir, v_i_0, v_m, v_n)) :|: 0 < v_m eval_start_3(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_bb6_in(v_dir, v_i_0, v_m, v_n)) :|: 0 >= v_m eval_start_bb1_in(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_bb2_in(v_dir, v_m, v_m, v_n)) :|: v_m < v_n eval_start_bb1_in(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_bb5_in(v_dir, v_i_0, v_m, v_n)) :|: v_m >= v_n eval_start_bb2_in(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_bb3_in(v_dir, v_i_0, v_m, v_n)) :|: 0 < v_i_0 && v_i_0 < v_n eval_start_bb2_in(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_bb4_in(v_dir, v_i_0, v_m, v_n)) :|: 0 >= v_i_0 eval_start_bb2_in(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_bb4_in(v_dir, v_i_0, v_m, v_n)) :|: v_i_0 >= v_n eval_start_bb3_in(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_bb2_in(v_dir, v_i_0 + 1, v_m, v_n)) :|: v_dir >= 1 && v_dir <= 1 eval_start_bb3_in(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_bb2_in(v_dir, v_i_0 - 1, v_m, v_n)) :|: v_dir < 1 eval_start_bb3_in(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_bb2_in(v_dir, v_i_0 - 1, v_m, v_n)) :|: v_dir > 1 eval_start_bb4_in(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_stop(v_dir, v_i_0, v_m, v_n)) :|: TRUE eval_start_bb5_in(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_8(v_dir, v_i_0, v_m, v_n)) :|: TRUE eval_start_8(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_9(v_dir, v_i_0, v_m, v_n)) :|: TRUE eval_start_9(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_stop(v_dir, v_i_0, v_m, v_n)) :|: TRUE eval_start_bb6_in(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_10(v_dir, v_i_0, v_m, v_n)) :|: TRUE eval_start_10(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_11(v_dir, v_i_0, v_m, v_n)) :|: TRUE eval_start_11(v_dir, v_i_0, v_m, v_n) -> Com_1(eval_start_stop(v_dir, v_i_0, v_m, v_n)) :|: TRUE The start-symbols are:[eval_start_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 10*ar_0 + 4*ar_1 + 4*ar_0*ar_1 + 4*ar_0^2 + 26) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalstartstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstartbb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalstartbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstart0(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalstart0(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstart1(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalstart1(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstart2(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalstart2(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstart3(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalstart3(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstartbb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalstart3(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstartbb6in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalstartbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstartbb2in(ar_0, ar_1, ar_0, ar_3)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalstartbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstartbb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalstartbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstartbb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 1 /\ ar_1 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalstartbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstartbb4in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_2 ] (Comp: ?, Cost: 1) evalstartbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstartbb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_1 ] (Comp: ?, Cost: 1) evalstartbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstartbb2in(ar_0, ar_1, ar_2 + 1, ar_3)) [ ar_3 = 1 ] (Comp: ?, Cost: 1) evalstartbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstartbb2in(ar_0, ar_1, ar_2 - 1, ar_3)) [ 0 >= ar_3 ] (Comp: ?, Cost: 1) evalstartbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstartbb2in(ar_0, ar_1, ar_2 - 1, ar_3)) [ ar_3 >= 2 ] (Comp: ?, Cost: 1) evalstartbb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstartstop(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalstartbb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstart8(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalstart8(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstart9(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalstart9(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalstartstop(ar_0, ar_1, ar_2, ar_3)) popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843