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