Initial Problem

Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₁₁: l0(X₀, X₁) → l1(C, X₁)
t₀: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ 5
t₃: l1(X₀, X₁) → l2(X₀, C) :|: 6 ≤ X₀ ∧ C+1 ≤ 0
t₄: l1(X₀, X₁) → l2(X₀, C) :|: 6 ≤ X₀ ∧ 1 ≤ C
t₁₀: l1(X₀, X₁) → l3(X₀, 0) :|: 6 ≤ X₀
t₅: l2(X₀, X₁) → l1(X₀+1, X₁) :|: 6 ≤ X₀
t₉: l2(X₀, X₁) → l1(X₀+1, X₁) :|: X₀ ≤ 5
t₈: l3(X₀, X₁) → l1(X₀, X₁) :|: X₀ ≤ 2
t₇: l3(X₀, X₁) → l3(X₀-1, X₁) :|: 3 ≤ X₀
t₂: l4(X₀, X₁) → l4(X₀, X₁)
t₁: l5(X₀, X₁) → l4(X₀, X₁)
t₆: l7(X₀, X₁) → l6(X₀, X₁)

Preprocessing

Cut unreachable locations [l4; l5; l6; l7] from the program graph

Eliminate variables {X₁} that do not contribute to the problem

Found invariant 2 ≤ X₀ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀
Temp_Vars: C
Locations: l0, l1, l2, l3
Transitions:
t₂₆: l0(X₀) → l1(C)
t₂₇: l1(X₀) → l2(X₀) :|: X₀ ≤ 5
t₂₈: l1(X₀) → l2(X₀) :|: 6 ≤ X₀ ∧ C+1 ≤ 0
t₂₉: l1(X₀) → l2(X₀) :|: 6 ≤ X₀ ∧ 1 ≤ C
t₃₀: l1(X₀) → l3(X₀) :|: 6 ≤ X₀
t₃₁: l2(X₀) → l1(X₀+1) :|: 6 ≤ X₀
t₃₂: l2(X₀) → l1(X₀+1) :|: X₀ ≤ 5
t₃₃: l3(X₀) → l1(X₀) :|: X₀ ≤ 2 ∧ 2 ≤ X₀
t₃₄: l3(X₀) → l3(X₀-1) :|: 3 ≤ X₀ ∧ 2 ≤ X₀

Chain transitions t₃₃: l3→l1 and t₃₀: l1→l3 to t₁₇₉: l3→l3

Chain transitions t₃₂: l2→l1 and t₃₀: l1→l3 to t₁₈₀: l2→l3

Chain transitions t₃₂: l2→l1 and t₂₉: l1→l2 to t₁₈₁: l2→l2

Chain transitions t₃₃: l3→l1 and t₂₉: l1→l2 to t₁₈₂: l3→l2

Chain transitions t₃₁: l2→l1 and t₂₉: l1→l2 to t₁₈₃: l2→l2

Chain transitions t₃₁: l2→l1 and t₃₀: l1→l3 to t₁₈₄: l2→l3

Chain transitions t₃₁: l2→l1 and t₂₈: l1→l2 to t₁₈₅: l2→l2

Chain transitions t₃₂: l2→l1 and t₂₈: l1→l2 to t₁₈₆: l2→l2

Chain transitions t₃₃: l3→l1 and t₂₈: l1→l2 to t₁₈₇: l3→l2

Chain transitions t₂₆: l0→l1 and t₂₈: l1→l2 to t₁₈₈: l0→l2

Chain transitions t₂₆: l0→l1 and t₂₉: l1→l2 to t₁₈₉: l0→l2

Chain transitions t₂₆: l0→l1 and t₃₀: l1→l3 to t₁₉₀: l0→l3

Chain transitions t₂₆: l0→l1 and t₂₇: l1→l2 to t₁₉₁: l0→l2

Chain transitions t₃₁: l2→l1 and t₂₇: l1→l2 to t₁₉₂: l2→l2

Chain transitions t₃₂: l2→l1 and t₂₇: l1→l2 to t₁₉₃: l2→l2

Chain transitions t₃₃: l3→l1 and t₂₇: l1→l2 to t₁₉₄: l3→l2

Analysing control-flow refined program

Cut unsatisfiable transition t₁₇₉: l3→l3

Cut unsatisfiable transition t₁₈₂: l3→l2

Cut unsatisfiable transition t₁₈₇: l3→l2

Cut unsatisfiable transition t₁₉₂: l2→l2

Found invariant 2 ≤ X₀ for location l3

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

Analysing control-flow refined program

Found invariant 7 ≤ X₀ for location n_l2___6

Found invariant 2 ≤ X₀ for location n_l3___4

Found invariant X₀ ≤ 6 for location n_l1___9

Found invariant 7 ≤ X₀ for location n_l1___7

Found invariant 5 ≤ X₀ for location n_l3___5

Found invariant X₀ ≤ 2 ∧ 2 ≤ X₀ for location n_l1___3

Found invariant 6 ≤ X₀ for location n_l2___11

Found invariant X₀ ≤ 5 for location n_l2___12

Found invariant X₀ ≤ 2 ∧ 2 ≤ X₀ for location n_l2___2

Found invariant X₀ ≤ 6 ∧ 6 ≤ X₀ for location n_l2___8

Found invariant X₀ ≤ 3 ∧ 3 ≤ X₀ for location n_l1___1

Found invariant 6 ≤ X₀ for location n_l3___10

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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}
t₃₄: inf {Infinity}

Costbounds

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₃₄: inf {Infinity}

Sizebounds

t₃₃, X₀: 2 {O(1)}