Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745613
details
property
value
status
complete
benchmark
jama_ex1.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n050.star.cs.uiowa.edu
space
ABC
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.28923106194 seconds
cpu usage
2.404935121
max memory
1.92884736E8
stage attributes
key
value
output-size
19591
starexec-result
WORST_CASE(?, O(n^2))
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^2)) 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^2). (0) CpxIntTrs (1) Koat Proof [FINISHED, 85 ms] (2) BOUNDS(1, n^2) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_jama_ex1_start(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb0_in(v_i.0, v_j.0, v_n)) :|: TRUE eval_jama_ex1_bb0_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb1_in(1, v_j.0, v_n)) :|: TRUE eval_jama_ex1_bb1_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb2_in(v_i.0, 1, v_n)) :|: v_i.0 <= v_n eval_jama_ex1_bb1_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb5_in(v_i.0, v_j.0, v_n)) :|: v_i.0 > v_n eval_jama_ex1_bb2_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb3_in(v_i.0, v_j.0, v_n)) :|: v_j.0 <= v_n eval_jama_ex1_bb2_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb4_in(v_i.0, v_j.0, v_n)) :|: v_j.0 > v_n eval_jama_ex1_bb3_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb2_in(v_i.0, v_j.0 + 1, v_n)) :|: TRUE eval_jama_ex1_bb4_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb1_in(v_i.0 + 1, v_j.0, v_n)) :|: TRUE eval_jama_ex1_bb5_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_stop(v_i.0, v_j.0, v_n)) :|: TRUE The start-symbols are:[eval_jama_ex1_start_3] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 9*ar_1 + 2*ar_1^2 + 6) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evaljamaex1start(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb0in(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evaljamaex1bb0in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb1in(1, ar_1, ar_2)) (Comp: ?, Cost: 1) evaljamaex1bb1in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb2in(ar_0, ar_1, 1)) [ ar_1 >= ar_0 ] (Comp: ?, Cost: 1) evaljamaex1bb1in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb5in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb2in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb3in(ar_0, ar_1, ar_2)) [ ar_1 >= ar_2 ] (Comp: ?, Cost: 1) evaljamaex1bb2in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb4in(ar_0, ar_1, ar_2)) [ ar_2 >= ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb3in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb2in(ar_0, ar_1, ar_2 + 1)) (Comp: ?, Cost: 1) evaljamaex1bb4in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb1in(ar_0 + 1, ar_1, ar_2)) (Comp: ?, Cost: 1) evaljamaex1bb5in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1stop(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1start(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) evaljamaex1start(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb0in(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 1) evaljamaex1bb0in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb1in(1, ar_1, ar_2)) (Comp: ?, Cost: 1) evaljamaex1bb1in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb2in(ar_0, ar_1, 1)) [ ar_1 >= ar_0 ] (Comp: ?, Cost: 1) evaljamaex1bb1in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb5in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb2in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb3in(ar_0, ar_1, ar_2)) [ ar_1 >= ar_2 ] (Comp: ?, Cost: 1) evaljamaex1bb2in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb4in(ar_0, ar_1, ar_2)) [ ar_2 >= ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb3in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb2in(ar_0, ar_1, ar_2 + 1)) (Comp: ?, Cost: 1) evaljamaex1bb4in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1bb1in(ar_0 + 1, ar_1, ar_2)) (Comp: ?, Cost: 1) evaljamaex1bb5in(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1stop(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evaljamaex1start(ar_0, ar_1, ar_2)) [ 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 C Integ Progr 85445