Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745694
details
property
value
status
complete
benchmark
t13.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n103.star.cs.uiowa.edu
space
C4B_examples
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
2.12072014809 seconds
cpu usage
3.300853529
max memory
2.93060608E8
stage attributes
key
value
output-size
93561
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, 892 ms] (2) BOUNDS(1, n^2) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_t13_start(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y) -> Com_1(eval_t13_bb0_in(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y)) :|: TRUE eval_t13_bb0_in(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y) -> Com_1(eval_t13_bb1_in(v_x, v_y, v_.1, v_1, v_2, v_x, v_y)) :|: TRUE eval_t13_bb1_in(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y) -> Com_1(eval_t13_bb2_in(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y)) :|: v_.0 > 0 eval_t13_bb1_in(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y) -> Com_1(eval_t13_bb6_in(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y)) :|: v_.0 <= 0 eval_t13_bb2_in(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y) -> Com_1(eval_t13_1(v_.0, v_.01, v_.1, v_.0 - 1, v_2, v_x, v_y)) :|: TRUE eval_t13_1(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y) -> Com_2(eval_nondet_start(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y), eval_t13_2(v_.0, v_.01, v_.1, v_1, nondef.0, v_x, v_y)) :|: TRUE eval_t13_2(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y) -> Com_1(eval_t13_bb3_in(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y)) :|: v_2 > 0 eval_t13_2(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y) -> Com_1(eval_t13_bb4_in(v_.0, v_.01, v_.01, v_1, v_2, v_x, v_y)) :|: v_2 <= 0 eval_t13_bb3_in(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y) -> Com_1(eval_t13_bb1_in(v_1, v_.01 + 1, v_.1, v_1, v_2, v_x, v_y)) :|: TRUE eval_t13_bb4_in(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y) -> Com_1(eval_t13_bb5_in(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y)) :|: v_.1 > 0 eval_t13_bb4_in(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y) -> Com_1(eval_t13_bb1_in(v_1, v_.1, v_.1, v_1, v_2, v_x, v_y)) :|: v_.1 <= 0 eval_t13_bb5_in(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y) -> Com_1(eval_t13_bb4_in(v_.0, v_.01, v_.1 - 1, v_1, v_2, v_x, v_y)) :|: TRUE eval_t13_bb6_in(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y) -> Com_1(eval_t13_stop(v_.0, v_.01, v_.1, v_1, v_2, v_x, v_y)) :|: TRUE The start-symbols are:[eval_t13_start_7] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 224*ar_1^2 + 224*ar_1*ar_3 + 63*ar_1 + 6) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalt13start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalt13bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13bb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalt13bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalt13bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalt13bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt131(ar_0, ar_1, ar_2, ar_3, ar_0 - 1, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalt1310(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalt1311(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt132(ar_0, ar_1, ar_2, ar_3, ar_4, ar_6, ar_6, ar_7)) (Comp: ?, Cost: 1) evalt131(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalt1310(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, i, ar_7), evalt1311(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, i, ar_7)) (Comp: ?, Cost: 1) evalt132(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_5 >= 1 ] (Comp: ?, Cost: 1) evalt132(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_2)) [ 0 >= ar_5 ] (Comp: ?, Cost: 1) evalt13bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13bb1in(ar_4, ar_1, ar_2 + 1, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalt13bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_7 >= 1 ] (Comp: ?, Cost: 1) evalt13bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13bb1in(ar_4, ar_1, ar_7, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_7 ] (Comp: ?, Cost: 1) evalt13bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7 - 1)) (Comp: ?, Cost: 1) evalt13bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13stop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 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) evalt13start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: 1, Cost: 1) evalt13bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13bb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalt13bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalt13bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalt13bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445