Initial Problem

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

Preprocessing

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

Found invariant 0 ≤ 5+X₀ for location l6

Found invariant 6 ≤ X₀ for location l7

Found invariant 6+X₀ ≤ 0 for location l5

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

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, l8
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₁) :|: X₀+5 < 0
t₃₁: l3(X₀, X₁) → l6(X₀, X₁) :|: 0 ≤ 5+X₀
t₃₂: l4(X₀, X₁) → l8(X₀, X₁) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₃₃: l5(X₀, X₁) → l1(1-X₀, X₁) :|: 6+X₀ ≤ 0
t₃₅: l6(X₀, X₁) → l1(0, X₁) :|: X₀ ≤ 5 ∧ 0 ≤ 5+X₀
t₃₄: l6(X₀, X₁) → l7(X₀, X₁) :|: 5 < X₀ ∧ 0 ≤ 5+X₀
t₃₆: l7(X₀, X₁) → l1(-X₀-1, X₁) :|: 6 ≤ X₀

Analysing control-flow refined program

Cut unsatisfiable transition t₁₄₂: n_l1___10→l4

Cut unsatisfiable transition t₁₄₄: n_l1___6→l4

Found invariant 1+X₀+X₁ ≤ 0 ∧ 7+X₀ ≤ 0 for location n_l1___6

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

Found invariant 1+X₀+X₁ ≤ 0 ∧ 7+X₀ ≤ 0 for location n_l3___5

Found invariant 2+X₁ ≤ X₀ ∧ 7 ≤ X₀ for location n_l1___10

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___3

Found invariant 1+X₀+X₁ ≤ 0 ∧ 7+X₀ ≤ 0 for location n_l5___4

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

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

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

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 l8

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

Found invariant 2+X₁ ≤ X₀ ∧ 7 ≤ X₀ for location n_l3___9

Found invariant 2+X₁ ≤ X₀ ∧ 7 ≤ X₀ for location n_l6___8

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 X₁ ≤ X₀ ∧ 6 ≤ X₁ ∧ 12 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 6 ≤ X₀ for location n_l7___1

Found invariant 2+X₁ ≤ X₀ ∧ 7 ≤ X₀ for location n_l7___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}
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}
t₃₆: inf {Infinity}

Sizebounds

t₂₅, X₀: X₀ {O(n)}
t₂₅, X₁: X₁ {O(n)}
t₂₆, X₁: 2⋅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₁: X₁ {O(n)}
t₃₀, X₁: 2⋅X₁ {O(n)}
t₃₁, X₁: 2⋅X₁ {O(n)}
t₃₂, X₀: 0 {O(1)}
t₃₂, X₁: 3⋅X₁ {O(n)}
t₃₃, X₁: 2⋅X₁ {O(n)}
t₃₄, X₁: 2⋅X₁ {O(n)}
t₃₅, X₀: 0 {O(1)}
t₃₅, X₁: 2⋅X₁ {O(n)}
t₃₆, X₁: 2⋅X₁ {O(n)}