Initial Problem

Start: f0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: f0, f1, f10000, f2
Transitions:
t₀: f0(X₀, X₁) → f1(X₀, X₀) :|: X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₁: f1(X₀, X₁) → f1(1+X₀, 1+X₁)
t₃: f1(X₀, X₁) → f10000(X₀, X₁) :|: 1+X₁ ≤ X₀
t₂: f1(X₀, X₁) → f2(X₀, X₁)

Preprocessing

Found invariant 1 ≤ 0 for location f10000

Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location f1

Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location f2

Cut unsatisfiable transition [t₃: f1→f10000]

Cut unreachable locations [f10000] from the program graph

Problem after Preprocessing

Start: f0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: f0, f1, f2
Transitions:
t₀: f0(X₀, X₁) → f1(X₀, X₀) :|: X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₁: f1(X₀, X₁) → f1(1+X₀, 1+X₁) :|: X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₂: f1(X₀, X₁) → f2(X₀, X₁) :|: X₁ ≤ X₀ ∧ X₀ ≤ X₁

Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location f1

Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location f1_v1

Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location f2

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₂: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₂: 1 {O(1)}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₀ {O(n)}