Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745578
details
property
value
status
complete
benchmark
speedNestedMultipleDep.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n004.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.26546406746 seconds
cpu usage
2.225177368
max memory
2.23080448E8
stage attributes
key
value
output-size
35619
starexec-result
WORST_CASE(?, O(n^2))
output
/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^2)) proof of /export/starexec/sandbox2/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, 75 ms] (2) BOUNDS(1, n^2) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedNestedMultipleDep_start(v_1, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedNestedMultipleDep_bb0_in(v_1, v_m, v_n, v_x.0, v_y.0)) :|: TRUE eval_speedNestedMultipleDep_bb0_in(v_1, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedNestedMultipleDep_bb1_in(v_1, v_m, v_n, 0, v_y.0)) :|: TRUE eval_speedNestedMultipleDep_bb1_in(v_1, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedNestedMultipleDep_bb2_in(v_1, v_m, v_n, v_x.0, v_y.0)) :|: v_x.0 < v_n eval_speedNestedMultipleDep_bb1_in(v_1, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedNestedMultipleDep_bb5_in(v_1, v_m, v_n, v_x.0, v_y.0)) :|: v_x.0 >= v_n eval_speedNestedMultipleDep_bb2_in(v_1, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedNestedMultipleDep_bb3_in(v_x.0 + 1, v_m, v_n, v_x.0, 0)) :|: TRUE eval_speedNestedMultipleDep_bb3_in(v_1, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedNestedMultipleDep_bb4_in(v_1, v_m, v_n, v_x.0, v_y.0)) :|: v_y.0 < v_m eval_speedNestedMultipleDep_bb3_in(v_1, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedNestedMultipleDep_bb1_in(v_1, v_m, v_n, v_1, v_y.0)) :|: v_y.0 >= v_m eval_speedNestedMultipleDep_bb4_in(v_1, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedNestedMultipleDep_bb3_in(v_1, v_m, v_n, v_x.0, v_y.0 + 1)) :|: TRUE eval_speedNestedMultipleDep_bb5_in(v_1, v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedNestedMultipleDep_stop(v_1, v_m, v_n, v_x.0, v_y.0)) :|: TRUE The start-symbols are:[eval_speedNestedMultipleDep_start_5] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 3*ar_1 + 2*ar_1*ar_4 + 6) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalspeedNestedMultipleDepstart(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb1in(0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb2in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb5in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb3in(ar_0, ar_1, ar_0 + 1, 0, ar_4)) (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_4 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb1in(ar_2, ar_1, ar_2, ar_3, ar_4)) [ ar_3 >= ar_4 ] (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb3in(ar_0, ar_1, ar_2, ar_3 + 1, ar_4)) (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb5in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepstop(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(evalspeedNestedMultipleDepstart(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 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) evalspeedNestedMultipleDepstart(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: 1, Cost: 1) evalspeedNestedMultipleDepbb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb1in(0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb2in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb5in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb3in(ar_0, ar_1, ar_0 + 1, 0, ar_4)) (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_4 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb1in(ar_2, ar_1, ar_2, ar_3, ar_4)) [ ar_3 >= ar_4 ] (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepbb3in(ar_0, ar_1, ar_2, ar_3 + 1, ar_4)) (Comp: ?, Cost: 1) evalspeedNestedMultipleDepbb5in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedNestedMultipleDepstop(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(evalspeedNestedMultipleDepstart(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 C Integ Progr 85445