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₃) :|: X₃ < X₀
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ ≤ X₃
t₁: l2(X₀, X₁, X₂, X₃) → l1(X₂, X₁, X₂, X₃)
t₄: l3(X₀, X₁, X₂, X₃) → l1(X₀-1, X₁, X₂, X₃)
t₅: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃)
Eliminate variables {X₁} that do not contribute to the problem
Found invariant X₀ ≤ X₃ ∧ X₀ ≤ X₂ for location l5
Found invariant X₀ ≤ X₂ for location l1
Found invariant X₀ ≤ X₃ ∧ X₀ ≤ X₂ for location l4
Found invariant 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₀ ∧ X₀ ≤ X₂ for location l3
Start: l0
Program_Vars: X₀, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₁₂: l0(X₀, X₂, X₃) → l2(X₀, X₂, X₃)
t₁₃: l1(X₀, X₂, X₃) → l3(X₀, X₂, X₃) :|: X₃ < X₀ ∧ X₀ ≤ X₂
t₁₄: l1(X₀, X₂, X₃) → l4(X₀, X₂, X₃) :|: X₀ ≤ X₃ ∧ X₀ ≤ X₂
t₁₅: l2(X₀, X₂, X₃) → l1(X₂, X₂, X₃)
t₁₆: l3(X₀, X₂, X₃) → l1(X₀-1, X₂, X₃) :|: 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₀ ∧ X₀ ≤ X₂
t₁₇: l4(X₀, X₂, X₃) → l5(X₀, X₂, X₃) :|: X₀ ≤ X₃ ∧ X₀ ≤ X₂
new bound:
X₂+X₃ {O(n)}
MPRF:
l3 [X₀-X₃-1 ]
l1 [X₀-X₃ ]
new bound:
X₂+X₃ {O(n)}
MPRF:
l3 [X₀-X₃ ]
l1 [X₀-X₃ ]
Overall timebound:2⋅X₂+2⋅X₃+4 {O(n)}
t₁₂: 1 {O(1)}
t₁₃: X₂+X₃ {O(n)}
t₁₄: 1 {O(1)}
t₁₅: 1 {O(1)}
t₁₆: X₂+X₃ {O(n)}
t₁₇: 1 {O(1)}
Overall costbound: 2⋅X₂+2⋅X₃+4 {O(n)}
t₁₂: 1 {O(1)}
t₁₃: X₂+X₃ {O(n)}
t₁₄: 1 {O(1)}
t₁₅: 1 {O(1)}
t₁₆: X₂+X₃ {O(n)}
t₁₇: 1 {O(1)}
t₁₂, X₀: X₀ {O(n)}
t₁₂, X₂: X₂ {O(n)}
t₁₂, X₃: X₃ {O(n)}
t₁₃, X₀: 2⋅X₂+X₃ {O(n)}
t₁₃, X₂: X₂ {O(n)}
t₁₃, X₃: X₃ {O(n)}
t₁₄, X₀: 3⋅X₂+X₃ {O(n)}
t₁₄, X₂: 2⋅X₂ {O(n)}
t₁₄, X₃: 2⋅X₃ {O(n)}
t₁₅, X₀: X₂ {O(n)}
t₁₅, X₂: X₂ {O(n)}
t₁₅, X₃: X₃ {O(n)}
t₁₆, X₀: 2⋅X₂+X₃ {O(n)}
t₁₆, X₂: X₂ {O(n)}
t₁₆, X₃: X₃ {O(n)}
t₁₇, X₀: 3⋅X₂+X₃ {O(n)}
t₁₇, X₂: 2⋅X₂ {O(n)}
t₁₇, X₃: 2⋅X₃ {O(n)}