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₀, X₁+1) :|: 0 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₁ ≤ X₀
t₂: l1(X₀, X₁) → l2(X₀-2, X₁) :|: 0 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₀+1 ≤ X₁
t₀: l2(X₀, X₁) → l1(X₀+1, 1) :|: 0 ≤ X₀
Found invariant X₁ ≤ 1+X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l1
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₀, X₁+1) :|: 0 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₁ ≤ 1+X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₂: l1(X₀, X₁) → l2(X₀-2, X₁) :|: 0 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₀+1 ≤ X₁ ∧ X₁ ≤ 1+X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₀: l2(X₀, X₁) → l1(X₀+1, 1) :|: 0 ≤ X₀
Found invariant X₁ ≤ 1+X₀ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l1___2
Found invariant X₁ ≤ 1 ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l1___3
Found invariant X₁ ≤ 3+X₀ ∧ 2 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 3+X₀ ≤ X₁ ∧ 0 ≤ 1+X₀ for location n_l2___1
Overall timebound:inf {Infinity}
t₃: 1 {O(1)}
t₁: inf {Infinity}
t₂: inf {Infinity}
t₀: inf {Infinity}
Overall costbound: inf {Infinity}
t₃: 1 {O(1)}
t₁: inf {Infinity}
t₂: inf {Infinity}
t₀: inf {Infinity}
t₃, X₀: X₀ {O(n)}
t₃, X₁: X₁ {O(n)}
t₀, X₁: 1 {O(1)}