Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745562
details
property
value
status
complete
benchmark
wcet2.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n075.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.30390000343 seconds
cpu usage
2.351575361
max memory
1.94936832E8
stage attributes
key
value
output-size
20663
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, 76 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_wcet2_start(v_.0, v_i, v_j.0) -> Com_1(eval_wcet2_bb0_in(v_.0, v_i, v_j.0)) :|: TRUE eval_wcet2_bb0_in(v_.0, v_i, v_j.0) -> Com_1(eval_wcet2_bb1_in(v_i, v_i, v_j.0)) :|: TRUE eval_wcet2_bb1_in(v_.0, v_i, v_j.0) -> Com_1(eval_wcet2_bb2_in(v_.0, v_i, 0)) :|: v_.0 < 5 eval_wcet2_bb1_in(v_.0, v_i, v_j.0) -> Com_1(eval_wcet2_bb5_in(v_.0, v_i, v_j.0)) :|: v_.0 >= 5 eval_wcet2_bb2_in(v_.0, v_i, v_j.0) -> Com_1(eval_wcet2_bb3_in(v_.0, v_i, v_j.0)) :|: v_.0 > 2 && v_j.0 <= 9 eval_wcet2_bb2_in(v_.0, v_i, v_j.0) -> Com_1(eval_wcet2_bb4_in(v_.0, v_i, v_j.0)) :|: v_.0 <= 2 eval_wcet2_bb2_in(v_.0, v_i, v_j.0) -> Com_1(eval_wcet2_bb4_in(v_.0, v_i, v_j.0)) :|: v_j.0 > 9 eval_wcet2_bb3_in(v_.0, v_i, v_j.0) -> Com_1(eval_wcet2_bb2_in(v_.0, v_i, v_j.0 + 1)) :|: TRUE eval_wcet2_bb4_in(v_.0, v_i, v_j.0) -> Com_1(eval_wcet2_bb1_in(v_.0 + 1, v_i, v_j.0)) :|: TRUE eval_wcet2_bb5_in(v_.0, v_i, v_j.0) -> Com_1(eval_wcet2_stop(v_.0, v_i, v_j.0)) :|: TRUE The start-symbols are:[eval_wcet2_start_3] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 56*ar_1 + 258) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalwcet2start(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb0in(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalwcet2bb0in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb1in(ar_1, ar_1, ar_2)) (Comp: ?, Cost: 1) evalwcet2bb1in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb2in(ar_0, ar_1, 0)) [ 4 >= ar_0 ] (Comp: ?, Cost: 1) evalwcet2bb1in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb5in(ar_0, ar_1, ar_2)) [ ar_0 >= 5 ] (Comp: ?, Cost: 1) evalwcet2bb2in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb3in(ar_0, ar_1, ar_2)) [ ar_0 >= 3 /\ 9 >= ar_2 ] (Comp: ?, Cost: 1) evalwcet2bb2in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb4in(ar_0, ar_1, ar_2)) [ 2 >= ar_0 ] (Comp: ?, Cost: 1) evalwcet2bb2in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb4in(ar_0, ar_1, ar_2)) [ ar_2 >= 10 ] (Comp: ?, Cost: 1) evalwcet2bb3in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb2in(ar_0, ar_1, ar_2 + 1)) (Comp: ?, Cost: 1) evalwcet2bb4in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb1in(ar_0 + 1, ar_1, ar_2)) (Comp: ?, Cost: 1) evalwcet2bb5in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2stop(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalwcet2start(ar_0, ar_1, ar_2)) [ 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) evalwcet2start(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb0in(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 1) evalwcet2bb0in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb1in(ar_1, ar_1, ar_2)) (Comp: ?, Cost: 1) evalwcet2bb1in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb2in(ar_0, ar_1, 0)) [ 4 >= ar_0 ] (Comp: ?, Cost: 1) evalwcet2bb1in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb5in(ar_0, ar_1, ar_2)) [ ar_0 >= 5 ] (Comp: ?, Cost: 1) evalwcet2bb2in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb3in(ar_0, ar_1, ar_2)) [ ar_0 >= 3 /\ 9 >= ar_2 ] (Comp: ?, Cost: 1) evalwcet2bb2in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb4in(ar_0, ar_1, ar_2)) [ 2 >= ar_0 ] (Comp: ?, Cost: 1) evalwcet2bb2in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb4in(ar_0, ar_1, ar_2)) [ ar_2 >= 10 ] (Comp: ?, Cost: 1) evalwcet2bb3in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb2in(ar_0, ar_1, ar_2 + 1)) (Comp: ?, Cost: 1) evalwcet2bb4in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2bb1in(ar_0 + 1, ar_1, ar_2)) (Comp: ?, Cost: 1) evalwcet2bb5in(ar_0, ar_1, ar_2) -> Com_1(evalwcet2stop(ar_0, ar_1, ar_2))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445