Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₁: l1(X₀, X₁, X₂) → l1(X₀+1, X₁+X₀+1, X₂) :|: X₁ ≤ X₀
t₂: l1(X₀, X₁, X₂) → l1(X₀-X₂, X₁-2⋅X₂, X₂-1) :|: X₁ ≤ X₀

Preprocessing

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₁: l1(X₀, X₁, X₂) → l1(X₀+1, X₁+X₀+1, X₂) :|: X₁ ≤ X₀
t₂: l1(X₀, X₁, X₂) → l1(X₀-X₂, X₁-2⋅X₂, X₂-1) :|: X₁ ≤ X₀

Analysing control-flow refined program

MPRF for transition t₃₆: n_l1___2(X₀, X₁, X₂) → n_l1___2(X₀-X₂, X₁-2⋅X₂, X₂-1) :|: 1+X₁+X₂ ≤ X₀ ∧ X₁ ≤ X₀ of depth 2:

new bound:

16⋅X₁+32⋅X₂+8⋅X₀+17 {O(n)}

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}

Costbounds

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

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}