Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars:
Locations: l0, l1, l2, l3
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₄, X₅, X₆, X₃, X₄, X₅, X₆)
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀+X₁, X₁+X₂, X₂-1, X₃, X₄, X₅, X₆) :|: 1 ≤ X₀
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃-1, X₄, X₅, X₆) :|: X₀ ≤ 0
t₃: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₄, X₅, X₆, X₃, X₄, X₅, X₆) :|: 1 ≤ X₃
t₄: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₃ ≤ 0
Found invariant X₂ ≤ X₆ ∧ X₀ ≤ 0 for location l2
Found invariant X₂ ≤ X₆ for location l1
Found invariant X₂ ≤ X₆ ∧ X₃ ≤ 0 ∧ X₀+X₃ ≤ 0 ∧ X₀ ≤ 0 for location l3
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars:
Locations: l0, l1, l2, l3
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₄, X₅, X₆, X₃, X₄, X₅, X₆)
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀+X₁, X₁+X₂, X₂-1, X₃, X₄, X₅, X₆) :|: 1 ≤ X₀ ∧ X₂ ≤ X₆
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃-1, X₄, X₅, X₆) :|: X₀ ≤ 0 ∧ X₂ ≤ X₆
t₃: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₄, X₅, X₆, X₃, X₄, X₅, X₆) :|: 1 ≤ X₃ ∧ X₂ ≤ X₆ ∧ X₀ ≤ 0
t₄: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₃ ≤ 0 ∧ X₂ ≤ X₆ ∧ X₀ ≤ 0
new bound:
X₃+1 {O(n)}
MPRF:
l2 [X₃ ]
l1 [X₃-1 ]
new bound:
X₃+2 {O(n)}
MPRF:
l1 [1 ]
l2 [0 ]
Found invariant X₂ ≤ X₆ ∧ X₀ ≤ X₄ ∧ X₀ ≤ 0 for location l2
Found invariant X₆ ≤ X₂ ∧ X₂ ≤ X₆ ∧ X₅ ≤ X₁ ∧ X₁ ≤ X₅ ∧ X₄ ≤ X₀ ∧ X₀ ≤ X₄ for location l1
Found invariant X₂ ≤ X₆ ∧ X₀ ≤ X₄ ∧ X₃ ≤ 0 ∧ X₀+X₃ ≤ 0 ∧ X₀ ≤ 0 for location l3
Found invariant 1+X₂ ≤ X₆ ∧ 1 ≤ X₄ for location n_l1___1
knowledge_propagation leads to new time bound X₃+2 {O(n)} for transition t₃₉: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → n_l1___1(X₀+X₁, X₁+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₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₀ ∧ X₂ ≤ X₆ ∧ X₆ ≤ X₂ ∧ X₂ ≤ X₆ ∧ X₅ ≤ X₁ ∧ X₁ ≤ X₅ ∧ X₄ ≤ X₀ ∧ X₀ ≤ X₄
knowledge_propagation leads to new time bound X₃+2 {O(n)} for transition t₄₀: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → n_l1___1(X₀+X₁, X₁+X₂, X₂-1, X₃, X₄, X₅, X₆) :|: X₂ ≤ X₆ ∧ X₁ ≤ X₅ ∧ X₅ ≤ X₁ ∧ X₂ ≤ X₆ ∧ X₆ ≤ X₂ ∧ X₀ ≤ X₄ ∧ X₄ ≤ X₀ ∧ 1 ≤ X₀ ∧ X₂ ≤ X₆ ∧ X₆ ≤ X₂ ∧ X₂ ≤ X₆ ∧ X₅ ≤ X₁ ∧ X₁ ≤ X₅ ∧ X₄ ≤ X₀ ∧ X₀ ≤ X₄
new bound:
9⋅X₃⋅X₄+11⋅X₄+X₃+2 {O(n^2)}
MPRF:
l1 [X₄+1-X₀ ]
n_l1___1 [1 ]
l2 [2⋅X₂+1-2⋅X₆ ]
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₂: X₃+2 {O(n)}
t₃: X₃+1 {O(n)}
t₄: 1 {O(1)}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₂: X₃+2 {O(n)}
t₃: 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₄: X₄ {O(n)}
t₀, X₅: X₅ {O(n)}
t₀, X₆: X₆ {O(n)}
t₁, X₃: 3⋅X₃+2 {O(n)}
t₁, X₄: 2⋅X₄ {O(n)}
t₁, X₅: 2⋅X₅ {O(n)}
t₁, X₆: 2⋅X₆ {O(n)}
t₂, X₃: 3⋅X₃+2 {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₁: 2⋅X₅ {O(n)}
t₃, X₂: 2⋅X₆ {O(n)}
t₃, X₃: 3⋅X₃+2 {O(n)}
t₃, X₄: 2⋅X₄ {O(n)}
t₃, X₅: 2⋅X₅ {O(n)}
t₃, X₆: 2⋅X₆ {O(n)}
t₄, X₃: 3⋅X₃+2 {O(n)}
t₄, X₄: 2⋅X₄ {O(n)}
t₄, X₅: 2⋅X₅ {O(n)}
t₄, X₆: 2⋅X₆ {O(n)}