Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁) → l2(X₀, X₁)
t₂: l1(X₀, X₁) → l3(X₀, X₁) :|: X₀ ≤ 2147483647
t₃: l1(X₀, X₁) → l4(X₀, X₁) :|: 2147483647 < X₀
t₁: l2(X₀, X₁) → l1(X₁, X₁)
t₄: l3(X₀, X₁) → l1(X₀+1, X₁)
t₅: l4(X₀, X₁) → l5(X₀, X₁)
Found invariant X₁ ≤ X₀ ∧ 2147483648 ≤ X₀ for location l5
Found invariant X₁ ≤ X₀ for location l1
Found invariant X₁ ≤ X₀ ∧ 2147483648 ≤ X₀ for location l4
Found invariant X₁ ≤ 2147483647 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 4294967294 ∧ X₀ ≤ 2147483647 for location l3
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁) → l2(X₀, X₁)
t₂: l1(X₀, X₁) → l3(X₀, X₁) :|: X₀ ≤ 2147483647 ∧ X₁ ≤ X₀
t₃: l1(X₀, X₁) → l4(X₀, X₁) :|: 2147483647 < X₀ ∧ X₁ ≤ X₀
t₁: l2(X₀, X₁) → l1(X₁, X₁)
t₄: l3(X₀, X₁) → l1(X₀+1, X₁) :|: X₁ ≤ 2147483647 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 4294967294 ∧ X₀ ≤ 2147483647
t₅: l4(X₀, X₁) → l5(X₀, X₁) :|: X₁ ≤ X₀ ∧ 2147483648 ≤ X₀
Found invariant X₁ ≤ X₀ ∧ 2147483648 ≤ X₀ for location l5
Found invariant X₁ ≤ X₀ for location l1
Found invariant X₁ ≤ X₀ ∧ 2147483648 ≤ X₀ for location l4
Found invariant X₁ ≤ 2147483647 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 4294967294 ∧ X₀ ≤ 2147483647 for location l3
Termination: true
Formula:
relevant size-bounds w.r.t. t₁:
X₀: X₁ {O(n)}
Runtime-bound of t₁: 1 {O(1)}
Results in: 2⋅X₁+4294967298 {O(n)}
relevant size-bounds w.r.t. t₁:
X₀: X₁ {O(n)}
Runtime-bound of t₁: 1 {O(1)}
Results in: 2⋅X₁+4294967298 {O(n)}
Overall timebound:4⋅X₁+8589934600 {O(n)}
t₀: 1 {O(1)}
t₂: 2⋅X₁+4294967298 {O(n)}
t₃: 1 {O(1)}
t₁: 1 {O(1)}
t₄: 2⋅X₁+4294967298 {O(n)}
t₅: 1 {O(1)}
Overall costbound: 4⋅X₁+8589934600 {O(n)}
t₀: 1 {O(1)}
t₂: 2⋅X₁+4294967298 {O(n)}
t₃: 1 {O(1)}
t₁: 1 {O(1)}
t₄: 2⋅X₁+4294967298 {O(n)}
t₅: 1 {O(1)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₂, X₀: 3⋅X₁+4294967298 {O(n)}
t₂, X₁: X₁ {O(n)}
t₃, X₀: 4⋅X₁+4294967298 {O(n)}
t₃, X₁: 2⋅X₁ {O(n)}
t₁, X₀: X₁ {O(n)}
t₁, X₁: X₁ {O(n)}
t₄, X₀: 3⋅X₁+4294967298 {O(n)}
t₄, X₁: X₁ {O(n)}
t₅, X₀: 4⋅X₁+4294967298 {O(n)}
t₅, X₁: 2⋅X₁ {O(n)}