Start: n_f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: A_P, B_P
Locations: n_f0, n_f5___1
Transitions:
0:n_f0(Arg_0,Arg_1) -> n_f5___1(A_P,B_P):|:A_P<=B_P && B_P<=A_P
Eliminate variables {Arg_0,Arg_1} that do not contribute to the problem
Start: n_f0
Program_Vars:
Temp_Vars: A_P, B_P
Locations: n_f0, n_f5___1
Transitions:
2:n_f0 -> n_f5___1:|:A_P<=B_P && B_P<=A_P
Overall timebound:1 {O(1)}
2: n_f0->n_f5___1: 1 {O(1)}
Overall costbound: 1 {O(1)}
2: n_f0->n_f5___1: 1 {O(1)}