Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: D, E
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₁₀: l0(X₀, X₁, X₂) → l1(D, E, D)
t₀: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: 6 ≤ X₀
t₁: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₀ ≤ 5 ∧ X₁ ≤ 0
t₉: l1(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: X₀ ≤ 5 ∧ 1 ≤ X₁
t₂: l2(X₀, X₁, X₂) → l1(X₀+1, D, X₂) :|: 6 ≤ X₀
t₈: l2(X₀, X₁, X₂) → l1(X₀+1, D, X₂) :|: X₀ ≤ 5
t₇: l3(X₀, X₁, X₂) → l1(X₀, D, X₂) :|: X₀ ≤ 2
t₆: l3(X₀, X₁, X₂) → l3(X₀-1, X₁, X₂) :|: 3 ≤ X₀
t₄: l4(X₀, X₁, X₂) → l4(X₀, X₁, X₂)
t₃: l5(X₀, X₁, X₂) → l4(X₀, X₁, X₂)
t₅: l7(X₀, X₁, X₂) → l6(X₀, X₁, X₂)
Cut unreachable locations [l4; l5; l6; l7] from the program graph
Eliminate variables {X₂} that do not contribute to the problem
Found invariant 1 ≤ X₁ ∧ X₀ ≤ 4+X₁ ∧ X₀ ≤ 5 for location l3
Start: l0
Program_Vars: X₀, X₁
Temp_Vars: D, E
Locations: l0, l1, l2, l3
Transitions:
t₂₂: l0(X₀, X₁) → l1(D, E)
t₂₃: l1(X₀, X₁) → l2(X₀, X₁) :|: 6 ≤ X₀
t₂₄: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ 5 ∧ X₁ ≤ 0
t₂₅: l1(X₀, X₁) → l3(X₀, X₁) :|: X₀ ≤ 5 ∧ 1 ≤ X₁
t₂₆: l2(X₀, X₁) → l1(X₀+1, D) :|: 6 ≤ X₀
t₂₇: l2(X₀, X₁) → l1(X₀+1, D) :|: X₀ ≤ 5
t₂₉: l3(X₀, X₁) → l1(X₀, D) :|: X₀ ≤ 2 ∧ 1 ≤ X₁ ∧ X₀ ≤ 4+X₁ ∧ X₀ ≤ 5
t₂₈: l3(X₀, X₁) → l3(X₀-1, X₁) :|: 3 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₀ ≤ 4+X₁ ∧ X₀ ≤ 5
Found invariant X₀ ≤ 6 ∧ 6 ≤ X₀ for location n_l2___6
Found invariant 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ X₀ ≤ 3+X₁ ∧ X₀ ≤ 4 ∧ 2 ≤ X₀ for location n_l3___4
Found invariant 7 ≤ X₀ for location n_l1___9
Found invariant X₀ ≤ 6 for location n_l1___7
Found invariant X₁ ≤ 0 ∧ X₀+X₁ ≤ 5 ∧ X₀ ≤ 5 for location n_l2___11
Found invariant 6 ≤ X₀ for location n_l2___12
Found invariant X₁ ≤ 0 ∧ X₀+X₁ ≤ 2 ∧ X₀ ≤ 2 for location n_l2___3
Found invariant X₀ ≤ 2 for location n_l1___5
Found invariant 1 ≤ X₁ ∧ X₀ ≤ 1+X₁ ∧ X₀ ≤ 2 for location n_l3___2
Found invariant 7 ≤ X₀ for location n_l2___8
Found invariant X₀ ≤ 3 for location n_l1___1
Found invariant 1 ≤ X₁ ∧ X₀ ≤ 4+X₁ ∧ X₀ ≤ 5 for location n_l3___10
Found invariant X₀ ≤ 6 ∧ 6 ≤ X₀ for location n_l2___6
Found invariant 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ X₀ ≤ 3+X₁ ∧ X₀ ≤ 4 ∧ 2 ≤ X₀ for location n_l3___4
Found invariant 7 ≤ X₀ for location n_l1___9
Found invariant X₀ ≤ 6 for location n_l1___7
Found invariant X₁ ≤ 0 ∧ X₀+X₁ ≤ 5 ∧ X₀ ≤ 5 for location n_l2___11
Found invariant 6 ≤ X₀ for location n_l2___12
Found invariant X₁ ≤ 0 ∧ X₀+X₁ ≤ 2 ∧ X₀ ≤ 2 for location n_l2___3
Found invariant X₀ ≤ 2 for location n_l1___5
Found invariant 1 ≤ X₁ ∧ X₀ ≤ 1+X₁ ∧ X₀ ≤ 2 for location n_l3___2
Found invariant 7 ≤ X₀ for location n_l2___8
Found invariant X₀ ≤ 3 for location n_l1___1
Found invariant 1 ≤ X₁ ∧ X₀ ≤ 4+X₁ ∧ X₀ ≤ 5 for location n_l3___10
Overall timebound:inf {Infinity}
t₂₂: 1 {O(1)}
t₂₃: inf {Infinity}
t₂₄: inf {Infinity}
t₂₅: inf {Infinity}
t₂₆: inf {Infinity}
t₂₇: inf {Infinity}
t₂₈: inf {Infinity}
t₂₉: inf {Infinity}
Overall costbound: inf {Infinity}
t₂₂: 1 {O(1)}
t₂₃: inf {Infinity}
t₂₄: inf {Infinity}
t₂₅: inf {Infinity}
t₂₆: inf {Infinity}
t₂₇: inf {Infinity}
t₂₈: inf {Infinity}
t₂₉: inf {Infinity}
t₂₈, X₀: 4 {O(1)}