details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	3.74786615372 seconds
cpu usage	7.65007288
max memory	3.4285568E8

stage attributes

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

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/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^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 226 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 1846 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_wcet1_start(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_bb0_in(v_1, v_i_0, v_j_0, v_j_3, v_n)) :|: TRUE eval_wcet1_bb0_in(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_0(v_1, v_i_0, v_j_0, v_j_3, v_n)) :|: TRUE eval_wcet1_0(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_1(v_1, v_i_0, v_j_0, v_j_3, v_n)) :|: TRUE eval_wcet1_1(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_2(v_1, v_i_0, v_j_0, v_j_3, v_n)) :|: TRUE eval_wcet1_2(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_3(v_1, v_i_0, v_j_0, v_j_3, v_n)) :|: TRUE eval_wcet1_3(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_bb1_in(v_1, v_n, 0, v_j_3, v_n)) :|: v_n >= 1 eval_wcet1_3(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_bb5_in(v_1, v_i_0, v_j_0, v_j_3, v_n)) :|: v_n < 1 eval_wcet1_bb1_in(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_4(v_1, v_i_0, v_j_0, v_j_3, v_n)) :|: TRUE eval_wcet1_4(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_5(nondef_0, v_i_0, v_j_0, v_j_3, v_n)) :|: TRUE eval_wcet1_5(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_bb2_in(v_1, v_i_0, v_j_0, v_j_3, v_n)) :|: v_1 > 0 eval_wcet1_5(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_bb3_in(v_1, v_i_0, v_j_0, v_j_3, v_n)) :|: v_1 <= 0 eval_wcet1_bb2_in(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_bb4_in(v_1, v_i_0, v_j_0, 0, v_n)) :|: v_j_0 + 1 >= v_n eval_wcet1_bb2_in(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_bb4_in(v_1, v_i_0, v_j_0, v_j_0 + 1, v_n)) :|: v_j_0 + 1 < v_n eval_wcet1_bb3_in(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_bb4_in(v_1, v_i_0, v_j_0, 0, v_n)) :|: v_j_0 - 1 <= 0 eval_wcet1_bb3_in(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_bb4_in(v_1, v_i_0, v_j_0, v_j_0 - 1, v_n)) :|: v_j_0 - 1 > 0 eval_wcet1_bb4_in(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_bb1_in(v_1, v_i_0 - 1, v_j_3, v_j_3, v_n)) :|: v_i_0 - 1 > 0 eval_wcet1_bb4_in(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_bb5_in(v_1, v_i_0, v_j_0, v_j_3, v_n)) :|: v_i_0 - 1 <= 0 eval_wcet1_bb5_in(v_1, v_i_0, v_j_0, v_j_3, v_n) -> Com_1(eval_wcet1_stop(v_1, v_i_0, v_j_0, v_j_3, v_n)) :|: TRUE The start-symbols are:[eval_wcet1_start_5] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 9*ar_0 + 19) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalwcet1start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet1bb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalwcet1bb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet10(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalwcet10(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet11(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalwcet11(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet12(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalwcet12(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet13(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalwcet13(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet1bb1in(ar_0, ar_0, 0, ar_3, ar_4)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalwcet13(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet1bb5in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalwcet1bb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet14(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalwcet14(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet15(ar_0, ar_1, ar_2, f, ar_4)) (Comp: ?, Cost: 1) evalwcet15(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_3 >= 1 ] (Comp: ?, Cost: 1) evalwcet15(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet1bb3in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_3 ] (Comp: ?, Cost: 1) evalwcet1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet1bb4in(ar_0, ar_1, ar_2, ar_3, 0)) [ ar_2 + 1 >= ar_0 ] (Comp: ?, Cost: 1) evalwcet1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet1bb4in(ar_0, ar_1, ar_2, ar_3, ar_2 + 1)) [ ar_0 >= ar_2 + 2 ] (Comp: ?, Cost: 1) evalwcet1bb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet1bb4in(ar_0, ar_1, ar_2, ar_3, 0)) [ 1 >= ar_2 ] (Comp: ?, Cost: 1) evalwcet1bb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet1bb4in(ar_0, ar_1, ar_2, ar_3, ar_2 - 1)) [ ar_2 >= 2 ] (Comp: ?, Cost: 1) evalwcet1bb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet1bb1in(ar_0, ar_1 - 1, ar_4, ar_3, ar_4)) [ ar_1 >= 2 ] (Comp: ?, Cost: 1) evalwcet1bb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet1bb5in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 1 >= ar_1 ] (Comp: ?, Cost: 1) evalwcet1bb5in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalwcet1stop(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(evalwcet1start(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843