Start: f0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: f0, f1, f10000, f2
Transitions:
0:f0(Arg_0,Arg_1) -> f1(Arg_0,Arg_0):|:Arg_0<=Arg_1 && Arg_1<=Arg_0
1:f1(Arg_0,Arg_1) -> f1(Arg_0+1,Arg_1+1)
3:f1(Arg_0,Arg_1) -> f10000(Arg_0,Arg_1):|:Arg_1+1<=Arg_0
2:f1(Arg_0,Arg_1) -> f2(Arg_0,Arg_1)
Found invariant Arg_1<=Arg_0 && Arg_0<=Arg_1 for location f2
Found invariant 1<=0 for location f10000
Found invariant Arg_1<=Arg_0 && Arg_0<=Arg_1 for location f1
Cut unsatisfiable transition 3: f1->f10000
Cut unreachable locations [f10000] from the program graph
Start: f0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: f0, f1, f2
Transitions:
0:f0(Arg_0,Arg_1) -> f1(Arg_0,Arg_0):|:Arg_0<=Arg_1 && Arg_1<=Arg_0
1:f1(Arg_0,Arg_1) -> f1(Arg_0+1,Arg_1+1):|:Arg_1<=Arg_0 && Arg_0<=Arg_1
2:f1(Arg_0,Arg_1) -> f2(Arg_0,Arg_1):|:Arg_1<=Arg_0 && Arg_0<=Arg_1
Overall timebound:inf {Infinity}
0: f0->f1: 1 {O(1)}
1: f1->f1: inf {Infinity}
2: f1->f2: 1 {O(1)}
Overall costbound: inf {Infinity}
0: f0->f1: 1 {O(1)}
1: f1->f1: inf {Infinity}
2: f1->f2: 1 {O(1)}
0: f0->f1, Arg_0: Arg_0 {O(n)}
0: f0->f1, Arg_1: Arg_0 {O(n)}