Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: nondef.0
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃)
t₈: l1(X₀, X₁, X₂, X₃) → l4(X₁, X₁, X₂, X₃)
t₅: l2(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃)
t₇: l3(X₀, X₁, X₂, X₃) → l1(X₀, nondef.0, X₂, X₃)
t₃: l4(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: 0 ≤ X₀
t₄: l4(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: X₀ < 0
t₁: l5(X₀, X₁, X₂, X₃) → l4(X₂, X₁, X₂, X₃) :|: 0 ≤ X₃
t₂: l5(X₀, X₁, X₂, X₃) → l4(-1, X₁, X₂, X₃) :|: X₃ < 0
t₉: l6(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃)
Found invariant 0 ≤ X₀ for location l2
Found invariant 1+X₀ ≤ 0 for location l6
Found invariant 1+X₀ ≤ 0 for location l7
Found invariant 0 ≤ X₀ for location l1
Found invariant 0 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: nondef.0
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃)
t₈: l1(X₀, X₁, X₂, X₃) → l4(X₁, X₁, X₂, X₃) :|: 0 ≤ X₀
t₅: l2(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: 0 ≤ X₀
t₇: l3(X₀, X₁, X₂, X₃) → l1(X₀, nondef.0, X₂, X₃) :|: 0 ≤ X₀
t₃: l4(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: 0 ≤ X₀
t₄: l4(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: X₀ < 0
t₁: l5(X₀, X₁, X₂, X₃) → l4(X₂, X₁, X₂, X₃) :|: 0 ≤ X₃
t₂: l5(X₀, X₁, X₂, X₃) → l4(-1, X₁, X₂, X₃) :|: X₃ < 0
t₉: l6(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃) :|: 1+X₀ ≤ 0
Chain transitions t₇: l3→l1 and t₈: l1→l4 to t₆₂: l3→l4
Chain transitions t₃: l4→l2 and t₅: l2→l3 to t₆₃: l4→l3
Chain transitions t₆₃: l4→l3 and t₆₂: l3→l4 to t₆₄: l4→l4
Chain transitions t₆₃: l4→l3 and t₇: l3→l1 to t₆₅: l4→l1
Eliminate variables {Temp_Int₂₁₁,X₁} that do not contribute to the problem
Found invariant 0 ≤ X₀ for location l2
Found invariant 1+X₀ ≤ 0 for location l6
Found invariant 1+X₀ ≤ 0 for location l7
Found invariant 0 ≤ X₀ for location l1
Found invariant 0 ≤ X₀ for location l3
Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ for location n_l2___7
Found invariant 1+X₀ ≤ 0 for location l6
Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location n_l4___4
Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ for location n_l3___6
Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l2___3
Found invariant 1+X₀ ≤ 0 for location l7
Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ for location n_l1___5
Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l3___2
Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₀ for location n_l1___1
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₃: inf {Infinity}
t₄: 1 {O(1)}
t₅: inf {Infinity}
t₇: inf {Infinity}
t₈: inf {Infinity}
t₉: 1 {O(1)}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₃: inf {Infinity}
t₄: 1 {O(1)}
t₅: inf {Infinity}
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₀: X₂ {O(n)}
t₁, X₁: X₁ {O(n)}
t₁, X₂: X₂ {O(n)}
t₁, X₃: X₃ {O(n)}
t₂, X₀: 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₂: 3⋅X₂ {O(n)}
t₄, X₃: 3⋅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₂ {O(n)}
t₉, X₃: 3⋅X₃ {O(n)}