Start: f1
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: E
Locations: f1, f2, f300
Transitions:
1:f1(Arg_0,Arg_1,Arg_2,Arg_3) -> f2(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_0 && 1+Arg_0<=Arg_1 && 1+Arg_1<=Arg_2
2:f1(Arg_0,Arg_1,Arg_2,Arg_3) -> f300(Arg_0,Arg_1,Arg_2,E):|:1+Arg_1<=Arg_2 && 1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_2
3:f1(Arg_0,Arg_1,Arg_2,Arg_3) -> f300(Arg_0,Arg_1,Arg_2,E):|:1+Arg_0<=Arg_1 && Arg_2<=Arg_1
4:f1(Arg_0,Arg_1,Arg_2,Arg_3) -> f300(Arg_0,Arg_1,Arg_2,E):|:Arg_1<=Arg_0
0:f2(Arg_0,Arg_1,Arg_2,Arg_3) -> f2(1+Arg_0,1+Arg_1,Arg_2-1,Arg_3)
Cut unsatisfiable transition 1: f1->f2
Cut unsatisfiable transition 0: f2->f2
Cut unreachable locations [f2] from the program graph
Eliminate variables {E,Arg_3} that do not contribute to the problem
Start: f1
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: f1, f300
Transitions:
8:f1(Arg_0,Arg_1,Arg_2) -> f300(Arg_0,Arg_1,Arg_2):|:1+Arg_1<=Arg_2 && 1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_2
9:f1(Arg_0,Arg_1,Arg_2) -> f300(Arg_0,Arg_1,Arg_2):|:1+Arg_0<=Arg_1 && Arg_2<=Arg_1
10:f1(Arg_0,Arg_1,Arg_2) -> f300(Arg_0,Arg_1,Arg_2):|:Arg_1<=Arg_0
Overall timebound:3 {O(1)}
8: f1->f300: 1 {O(1)}
9: f1->f300: 1 {O(1)}
10: f1->f300: 1 {O(1)}
Overall costbound: 3 {O(1)}
8: f1->f300: 1 {O(1)}
9: f1->f300: 1 {O(1)}
10: f1->f300: 1 {O(1)}