Start: f1
Program_Vars: Arg_0
Temp_Vars:
Locations: f1, f4, f8
Transitions:
1:f1(Arg_0) -> f4(3)
2:f4(Arg_0) -> f4(3)
0:f8(Arg_0) -> f8(2)
Cut unreachable locations [f8] from the program graph
Eliminate variables {Arg_0} that do not contribute to the problem
Start: f1
Program_Vars:
Temp_Vars:
Locations: f1, f4
Transitions:
6:f1 -> f4
7:f4 -> f4
Overall timebound:inf {Infinity}
6: f1->f4: 1 {O(1)}
7: f4->f4: inf {Infinity}
Overall costbound: inf {Infinity}
6: f1->f4: 1 {O(1)}
7: f4->f4: inf {Infinity}