Trying to load file: main.koat Initial Control flow graph problem: Start location: f0 0: f8 -> f12 : A'=2, B'=1, [ A==2 ], cost: 1 1: f8 -> f12 : B'=0, [ 1>=A ], cost: 1 2: f8 -> f12 : B'=0, [ A>=3 ], cost: 1 3: f0 -> f12 : A'=1, B'=1, C'=1, [], cost: 1 Simplified the transitions: Start location: f0 Final control flow graph problem, now checking costs for infinitely many models: Start location: f0 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),?)