Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f
      0: f -> g : [], cost: 1
      1: g -> g : A'=2*A, B'=-1+B, [ B>0 ], cost: 1
      2: g -> h : [ 0>=B ], cost: 1
      3: h -> h : A'=-1+A, [ A>0 ], cost: 1

Eliminating 1 self-loops for location g
  Self-Loop 1 has the metering function: B, resulting in the new transition 4.
  Removing the self-loops: 1.
Eliminating 1 self-loops for location h
  Self-Loop 3 has the metering function: A, resulting in the new transition 5.
  Removing the self-loops: 3.

Removed all Self-loops using metering functions (where possible):
  Start location: f
      0: f -> g : [], cost: 1
      4: g -> [3] : A'=2^B*A, B'=0, [ B>0 ], cost: B
      5: h -> [4] : A'=0, [ A>0 ], cost: A
      2: [3] -> h : [ 0>=B ], cost: 1


Applied simple chaining:
  Start location: f
      0: f -> [4] : A'=0, B'=0, [ B>0 && 0>=0 && 2^B*A>0 ], cost: 2+B+2^B*A


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f
      0: f -> [4] : A'=0, B'=0, [ B>0 && 0>=0 && 2^B*A>0 ], cost: 2+B+2^B*A


Computing complexity for remaining 1 transitions.

  Found configuration with infinitely models for cost: 2+B+2^B*A
  and guard: B>0 && 0>=0 && 2^B*A>0:
  B: Pos, A: Pos

Found new complexity EXP, because: Found infinity configuration.


The final runtime is determined by this resulting transition:
  Final Guard: B>0 && 0>=0 && 2^B*A>0
  Final Cost:  2+B+2^B*A

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

WORST_CASE(EXP,?)