Start: f0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆
Temp_Vars: R, S
Locations: f0, f21, f29, f41, f43, f46
Transitions:
t₇: f0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → f21(1, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, R, X₁₀, X₁₃, X₁₄, X₁₅, X₁₆) :|: X₁₀ ≤ 0
t₈: f0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → f21(1, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, S, R, 0, 1, S, S, S) :|: 1 ≤ S ∧ 1 ≤ X₁₀
t₉: f0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → f41(1, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, S, R, 0, 1, S, S, S) :|: 1 ≤ X₁₀ ∧ S ≤ 0
t₀: f21(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → f29(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: X₀ ≤ 0
t₆: f21(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → f29(0, X₁, R, X₃, X₄, X₅, X₆, 0, R, R, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: 1 ≤ X₀
t₃: f29(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → f41(X₀, R, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: 1 ≤ X₀
t₄: f29(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → f41(X₀, S, X₂, 0, R, R, R, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: R ≤ 999+X₂ ∧ X₀ ≤ 0
t₅: f29(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → f41(1, S, X₂, 0, R, R, R, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: 1000+X₂ ≤ R ∧ X₀ ≤ 0
t₁: f41(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → f41(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆)
t₂: f43(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → f46(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆)
Cut unreachable locations [f43; f46] from the program graph
Cut unsatisfiable transition [t₀: f21→f29; t₃: f29→f41]
Eliminate variables [X₁; X₃; X₄; X₅; X₆; X₇; X₈; X₉; X₁₁; X₁₂; X₁₃; X₁₄; X₁₅; X₁₆] that do not contribute to the problem
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location f29
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location f21
Found invariant X₀ ≤ 1 ∧ 0 ≤ X₀ for location f41
Start: f0
Program_Vars: X₀, X₁, X₂
Temp_Vars: R, S
Locations: f0, f21, f29, f41
Transitions:
t₁₉: f0(X₀, X₁, X₂) → f21(1, X₁, X₂) :|: X₂ ≤ 0
t₂₀: f0(X₀, X₁, X₂) → f21(1, X₁, S) :|: 1 ≤ S ∧ 1 ≤ X₂
t₂₁: f0(X₀, X₁, X₂) → f41(1, X₁, S) :|: 1 ≤ X₂ ∧ S ≤ 0
t₂₂: f21(X₀, X₁, X₂) → f29(0, R, X₂) :|: 1 ≤ X₀ ∧ X₀ ≤ 1
t₂₃: f29(X₀, X₁, X₂) → f41(X₀, X₁, X₂) :|: R ≤ 999+X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀
t₂₄: f29(X₀, X₁, X₂) → f41(1, X₁, X₂) :|: 1000+X₁ ≤ R ∧ X₀ ≤ 0 ∧ 0 ≤ X₀
t₂₅: f41(X₀, X₁, X₂) → f41(X₀, X₁, X₂) :|: X₀ ≤ 1 ∧ 0 ≤ X₀
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location f29
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location f21
Found invariant X₀ ≤ 1 ∧ 0 ≤ X₀ for location f41
Found invariant X₀ ≤ 1 ∧ 0 ≤ X₀ for location f41_v1
Overall timebound:inf {Infinity}
t₁₉: 1 {O(1)}
t₂₀: 1 {O(1)}
t₂₁: 1 {O(1)}
t₂₂: 1 {O(1)}
t₂₃: 1 {O(1)}
t₂₄: 1 {O(1)}
t₂₅: inf {Infinity}
Overall costbound: inf {Infinity}
t₁₉: 1 {O(1)}
t₂₀: 1 {O(1)}
t₂₁: 1 {O(1)}
t₂₂: 1 {O(1)}
t₂₃: 1 {O(1)}
t₂₄: 1 {O(1)}
t₂₅: inf {Infinity}
t₁₉, X₀: 1 {O(1)}
t₁₉, X₁: X₁ {O(n)}
t₁₉, X₂: X₂ {O(n)}
t₂₀, X₀: 1 {O(1)}
t₂₀, X₁: X₁ {O(n)}
t₂₁, X₀: 1 {O(1)}
t₂₁, X₁: X₁ {O(n)}
t₂₂, X₀: 0 {O(1)}
t₂₃, X₀: 0 {O(1)}
t₂₄, X₀: 1 {O(1)}
t₂₅, X₀: 1 {O(1)}