Start: eval_speedFails2_start
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: eval_speedFails2_bb0_in, eval_speedFails2_bb1_in, eval_speedFails2_bb2_in, eval_speedFails2_bb3_in, eval_speedFails2_start, eval_speedFails2_stop
Transitions:
t₁: eval_speedFails2_bb0_in(X₀, X₁, X₂) → eval_speedFails2_bb1_in(X₂, X₁, X₂)
t₂: eval_speedFails2_bb1_in(X₀, X₁, X₂) → eval_speedFails2_bb2_in(X₀, X₁, X₂) :|: 1+X₀ ≤ X₁
t₃: eval_speedFails2_bb1_in(X₀, X₁, X₂) → eval_speedFails2_bb2_in(X₀, X₁, X₂) :|: 1+X₁ ≤ X₀
t₄: eval_speedFails2_bb1_in(X₀, X₁, X₂) → eval_speedFails2_bb3_in(X₀, X₁, X₂) :|: X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₅: eval_speedFails2_bb2_in(X₀, X₁, X₂) → eval_speedFails2_bb1_in(1+X₀, X₁, X₂)
t₆: eval_speedFails2_bb3_in(X₀, X₁, X₂) → eval_speedFails2_stop(X₀, X₁, X₂)
t₀: eval_speedFails2_start(X₀, X₁, X₂) → eval_speedFails2_bb0_in(X₀, X₁, X₂)
Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location eval_speedFails2_stop
Found invariant X₂ ≤ X₀ for location eval_speedFails2_bb1_in
Found invariant X₂ ≤ X₀ for location eval_speedFails2_bb2_in
Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location eval_speedFails2_bb3_in
Start: eval_speedFails2_start
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: eval_speedFails2_bb0_in, eval_speedFails2_bb1_in, eval_speedFails2_bb2_in, eval_speedFails2_bb3_in, eval_speedFails2_start, eval_speedFails2_stop
Transitions:
t₁: eval_speedFails2_bb0_in(X₀, X₁, X₂) → eval_speedFails2_bb1_in(X₂, X₁, X₂)
t₂: eval_speedFails2_bb1_in(X₀, X₁, X₂) → eval_speedFails2_bb2_in(X₀, X₁, X₂) :|: 1+X₀ ≤ X₁ ∧ X₂ ≤ X₀
t₃: eval_speedFails2_bb1_in(X₀, X₁, X₂) → eval_speedFails2_bb2_in(X₀, X₁, X₂) :|: 1+X₁ ≤ X₀ ∧ X₂ ≤ X₀
t₄: eval_speedFails2_bb1_in(X₀, X₁, X₂) → eval_speedFails2_bb3_in(X₀, X₁, X₂) :|: X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₂ ≤ X₀
t₅: eval_speedFails2_bb2_in(X₀, X₁, X₂) → eval_speedFails2_bb1_in(1+X₀, X₁, X₂) :|: X₂ ≤ X₀
t₆: eval_speedFails2_bb3_in(X₀, X₁, X₂) → eval_speedFails2_stop(X₀, X₁, X₂) :|: X₁ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₂ ≤ X₁
t₀: eval_speedFails2_start(X₀, X₁, X₂) → eval_speedFails2_bb0_in(X₀, X₁, X₂)
new bound:
X₁+X₂ {O(n)}
MPRF:
• eval_speedFails2_bb1_in: [X₁-X₀]
• eval_speedFails2_bb2_in: [X₁-1-X₀]
Found invariant 1+X₂ ≤ X₀ ∧ 1+X₁ ≤ X₂ ∧ 2+X₁ ≤ X₀ for location eval_speedFails2_bb1_in_v2
Found invariant 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1+X₀ ≤ X₁ for location eval_speedFails2_bb2_in_v2
Found invariant 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ X₀ ≤ X₁ for location eval_speedFails2_bb1_in_v1
Found invariant X₂ ≤ X₀ ∧ 1+X₁ ≤ X₂ ∧ 1+X₁ ≤ X₀ for location eval_speedFails2_bb2_in_v1
Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location eval_speedFails2_bb3_in
Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location eval_speedFails2_stop
Found invariant X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location eval_speedFails2_bb1_in
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₁+X₂ {O(n)}
t₃: inf {Infinity}
t₄: 1 {O(1)}
t₅: inf {Infinity}
t₆: 1 {O(1)}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₁+X₂ {O(n)}
t₃: inf {Infinity}
t₄: 1 {O(1)}
t₅: inf {Infinity}
t₆: 1 {O(1)}
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)}
t₆, X₁: 2⋅X₁ {O(n)}
t₆, X₂: 2⋅X₂ {O(n)}