details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	3.20456504822 seconds
cpu usage	5.389452104
max memory	3.14052608E8

stage attributes

key	value
output-size	43187
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, 176 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 787 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_wcet2_start(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_bb0_in(v__0, v_4, v_i, v_j_0)) :|: TRUE eval_wcet2_bb0_in(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_0(v__0, v_4, v_i, v_j_0)) :|: TRUE eval_wcet2_0(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_1(v__0, v_4, v_i, v_j_0)) :|: TRUE eval_wcet2_1(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_2(v__0, v_4, v_i, v_j_0)) :|: TRUE eval_wcet2_2(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_3(v__0, v_4, v_i, v_j_0)) :|: TRUE eval_wcet2_3(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_bb1_in(v_i, v_4, v_i, v_j_0)) :|: TRUE eval_wcet2_bb1_in(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_bb2_in(v__0, v_4, v_i, 0)) :|: v__0 < 5 eval_wcet2_bb1_in(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_bb5_in(v__0, v_4, v_i, v_j_0)) :|: v__0 >= 5 eval_wcet2_bb2_in(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_bb3_in(v__0, v_4, v_i, v_j_0)) :|: v__0 > 2 && v_j_0 <= 9 eval_wcet2_bb2_in(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_bb4_in(v__0, v_4, v_i, v_j_0)) :|: v__0 <= 2 eval_wcet2_bb2_in(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_bb4_in(v__0, v_4, v_i, v_j_0)) :|: v_j_0 > 9 eval_wcet2_bb3_in(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_bb2_in(v__0, v_4, v_i, v_j_0 + 1)) :|: TRUE eval_wcet2_bb4_in(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_7(v__0, v__0 + 1, v_i, v_j_0)) :|: TRUE eval_wcet2_7(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_8(v__0, v_4, v_i, v_j_0)) :|: TRUE eval_wcet2_8(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_bb1_in(v_4, v_4, v_i, v_j_0)) :|: TRUE eval_wcet2_bb5_in(v__0, v_4, v_i, v_j_0) -> Com_1(eval_wcet2_stop(v__0, v_4, v_i, v_j_0)) :|: TRUE The start-symbols are:[eval_wcet2_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 100*ar_1 + 460) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalwcet2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet2bb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwcet2bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet20(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwcet20(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet21(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwcet21(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet22(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwcet22(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet23(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwcet23(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet2bb1in(ar_1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwcet2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet2bb2in(ar_0, ar_1, 0, ar_3)) [ 4 >= ar_0 ] (Comp: ?, Cost: 1) evalwcet2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet2bb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 5 ] (Comp: ?, Cost: 1) evalwcet2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 /\ 9 >= ar_2 ] (Comp: ?, Cost: 1) evalwcet2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet2bb4in(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ] (Comp: ?, Cost: 1) evalwcet2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 10 ] (Comp: ?, Cost: 1) evalwcet2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet2bb2in(ar_0, ar_1, ar_2 + 1, ar_3)) (Comp: ?, Cost: 1) evalwcet2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet27(ar_0, ar_1, ar_2, ar_0 + 1)) (Comp: ?, Cost: 1) evalwcet27(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet28(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwcet28(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet2bb1in(ar_3, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwcet2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet2stop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwcet2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843