Initial Problem

Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l2(X₀, X₁)
t₂: l1(X₀, X₁) → l1(X₀-1, X₁) :|: X₀ ≤ 0
t₃: l1(X₀, X₁) → l1(X₀+1, X₁) :|: 0 < X₀
t₁: l2(X₀, X₁) → l1(X₁, X₁)

Preprocessing

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l2(X₀, X₁)
t₂: l1(X₀, X₁) → l1(X₀-1, X₁) :|: X₀ ≤ 0
t₃: l1(X₀, X₁) → l1(X₀+1, X₁) :|: 0 < X₀
t₁: l2(X₀, X₁) → l1(X₁, X₁)

Analysing control-flow refined program

Found invariant 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 2 ≤ X₀ for location n_l1___2

Found invariant X₁ ≤ 0 ∧ 1+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l1___3

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

Found invariant 2+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l1___1

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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

Costbounds

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

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)}