Initial Problem

Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1, l2, l3
Transitions:
t₂: l0(X₀, X₁) → l1(C, 0)
t₆: l1(X₀, X₁) → l2(0, X₁) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₀: l1(X₀, X₁) → l3(X₀, X₁) :|: X₀+1 ≤ 0
t₁: l1(X₀, X₁) → l3(X₀, X₁) :|: 1 ≤ X₀
t₃: l3(X₀, X₁) → l1(C, X₁+1) :|: X₁ ≤ 3
t₄: l3(X₀, X₁) → l1(C, X₁+1) :|: 5 ≤ X₁
t₅: l3(X₀, X₁) → l1(C, 1) :|: X₁ ≤ 4 ∧ 4 ≤ X₁

Preprocessing

Found invariant X₁ ≤ 4 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 4 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location l2

Found invariant X₁ ≤ 4 ∧ 0 ≤ X₁ for location l1

Found invariant X₁ ≤ 4 ∧ 0 ≤ X₁ for location l3

Cut unsatisfiable transition t₄: l3→l1

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1, l2, l3
Transitions:
t₂: l0(X₀, X₁) → l1(C, 0)
t₆: l1(X₀, X₁) → l2(0, X₁) :|: X₀ ≤ 0 ∧ 0 ≤ X₀ ∧ X₁ ≤ 4 ∧ 0 ≤ X₁
t₀: l1(X₀, X₁) → l3(X₀, X₁) :|: X₀+1 ≤ 0 ∧ X₁ ≤ 4 ∧ 0 ≤ X₁
t₁: l1(X₀, X₁) → l3(X₀, X₁) :|: 1 ≤ X₀ ∧ X₁ ≤ 4 ∧ 0 ≤ X₁
t₃: l3(X₀, X₁) → l1(C, X₁+1) :|: X₁ ≤ 3 ∧ X₁ ≤ 4 ∧ 0 ≤ X₁
t₅: l3(X₀, X₁) → l1(C, 1) :|: X₁ ≤ 4 ∧ 4 ≤ X₁ ∧ X₁ ≤ 4 ∧ 0 ≤ X₁

Chain transitions t₅: l3→l1 and t₁: l1→l3 to t₉₄: l3→l3

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

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

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

Chain transitions t₂: l0→l1 and t₀: l1→l3 to t₉₈: l0→l3

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₃: l3→l1 and t₆: l1→l2 to t₁₀₁: l3→l2

Chain transitions t₅: l3→l1 and t₆: l1→l2 to t₁₀₂: l3→l2

Analysing control-flow refined program

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

Found invariant X₀ ≤ 4 ∧ 0 ≤ X₀ for location l2

Found invariant X₀ ≤ 4 ∧ 0 ≤ X₀ for location l1

Found invariant X₀ ≤ 4 ∧ 0 ≤ 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 X₁ ≤ 4 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 4 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location l2

Found invariant X₁ ≤ 2 ∧ 2 ≤ X₁ for location n_l1___6

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

Found invariant X₁ ≤ 1 ∧ 1 ≤ X₁ for location n_l1___9

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

Found invariant X₁ ≤ 4 ∧ 3 ≤ X₁ for location n_l1___3

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

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

Found invariant X₁ ≤ 4 ∧ X₀+X₁ ≤ 3 ∧ 3 ≤ X₁ ∧ 4+X₀ ≤ X₁ ∧ 1+X₀ ≤ 0 for location n_l3___2

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

Found invariant X₁ ≤ 4 ∧ X₁ ≤ 3+X₀ ∧ 3 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l3___1

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

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

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₀: inf {Infinity}
t₁: inf {Infinity}
t₂: 1 {O(1)}
t₃: inf {Infinity}
t₅: inf {Infinity}
t₆: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₀: inf {Infinity}
t₁: inf {Infinity}
t₂: 1 {O(1)}
t₃: inf {Infinity}
t₅: inf {Infinity}
t₆: 1 {O(1)}

Sizebounds

t₀, X₁: 4 {O(1)}
t₁, X₁: 4 {O(1)}
t₂, X₁: 0 {O(1)}
t₃, X₁: 4 {O(1)}
t₅, X₁: 1 {O(1)}
t₆, X₀: 0 {O(1)}
t₆, X₁: 4 {O(1)}