Start: n_f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: A_P, B_P
Locations: n_f0, n_f1___1, n_f1___2
Transitions:
0:n_f0(Arg_0,Arg_1) -> n_f1___2(Arg_0,Arg_1)
1:n_f1___1(Arg_0,Arg_1) -> n_f1___1(A_P,B_P):|:Arg_0<=Arg_1 && Arg_1<=Arg_0 && A_P<=B_P && B_P<=A_P
2:n_f1___2(Arg_0,Arg_1) -> n_f1___1(A_P,B_P):|:A_P<=B_P && B_P<=A_P
Found invariant Arg_1<=Arg_0 && Arg_0<=Arg_1 for location n_f1___1
Start: n_f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: A_P, B_P
Locations: n_f0, n_f1___1, n_f1___2
Transitions:
0:n_f0(Arg_0,Arg_1) -> n_f1___2(Arg_0,Arg_1)
1:n_f1___1(Arg_0,Arg_1) -> n_f1___1(A_P,B_P):|:Arg_1<=Arg_0 && Arg_0<=Arg_1 && Arg_0<=Arg_1 && Arg_1<=Arg_0 && A_P<=B_P && B_P<=A_P
2:n_f1___2(Arg_0,Arg_1) -> n_f1___1(A_P,B_P):|:A_P<=B_P && B_P<=A_P
Overall timebound:inf {Infinity}
0: n_f0->n_f1___2: 1 {O(1)}
1: n_f1___1->n_f1___1: inf {Infinity}
2: n_f1___2->n_f1___1: 1 {O(1)}
Overall costbound: inf {Infinity}
0: n_f0->n_f1___2: 1 {O(1)}
1: n_f1___1->n_f1___1: inf {Infinity}
2: n_f1___2->n_f1___1: 1 {O(1)}
0: n_f0->n_f1___2, Arg_0: Arg_0 {O(n)}
0: n_f0->n_f1___2, Arg_1: Arg_1 {O(n)}