Initial Problem

Start: f1
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: f1, f2, f300
Transitions:
t₁: f1(X₀, X₁, X₂, X₃) → f2(X₀, X₁, X₂, X₃) :|: 1+X₀ ≤ X₁ ∧ 1+X₁ ≤ X₂ ∧ X₂ ≤ X₀
t₂: f1(X₀, X₁, X₂, X₃) → f300(X₀, X₁, X₂, E) :|: 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ X₂ ∧ 1+X₁ ≤ X₂
t₃: f1(X₀, X₁, X₂, X₃) → f300(X₀, X₁, X₂, E) :|: 1+X₀ ≤ X₁ ∧ X₂ ≤ X₁
t₄: f1(X₀, X₁, X₂, X₃) → f300(X₀, X₁, X₂, E) :|: X₁ ≤ X₀
t₀: f2(X₀, X₁, X₂, X₃) → f2(1+X₀, 1+X₁, X₂-1, X₃)

Preprocessing

Cut unsatisfiable transition [t₀: f2→f2; t₁: f1→f2]

Cut unreachable locations [f2] from the program graph

Eliminate variables [E; X₃] that do not contribute to the problem

Problem after Preprocessing

Start: f1
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: f1, f300
Transitions:
t₇: f1(X₀, X₁, X₂) → f300(X₀, X₁, X₂) :|: 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ X₂ ∧ 1+X₁ ≤ X₂
t₈: f1(X₀, X₁, X₂) → f300(X₀, X₁, X₂) :|: 1+X₀ ≤ X₁ ∧ X₂ ≤ X₁
t₉: f1(X₀, X₁, X₂) → f300(X₀, X₁, X₂) :|: X₁ ≤ X₀

All Bounds

Timebounds

Overall timebound:3 {O(1)}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
t₉: 1 {O(1)}

Costbounds

Overall costbound: 3 {O(1)}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
t₉: 1 {O(1)}

Sizebounds

t₇, X₀: X₀ {O(n)}
t₇, X₁: X₁ {O(n)}
t₇, X₂: X₂ {O(n)}
t₈, X₀: X₀ {O(n)}
t₈, X₁: X₁ {O(n)}
t₈, X₂: X₂ {O(n)}
t₉, X₀: X₀ {O(n)}
t₉, X₁: X₁ {O(n)}
t₉, X₂: X₂ {O(n)}