Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l1(1, X₁)
t₁: l1(X₀, X₁) → l1(X₀+1, 10-X₀) :|: X₀ ≤ 10
t₂: l1(X₀, X₁) → l2(X₀, X₁) :|: 11 ≤ X₀
Eliminate variables {X₁} that do not contribute to the problem
Found invariant X₀ ≤ 11 ∧ 11 ≤ X₀ for location l2
Found invariant X₀ ≤ 11 ∧ 1 ≤ X₀ for location l1
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₆: l0(X₀) → l1(1)
t₇: l1(X₀) → l1(X₀+1) :|: X₀ ≤ 10 ∧ X₀ ≤ 11 ∧ 1 ≤ X₀
t₈: l1(X₀) → l2(X₀) :|: 11 ≤ X₀ ∧ X₀ ≤ 11 ∧ 1 ≤ X₀
new bound:
13 {O(1)}
Overall timebound:15 {O(1)}
t₆: 1 {O(1)}
t₇: 13 {O(1)}
t₈: 1 {O(1)}
Overall costbound: 15 {O(1)}
t₆: 1 {O(1)}
t₇: 13 {O(1)}
t₈: 1 {O(1)}
t₆, X₀: 1 {O(1)}
t₇, X₀: 11 {O(1)}
t₈, X₀: 11 {O(1)}