Start: f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: C
Locations: f0, f12, f4, f5
Transitions:
2:f0(Arg_0,Arg_1) -> f4(C,0)
6:f4(Arg_0,Arg_1) -> f12(0,Arg_1):|:Arg_0<=0 && 0<=Arg_0
0:f4(Arg_0,Arg_1) -> f5(Arg_0,Arg_1):|:Arg_0+1<=0
1:f4(Arg_0,Arg_1) -> f5(Arg_0,Arg_1):|:1<=Arg_0
3:f5(Arg_0,Arg_1) -> f4(C,Arg_1+1):|:Arg_1<=3
4:f5(Arg_0,Arg_1) -> f4(C,Arg_1+1):|:5<=Arg_1
5:f5(Arg_0,Arg_1) -> f4(C,1):|:Arg_1<=4 && 4<=Arg_1
Found invariant Arg_1<=4 && 0<=Arg_1 for location f5
Found invariant Arg_1<=4 && Arg_1<=4+Arg_0 && Arg_0+Arg_1<=4 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && Arg_0<=0 && 0<=Arg_0 for location f12
Found invariant Arg_1<=4 && 0<=Arg_1 for location f4
Cut unsatisfiable transition 4: f5->f4
Start: f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: C
Locations: f0, f12, f4, f5
Transitions:
2:f0(Arg_0,Arg_1) -> f4(C,0)
6:f4(Arg_0,Arg_1) -> f12(0,Arg_1):|:Arg_1<=4 && 0<=Arg_1 && Arg_0<=0 && 0<=Arg_0
0:f4(Arg_0,Arg_1) -> f5(Arg_0,Arg_1):|:Arg_1<=4 && 0<=Arg_1 && Arg_0+1<=0
1:f4(Arg_0,Arg_1) -> f5(Arg_0,Arg_1):|:Arg_1<=4 && 0<=Arg_1 && 1<=Arg_0
3:f5(Arg_0,Arg_1) -> f4(C,Arg_1+1):|:Arg_1<=4 && 0<=Arg_1 && Arg_1<=3
5:f5(Arg_0,Arg_1) -> f4(C,1):|:Arg_1<=4 && 0<=Arg_1 && Arg_1<=4 && 4<=Arg_1
Overall timebound:inf {Infinity}
2: f0->f4: 1 {O(1)}
0: f4->f5: inf {Infinity}
1: f4->f5: inf {Infinity}
6: f4->f12: 1 {O(1)}
3: f5->f4: inf {Infinity}
5: f5->f4: inf {Infinity}
Overall costbound: inf {Infinity}
2: f0->f4: 1 {O(1)}
0: f4->f5: inf {Infinity}
1: f4->f5: inf {Infinity}
6: f4->f12: 1 {O(1)}
3: f5->f4: inf {Infinity}
5: f5->f4: inf {Infinity}
2: f0->f4, Arg_1: 0 {O(1)}
0: f4->f5, Arg_1: 4 {O(1)}
1: f4->f5, Arg_1: 4 {O(1)}
6: f4->f12, Arg_0: 0 {O(1)}
6: f4->f12, Arg_1: 4 {O(1)}
3: f5->f4, Arg_1: 4 {O(1)}
5: f5->f4, Arg_1: 1 {O(1)}