Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098600
details
property
value
status
complete
benchmark
acqrel-succeed2.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n147.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.313494 seconds
cpu usage
0.321039
user time
0.274805
system time
0.046234
max virtual memory
113188.0
max residence set size
19368.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l4 0: l0 -> l1 : A^0'=A^post0, dobreak^0'=dobreak^post0, R^0'=R^post0, n^0'=n^post0, (0 == 0 /\ n^0-n^post0 == 0 /\ R^post0 == 0 /\ A^0-A^post0 == 0 /\ R^10 == 0 /\ n^0 <= 0), cost: 1 1: l0 -> l2 : A^0'=A^post1, dobreak^0'=dobreak^post1, R^0'=R^post1, n^0'=n^post1, (A^0-A^post1 == 0 /\ 1+n^post1-n^0 == 0 /\ -R^post1+R^0 == 0 /\ -dobreak^post1+dobreak^0 == 0 /\ 1-n^0 <= 0), cost: 1 3: l1 -> l0 : A^0'=A^post3, dobreak^0'=dobreak^post3, R^0'=R^post3, n^0'=n^post3, (A^post3 == 0 /\ -1+A^10 == 0 /\ -R^post3+R^0 == 0 /\ dobreak^0 <= 0 /\ dobreak^0-dobreak^post3 == 0 /\ -n^post3+n^0 == 0), cost: 1 2: l2 -> l0 : A^0'=A^post2, dobreak^0'=dobreak^post2, R^0'=R^post2, n^0'=n^post2, (A^0-A^post2 == 0 /\ -n^post2+n^0 == 0 /\ dobreak^0-dobreak^post2 == 0 /\ -R^post2+R^0 == 0), cost: 1 4: l3 -> l1 : A^0'=A^post4, dobreak^0'=dobreak^post4, R^0'=R^post4, n^0'=n^post4, (0 == 0 /\ A^post4 == 0 /\ R^post4 == 0), cost: 1 5: l4 -> l3 : A^0'=A^post5, dobreak^0'=dobreak^post5, R^0'=R^post5, n^0'=n^post5, (-n^post5+n^0 == 0 /\ -R^post5+R^0 == 0 /\ A^0-A^post5 == 0 /\ -dobreak^post5+dobreak^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : A^0'=A^post0, dobreak^0'=dobreak^post0, R^0'=R^post0, n^0'=n^post0, (0 == 0 /\ n^0-n^post0 == 0 /\ R^post0 == 0 /\ A^0-A^post0 == 0 /\ R^10 == 0 /\ n^0 <= 0), cost: 1 New rule: l0 -> l1 : dobreak^0'=dobreak^post0, R^0'=0, n^0 <= 0, cost: 1 Applied preprocessing Original rule: l0 -> l2 : A^0'=A^post1, dobreak^0'=dobreak^post1, R^0'=R^post1, n^0'=n^post1, (A^0-A^post1 == 0 /\ 1+n^post1-n^0 == 0 /\ -R^post1+R^0 == 0 /\ -dobreak^post1+dobreak^0 == 0 /\ 1-n^0 <= 0), cost: 1 New rule: l0 -> l2 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : A^0'=A^post2, dobreak^0'=dobreak^post2, R^0'=R^post2, n^0'=n^post2, (A^0-A^post2 == 0 /\ -n^post2+n^0 == 0 /\ dobreak^0-dobreak^post2 == 0 /\ -R^post2+R^0 == 0), cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l0 : A^0'=A^post3, dobreak^0'=dobreak^post3, R^0'=R^post3, n^0'=n^post3, (A^post3 == 0 /\ -1+A^10 == 0 /\ -R^post3+R^0 == 0 /\ dobreak^0 <= 0 /\ dobreak^0-dobreak^post3 == 0 /\ -n^post3+n^0 == 0), cost: 1 New rule: l1 -> l0 : A^0'=0, dobreak^0 <= 0, cost: 1 Applied preprocessing Original rule: l3 -> l1 : A^0'=A^post4, dobreak^0'=dobreak^post4, R^0'=R^post4, n^0'=n^post4, (0 == 0 /\ A^post4 == 0 /\ R^post4 == 0), cost: 1 New rule: l3 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 1 Applied preprocessing Original rule: l4 -> l3 : A^0'=A^post5, dobreak^0'=dobreak^post5, R^0'=R^post5, n^0'=n^post5, (-n^post5+n^0 == 0 /\ -R^post5+R^0 == 0 /\ A^0-A^post5 == 0 /\ -dobreak^post5+dobreak^0 == 0), cost: 1 New rule: l4 -> l3 : TRUE, cost: 1 Simplified rules Start location: l4 6: l0 -> l1 : dobreak^0'=dobreak^post0, R^0'=0, n^0 <= 0, cost: 1 7: l0 -> l2 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 1 9: l1 -> l0 : A^0'=0, dobreak^0 <= 0, cost: 1 8: l2 -> l0 : TRUE, cost: 1 10: l3 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 1 11: l4 -> l3 : TRUE, cost: 1 Eliminating location l3 by chaining: Applied chaining First rule: l4 -> l3 : TRUE, cost: 1 Second rule: l3 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 1 New rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Applied deletion Removed the following rules: 10 11 Eliminating location l2 by chaining: Applied chaining First rule: l0 -> l2 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 1 Second rule: l2 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 2 Applied deletion Removed the following rules: 7 8 Eliminated locations on linear paths Start location: l4 6: l0 -> l1 : dobreak^0'=dobreak^post0, R^0'=0, n^0 <= 0, cost: 1 13: l0 -> l0 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 2 9: l1 -> l0 : A^0'=0, dobreak^0 <= 0, cost: 1 12: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Applied acceleration Original rule: l0 -> l0 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 2 New rule: l0 -> l0 : n^0'=-n0+n^0, (n0 >= 0 /\ -n0+n^0 >= 0), cost: 2*n0 Applied instantiation Original rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS