Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744629
details
property
value
status
complete
benchmark
Loopus2011_ex1.c.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
Flores-Montoya_16
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
3.12863397598 seconds
cpu usage
7.540046623
max memory
4.33287168E8
stage attributes
key
value
output-size
51782
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 934 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 1521 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_ex1_start(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_bb0_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: TRUE eval_ex1_bb0_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_0(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: TRUE eval_ex1_0(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_1(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: TRUE eval_ex1_1(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_2(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: TRUE eval_ex1_2(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_3(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: TRUE eval_ex1_3(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_4(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: TRUE eval_ex1_4(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_5(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: TRUE eval_ex1_5(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_6(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: TRUE eval_ex1_6(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_bb1_in(v_3, v_8, 0, v_i_1, v_j_0, v_n)) :|: TRUE eval_ex1_bb1_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_bb2_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: v_i_0 < v_n eval_ex1_bb1_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_bb6_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: v_i_0 >= v_n eval_ex1_bb2_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_bb3_in(v_3, v_8, v_i_0, v_i_0 + 1, 0, v_n)) :|: TRUE eval_ex1_bb3_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_bb4_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: v_i_1 < v_n eval_ex1_bb3_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1__critedge_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: v_i_1 >= v_n eval_ex1_bb4_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_9(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: TRUE eval_ex1_9(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_10(nondef_0, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: TRUE eval_ex1_10(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_bb5_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: v_3 > 0 eval_ex1_10(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1__critedge_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: v_3 <= 0 eval_ex1_bb5_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_bb3_in(v_3, v_8, v_i_0, v_i_1 + 1, v_j_0 + 1, v_n)) :|: TRUE eval_ex1__critedge_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_15(v_3, v_i_1 - 1, v_i_0, v_i_1, v_j_0, v_n)) :|: TRUE eval_ex1_15(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_16(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: TRUE eval_ex1_16(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_bb1_in(v_3, v_8, v_8, v_i_1, v_j_0, v_n)) :|: v_j_0 > 0 eval_ex1_16(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_bb1_in(v_3, v_8, v_i_1, v_i_1, v_j_0, v_n)) :|: v_j_0 <= 0 eval_ex1_bb6_in(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n) -> Com_1(eval_ex1_stop(v_3, v_8, v_i_0, v_i_1, v_j_0, v_n)) :|: TRUE The start-symbols are:[eval_ex1_start_6] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 182*ar_1 + 13) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalex1start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex1bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalex1bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex10(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalex10(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex11(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalex11(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalex12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex13(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalex13(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex14(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalex14(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex15(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalex15(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex16(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalex16(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex1bb1in(0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalex1bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalex1bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex1bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalex1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex1bb3in(ar_0, ar_1, ar_0 + 1, 0, ar_4, ar_5)) (Comp: ?, Cost: 1) evalex1bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex1bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_1 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalex1bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex1critedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_2 >= ar_1 ] (Comp: ?, Cost: 1) evalex1bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex19(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalex19(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex110(ar_0, ar_1, ar_2, ar_3, g, ar_5)) (Comp: ?, Cost: 1) evalex110(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex1bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_4 >= 1 ] (Comp: ?, Cost: 1) evalex110(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalex1critedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_4 ]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843