Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₃: l0(X₀, X₁, X₂) → l1(1, 1, 1)
t₀: l2(X₀, X₁, X₂) → l1(2, 1, X₂) :|: X₀ ≤ 2 ∧ 2 ≤ X₀
t₁: l2(X₀, X₁, X₂) → l1(X₀, 0, X₂) :|: X₀ ≤ 1
t₂: l2(X₀, X₁, X₂) → l1(X₀, 0, X₂) :|: 3 ≤ X₀

Preprocessing

Cut unreachable locations [l2] from the program graph

Eliminate variables {X₀,X₁,X₂} that do not contribute to the problem

Problem after Preprocessing

Start: l0
Program_Vars:
Temp_Vars:
Locations: l0, l1
Transitions:
t₅: l0 → l1

All Bounds

Timebounds

Overall timebound:1 {O(1)}
t₅: 1 {O(1)}

Costbounds

Overall costbound: 1 {O(1)}
t₅: 1 {O(1)}

Sizebounds