Start: start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: group3, start, zip3
Transitions:
1:group3(Arg_0,Arg_1,Arg_2) -> group3(Arg_0-3,Arg_1,Arg_2):|:4<=Arg_0
2:start(Arg_0,Arg_1,Arg_2) -> zip3(Arg_0,Arg_1,Arg_2)
0:zip3(Arg_0,Arg_1,Arg_2) -> zip3(Arg_0-1,Arg_1-1,Arg_2-1):|:1<=Arg_0 && 1<=Arg_1 && 1<=Arg_2
Cut unreachable locations [group3] from the program graph
Start: start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: start, zip3
Transitions:
2:start(Arg_0,Arg_1,Arg_2) -> zip3(Arg_0,Arg_1,Arg_2)
0:zip3(Arg_0,Arg_1,Arg_2) -> zip3(Arg_0-1,Arg_1-1,Arg_2-1):|:1<=Arg_0 && 1<=Arg_1 && 1<=Arg_2
new bound:
Arg_0 {O(n)}
MPRF:
zip3 [Arg_0 ]
Overall timebound:Arg_0+1 {O(n)}
2: start->zip3: 1 {O(1)}
0: zip3->zip3: Arg_0 {O(n)}
Overall costbound: Arg_0+1 {O(n)}
2: start->zip3: 1 {O(1)}
0: zip3->zip3: Arg_0 {O(n)}
2: start->zip3, Arg_0: Arg_0 {O(n)}
2: start->zip3, Arg_1: Arg_1 {O(n)}
2: start->zip3, Arg_2: Arg_2 {O(n)}
0: zip3->zip3, Arg_0: Arg_0 {O(n)}
0: zip3->zip3, Arg_1: Arg_1 {O(n)}
0: zip3->zip3, Arg_2: Arg_2 {O(n)}