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