Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098984
details
property
value
status
complete
benchmark
mc91test.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n142.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
1.12882 seconds
cpu usage
1.14359
user time
1.06001
system time
0.083581
max virtual memory
278484.0
max residence set size
32196.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: l7 0: l0 -> l1 : copied^0'=copied^post0, n^0'=n^post0, oldn^0'=oldn^post0, e^0'=e^post0, olde^0'=olde^post0, (1-copied^0 <= 0 /\ -e^0+olde^0 <= 0 /\ oldn^0-oldn^post0 == 0 /\ copied^0-copied^post0 == 0 /\ -olde^post0+olde^0 == 0 /\ -e^post0+e^0 == 0 /\ n^0-n^post0 == 0 /\ n^0-oldn^0 <= 0), cost: 1 1: l0 -> l2 : copied^0'=copied^post1, n^0'=n^post1, oldn^0'=oldn^post1, e^0'=e^post1, olde^0'=olde^post1, (copied^0 <= 0 /\ olde^post1-e^0 == 0 /\ -100+n^0 <= 0 /\ -1+copied^post1 == 0 /\ -1-e^0+e^post1 == 0 /\ 1-e^0 <= 0 /\ -11+n^post1-n^0 == 0 /\ -n^0+oldn^post1 == 0), cost: 1 3: l0 -> l3 : copied^0'=copied^post3, n^0'=n^post3, oldn^0'=oldn^post3, e^0'=e^post3, olde^0'=olde^post3, (copied^0 <= 0 /\ -n^0+oldn^post3 == 0 /\ 10-n^0+n^post3 == 0 /\ 1-e^0+e^post3 == 0 /\ -1+copied^post3 == 0 /\ 1-e^0 <= 0 /\ 101-n^0 <= 0 /\ olde^post3-e^0 == 0), cost: 1 5: l0 -> l4 : copied^0'=copied^post5, n^0'=n^post5, oldn^0'=oldn^post5, e^0'=e^post5, olde^0'=olde^post5, (-100+n^0 <= 0 /\ -1+e^post5-e^0 == 0 /\ -olde^post5+olde^0 == 0 /\ 1-e^0 <= 0 /\ oldn^0-oldn^post5 == 0 /\ -11-n^0+n^post5 == 0 /\ copied^0-copied^post5 == 0), cost: 1 7: l0 -> l5 : copied^0'=copied^post7, n^0'=n^post7, oldn^0'=oldn^post7, e^0'=e^post7, olde^0'=olde^post7, (1+e^post7-e^0 == 0 /\ 1-e^0 <= 0 /\ 101-n^0 <= 0 /\ copied^0-copied^post7 == 0 /\ oldn^0-oldn^post7 == 0 /\ 10-n^0+n^post7 == 0 /\ -olde^post7+olde^0 == 0), cost: 1 2: l2 -> l0 : copied^0'=copied^post2, n^0'=n^post2, oldn^0'=oldn^post2, e^0'=e^post2, olde^0'=olde^post2, (copied^0-copied^post2 == 0 /\ -e^post2+e^0 == 0 /\ -oldn^post2+oldn^0 == 0 /\ n^0-n^post2 == 0 /\ -olde^post2+olde^0 == 0), cost: 1 4: l3 -> l0 : copied^0'=copied^post4, n^0'=n^post4, oldn^0'=oldn^post4, e^0'=e^post4, olde^0'=olde^post4, (-olde^post4+olde^0 == 0 /\ -oldn^post4+oldn^0 == 0 /\ -e^post4+e^0 == 0 /\ copied^0-copied^post4 == 0 /\ n^0-n^post4 == 0), cost: 1 6: l4 -> l0 : copied^0'=copied^post6, n^0'=n^post6, oldn^0'=oldn^post6, e^0'=e^post6, olde^0'=olde^post6, (olde^0-olde^post6 == 0 /\ -oldn^post6+oldn^0 == 0 /\ copied^0-copied^post6 == 0 /\ n^0-n^post6 == 0 /\ -e^post6+e^0 == 0), cost: 1 8: l5 -> l0 : copied^0'=copied^post8, n^0'=n^post8, oldn^0'=oldn^post8, e^0'=e^post8, olde^0'=olde^post8, (-olde^post8+olde^0 == 0 /\ copied^0-copied^post8 == 0 /\ -e^post8+e^0 == 0 /\ n^0-n^post8 == 0 /\ -oldn^post8+oldn^0 == 0), cost: 1 9: l6 -> l0 : copied^0'=copied^post9, n^0'=n^post9, oldn^0'=oldn^post9, e^0'=e^post9, olde^0'=olde^post9, (0 == 0 /\ copied^post9 == 0 /\ -1+e^post9 == 0 /\ -olde^post9+olde^0 == 0 /\ oldn^0-oldn^post9 == 0), cost: 1 10: l7 -> l6 : copied^0'=copied^post10, n^0'=n^post10, oldn^0'=oldn^post10, e^0'=e^post10, olde^0'=olde^post10, (olde^0-olde^post10 == 0 /\ -oldn^post10+oldn^0 == 0 /\ -e^post10+e^0 == 0 /\ copied^0-copied^post10 == 0 /\ n^0-n^post10 == 0), cost: 1 Removed unreachable rules and leafs Start location: l7 1: l0 -> l2 : copied^0'=copied^post1, n^0'=n^post1, oldn^0'=oldn^post1, e^0'=e^post1, olde^0'=olde^post1, (copied^0 <= 0 /\ olde^post1-e^0 == 0 /\ -100+n^0 <= 0 /\ -1+copied^post1 == 0 /\ -1-e^0+e^post1 == 0 /\ 1-e^0 <= 0 /\ -11+n^post1-n^0 == 0 /\ -n^0+oldn^post1 == 0), cost: 1 3: l0 -> l3 : copied^0'=copied^post3, n^0'=n^post3, oldn^0'=oldn^post3, e^0'=e^post3, olde^0'=olde^post3, (copied^0 <= 0 /\ -n^0+oldn^post3 == 0 /\ 10-n^0+n^post3 == 0 /\ 1-e^0+e^post3 == 0 /\ -1+copied^post3 == 0 /\ 1-e^0 <= 0 /\ 101-n^0 <= 0 /\ olde^post3-e^0 == 0), cost: 1 5: l0 -> l4 : copied^0'=copied^post5, n^0'=n^post5, oldn^0'=oldn^post5, e^0'=e^post5, olde^0'=olde^post5, (-100+n^0 <= 0 /\ -1+e^post5-e^0 == 0 /\ -olde^post5+olde^0 == 0 /\ 1-e^0 <= 0 /\ oldn^0-oldn^post5 == 0 /\ -11-n^0+n^post5 == 0 /\ copied^0-copied^post5 == 0), cost: 1 7: l0 -> l5 : copied^0'=copied^post7, n^0'=n^post7, oldn^0'=oldn^post7, e^0'=e^post7, olde^0'=olde^post7, (1+e^post7-e^0 == 0 /\ 1-e^0 <= 0 /\ 101-n^0 <= 0 /\ copied^0-copied^post7 == 0 /\ oldn^0-oldn^post7 == 0 /\ 10-n^0+n^post7 == 0 /\ -olde^post7+olde^0 == 0), cost: 1 2: l2 -> l0 : copied^0'=copied^post2, n^0'=n^post2, oldn^0'=oldn^post2, e^0'=e^post2, olde^0'=olde^post2, (copied^0-copied^post2 == 0 /\ -e^post2+e^0 == 0 /\ -oldn^post2+oldn^0 == 0 /\ n^0-n^post2 == 0 /\ -olde^post2+olde^0 == 0), cost: 1 4: l3 -> l0 : copied^0'=copied^post4, n^0'=n^post4, oldn^0'=oldn^post4, e^0'=e^post4, olde^0'=olde^post4, (-olde^post4+olde^0 == 0 /\ -oldn^post4+oldn^0 == 0 /\ -e^post4+e^0 == 0 /\ copied^0-copied^post4 == 0 /\ n^0-n^post4 == 0), cost: 1 6: l4 -> l0 : copied^0'=copied^post6, n^0'=n^post6, oldn^0'=oldn^post6, e^0'=e^post6, olde^0'=olde^post6, (olde^0-olde^post6 == 0 /\ -oldn^post6+oldn^0 == 0 /\ copied^0-copied^post6 == 0 /\ n^0-n^post6 == 0 /\ -e^post6+e^0 == 0), cost: 1 8: l5 -> l0 : copied^0'=copied^post8, n^0'=n^post8, oldn^0'=oldn^post8, e^0'=e^post8, olde^0'=olde^post8, (-olde^post8+olde^0 == 0 /\ copied^0-copied^post8 == 0 /\ -e^post8+e^0 == 0 /\ n^0-n^post8 == 0 /\ -oldn^post8+oldn^0 == 0), cost: 1 9: l6 -> l0 : copied^0'=copied^post9, n^0'=n^post9, oldn^0'=oldn^post9, e^0'=e^post9, olde^0'=olde^post9, (0 == 0 /\ copied^post9 == 0 /\ -1+e^post9 == 0 /\ -olde^post9+olde^0 == 0 /\ oldn^0-oldn^post9 == 0), cost: 1 10: l7 -> l6 : copied^0'=copied^post10, n^0'=n^post10, oldn^0'=oldn^post10, e^0'=e^post10, olde^0'=olde^post10, (olde^0-olde^post10 == 0 /\ -oldn^post10+oldn^0 == 0 /\ -e^post10+e^0 == 0 /\ copied^0-copied^post10 == 0 /\ n^0-n^post10 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l2 : copied^0'=copied^post1, n^0'=n^post1, oldn^0'=oldn^post1, e^0'=e^post1, olde^0'=olde^post1, (copied^0 <= 0 /\ olde^post1-e^0 == 0 /\ -100+n^0 <= 0 /\ -1+copied^post1 == 0 /\ -1-e^0+e^post1 == 0 /\ 1-e^0 <= 0 /\ -11+n^post1-n^0 == 0 /\ -n^0+oldn^post1 == 0), cost: 1 New rule: l0 -> l2 : copied^0'=1, n^0'=11+n^0, oldn^0'=n^0, e^0'=1+e^0, olde^0'=e^0, (copied^0 <= 0 /\ -100+n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 Applied preprocessing Original rule: l2 -> l0 : copied^0'=copied^post2, n^0'=n^post2, oldn^0'=oldn^post2, e^0'=e^post2, olde^0'=olde^post2, (copied^0-copied^post2 == 0 /\ -e^post2+e^0 == 0 /\ -oldn^post2+oldn^0 == 0 /\ n^0-n^post2 == 0 /\ -olde^post2+olde^0 == 0), cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l0 -> l3 : copied^0'=copied^post3, n^0'=n^post3, oldn^0'=oldn^post3, e^0'=e^post3, olde^0'=olde^post3, (copied^0 <= 0 /\ -n^0+oldn^post3 == 0 /\ 10-n^0+n^post3 == 0 /\ 1-e^0+e^post3 == 0 /\ -1+copied^post3 == 0 /\ 1-e^0 <= 0 /\ 101-n^0 <= 0 /\ olde^post3-e^0 == 0), cost: 1 New rule: l0 -> l3 : copied^0'=1, n^0'=-10+n^0, oldn^0'=n^0, e^0'=-1+e^0, olde^0'=e^0, (copied^0 <= 0 /\ -1+e^0 >= 0 /\ -101+n^0 >= 0), cost: 1 Applied preprocessing Original rule: l3 -> l0 : copied^0'=copied^post4, n^0'=n^post4, oldn^0'=oldn^post4, e^0'=e^post4, olde^0'=olde^post4, (-olde^post4+olde^0 == 0 /\ -oldn^post4+oldn^0 == 0 /\ -e^post4+e^0 == 0 /\ copied^0-copied^post4 == 0 /\ n^0-n^post4 == 0), cost: 1 New rule: l3 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l0 -> l4 : copied^0'=copied^post5, n^0'=n^post5, oldn^0'=oldn^post5, e^0'=e^post5, olde^0'=olde^post5, (-100+n^0 <= 0 /\ -1+e^post5-e^0 == 0 /\ -olde^post5+olde^0 == 0 /\ 1-e^0 <= 0 /\ oldn^0-oldn^post5 == 0 /\ -11-n^0+n^post5 == 0 /\ copied^0-copied^post5 == 0), cost: 1 New rule: l0 -> l4 : n^0'=11+n^0, e^0'=1+e^0, (-100+n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 Applied preprocessing Original rule: l4 -> l0 : copied^0'=copied^post6, n^0'=n^post6, oldn^0'=oldn^post6, e^0'=e^post6, olde^0'=olde^post6, (olde^0-olde^post6 == 0 /\ -oldn^post6+oldn^0 == 0 /\ copied^0-copied^post6 == 0 /\ n^0-n^post6 == 0 /\ -e^post6+e^0 == 0), cost: 1 New rule: l4 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l0 -> l5 : copied^0'=copied^post7, n^0'=n^post7, oldn^0'=oldn^post7, e^0'=e^post7, olde^0'=olde^post7, (1+e^post7-e^0 == 0 /\ 1-e^0 <= 0 /\ 101-n^0 <= 0 /\ copied^0-copied^post7 == 0 /\ oldn^0-oldn^post7 == 0 /\ 10-n^0+n^post7 == 0 /\ -olde^post7+olde^0 == 0), cost: 1 New rule: l0 -> l5 : n^0'=-10+n^0, e^0'=-1+e^0, (-1+e^0 >= 0 /\ -101+n^0 >= 0), cost: 1 Applied preprocessing Original rule: l5 -> l0 : copied^0'=copied^post8, n^0'=n^post8, oldn^0'=oldn^post8, e^0'=e^post8, olde^0'=olde^post8, (-olde^post8+olde^0 == 0 /\ copied^0-copied^post8 == 0 /\ -e^post8+e^0 == 0 /\ n^0-n^post8 == 0 /\ -oldn^post8+oldn^0 == 0), cost: 1 New rule: l5 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l6 -> l0 : copied^0'=copied^post9, n^0'=n^post9, oldn^0'=oldn^post9, e^0'=e^post9, olde^0'=olde^post9, (0 == 0 /\ copied^post9 == 0 /\ -1+e^post9 == 0 /\ -olde^post9+olde^0 == 0 /\ oldn^0-oldn^post9 == 0), cost: 1 New rule: l6 -> l0 : copied^0'=0, n^0'=n^post9, e^0'=1, 0 == 0, cost: 1 Applied preprocessing Original rule: l7 -> l6 : copied^0'=copied^post10, n^0'=n^post10, oldn^0'=oldn^post10, e^0'=e^post10, olde^0'=olde^post10, (olde^0-olde^post10 == 0 /\ -oldn^post10+oldn^0 == 0 /\ -e^post10+e^0 == 0 /\ copied^0-copied^post10 == 0 /\ n^0-n^post10 == 0), cost: 1 New rule: l7 -> l6 : TRUE, cost: 1 Simplified rules Start location: l7 11: l0 -> l2 : copied^0'=1, n^0'=11+n^0, oldn^0'=n^0, e^0'=1+e^0, olde^0'=e^0, (copied^0 <= 0 /\ -100+n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 13: l0 -> l3 : copied^0'=1, n^0'=-10+n^0, oldn^0'=n^0, e^0'=-1+e^0, olde^0'=e^0, (copied^0 <= 0 /\ -1+e^0 >= 0 /\ -101+n^0 >= 0), cost: 1 15: l0 -> l4 : n^0'=11+n^0, e^0'=1+e^0, (-100+n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 17: l0 -> l5 : n^0'=-10+n^0, e^0'=-1+e^0, (-1+e^0 >= 0 /\ -101+n^0 >= 0), cost: 1 12: l2 -> l0 : TRUE, cost: 1 14: l3 -> l0 : TRUE, cost: 1 16: l4 -> l0 : TRUE, cost: 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS