Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₂, X₃, X₄)
t₁: l1(X₀, X₁, X₂, X₃, X₄) → l1(X₀+X₁, X₁+X₂, X₂-1, X₃, X₄) :|: 1 ≤ X₀
t₂: l1(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ 0
t₃: l2(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃+X₄, X₄-1) :|: 1 ≤ X₃

Preprocessing

Found invariant X₀ ≤ 0 for location l2

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₂, X₃, X₄)
t₁: l1(X₀, X₁, X₂, X₃, X₄) → l1(X₀+X₁, X₁+X₂, X₂-1, X₃, X₄) :|: 1 ≤ X₀
t₂: l1(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ 0
t₃: l2(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃+X₄, X₄-1) :|: 1 ≤ X₃ ∧ X₀ ≤ 0

Analysing control-flow refined program

Found invariant X₀ ≤ 0 for location l2

CFR did not improve the program. Rolling back

Analysing control-flow refined program

Found invariant X₀ ≤ 0 for location l2

Found invariant 2+X₄ ≤ X₃ ∧ X₀ ≤ 0 for location n_l2___1

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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

Costbounds

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

Sizebounds

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