Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487097628
details
property
value
status
complete
benchmark
eric.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n150.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
2.23242 seconds
cpu usage
2.21482
user time
2.15432
system time
0.060496
max virtual memory
278328.0
max residence set size
21080.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: l3 0: l0 -> l1 : id^0'=id^post0, x^0'=x^post0, m^0'=m^post0, (x^0-m^0 <= 0 /\ -x^post0 <= 0 /\ id^0-id^post0 == 0 /\ -1-m^0+x^post0 <= 0 /\ -m^post0+m^0 == 0 /\ -1-x^0+x^post0 == 0), cost: 1 1: l0 -> l1 : id^0'=id^post1, x^0'=x^post1, m^0'=m^post1, (-x^post1 <= 0 /\ 1-x^0 <= 0 /\ -1-m^0+x^post1 <= 0 /\ id^0-id^post1 == 0 /\ 1-x^0+m^0 <= 0 /\ m^0-m^post1 == 0 /\ x^post1 == 0), cost: 1 2: l1 -> l0 : id^0'=id^post2, x^0'=x^post2, m^0'=m^post2, (x^0-x^post2 == 0 /\ m^0-m^post2 == 0 /\ 1+id^0-x^0 <= 0 /\ id^0-id^post2 == 0), cost: 1 3: l1 -> l0 : id^0'=id^post3, x^0'=x^post3, m^0'=m^post3, (m^0-m^post3 == 0 /\ 1-id^0+x^0 <= 0 /\ id^0-id^post3 == 0 /\ x^0-x^post3 == 0), cost: 1 4: l2 -> l1 : id^0'=id^post4, x^0'=x^post4, m^0'=m^post4, (1-id^0 <= 0 /\ 1-m^0 <= 0 /\ -x^post4 <= 0 /\ -1+x^post4-m^0 <= 0 /\ -1-id^0+x^post4 == 0 /\ id^0-m^0 <= 0 /\ m^0-m^post4 == 0 /\ id^0-id^post4 == 0), cost: 1 5: l3 -> l2 : id^0'=id^post5, x^0'=x^post5, m^0'=m^post5, (id^0-id^post5 == 0 /\ x^0-x^post5 == 0 /\ m^0-m^post5 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : id^0'=id^post0, x^0'=x^post0, m^0'=m^post0, (x^0-m^0 <= 0 /\ -x^post0 <= 0 /\ id^0-id^post0 == 0 /\ -1-m^0+x^post0 <= 0 /\ -m^post0+m^0 == 0 /\ -1-x^0+x^post0 == 0), cost: 1 New rule: l0 -> l1 : x^0'=1+x^0, (x^0-m^0 <= 0 /\ 1+x^0 >= 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : id^0'=id^post1, x^0'=x^post1, m^0'=m^post1, (-x^post1 <= 0 /\ 1-x^0 <= 0 /\ -1-m^0+x^post1 <= 0 /\ id^0-id^post1 == 0 /\ 1-x^0+m^0 <= 0 /\ m^0-m^post1 == 0 /\ x^post1 == 0), cost: 1 New rule: l0 -> l1 : x^0'=0, (-1+x^0 >= 0 /\ 1-x^0+m^0 <= 0 /\ 1+m^0 >= 0), cost: 1 Applied preprocessing Original rule: l1 -> l0 : id^0'=id^post2, x^0'=x^post2, m^0'=m^post2, (x^0-x^post2 == 0 /\ m^0-m^post2 == 0 /\ 1+id^0-x^0 <= 0 /\ id^0-id^post2 == 0), cost: 1 New rule: l1 -> l0 : 1+id^0-x^0 <= 0, cost: 1 Applied preprocessing Original rule: l1 -> l0 : id^0'=id^post3, x^0'=x^post3, m^0'=m^post3, (m^0-m^post3 == 0 /\ 1-id^0+x^0 <= 0 /\ id^0-id^post3 == 0 /\ x^0-x^post3 == 0), cost: 1 New rule: l1 -> l0 : 1-id^0+x^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l1 : id^0'=id^post4, x^0'=x^post4, m^0'=m^post4, (1-id^0 <= 0 /\ 1-m^0 <= 0 /\ -x^post4 <= 0 /\ -1+x^post4-m^0 <= 0 /\ -1-id^0+x^post4 == 0 /\ id^0-m^0 <= 0 /\ m^0-m^post4 == 0 /\ id^0-id^post4 == 0), cost: 1 New rule: l2 -> l1 : x^0'=1+id^0, (-1+id^0 >= 0 /\ id^0-m^0 <= 0), cost: 1 Applied preprocessing Original rule: l3 -> l2 : id^0'=id^post5, x^0'=x^post5, m^0'=m^post5, (id^0-id^post5 == 0 /\ x^0-x^post5 == 0 /\ m^0-m^post5 == 0), cost: 1 New rule: l3 -> l2 : TRUE, cost: 1 Simplified rules Start location: l3 6: l0 -> l1 : x^0'=1+x^0, (x^0-m^0 <= 0 /\ 1+x^0 >= 0), cost: 1 7: l0 -> l1 : x^0'=0, (-1+x^0 >= 0 /\ 1-x^0+m^0 <= 0 /\ 1+m^0 >= 0), cost: 1 8: l1 -> l0 : 1+id^0-x^0 <= 0, cost: 1 9: l1 -> l0 : 1-id^0+x^0 <= 0, cost: 1 10: l2 -> l1 : x^0'=1+id^0, (-1+id^0 >= 0 /\ id^0-m^0 <= 0), cost: 1 11: l3 -> l2 : TRUE, cost: 1 Eliminating location l2 by chaining: Applied chaining First rule: l3 -> l2 : TRUE, cost: 1 Second rule: l2 -> l1 : x^0'=1+id^0, (-1+id^0 >= 0 /\ id^0-m^0 <= 0), cost: 1 New rule: l3 -> l1 : x^0'=1+id^0, (-1+id^0 >= 0 /\ id^0-m^0 <= 0), cost: 2 Applied deletion Removed the following rules: 10 11 Eliminated locations on linear paths Start location: l3 6: l0 -> l1 : x^0'=1+x^0, (x^0-m^0 <= 0 /\ 1+x^0 >= 0), cost: 1 7: l0 -> l1 : x^0'=0, (-1+x^0 >= 0 /\ 1-x^0+m^0 <= 0 /\ 1+m^0 >= 0), cost: 1 8: l1 -> l0 : 1+id^0-x^0 <= 0, cost: 1 9: l1 -> l0 : 1-id^0+x^0 <= 0, cost: 1 12: l3 -> l1 : x^0'=1+id^0, (-1+id^0 >= 0 /\ id^0-m^0 <= 0), cost: 2 Eliminating location l0 by chaining: Applied chaining First rule: l1 -> l0 : 1+id^0-x^0 <= 0, cost: 1 Second rule: l0 -> l1 : x^0'=1+x^0, (x^0-m^0 <= 0 /\ 1+x^0 >= 0), cost: 1 New rule: l1 -> l1 : x^0'=1+x^0, (x^0-m^0 <= 0 /\ 1+id^0-x^0 <= 0 /\ 1+x^0 >= 0), cost: 2 Applied chaining First rule: l1 -> l0 : 1+id^0-x^0 <= 0, cost: 1 Second rule: l0 -> l1 : x^0'=0, (-1+x^0 >= 0 /\ 1-x^0+m^0 <= 0 /\ 1+m^0 >= 0), cost: 1 New rule: l1 -> l1 : x^0'=0, (-1+x^0 >= 0 /\ 1-x^0+m^0 <= 0 /\ 1+id^0-x^0 <= 0 /\ 1+m^0 >= 0), cost: 2 Applied chaining First rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS