Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: start0
      0: start -> lbl41 : A'=free, [ A==B && C==D ], cost: 1
      1: lbl41 -> stop : C'=A, [ C==D ], cost: 1
      2: start0 -> start : A'=B, C'=D, [], cost: 1


Simplified the transitions:
  Start location: start0
    <empty>


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: start0
    <empty>


Computing complexity for remaining 0 transitions.


The final runtime is determined by this resulting transition:
  Final Guard: 
  Final Cost:  1

Obtained the following complexity w.r.t. the length of the input n:
  Complexity class: const
  Complexity value: 0

WORST_CASE(Omega(1),?)