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