Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅)
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ < X₃
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₃ ≤ X₀
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₄, X₅, X₂, X₃, X₄, X₅)
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, X₁+1, X₂, X₃, X₄, X₅) :|: X₁ < X₂ ∧ X₁ < X₂
t₅: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀+1, X₁+1, X₂, X₃, X₄, X₅) :|: X₁ < X₂ ∧ X₂ ≤ X₁
t₆: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₂ ≤ X₁ ∧ X₁ < X₂
t₇: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀+1, X₁, X₂, X₃, X₄, X₅) :|: X₂ ≤ X₁ ∧ X₂ ≤ X₁
t₈: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅)
Cut unsatisfiable transition t₅: l3→l1
Cut unsatisfiable transition t₆: l3→l1
Found invariant X₅ ≤ X₁ ∧ X₄ ≤ X₀ ∧ X₃ ≤ X₀ for location l5
Found invariant X₅ ≤ X₁ ∧ X₄ ≤ X₀ for location l1
Found invariant X₅ ≤ X₁ ∧ X₄ ≤ X₀ ∧ X₃ ≤ X₀ for location l4
Found invariant X₅ ≤ X₁ ∧ 1+X₄ ≤ X₃ ∧ X₄ ≤ X₀ ∧ 1+X₀ ≤ X₃ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅)
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ < X₃ ∧ X₅ ≤ X₁ ∧ X₄ ≤ X₀
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₃ ≤ X₀ ∧ X₅ ≤ X₁ ∧ X₄ ≤ X₀
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₄, X₅, X₂, X₃, X₄, X₅)
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, X₁+1, X₂, X₃, X₄, X₅) :|: X₁ < X₂ ∧ X₁ < X₂ ∧ X₅ ≤ X₁ ∧ 1+X₄ ≤ X₃ ∧ X₄ ≤ X₀ ∧ 1+X₀ ≤ X₃
t₇: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀+1, X₁, X₂, X₃, X₄, X₅) :|: X₂ ≤ X₁ ∧ X₂ ≤ X₁ ∧ X₅ ≤ X₁ ∧ 1+X₄ ≤ X₃ ∧ X₄ ≤ X₀ ∧ 1+X₀ ≤ X₃
t₈: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₅ ≤ X₁ ∧ X₄ ≤ X₀ ∧ X₃ ≤ X₀
new bound:
X₂+X₅ {O(n)}
MPRF:
l3 [X₂-X₁ ]
l1 [X₂-X₁ ]
new bound:
X₃+X₄ {O(n)}
MPRF:
l3 [X₃-X₀ ]
l1 [X₃-X₀ ]
knowledge_propagation leads to new time bound X₂+X₃+X₄+X₅+1 {O(n)} for transition t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ < X₃ ∧ X₅ ≤ X₁ ∧ X₄ ≤ X₀
Overall timebound:2⋅X₂+2⋅X₃+2⋅X₄+2⋅X₅+5 {O(n)}
t₀: 1 {O(1)}
t₂: X₂+X₃+X₄+X₅+1 {O(n)}
t₃: 1 {O(1)}
t₁: 1 {O(1)}
t₄: X₂+X₅ {O(n)}
t₇: X₃+X₄ {O(n)}
t₈: 1 {O(1)}
Overall costbound: 2⋅X₂+2⋅X₃+2⋅X₄+2⋅X₅+5 {O(n)}
t₀: 1 {O(1)}
t₂: X₂+X₃+X₄+X₅+1 {O(n)}
t₃: 1 {O(1)}
t₁: 1 {O(1)}
t₄: X₂+X₅ {O(n)}
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₃: X₃ {O(n)}
t₀, X₄: X₄ {O(n)}
t₀, X₅: X₅ {O(n)}
t₂, X₀: 2⋅X₄+X₃ {O(n)}
t₂, X₁: 2⋅X₅+X₂ {O(n)}
t₂, X₂: X₂ {O(n)}
t₂, X₃: X₃ {O(n)}
t₂, X₄: X₄ {O(n)}
t₂, X₅: X₅ {O(n)}
t₃, X₀: 3⋅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₄: 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₃: X₃ {O(n)}
t₁, X₄: X₄ {O(n)}
t₁, X₅: X₅ {O(n)}
t₄, X₀: 2⋅X₄+X₃ {O(n)}
t₄, X₁: 2⋅X₅+X₂ {O(n)}
t₄, X₂: 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₁: 2⋅X₅+X₂ {O(n)}
t₇, X₂: X₂ {O(n)}
t₇, X₃: X₃ {O(n)}
t₇, X₄: X₄ {O(n)}
t₇, X₅: X₅ {O(n)}
t₈, X₀: 3⋅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₄: 2⋅X₄ {O(n)}
t₈, X₅: 2⋅X₅ {O(n)}