Start: f1
Program_Vars: X₀
Temp_Vars:
Locations: f1, f4, f8
Transitions:
t₁: f1(X₀) → f4(3)
t₂: f4(X₀) → f4(3)
t₀: f8(X₀) → f8(2)
Cut unreachable locations [f8] from the program graph
Eliminate variables [X₀] that do not contribute to the problem
Start: f1
Program_Vars:
Temp_Vars:
Locations: f1, f4
Transitions:
t₅: f1 → f4
t₆: f4 → f4
Overall timebound:inf {Infinity}
t₅: 1 {O(1)}
t₆: inf {Infinity}
Overall costbound: inf {Infinity}
t₅: 1 {O(1)}
t₆: inf {Infinity}