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