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₅) → 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₁ ∧ 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₁+X₄, 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₀ ∧ 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₀+X₂, 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
Eliminate variables {X₃,X₅} that do not contribute to the problem
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l5
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l4
Start: l0
Program_Vars: X₀, X₁, X₂, X₄
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₂₃: l0(X₀, X₁, X₂, X₄) → l2(X₀, X₁, X₂, X₄)
t₂₄: l1(X₀, X₁, X₂, X₄) → l3(X₀, X₁, X₂, X₄) :|: X₀ < X₁
t₂₅: l1(X₀, X₁, X₂, X₄) → l3(X₀, X₁, X₂, X₄) :|: X₁ < X₀
t₂₆: l1(X₀, X₁, X₂, X₄) → l4(X₀, X₁, X₂, X₄) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀
t₂₇: l2(X₀, X₁, X₂, X₄) → l1(X₂, X₄, X₂, X₄)
t₂₈: l3(X₀, X₁, X₂, X₄) → l1(X₀, X₁+X₄, X₂, X₄) :|: X₁ < X₀ ∧ X₁ < X₀
t₂₉: l3(X₀, X₁, X₂, X₄) → l1(X₀+X₂, X₁, X₂, X₄) :|: X₀ ≤ X₁ ∧ X₀ ≤ X₁
t₃₀: l4(X₀, X₁, X₂, X₄) → l5(X₀, X₁, X₂, X₄) :|: X₁ ≤ X₀ ∧ X₀ ≤ X₁
Found invariant X₄ ≤ X₁ ∧ 1+X₂ ≤ X₁ for location n_l1___6
Found invariant X₄ ≤ X₁ ∧ 1+X₄ ≤ X₀ ∧ 1+X₂ ≤ X₁ ∧ 2+X₂ ≤ X₀ ∧ 1+X₁ ≤ X₀ for location n_l3___4
Found invariant X₄ ≤ X₁ ∧ 1+X₂ ≤ X₁ ∧ 1+X₀ ≤ X₁ for location n_l3___5
Found invariant 1+X₄ ≤ X₀ ∧ X₂ ≤ X₀ for location n_l1___3
Found invariant X₄ ≤ X₁ ∧ 1+X₂ ≤ X₄ ∧ X₁ ≤ X₄ ∧ 1+X₀ ≤ X₄ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁ for location n_l3___8
Found invariant X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l5
Found invariant 2+X₄ ≤ X₁ ∧ 1+X₄ ≤ X₀ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ for location n_l3___2
Found invariant X₄ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location l1
Found invariant X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l4
Found invariant 1+X₄ ≤ X₀ ∧ X₂ ≤ X₀ ∧ 1+X₁ ≤ X₀ for location n_l3___1
Found invariant 1+X₄ ≤ X₂ ∧ X₄ ≤ X₁ ∧ 1+X₄ ≤ X₀ ∧ X₁ ≤ X₄ ∧ X₂ ≤ X₀ ∧ 1+X₁ ≤ X₂ ∧ X₀ ≤ X₂ ∧ 1+X₁ ≤ X₀ for location n_l3___7
Overall timebound:inf {Infinity}
t₂₃: 1 {O(1)}
t₂₄: inf {Infinity}
t₂₅: inf {Infinity}
t₂₆: 1 {O(1)}
t₂₇: 1 {O(1)}
t₂₈: inf {Infinity}
t₂₉: inf {Infinity}
t₃₀: 1 {O(1)}
Overall costbound: inf {Infinity}
t₂₃: 1 {O(1)}
t₂₄: inf {Infinity}
t₂₅: inf {Infinity}
t₂₆: 1 {O(1)}
t₂₇: 1 {O(1)}
t₂₈: inf {Infinity}
t₂₉: inf {Infinity}
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₂: 2⋅X₂ {O(n)}
t₂₄, X₄: 2⋅X₄ {O(n)}
t₂₅, X₂: 2⋅X₂ {O(n)}
t₂₅, X₄: 2⋅X₄ {O(n)}
t₂₆, X₂: 5⋅X₂ {O(n)}
t₂₆, X₄: 5⋅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₄: 2⋅X₄ {O(n)}
t₂₉, X₂: 2⋅X₂ {O(n)}
t₂₉, X₄: 2⋅X₄ {O(n)}
t₃₀, X₂: 5⋅X₂ {O(n)}
t₃₀, X₄: 5⋅X₄ {O(n)}