Initial Problem

Start: f0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: f0, f12, f8
Transitions:
t₃: f0(X₀, X₁, X₂) → f12(1, 1, 1)
t₀: f8(X₀, X₁, X₂) → f12(2, 1, X₂) :|: X₀ ≤ 2 ∧ 2 ≤ X₀
t₁: f8(X₀, X₁, X₂) → f12(X₀, 0, X₂) :|: X₀ ≤ 1
t₂: f8(X₀, X₁, X₂) → f12(X₀, 0, X₂) :|: 3 ≤ X₀

Preprocessing

Cut unreachable locations [f8] from the program graph

Eliminate variables [X₀; X₁; X₂] that do not contribute to the problem

Problem after Preprocessing

Start: f0
Program_Vars:
Temp_Vars:
Locations: f0, f12
Transitions:
t₄: f0 → f12

All Bounds

Timebounds

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

Costbounds

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

Sizebounds