Start: l0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: l0, l1
Transitions:
0:l0(Arg_0,Arg_1) -> l1(Arg_0,Arg_1)
1:l1(Arg_0,Arg_1) -> l1(Arg_0,Arg_1+1-2*Arg_0):|:Arg_1<=Arg_0 && 1<=Arg_0+Arg_1
Start: l0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: l0, l1
Transitions:
0:l0(Arg_0,Arg_1) -> l1(Arg_0,Arg_1)
1:l1(Arg_0,Arg_1) -> l1(Arg_0,Arg_1+1-2*Arg_0):|:Arg_1<=Arg_0 && 1<=Arg_0+Arg_1
Overall timebound:inf {Infinity}
0: l0->l1: 1 {O(1)}
1: l1->l1: inf {Infinity}
Overall costbound: inf {Infinity}
0: l0->l1: 1 {O(1)}
1: l1->l1: inf {Infinity}
0: l0->l1, Arg_0: Arg_0 {O(n)}
0: l0->l1, Arg_1: Arg_1 {O(n)}
1: l1->l1, Arg_0: Arg_0 {O(n)}
1: l1->l1, Arg_1: 6*Arg_0 {O(n)}