/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(?, O(1))
proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1).

(0) CpxIntTrs
(1) Koat2 Proof [FINISHED, 31 ms]
(2) BOUNDS(1, 1)


----------------------------------------

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f11(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f54(A, B, B + A, D, E, F, G, H, I, J, K)) :|: A >= B
f11(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f54(A, B, B - A, D, E, F, G, H, I, J, K)) :|: B >= 1 + A
f38(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f11(L, B, C, D, E, D, D, H, I, J, K)) :|: D >= 1 + E
f38(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f11(L, B, C, D, E, D, D, M, I, J, K)) :|: E >= D
f0(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f38(1, 2, C, 1, 10, F, G, H, 10, 2, L)) :|: TRUE

The start-symbols are:[f0_11]


----------------------------------------

(1) Koat2 Proof (FINISHED)
YES( ?, 5 {O(1)})



Initial Complexity Problem:

  Start:  f0  

  Program_Vars:  Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6, Arg_7, Arg_8, Arg_9, Arg_10  

  Temp_Vars:  L, M  

  Locations:  f0, f11, f38, f54  

  Transitions:

  4: f0->f38

  0: f11->f54

  1: f11->f54

  2: f38->f11

  3: f38->f11  



Timebounds: 

  Overall timebound: 5 {O(1)}

  4: f0->f38: 1 {O(1)}

  0: f11->f54: 1 {O(1)}

  1: f11->f54: 1 {O(1)}

  2: f38->f11: 1 {O(1)}

  3: f38->f11: 1 {O(1)}



Costbounds:

  Overall costbound: 5 {O(1)}

  4: f0->f38: 1 {O(1)}

  0: f11->f54: 1 {O(1)}

  1: f11->f54: 1 {O(1)}

  2: f38->f11: 1 {O(1)}

  3: f38->f11: 1 {O(1)}



Sizebounds:

`Lower:

  

`Upper:

  


----------------------------------------

(2)
BOUNDS(1, 1)