Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745747
details
property
value
status
complete
benchmark
t08.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n102.star.cs.uiowa.edu
space
C4B_examples
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.34253001213 seconds
cpu usage
2.478777869
max memory
1.98967296E8
stage attributes
key
value
output-size
17375
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, 75 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_t08_start(v_.0, v_.1, v_y, v_z) -> Com_1(eval_t08_bb0_in(v_.0, v_.1, v_y, v_z)) :|: TRUE eval_t08_bb0_in(v_.0, v_.1, v_y, v_z) -> Com_1(eval_t08_bb1_in(v_y, v_.1, v_y, v_z)) :|: TRUE eval_t08_bb1_in(v_.0, v_.1, v_y, v_z) -> Com_1(eval_t08_bb2_in(v_.0, v_.1, v_y, v_z)) :|: v_z > v_.0 eval_t08_bb1_in(v_.0, v_.1, v_y, v_z) -> Com_1(eval_t08_bb3_in(v_.0, v_.0, v_y, v_z)) :|: v_z <= v_.0 eval_t08_bb2_in(v_.0, v_.1, v_y, v_z) -> Com_1(eval_t08_bb1_in(v_.0 + 1, v_.1, v_y, v_z)) :|: TRUE eval_t08_bb3_in(v_.0, v_.1, v_y, v_z) -> Com_1(eval_t08_bb4_in(v_.0, v_.1, v_y, v_z)) :|: v_.1 > 2 eval_t08_bb3_in(v_.0, v_.1, v_y, v_z) -> Com_1(eval_t08_bb5_in(v_.0, v_.1, v_y, v_z)) :|: v_.1 <= 2 eval_t08_bb4_in(v_.0, v_.1, v_y, v_z) -> Com_1(eval_t08_bb3_in(v_.0, v_.1 - 3, v_y, v_z)) :|: TRUE eval_t08_bb5_in(v_.0, v_.1, v_y, v_z) -> Com_1(eval_t08_stop(v_.0, v_.1, v_y, v_z)) :|: TRUE The start-symbols are:[eval_t08_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 14*ar_1 + 14*ar_2 + 11) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalt08start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalt08bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb1in(ar_1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalt08bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalt08bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb3in(ar_0, ar_1, ar_2, ar_0)) [ ar_0 >= ar_2 ] (Comp: ?, Cost: 1) evalt08bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb1in(ar_0 + 1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalt08bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 >= 3 ] (Comp: ?, Cost: 1) evalt08bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb5in(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_3 ] (Comp: ?, Cost: 1) evalt08bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb3in(ar_0, ar_1, ar_2, ar_3 - 3)) (Comp: ?, Cost: 1) evalt08bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08stop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08start(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: (Comp: 1, Cost: 1) evalt08start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 1) evalt08bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb1in(ar_1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalt08bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalt08bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb3in(ar_0, ar_1, ar_2, ar_0)) [ ar_0 >= ar_2 ] (Comp: ?, Cost: 1) evalt08bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb1in(ar_0 + 1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalt08bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 >= 3 ] (Comp: ?, Cost: 1) evalt08bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb5in(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_3 ] (Comp: ?, Cost: 1) evalt08bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08bb3in(ar_0, ar_1, ar_2, ar_3 - 3)) (Comp: ?, Cost: 1) evalt08bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08stop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt08start(ar_0, ar_1, ar_2, ar_3)) [ 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