Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀) → l3(X₀)
t₄: l1(X₀) → l4(X₀-1)
t₅: l2(X₀) → l5(X₀)
t₁: l3(X₀) → l4(X₀-1)
t₂: l4(X₀) → l1(X₀) :|: 2 ≤ X₀
t₃: l4(X₀) → l2(X₀) :|: X₀ ≤ 1
Found invariant X₀ ≤ 1 for location l2
Found invariant X₀ ≤ 1 for location l5
Found invariant 2 ≤ X₀ for location l1
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀) → l3(X₀)
t₄: l1(X₀) → l4(X₀-1) :|: 2 ≤ X₀
t₅: l2(X₀) → l5(X₀) :|: X₀ ≤ 1
t₁: l3(X₀) → l4(X₀-1)
t₂: l4(X₀) → l1(X₀) :|: 2 ≤ X₀
t₃: l4(X₀) → l2(X₀) :|: X₀ ≤ 1
new bound:
X₀+2 {O(n)}
MPRF:
l4 [X₀-1 ]
l1 [X₀-1 ]
new bound:
X₀+2 {O(n)}
MPRF:
l4 [X₀-1 ]
l1 [X₀-2 ]
Overall timebound:2⋅X₀+8 {O(n)}
t₀: 1 {O(1)}
t₄: X₀+2 {O(n)}
t₅: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₀+2 {O(n)}
t₃: 1 {O(1)}
Overall costbound: 2⋅X₀+8 {O(n)}
t₀: 1 {O(1)}
t₄: X₀+2 {O(n)}
t₅: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₀+2 {O(n)}
t₃: 1 {O(1)}
t₀, X₀: X₀ {O(n)}
t₄, X₀: X₀+1 {O(n)}
t₅, X₀: 2⋅X₀+2 {O(n)}
t₁, X₀: X₀+1 {O(n)}
t₂, X₀: X₀+1 {O(n)}
t₃, X₀: 2⋅X₀+2 {O(n)}