Initial Problem

Start: start
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: eval, start
Transitions:
t₀: eval(X₀, X₁, X₂) → eval(X₀-1, X₁, X₂-1) :|: 0 ≤ X₀ ∧ X₂ ≤ (X₁)³
t₁: eval(X₀, X₁, X₂) → eval(X₀, X₁+X₂, X₂-1) :|: 0 ≤ X₀ ∧ X₂ ≤ (X₁)³
t₂: start(X₀, X₁, X₂) → eval(X₀, X₁, X₂)

Preprocessing

Problem after Preprocessing

Start: start
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: eval, start
Transitions:
t₀: eval(X₀, X₁, X₂) → eval(X₀-1, X₁, X₂-1) :|: 0 ≤ X₀ ∧ X₂ ≤ (X₁)³
t₁: eval(X₀, X₁, X₂) → eval(X₀, X₁+X₂, X₂-1) :|: 0 ≤ X₀ ∧ X₂ ≤ (X₁)³
t₂: start(X₀, X₁, X₂) → eval(X₀, X₁, X₂)

MPRF for transition t₀: eval(X₀, X₁, X₂) → eval(X₀-1, X₁, X₂-1) :|: 0 ≤ X₀ ∧ X₂ ≤ (X₁)³ of depth 1:

new bound:

X₀+1 {O(n)}

MPRF:

• eval: [1+X₀]

Found invariant 0 ≤ X₀ for location eval_v1

Found invariant 0 ≤ 1+X₀ for location eval_v2

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₀: X₀+1 {O(n)}
t₁: inf {Infinity}
t₂: 1 {O(1)}

Costbounds

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

Sizebounds

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