Start: f20
Program_Vars: X₀, X₁
Temp_Vars:
Locations: f1, f20, f30
Transitions:
t₁: f1(X₀, X₁) → f1(1+X₀, 1+X₁)
t₂: f1(X₀, X₁) → f30(X₀, X₁) :|: 1+X₁ ≤ X₀
t₀: f20(X₀, X₁) → f1(0, 0)
Found invariant X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location f1
Found invariant 1 ≤ 0 for location f30
Cut unsatisfiable transition [t₂: f1→f30]
Cut unreachable locations [f30] from the program graph
Start: f20
Program_Vars: X₀, X₁
Temp_Vars:
Locations: f1, f20
Transitions:
t₁: f1(X₀, X₁) → f1(1+X₀, 1+X₁) :|: 0 ≤ X₀ ∧ 0 ≤ X₀+X₁ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₁
t₀: f20(X₀, X₁) → f1(0, 0)
Found invariant X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location f1
Found invariant X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location f1_v1
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₀, X₀: 0 {O(1)}
t₀, X₁: 0 {O(1)}