Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars: F
Locations: l0, l1, l2, l3
Transitions:
t₂: l0(X₀, X₁, X₂, X₃, X₄) → l3(2, X₁, 2, F, X₄)
t₅: l1(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, 0) :|: X₁ ≤ 0
t₃: l1(X₀, X₁, X₂, X₃, X₄) → l3(X₀-1, X₁, X₂, F, X₄) :|: F ≤ 0 ∧ 1 ≤ F
t₄: l1(X₀, X₁, X₂, X₃, X₄) → l3(X₀+1, X₁, X₂, F, X₄) :|: 1 ≤ F
t₀: l3(X₀, X₁, X₂, X₃, X₄) → l1(X₀, 1, X₂, X₃, X₄) :|: 2 ≤ X₀
t₁: l3(X₀, X₁, X₂, X₃, X₄) → l1(X₀, 0, X₂, X₃, X₄) :|: X₀ ≤ 1
Cut unsatisfiable transition t₃: l1→l3
Eliminate variables {X₂,X₃,X₄} that do not contribute to the problem
Found invariant 1 ≤ 0 for location l2
Found invariant X₁ ≤ 1 ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l1
Found invariant 2 ≤ X₀ for location l3
Cut unsatisfiable transition t₁₅: l1→l2
Cut unsatisfiable transition t₁₇: l3→l1
Cut unreachable locations [l2] from the program graph
Start: l0
Program_Vars: X₀, X₁
Temp_Vars: F
Locations: l0, l1, l3
Transitions:
t₁₃: l0(X₀, X₁) → l3(2, X₁)
t₁₄: l1(X₀, X₁) → l3(X₀+1, X₁) :|: 1 ≤ F ∧ X₁ ≤ 1 ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀
t₁₆: l3(X₀, X₁) → l1(X₀, 1) :|: 2 ≤ X₀ ∧ 2 ≤ X₀
Found invariant X₁ ≤ 1 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 3 ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ X₀ ≤ 2 ∧ 2 ≤ X₀ for location n_l1___3
Found invariant X₁ ≤ 1 ∧ 2+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l3___2
Found invariant X₀ ≤ 2 ∧ 2 ≤ X₀ for location l3
Found invariant X₁ ≤ 1 ∧ 2+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l1___1
Overall timebound:inf {Infinity}
t₁₃: 1 {O(1)}
t₁₄: inf {Infinity}
t₁₆: inf {Infinity}
Overall costbound: inf {Infinity}
t₁₃: 1 {O(1)}
t₁₄: inf {Infinity}
t₁₆: inf {Infinity}
t₁₃, X₀: 2 {O(1)}
t₁₃, X₁: X₁ {O(n)}
t₁₄, X₁: 1 {O(1)}
t₁₆, X₁: 1 {O(1)}