Initial Problem

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

Preprocessing

Found invariant X₀ ≤ 5 for location l6

Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l7

Found invariant 6 ≤ X₀ for location l5

Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l4

Problem after Preprocessing

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

Analysing control-flow refined program

Cut unsatisfiable transition t₁₃₃: n_l1___3→l4

Cut unsatisfiable transition t₁₃₅: n_l1___9→l4

Found invariant 6+X₁ ≤ 0 ∧ 13+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ X₁ ∧ 7+X₀ ≤ 0 for location n_l6___6

Found invariant 1+X₁ ≤ X₀ ∧ 6 ≤ X₁ ∧ 13 ≤ X₀+X₁ ∧ 7 ≤ X₀ for location n_l5___1

Found invariant 6+X₁ ≤ 0 ∧ 13+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ X₁ ∧ 7+X₀ ≤ 0 for location n_l1___9

Found invariant X₁ ≤ 5 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 10 ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 5 ∧ 1 ≤ X₀ for location n_l6___4

Found invariant X₁ ≤ X₀ ∧ 6 ≤ X₁ ∧ 12 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 6 ≤ X₀ for location n_l5___5

Found invariant 1+X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 2+X₀+X₁ ≤ 0 ∧ X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l6___10

Found invariant 1+X₁ ≤ X₀ ∧ 6 ≤ X₁ ∧ 13 ≤ X₀+X₁ ∧ 7 ≤ X₀ for location n_l1___3

Found invariant X₁ ≤ 5 ∧ X₁ ≤ 5+X₀ ∧ X₀+X₁ ≤ 5 ∧ 0 ≤ 5+X₁ ∧ 0 ≤ 5+X₀+X₁ ∧ X₀ ≤ 5+X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l1___8

Found invariant 1+X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 2+X₀+X₁ ≤ 0 ∧ X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l3___12

Found invariant X₁ ≤ 5 ∧ X₁ ≤ 5+X₀ ∧ X₀+X₁ ≤ 5 ∧ 0 ≤ 5+X₁ ∧ 0 ≤ 5+X₀+X₁ ∧ X₀ ≤ 5+X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location l7

Found invariant X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l3___11

Found invariant 1+X₁ ≤ X₀ ∧ 6 ≤ X₁ ∧ 13 ≤ X₀+X₁ ∧ 7 ≤ X₀ for location n_l3___2

Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l1

Found invariant X₁ ≤ 5 ∧ X₁ ≤ 5+X₀ ∧ X₀+X₁ ≤ 5 ∧ 0 ≤ 5+X₁ ∧ 0 ≤ 5+X₀+X₁ ∧ X₀ ≤ 5+X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location l4

Found invariant 6+X₁ ≤ 0 ∧ 13+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ X₁ ∧ 7+X₀ ≤ 0 for location n_l3___7

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₄: 1 {O(1)}
t₁: 1 {O(1)}
t₅: inf {Infinity}
t₆: inf {Infinity}
t₁₀: 1 {O(1)}
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₄: 1 {O(1)}
t₁: 1 {O(1)}
t₅: inf {Infinity}
t₆: inf {Infinity}
t₁₀: 1 {O(1)}
t₇: inf {Infinity}
t₈: inf {Infinity}
t₉: inf {Infinity}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₂, X₁: 2⋅X₁ {O(n)}
t₃, X₁: X₁ {O(n)}
t₄, X₀: 0 {O(1)}
t₄, X₁: 3⋅X₁ {O(n)}
t₁, X₀: X₁ {O(n)}
t₁, X₁: X₁ {O(n)}
t₅, X₁: X₁ {O(n)}
t₆, X₁: 2⋅X₁ {O(n)}
t₁₀, X₀: 0 {O(1)}
t₁₀, X₁: 3⋅X₁ {O(n)}
t₇, X₁: X₁ {O(n)}
t₈, X₁: 2⋅X₁ {O(n)}
t₉, X₀: 0 {O(1)}
t₉, X₁: 2⋅X₁ {O(n)}