Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars:
Locations: l0, l1, l2, l3, l4
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄)
t₂: l1(X₀, X₁, X₂, X₃, X₄) → l1(X₁, X₀, X₂, X₃, X₄) :|: X₀ < 0 ∧ X₁ < 0
t₃: l1(X₀, X₁, X₂, X₃, X₄) → l1(X₁, X₀, X₂, X₃, X₄) :|: X₀ < 0 ∧ 0 < X₁
t₄: l1(X₀, X₁, X₂, X₃, X₄) → l1(X₁, X₀, X₂, X₃, X₄) :|: 0 < X₀ ∧ X₁ < 0
t₅: l1(X₀, X₁, X₂, X₃, X₄) → l1(X₁, X₀, X₂, X₃, X₄) :|: 0 < X₀ ∧ 0 < X₁
t₆: l1(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₇: l1(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄) :|: X₁ ≤ 0 ∧ 0 ≤ X₁
t₁: l2(X₀, X₁, X₂, X₃, X₄) → l1(X₂, X₃, X₂, X₃, X₄)
t₈: l3(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄)
Eliminate variables {X₄} that do not contribute to the problem
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l4
Transitions:
t₁₇: l0(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃)
t₁₈: l1(X₀, X₁, X₂, X₃) → l1(X₁, X₀, X₂, X₃) :|: X₀ < 0 ∧ X₁ < 0
t₁₉: l1(X₀, X₁, X₂, X₃) → l1(X₁, X₀, X₂, X₃) :|: X₀ < 0 ∧ 0 < X₁
t₂₀: l1(X₀, X₁, X₂, X₃) → l1(X₁, X₀, X₂, X₃) :|: 0 < X₀ ∧ X₁ < 0
t₂₁: l1(X₀, X₁, X₂, X₃) → l1(X₁, X₀, X₂, X₃) :|: 0 < X₀ ∧ 0 < X₁
t₂₂: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₂₃: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: X₁ ≤ 0 ∧ 0 ≤ X₁
t₂₄: l2(X₀, X₁, X₂, X₃) → l1(X₂, X₃, X₂, X₃)
t₂₅: l3(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃)
Found invariant 1+X₃ ≤ 0 ∧ 2+X₂+X₃ ≤ 0 ∧ 2+X₁+X₃ ≤ 0 ∧ 2+X₀+X₃ ≤ 0 ∧ 1+X₂ ≤ 0 ∧ 2+X₁+X₂ ≤ 0 ∧ 2+X₀+X₂ ≤ 0 ∧ 1+X₁ ≤ 0 ∧ 2+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ 0 for location n_l1___4
Found invariant X₃ ≤ X₁ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l1___2
Found invariant X₃ ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₂ ∧ 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ 1 ≤ X₀ for location n_l1___3
Found invariant X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location l1
Found invariant X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location l4
Found invariant X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location l3
Found invariant 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l1___1
cycle: [t₁₈₁: n_l1___2→n_l1___3; t₁₈₂: n_l1___3→n_l1___2]
Termination: true
Formula:
Termination: true
Formula:
Overall timebound:inf {Infinity}
t₁₇: 1 {O(1)}
t₁₈: inf {Infinity}
t₁₉: inf {Infinity}
t₂₀: inf {Infinity}
t₂₁: inf {Infinity}
t₂₂: 1 {O(1)}
t₂₃: 1 {O(1)}
t₂₄: 1 {O(1)}
t₂₅: 1 {O(1)}
Overall costbound: inf {Infinity}
t₁₇: 1 {O(1)}
t₁₈: inf {Infinity}
t₁₉: inf {Infinity}
t₂₀: inf {Infinity}
t₂₁: inf {Infinity}
t₂₂: 1 {O(1)}
t₂₃: 1 {O(1)}
t₂₄: 1 {O(1)}
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₂+X₃ {O(n)}
t₁₈, X₁: X₂+X₃ {O(n)}
t₁₈, X₂: X₂ {O(n)}
t₁₈, X₃: X₃ {O(n)}
t₁₉, X₀: X₂+X₃ {O(n)}
t₁₉, X₁: X₂+X₃ {O(n)}
t₁₉, X₂: X₂ {O(n)}
t₁₉, X₃: X₃ {O(n)}
t₂₀, X₀: X₂+X₃ {O(n)}
t₂₀, X₁: X₂+X₃ {O(n)}
t₂₀, X₂: X₂ {O(n)}
t₂₀, X₃: X₃ {O(n)}
t₂₁, X₀: X₂+X₃ {O(n)}
t₂₁, X₁: X₂+X₃ {O(n)}
t₂₁, X₂: X₂ {O(n)}
t₂₁, X₃: X₃ {O(n)}
t₂₂, X₀: 0 {O(1)}
t₂₂, X₁: X₃ {O(n)}
t₂₂, X₂: X₂ {O(n)}
t₂₂, X₃: X₃ {O(n)}
t₂₃, X₀: X₂ {O(n)}
t₂₃, X₁: 0 {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₂: 2⋅X₂ {O(n)}
t₂₅, X₃: 2⋅X₃ {O(n)}