Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744388
details
property
value
status
complete
benchmark
Loopus2014_ex2.c.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
Flores-Montoya_16
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
3.25282692909 seconds
cpu usage
7.945515833
max memory
3.89103616E8
stage attributes
key
value
output-size
95510
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox/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, 1127 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_start_start(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_bb0_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: TRUE eval_start_bb0_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_0(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: TRUE eval_start_0(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_1(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: TRUE eval_start_1(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_2(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: TRUE eval_start_2(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_3(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: TRUE eval_start_3(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_4(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: TRUE eval_start_4(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_5(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: TRUE eval_start_5(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_6(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: TRUE eval_start_6(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start__critedge_in(v_1, v_2, v_6, v_m, v_m, 0, v_n_1)) :|: TRUE eval_start__critedge_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_bb1_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: v_i_0 > 0 eval_start__critedge_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_bb6_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: v_i_0 <= 0 eval_start_bb1_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_8(v_i_0 - 1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: TRUE eval_start_8(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_9(v_1, nondef_0, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: TRUE eval_start_9(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_bb2_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: v_2 > 0 eval_start_9(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_bb3_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_0)) :|: v_2 <= 0 eval_start_bb2_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start__critedge_in(v_1, v_2, v_6, v_1, v_m, v_n_0 + 1, v_n_1)) :|: TRUE eval_start_bb3_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_bb4_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: v_n_1 > 0 eval_start_bb3_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start__critedge_in(v_1, v_2, v_6, v_1, v_m, v_n_1, v_n_1)) :|: v_n_1 <= 0 eval_start_bb4_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_12(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: TRUE eval_start_12(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_13(v_1, v_2, nondef_1, v_i_0, v_m, v_n_0, v_n_1)) :|: TRUE eval_start_13(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_bb5_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: v_6 > 0 eval_start_13(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start__critedge_in(v_1, v_2, v_6, v_1, v_m, v_n_1, v_n_1)) :|: v_6 <= 0 eval_start_bb5_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_bb3_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1 - 1)) :|: TRUE eval_start_bb6_in(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1) -> Com_1(eval_start_stop(v_1, v_2, v_6, v_i_0, v_m, v_n_0, v_n_1)) :|: TRUE The start-symbols are:[eval_start_start_7] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 48*ar_1 + 13) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalstartstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstartbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalstartbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstart0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalstart0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstart1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalstart1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstart2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalstart2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstart3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalstart3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstart4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalstart4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstart5(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalstart5(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstart6(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalstart6(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstartcritedgein(ar_1, ar_1, 0, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalstartcritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstartbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalstartcritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstartbb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalstartbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstart8(ar_0, ar_1, ar_2, ar_0 - 1, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalstart8(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstart9(ar_0, ar_1, ar_2, ar_3, h, ar_5, ar_6)) (Comp: ?, Cost: 1) evalstart9(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstartbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_4 >= 1 ] (Comp: ?, Cost: 1) evalstart9(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstartbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_2, ar_6)) [ 0 >= ar_4 ] (Comp: ?, Cost: 1) evalstartbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstartcritedgein(ar_3, ar_1, ar_2 + 1, ar_3, ar_4, ar_5, ar_6)) (Comp: ?, Cost: 1) evalstartbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstartbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6)) [ ar_5 >= 1 ] (Comp: ?, Cost: 1) evalstartbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6) -> Com_1(evalstartcritedgein(ar_3, ar_1, ar_5, ar_3, ar_4, ar_5, ar_6)) [ 0 >= ar_5 ]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843