Initial Problem

Start: eval_foo_start
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: eval_foo_bb0_in, eval_foo_bb1_in, eval_foo_bb2_in, eval_foo_bb3_in, eval_foo_start, eval_foo_stop
Transitions:
t₁: eval_foo_bb0_in(X₀, X₁, X₂, X₃) → eval_foo_bb1_in(X₁, X₁, X₂, X₃) :|: X₃ ≤ 2⋅X₂
t₂: eval_foo_bb0_in(X₀, X₁, X₂, X₃) → eval_foo_bb3_in(X₀, X₁, X₂, X₃) :|: 1+2⋅X₂ ≤ X₃
t₃: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_bb2_in(X₀, X₁, X₂, X₃) :|: X₃ ≤ 1 ∧ 1 ≤ X₃ ∧ 0 ≤ X₀
t₄: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_bb3_in(X₀, X₁, X₂, X₃) :|: 1+X₀ ≤ 0
t₅: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_bb3_in(X₀, X₁, X₂, X₃) :|: X₃ ≤ 0
t₆: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_bb3_in(X₀, X₁, X₂, X₃) :|: 2 ≤ X₃
t₇: eval_foo_bb2_in(X₀, X₁, X₂, X₃) → eval_foo_bb1_in(1+X₀-2⋅X₂, X₁, X₂, X₃)
t₈: eval_foo_bb3_in(X₀, X₁, X₂, X₃) → eval_foo_stop(X₀, X₁, X₂, X₃)
t₀: eval_foo_start(X₀, X₁, X₂, X₃) → eval_foo_bb0_in(X₀, X₁, X₂, X₃)

Preprocessing

Found invariant X₃ ≤ 1 ∧ X₃ ≤ 1+X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ 0 ≤ X₀ for location eval_foo_bb2_in

Problem after Preprocessing

Start: eval_foo_start
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: eval_foo_bb0_in, eval_foo_bb1_in, eval_foo_bb2_in, eval_foo_bb3_in, eval_foo_start, eval_foo_stop
Transitions:
t₁: eval_foo_bb0_in(X₀, X₁, X₂, X₃) → eval_foo_bb1_in(X₁, X₁, X₂, X₃) :|: X₃ ≤ 2⋅X₂
t₂: eval_foo_bb0_in(X₀, X₁, X₂, X₃) → eval_foo_bb3_in(X₀, X₁, X₂, X₃) :|: 1+2⋅X₂ ≤ X₃
t₃: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_bb2_in(X₀, X₁, X₂, X₃) :|: X₃ ≤ 1 ∧ 1 ≤ X₃ ∧ 0 ≤ X₀
t₄: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_bb3_in(X₀, X₁, X₂, X₃) :|: 1+X₀ ≤ 0
t₅: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_bb3_in(X₀, X₁, X₂, X₃) :|: X₃ ≤ 0
t₆: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_bb3_in(X₀, X₁, X₂, X₃) :|: 2 ≤ X₃
t₇: eval_foo_bb2_in(X₀, X₁, X₂, X₃) → eval_foo_bb1_in(1+X₀-2⋅X₂, X₁, X₂, X₃) :|: X₃ ≤ 1+X₀ ∧ X₃ ≤ 1 ∧ 1 ≤ X₀+X₃ ∧ 1 ≤ X₃ ∧ 0 ≤ X₀
t₈: eval_foo_bb3_in(X₀, X₁, X₂, X₃) → eval_foo_stop(X₀, X₁, X₂, X₃)
t₀: eval_foo_start(X₀, X₁, X₂, X₃) → eval_foo_bb0_in(X₀, X₁, X₂, X₃)

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

Found invariant X₃ ≤ 1 ∧ X₃ ≤ 1+X₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₁ for location eval_foo_bb1_in_v1

Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location eval_foo_bb1_in

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

All Bounds

Timebounds

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

Costbounds

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

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₃: 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₃: 1 {O(1)}
t₄, X₁: 2⋅X₁ {O(n)}
t₄, X₂: 2⋅X₂ {O(n)}
t₄, X₃: X₃+1 {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₂: X₂ {O(n)}
t₆, X₃: X₃ {O(n)}
t₇, X₁: X₁ {O(n)}
t₇, X₂: X₂ {O(n)}
t₇, X₃: 1 {O(1)}
t₈, X₁: 5⋅X₁ {O(n)}
t₈, X₂: 5⋅X₂ {O(n)}
t₈, X₃: 4⋅X₃+1 {O(n)}