Start: f0
Program_Vars: Arg_0
Temp_Vars: B, C
Locations: f0, f1
Transitions:
0:f0(Arg_0) -> f1(B):|:2<=B
1:f1(Arg_0) -> f1(B):|:B<=1 && 0<=1+B && 2<=C
Eliminate variables {Arg_0} that do not contribute to the problem
Start: f0
Program_Vars:
Temp_Vars: B, C
Locations: f0, f1
Transitions:
5:f0 -> f1:|:2<=B
6:f1 -> f1:|:B<=1 && 0<=1+B && 2<=C
Overall timebound:inf {Infinity}
5: f0->f1: 1 {O(1)}
6: f1->f1: inf {Infinity}
Overall costbound: inf {Infinity}
5: f0->f1: 1 {O(1)}
6: f1->f1: inf {Infinity}