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