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₆) :|: X₁ ≤ 100 ∧ X₂ ≤ X₀
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 100 < X₁
t₄: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ < X₂
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₀-1, X₂, 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 X₀ ≤ X₅ for location l5
Found invariant X₀ ≤ X₅ for location l1
Found invariant X₀ ≤ X₅ for location l4
Found invariant X₂ ≤ X₅ ∧ X₀ ≤ X₅ ∧ X₂ ≤ X₀ ∧ X₁ ≤ 100 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₁ ≤ 100 ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₅
t₁₆: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: 100 < 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₀-1, X₂, X₁+1, X₃, X₄, X₅) :|: X₂ ≤ X₅ ∧ X₀ ≤ X₅ ∧ X₂ ≤ X₀ ∧ X₁ ≤ 100
t₂₀: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ ≤ X₅
Found invariant X₅ ≤ X₀ ∧ X₄ ≤ X₅ ∧ X₂ ≤ X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ X₄ ≤ X₀ ∧ X₂ ≤ X₄ ∧ X₃ ≤ 100 ∧ X₃ ≤ X₁ ∧ X₁+X₃ ≤ 200 ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₁ ≤ 100 for location n_l3___3
Found invariant X₄ ≤ X₅ ∧ X₁ ≤ X₅ ∧ 1+X₀ ≤ X₅ ∧ X₃ ≤ 100 ∧ X₂+X₃ ≤ 201 ∧ X₂ ≤ 101 ∧ X₁ ≤ 1+X₀ for location n_l1___2
Found invariant X₀ ≤ 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₅ for location l4
Found invariant X₄ ≤ X₅ ∧ 1+X₂ ≤ X₅ ∧ X₁ ≤ X₅ ∧ 1+X₀ ≤ X₅ ∧ X₃ ≤ 100 ∧ X₂+X₃ ≤ 201 ∧ X₁+X₃ ≤ 200 ∧ X₂ ≤ 101 ∧ X₁+X₂ ≤ 201 ∧ X₂ ≤ X₀ ∧ X₁ ≤ 100 ∧ X₁ ≤ 1+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₁₈: 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₁₈: 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₃: 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₃: 4⋅X₃ {O(n)}
t₂₀, X₄: 4⋅X₄ {O(n)}
t₂₀, X₅: 4⋅X₅ {O(n)}