Initial Problem

Start: eval_speed_popl10_simple_multiple_start
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: eval_speed_popl10_simple_multiple_bb0_in, eval_speed_popl10_simple_multiple_bb1_in, eval_speed_popl10_simple_multiple_bb2_in, eval_speed_popl10_simple_multiple_bb3_in, eval_speed_popl10_simple_multiple_start, eval_speed_popl10_simple_multiple_stop
Transitions:
t₁: eval_speed_popl10_simple_multiple_bb0_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, 0, 0)
t₂: eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb2_in(X₀, X₁, X₂, X₃) :|: 1+X₂ ≤ X₁
t₃: eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb3_in(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₂
t₄: eval_speed_popl10_simple_multiple_bb2_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, X₂, 1+X₃) :|: 1+X₃ ≤ X₀
t₅: eval_speed_popl10_simple_multiple_bb2_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, 1+X₂, 1+X₃) :|: 1+X₃ ≤ X₀ ∧ X₀ ≤ X₃
t₆: eval_speed_popl10_simple_multiple_bb2_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, X₂, X₃) :|: 1+X₃ ≤ X₀ ∧ X₀ ≤ X₃
t₇: eval_speed_popl10_simple_multiple_bb2_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, 1+X₂, X₃) :|: X₀ ≤ X₃
t₈: eval_speed_popl10_simple_multiple_bb3_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_stop(X₀, X₁, X₂, X₃)
t₀: eval_speed_popl10_simple_multiple_start(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb0_in(X₀, X₁, X₂, X₃)

Preprocessing

Cut unsatisfiable transition [t₅: eval_speed_popl10_simple_multiple_bb2_in→eval_speed_popl10_simple_multiple_bb1_in; t₆: eval_speed_popl10_simple_multiple_bb2_in→eval_speed_popl10_simple_multiple_bb1_in]

Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ for location eval_speed_popl10_simple_multiple_bb1_in

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

Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ X₁ ≤ X₂ for location eval_speed_popl10_simple_multiple_stop

Found invariant 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ X₁ ≤ X₂ for location eval_speed_popl10_simple_multiple_bb3_in

Problem after Preprocessing

Start: eval_speed_popl10_simple_multiple_start
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: eval_speed_popl10_simple_multiple_bb0_in, eval_speed_popl10_simple_multiple_bb1_in, eval_speed_popl10_simple_multiple_bb2_in, eval_speed_popl10_simple_multiple_bb3_in, eval_speed_popl10_simple_multiple_start, eval_speed_popl10_simple_multiple_stop
Transitions:
t₁: eval_speed_popl10_simple_multiple_bb0_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, 0, 0)
t₂: eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb2_in(X₀, X₁, X₂, X₃) :|: 1+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃
t₃: eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb3_in(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₂ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃
t₄: eval_speed_popl10_simple_multiple_bb2_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, X₂, 1+X₃) :|: 1+X₃ ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃
t₇: eval_speed_popl10_simple_multiple_bb2_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, 1+X₂, X₃) :|: X₀ ≤ X₃ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃
t₈: eval_speed_popl10_simple_multiple_bb3_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_stop(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₂ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃
t₀: eval_speed_popl10_simple_multiple_start(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb0_in(X₀, X₁, X₂, X₃)

MPRF for transition t₄: eval_speed_popl10_simple_multiple_bb2_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, X₂, 1+X₃) :|: 1+X₃ ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃ of depth 1:

new bound:

X₀ {O(n)}

• eval_speed_popl10_simple_multiple_bb1_in: [X₀-X₃]
• eval_speed_popl10_simple_multiple_bb2_in: [X₀-X₃]

MPRF for transition t₇: eval_speed_popl10_simple_multiple_bb2_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, 1+X₂, X₃) :|: X₀ ≤ X₃ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃ of depth 1:

new bound:

X₁ {O(n)}

• eval_speed_popl10_simple_multiple_bb1_in: [X₁-X₂]
• eval_speed_popl10_simple_multiple_bb2_in: [X₁-X₂]

knowledge_propagation leads to new time bound X₀+X₁+1 {O(n)} for transition t₂: eval_speed_popl10_simple_multiple_bb1_in(X₀, X₁, X₂, X₃) → eval_speed_popl10_simple_multiple_bb2_in(X₀, X₁, X₂, X₃) :|: 1+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₃

All Bounds

Timebounds

Overall timebound:2⋅X₀+2⋅X₁+5 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₀+X₁+1 {O(n)}
t₃: 1 {O(1)}
t₄: X₀ {O(n)}
t₇: X₁ {O(n)}
t₈: 1 {O(1)}

Costbounds

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