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