Initial Problem

Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l1(C, 0)
t₁: l1(X₀, X₁) → l1(X₀, X₁+1) :|: C+1 ≤ 0
t₂: l1(X₀, X₁) → l1(X₀, X₁+1)
t₃: l1(X₀, X₁) → l2(X₀, X₁) :|: 0 ≤ X₀ ∧ X₀+1 ≤ X₁
t₄: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀+1 ≤ 0
t₅: l1(X₀, X₁) → l2(X₀, X₁) :|: 0 ≤ X₀ ∧ X₁ ≤ X₀
t₆: l1(X₀, X₁) → l2(X₀, X₁) :|: C+1 ≤ 0 ∧ 0 ≤ X₀ ∧ X₀+1 ≤ X₁

Preprocessing

Found invariant 0 ≤ X₁ for location l2

Found invariant 0 ≤ X₁ for location l1

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l1(C, 0)
t₁: l1(X₀, X₁) → l1(X₀, X₁+1) :|: C+1 ≤ 0 ∧ 0 ≤ X₁
t₂: l1(X₀, X₁) → l1(X₀, X₁+1) :|: 0 ≤ X₁
t₃: l1(X₀, X₁) → l2(X₀, X₁) :|: 0 ≤ X₀ ∧ X₀+1 ≤ X₁ ∧ 0 ≤ X₁
t₄: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀+1 ≤ 0 ∧ 0 ≤ X₁
t₅: l1(X₀, X₁) → l2(X₀, X₁) :|: 0 ≤ X₀ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁
t₆: l1(X₀, X₁) → l2(X₀, X₁) :|: C+1 ≤ 0 ∧ 0 ≤ X₀ ∧ X₀+1 ≤ X₁ ∧ 0 ≤ X₁

Analysing control-flow refined program

Cut unsatisfiable transition t₃: l1→l2

Cut unsatisfiable transition t₆: l1→l2

Found invariant 0 ≤ X₁ for location l2

Found invariant X₁ ≤ 0 ∧ 0 ≤ X₁ for location l1

Found invariant 1 ≤ X₁ for location n_l1___1

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₅: 1 {O(1)}
t₆: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₅: 1 {O(1)}
t₆: 1 {O(1)}

Sizebounds

t₀, X₁: 0 {O(1)}