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
Found invariant Arg_1<=Arg_0 && 1<=Arg_0 for location n_l1___1
knowledge_propagation leads to new time bound 1 {O(1)} for transition 15:n_l1___1(Arg_0,Arg_1) -> n_l1___1(Arg_0,Arg_1+1-2*Arg_0):|:Arg_1<=Arg_0 && 1<=Arg_0 && Arg_1<=Arg_0 && 2<=3*Arg_0+Arg_1 && Arg_0+Arg_1<=1 && 1<=Arg_0+Arg_1 && Arg_1<=Arg_0
new bound:
1 {O(1)}
cfr-program:
Start: l0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: l0, l1, n_l1___1
Transitions:
0:l0(Arg_0,Arg_1) -> l1(Arg_0,Arg_1)
16:l1(Arg_0,Arg_1) -> n_l1___1(Arg_0,Arg_1+1-2*Arg_0):|:1<=Arg_0+Arg_1 && Arg_1<=Arg_0
15:n_l1___1(Arg_0,Arg_1) -> n_l1___1(Arg_0,Arg_1+1-2*Arg_0):|:Arg_1<=Arg_0 && 1<=Arg_0 && Arg_1<=Arg_0 && 2<=3*Arg_0+Arg_1 && Arg_0+Arg_1<=1 && 1<=Arg_0+Arg_1 && Arg_1<=Arg_0
Overall timebound:3 {O(1)}
0: l0->l1: 1 {O(1)}
16: l1->n_l1___1: 1 {O(1)}
15: n_l1___1->n_l1___1: 1 {O(1)}
Overall costbound: 3 {O(1)}
0: l0->l1: 1 {O(1)}
16: l1->n_l1___1: 1 {O(1)}
15: n_l1___1->n_l1___1: 1 {O(1)}
0: l0->l1, Arg_0: Arg_0 {O(n)}
0: l0->l1, Arg_1: Arg_1 {O(n)}
16: l1->n_l1___1, Arg_0: Arg_0 {O(n)}
16: l1->n_l1___1, Arg_1: 3*Arg_0 {O(n)}
15: n_l1___1->n_l1___1, Arg_0: Arg_0 {O(n)}
15: n_l1___1->n_l1___1, Arg_1: 3*Arg_0 {O(n)}