Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 ≤ X₀
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ < 0
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₆, 73, 74, X₃, X₄, X₅, X₆)
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀-X₁, X₂+1, X₁+1, X₃, X₄, X₅, X₆)
t₅: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
Eliminate variables {X₃,X₄,X₅} that do not contribute to the problem
Found invariant X₀ ≤ X₆ ∧ X₂ ≤ 1+X₁ ∧ 74 ≤ X₂ ∧ 147 ≤ X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 75+X₀ ≤ X₂ ∧ 73 ≤ X₁ ∧ 74+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location l5
Found invariant X₀ ≤ X₆ ∧ X₂ ≤ 1+X₁ ∧ 74 ≤ X₂ ∧ 147 ≤ X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 73 ≤ X₁ for location l1
Found invariant X₀ ≤ X₆ ∧ X₂ ≤ 1+X₁ ∧ 74 ≤ X₂ ∧ 147 ≤ X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 75+X₀ ≤ X₂ ∧ 73 ≤ X₁ ∧ 74+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location l4
Found invariant 0 ≤ X₆ ∧ 74 ≤ X₂+X₆ ∧ 73 ≤ X₁+X₆ ∧ 0 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ X₂ ≤ 1+X₁ ∧ 74 ≤ X₂ ∧ 147 ≤ X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 74 ≤ X₀+X₂ ∧ 73 ≤ X₁ ∧ 73 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂, X₆
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₁₂: l0(X₀, X₁, X₂, X₆) → l2(X₀, X₁, X₂, X₆)
t₁₃: l1(X₀, X₁, X₂, X₆) → l3(X₀, X₁, X₂, X₆) :|: 0 ≤ X₀ ∧ X₀ ≤ X₆ ∧ X₂ ≤ 1+X₁ ∧ 74 ≤ X₂ ∧ 147 ≤ X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 73 ≤ X₁
t₁₄: l1(X₀, X₁, X₂, X₆) → l4(X₀, X₁, X₂, X₆) :|: X₀ < 0 ∧ X₀ ≤ X₆ ∧ X₂ ≤ 1+X₁ ∧ 74 ≤ X₂ ∧ 147 ≤ X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 73 ≤ X₁
t₁₅: l2(X₀, X₁, X₂, X₆) → l1(X₆, 73, 74, X₆)
t₁₆: l3(X₀, X₁, X₂, X₆) → l1(X₀-X₁, X₂+1, X₁+1, X₆) :|: 0 ≤ X₆ ∧ 74 ≤ X₂+X₆ ∧ 73 ≤ X₁+X₆ ∧ 0 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ X₂ ≤ 1+X₁ ∧ 74 ≤ X₂ ∧ 147 ≤ X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 74 ≤ X₀+X₂ ∧ 73 ≤ X₁ ∧ 73 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₁₇: l4(X₀, X₁, X₂, X₆) → l5(X₀, X₁, X₂, X₆) :|: X₀ ≤ X₆ ∧ X₂ ≤ 1+X₁ ∧ 74 ≤ X₂ ∧ 147 ≤ X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 75+X₀ ≤ X₂ ∧ 73 ≤ X₁ ∧ 74+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0
new bound:
2⋅X₆+149 {O(n)}
MPRF:
l3 [2⋅X₀+X₂-X₁-146 ]
l1 [2⋅X₀+X₂+2-X₁ ]
new bound:
2⋅X₆+1 {O(n)}
MPRF:
l3 [2⋅X₀+1 ]
l1 [2⋅X₀+1 ]
Overall timebound:4⋅X₆+154 {O(n)}
t₁₂: 1 {O(1)}
t₁₃: 2⋅X₆+149 {O(n)}
t₁₄: 1 {O(1)}
t₁₅: 1 {O(1)}
t₁₆: 2⋅X₆+1 {O(n)}
t₁₇: 1 {O(1)}
Overall costbound: 4⋅X₆+154 {O(n)}
t₁₂: 1 {O(1)}
t₁₃: 2⋅X₆+149 {O(n)}
t₁₄: 1 {O(1)}
t₁₅: 1 {O(1)}
t₁₆: 2⋅X₆+1 {O(n)}
t₁₇: 1 {O(1)}
t₁₂, X₀: X₀ {O(n)}
t₁₂, X₁: X₁ {O(n)}
t₁₂, X₂: X₂ {O(n)}
t₁₂, X₆: X₆ {O(n)}
t₁₃, X₀: 5⋅X₆+75 {O(n)}
t₁₃, X₁: 4⋅X₆+75 {O(n)}
t₁₃, X₂: 4⋅X₆+150 {O(n)}
t₁₃, X₆: X₆ {O(n)}
t₁₄, X₀: 6⋅X₆+75 {O(n)}
t₁₄, X₁: 4⋅X₆+148 {O(n)}
t₁₄, X₂: 4⋅X₆+150 {O(n)}
t₁₄, X₆: 2⋅X₆ {O(n)}
t₁₅, X₀: X₆ {O(n)}
t₁₅, X₁: 73 {O(1)}
t₁₅, X₂: 74 {O(1)}
t₁₅, X₆: X₆ {O(n)}
t₁₆, X₀: 5⋅X₆+75 {O(n)}
t₁₆, X₁: 4⋅X₆+75 {O(n)}
t₁₆, X₂: 4⋅X₆+76 {O(n)}
t₁₆, X₆: X₆ {O(n)}
t₁₇, X₀: 6⋅X₆+75 {O(n)}
t₁₇, X₁: 4⋅X₆+148 {O(n)}
t₁₇, X₂: 4⋅X₆+150 {O(n)}
t₁₇, X₆: 2⋅X₆ {O(n)}