/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, 29 ms]
(2) BOUNDS(1, 1)


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
start(A, B, C, D) -> Com_1(lbl41(E, B, C, D)) :|: A >= B && A <= B && C >= D && C <= D
lbl41(A, B, C, D) -> Com_1(stop(A, B, A, D)) :|: C >= D && C <= D
start0(A, B, C, D) -> Com_1(start(B, B, D, D)) :|: TRUE

The start-symbols are:[start0_4]


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

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



Initial Complexity Problem:

  Start:  start0  

  Program_Vars:  Arg_0, Arg_1, Arg_2, Arg_3  

  Temp_Vars:  E  

  Locations:  lbl41, start, start0, stop  

  Transitions:

  1: lbl41->stop

  0: start->lbl41

  2: start0->start  



Timebounds: 

  Overall timebound: 3 {O(1)}

  1: lbl41->stop: 1 {O(1)}

  0: start->lbl41: 1 {O(1)}

  2: start0->start: 1 {O(1)}



Costbounds:

  Overall costbound: 3 {O(1)}

  1: lbl41->stop: 1 {O(1)}

  0: start->lbl41: 1 {O(1)}

  2: start0->start: 1 {O(1)}



Sizebounds:

`Lower:

  

`Upper:

  


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

(2)
BOUNDS(1, 1)