Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars: G, H, I
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l1(H, G, I, X₃, X₄, X₅) :|: 2+G ≤ 0
t₁: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l1(H, G, I, X₃, X₄, X₅) :|: 0 ≤ G
t₂: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l1(H, -1, X₂, 0, G, I)
Eliminate variables {H,I,X₀,X₁,X₂,X₃,X₄,X₅} that do not contribute to the problem
Start: l0
Program_Vars:
Temp_Vars: G
Locations: l0, l1
Transitions:
t₃: l0 → l1 :|: 2+G ≤ 0
t₄: l0 → l1 :|: 0 ≤ G
t₅: l0 → l1
Overall timebound:3 {O(1)}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₅: 1 {O(1)}
Overall costbound: 3 {O(1)}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₅: 1 {O(1)}