Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
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₀
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₂+1, X₁+1, X₃, X₄, X₅, X₆)
t₅: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
Eliminate variables {X₄} that do not contribute to the problem
Found invariant 1+X₀ ≤ 0 for location l5
Found invariant 1+X₀ ≤ 0 for location l4
Found invariant 0 ≤ X₀ 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₆) :|: 0 ≤ X₀
t₁₄: l1(X₀, X₁, X₂, X₃, X₅, X₆) → l4(X₀, X₁, X₂, X₃, X₅, X₆) :|: X₀ < 0
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, X₁+1, X₃, X₅, X₆) :|: 0 ≤ X₀
t₁₇: l4(X₀, X₁, X₂, X₃, X₅, X₆) → l5(X₀, X₁, X₂, X₃, X₅, X₆) :|: 1+X₀ ≤ 0
Found invariant X₆ ≤ X₀ ∧ 0 ≤ X₆ ∧ 0 ≤ X₀+X₆ ∧ X₀ ≤ X₆ ∧ X₅ ≤ X₂ ∧ X₂ ≤ X₅ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₀ for location n_l3___3
Found invariant 0 ≤ X₆ ∧ 1 ≤ X₀+X₂ for location n_l1___2
Found invariant X₀ ≤ X₆ ∧ 1+X₀ ≤ 0 for location l5
Found invariant X₆ ≤ X₀ ∧ X₀ ≤ X₆ ∧ X₅ ≤ X₂ ∧ X₂ ≤ X₅ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ for location l1
Found invariant X₀ ≤ X₆ ∧ 1+X₀ ≤ 0 for location l4
Found invariant 0 ≤ X₆ ∧ 0 ≤ X₀+X₆ ∧ 1 ≤ X₀+X₂ ∧ 0 ≤ X₀ for location n_l3___1
Overall timebound:inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: inf {Infinity}
t₁₄: 1 {O(1)}
t₁₅: 1 {O(1)}
t₁₆: inf {Infinity}
t₁₇: 1 {O(1)}
Overall costbound: inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: inf {Infinity}
t₁₄: 1 {O(1)}
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₃: 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₃: 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)}