Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745937
details
property
value
status
complete
benchmark
sipmabubble.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n099.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.9208509922 seconds
cpu usage
2.635086482
max memory
2.32493056E8
stage attributes
key
value
output-size
34195
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, 377 ms] (2) BOUNDS(1, n^2) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_sipmabubble_start(v_i.0, v_j.0, v_n) -> Com_1(eval_sipmabubble_bb0_in(v_i.0, v_j.0, v_n)) :|: TRUE eval_sipmabubble_bb0_in(v_i.0, v_j.0, v_n) -> Com_1(eval_sipmabubble_bb1_in(v_n, v_j.0, v_n)) :|: TRUE eval_sipmabubble_bb1_in(v_i.0, v_j.0, v_n) -> Com_1(eval_sipmabubble_bb2_in(v_i.0, 0, v_n)) :|: v_i.0 >= 0 eval_sipmabubble_bb1_in(v_i.0, v_j.0, v_n) -> Com_1(eval_sipmabubble_bb5_in(v_i.0, v_j.0, v_n)) :|: v_i.0 < 0 eval_sipmabubble_bb2_in(v_i.0, v_j.0, v_n) -> Com_1(eval_sipmabubble_bb3_in(v_i.0, v_j.0, v_n)) :|: v_j.0 <= v_i.0 - 1 eval_sipmabubble_bb2_in(v_i.0, v_j.0, v_n) -> Com_1(eval_sipmabubble_bb4_in(v_i.0, v_j.0, v_n)) :|: v_j.0 > v_i.0 - 1 eval_sipmabubble_bb3_in(v_i.0, v_j.0, v_n) -> Com_1(eval_sipmabubble_2(v_i.0, v_j.0, v_n)) :|: TRUE eval_sipmabubble_2(v_i.0, v_j.0, v_n) -> Com_2(eval_nondet_start(v_i.0, v_j.0, v_n), eval_sipmabubble_3(v_i.0, v_j.0, v_n)) :|: TRUE eval_sipmabubble_3(v_i.0, v_j.0, v_n) -> Com_2(eval_nondet_start(v_i.0, v_j.0, v_n), eval_sipmabubble_4(v_i.0, v_j.0, v_n)) :|: TRUE eval_sipmabubble_4(v_i.0, v_j.0, v_n) -> Com_1(eval_sipmabubble_bb2_in(v_i.0, v_j.0 + 1, v_n)) :|: TRUE eval_sipmabubble_bb4_in(v_i.0, v_j.0, v_n) -> Com_1(eval_sipmabubble_bb1_in(v_i.0 - 1, v_j.0, v_n)) :|: TRUE eval_sipmabubble_bb5_in(v_i.0, v_j.0, v_n) -> Com_1(eval_sipmabubble_stop(v_i.0, v_j.0, v_n)) :|: TRUE The start-symbols are:[eval_sipmabubble_start_3] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 84*ar_1 + 75*ar_1^2 + 15) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalsipmabubblestart(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblebb0in(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalsipmabubblebb0in(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblebb1in(ar_1, ar_1, ar_2)) (Comp: ?, Cost: 1) evalsipmabubblebb1in(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblebb2in(ar_0, ar_1, 0)) [ ar_0 >= 0 ] (Comp: ?, Cost: 1) evalsipmabubblebb1in(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblebb5in(ar_0, ar_1, ar_2)) [ 0 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalsipmabubblebb2in(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblebb3in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalsipmabubblebb2in(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblebb4in(ar_0, ar_1, ar_2)) [ ar_2 >= ar_0 ] (Comp: ?, Cost: 1) evalsipmabubblebb3in(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubble2(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalsipmabubble2(ar_0, ar_1, ar_2) -> Com_2(evalnondetstart(ar_0, ar_1, ar_2), evalsipmabubble3(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalsipmabubble3(ar_0, ar_1, ar_2) -> Com_2(evalnondetstart(ar_0, ar_1, ar_2), evalsipmabubble4(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalsipmabubble4(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblebb2in(ar_0, ar_1, ar_2 + 1)) (Comp: ?, Cost: 1) evalsipmabubblebb4in(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblebb1in(ar_0 - 1, ar_1, ar_2)) (Comp: ?, Cost: 1) evalsipmabubblebb5in(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblestop(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblestart(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) evalsipmabubblestart(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblebb0in(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 1) evalsipmabubblebb0in(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblebb1in(ar_1, ar_1, ar_2)) (Comp: ?, Cost: 1) evalsipmabubblebb1in(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblebb2in(ar_0, ar_1, 0)) [ ar_0 >= 0 ] (Comp: ?, Cost: 1) evalsipmabubblebb1in(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblebb5in(ar_0, ar_1, ar_2)) [ 0 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalsipmabubblebb2in(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblebb3in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalsipmabubblebb2in(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubblebb4in(ar_0, ar_1, ar_2)) [ ar_2 >= ar_0 ] (Comp: ?, Cost: 1) evalsipmabubblebb3in(ar_0, ar_1, ar_2) -> Com_1(evalsipmabubble2(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