Start: f3
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: E
Locations: f0, f1, f2, f3, f4
Transitions:
1:f0(Arg_0,Arg_1,Arg_2,Arg_3) -> f0(1+Arg_0,Arg_1,Arg_0,Arg_3):|:Arg_0<=9
0:f0(Arg_0,Arg_1,Arg_2,Arg_3) -> f4(Arg_0,E,Arg_2,Arg_3):|:10<=Arg_0
2:f1(Arg_0,Arg_1,Arg_2,Arg_3) -> f0(1,Arg_1,Arg_2,Arg_3):|:E<=9 && Arg_0<=0 && 0<=Arg_0
3:f2(Arg_0,Arg_1,Arg_2,Arg_3) -> f0(2,Arg_1,Arg_2,2):|:Arg_0<=9
4:f3(Arg_0,Arg_1,Arg_2,Arg_3) -> f0(0,Arg_1,Arg_2,Arg_3)
Cut unreachable locations [f1; f2] from the program graph
Eliminate variables {E,Arg_1,Arg_2,Arg_3} that do not contribute to the problem
Found invariant Arg_0<=10 && 0<=Arg_0 for location f0
Found invariant Arg_0<=10 && 10<=Arg_0 for location f4
Start: f3
Program_Vars: Arg_0
Temp_Vars:
Locations: f0, f3, f4
Transitions:
10:f0(Arg_0) -> f0(1+Arg_0):|:Arg_0<=10 && 0<=Arg_0 && Arg_0<=9
9:f0(Arg_0) -> f4(Arg_0):|:Arg_0<=10 && 0<=Arg_0 && 10<=Arg_0
11:f3(Arg_0) -> f0(0)
new bound:
10 {O(1)}
MPRF:
f0 [10-Arg_0 ]
Overall timebound:12 {O(1)}
9: f0->f4: 1 {O(1)}
10: f0->f0: 10 {O(1)}
11: f3->f0: 1 {O(1)}
Overall costbound: 12 {O(1)}
9: f0->f4: 1 {O(1)}
10: f0->f0: 10 {O(1)}
11: f3->f0: 1 {O(1)}
9: f0->f4, Arg_0: 10 {O(1)}
10: f0->f0, Arg_0: 10 {O(1)}
11: f3->f0, Arg_0: 0 {O(1)}