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₀ < 0
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ 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₁+1, -2⋅X₁, X₃, X₄, X₅)
t₅: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅)
Found invariant X₄ ≤ X₁ ∧ 0 ≤ X₀ for location l5
Found invariant X₄ ≤ X₁ for location l1
Found invariant X₄ ≤ X₁ ∧ 0 ≤ X₀ for location l4
Found invariant X₄ ≤ X₁ ∧ 1+X₀ ≤ 0 for location l3
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₀ < 0 ∧ X₄ ≤ X₁
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ 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₁+1, -2⋅X₁, X₃, X₄, X₅) :|: X₄ ≤ X₁ ∧ 1+X₀ ≤ 0
t₅: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₄ ≤ X₁ ∧ 0 ≤ X₀
Chain transitions t₄: l3→l1 and t₃: l1→l4 to t₃₆: l3→l4
Chain transitions t₁: l2→l1 and t₃: l1→l4 to t₃₇: l2→l4
Chain transitions t₁: l2→l1 and t₂: l1→l3 to t₃₈: l2→l3
Chain transitions t₄: l3→l1 and t₂: l1→l3 to t₃₉: l3→l3
Found invariant X₄ ≤ X₁ ∧ 0 ≤ X₀ for location l5
Found invariant X₄ ≤ X₁ for location l1
Found invariant X₄ ≤ X₁ for location l4
Found invariant X₄ ≤ X₁ ∧ 1+X₃ ≤ 0 for location l3
Found invariant X₅ ≤ X₂ ∧ X₂ ≤ X₅ ∧ X₄ ≤ X₁ ∧ X₁ ≤ X₄ ∧ 1+X₃ ≤ 0 ∧ X₃ ≤ X₀ ∧ 2+X₀+X₃ ≤ 0 ∧ X₀ ≤ X₃ ∧ 1+X₀ ≤ 0 for location n_l3___3
Found invariant 1+X₄ ≤ X₁ ∧ 1+X₃ ≤ 0 for location n_l1___2
Found invariant X₄ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₀ for location l5
Found invariant X₅ ≤ X₂ ∧ X₂ ≤ X₅ ∧ X₄ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₃ ≤ X₀ ∧ X₀ ≤ X₃ for location l1
Found invariant X₄ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₀ for location l4
Found invariant 1+X₄ ≤ X₁ ∧ 1+X₃ ≤ 0 ∧ 2+X₀+X₃ ≤ 0 ∧ 1+X₀ ≤ 0 for location n_l3___1
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₄: inf {Infinity}
t₅: 1 {O(1)}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: inf {Infinity}
t₃: 1 {O(1)}
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₂: 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)}
t₃, X₅: 2⋅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)}