Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉
Temp_Vars: K, L
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → l1(K, 0, 0, X₃, X₄, X₅, X₆, X₇, X₈, X₉)
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → l1(X₀, X₁+1, X₂+1, 1, X₄, X₅, X₆, X₇, X₈, X₉) :|: X₂ ≤ 15
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → l1(X₀, X₁, X₂+1, 0, X₄, X₅, X₆, X₇, X₈, X₉) :|: X₂ ≤ 15
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → l2(X₀, X₁, X₂, X₃, X₁, X₁, K, L, L, L) :|: 16 ≤ X₂
Eliminate variables {K,L,X₀,X₁,X₃,X₄,X₅,X₆,X₇,X₈,X₉} that do not contribute to the problem
Found invariant X₀ ≤ 16 ∧ 16 ≤ X₀ for location l2
Found invariant X₀ ≤ 16 ∧ 0 ≤ X₀ for location l1
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₈: l0(X₀) → l1(0)
t₉: l1(X₀) → l1(X₀+1) :|: X₀ ≤ 15 ∧ X₀ ≤ 16 ∧ 0 ≤ X₀
t₁₀: l1(X₀) → l1(X₀+1) :|: X₀ ≤ 15 ∧ X₀ ≤ 16 ∧ 0 ≤ X₀
t₁₁: l1(X₀) → l2(X₀) :|: 16 ≤ X₀ ∧ X₀ ≤ 16 ∧ 0 ≤ X₀
new bound:
16 {O(1)}
new bound:
16 {O(1)}
Overall timebound:34 {O(1)}
t₈: 1 {O(1)}
t₉: 16 {O(1)}
t₁₀: 16 {O(1)}
t₁₁: 1 {O(1)}
Overall costbound: 34 {O(1)}
t₈: 1 {O(1)}
t₉: 16 {O(1)}
t₁₀: 16 {O(1)}
t₁₁: 1 {O(1)}
t₈, X₀: 0 {O(1)}
t₉, X₀: 16 {O(1)}
t₁₀, X₀: 16 {O(1)}
t₁₁, X₀: 16 {O(1)}