Initial Problem

Start: n_f0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: n_f0, n_f1___1, n_f1___2
Transitions:
0:n_f0(Arg_0,Arg_1,Arg_2) -> n_f1___2(Arg_0,Arg_1,Arg_2)
1:n_f1___1(Arg_0,Arg_1,Arg_2) -> n_f1___1(Arg_0+Arg_1,Arg_1-Arg_2,Arg_2+1):|:Arg_1+Arg_2<=Arg_0 && 1<=Arg_0
2:n_f1___2(Arg_0,Arg_1,Arg_2) -> n_f1___1(Arg_0+Arg_1,Arg_1-Arg_2,Arg_2+1):|:1<=Arg_0

Preprocessing

Problem after Preprocessing

Start: n_f0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: n_f0, n_f1___1, n_f1___2
Transitions:
0:n_f0(Arg_0,Arg_1,Arg_2) -> n_f1___2(Arg_0,Arg_1,Arg_2)
1:n_f1___1(Arg_0,Arg_1,Arg_2) -> n_f1___1(Arg_0+Arg_1,Arg_1-Arg_2,Arg_2+1):|:Arg_1+Arg_2<=Arg_0 && 1<=Arg_0
2:n_f1___2(Arg_0,Arg_1,Arg_2) -> n_f1___1(Arg_0+Arg_1,Arg_1-Arg_2,Arg_2+1):|:1<=Arg_0

All Bounds

Timebounds

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)}

Costbounds

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)}

Sizebounds

0: n_f0->n_f1___2, Arg_0: Arg_0 {O(n)}
0: n_f0->n_f1___2, Arg_1: Arg_1 {O(n)}
0: n_f0->n_f1___2, Arg_2: Arg_2 {O(n)}
2: n_f1___2->n_f1___1, Arg_0: Arg_0+Arg_1 {O(n)}
2: n_f1___2->n_f1___1, Arg_1: Arg_1+Arg_2 {O(n)}
2: n_f1___2->n_f1___1, Arg_2: Arg_2+1 {O(n)}