Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099086
details
property
value
status
complete
benchmark
ex2.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n148.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.064468 seconds
cpu usage
0.065501
user time
0.055167
system time
0.010334
max virtual memory
113188.0
max residence set size
7996.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l7 0: l0 -> l1 : i5^0'=i5^post0, tmp^0'=tmp^post0, n_promoted_1^0'=n_promoted_1^post0, tmp___0^0'=tmp___0^post0, (0 == 0 /\ -1023+n_promoted_1^0 <= 0 /\ n_promoted_1^0-n_promoted_1^post0 == 0 /\ i5^0-i5^post0 == 0 /\ tmp^0-tmp^post0 == 0), cost: 1 1: l0 -> l1 : i5^0'=i5^post1, tmp^0'=tmp^post1, n_promoted_1^0'=n_promoted_1^post1, tmp___0^0'=tmp___0^post1, (-n_promoted_1^post1+n_promoted_1^0 == 0 /\ 1024-n_promoted_1^0 <= 0 /\ i5^0-i5^post1 == 0 /\ -tmp^post1+tmp^0 == 0 /\ -tmp___0^post1+tmp___0^0 == 0), cost: 1 2: l1 -> l2 : i5^0'=i5^post2, tmp^0'=tmp^post2, n_promoted_1^0'=n_promoted_1^post2, tmp___0^0'=tmp___0^post2, (i5^post2 == 0 /\ -n_promoted_1^post2+n_promoted_1^0 == 0 /\ tmp^0-tmp^post2 == 0 /\ -tmp___0^post2+tmp___0^0 == 0), cost: 1 5: l2 -> l4 : i5^0'=i5^post5, tmp^0'=tmp^post5, n_promoted_1^0'=n_promoted_1^post5, tmp___0^0'=tmp___0^post5, (i5^0-i5^post5 == 0 /\ tmp^0-tmp^post5 == 0 /\ -tmp___0^post5+tmp___0^0 == 0 /\ -n_promoted_1^post5+n_promoted_1^0 == 0), cost: 1 3: l3 -> l0 : i5^0'=i5^post3, tmp^0'=tmp^post3, n_promoted_1^0'=n_promoted_1^post3, tmp___0^0'=tmp___0^post3, (i5^0-i5^post3 == 0 /\ 1-n_promoted_1^0 <= 0 /\ tmp^0-tmp^post3 == 0 /\ n_promoted_1^0-n_promoted_1^post3 == 0 /\ -tmp___0^post3+tmp___0^0 == 0), cost: 1 4: l3 -> l1 : i5^0'=i5^post4, tmp^0'=tmp^post4, n_promoted_1^0'=n_promoted_1^post4, tmp___0^0'=tmp___0^post4, (i5^0-i5^post4 == 0 /\ n_promoted_1^0 <= 0 /\ -tmp___0^post4+tmp___0^0 == 0 /\ -n_promoted_1^post4+n_promoted_1^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 6: l4 -> l5 : i5^0'=i5^post6, tmp^0'=tmp^post6, n_promoted_1^0'=n_promoted_1^post6, tmp___0^0'=tmp___0^post6, (tmp^0-tmp^post6 == 0 /\ tmp___0^0-tmp___0^post6 == 0 /\ i5^0-i5^post6 == 0 /\ -n_promoted_1^post6+n_promoted_1^0 == 0), cost: 1 7: l4 -> l2 : i5^0'=i5^post7, tmp^0'=tmp^post7, n_promoted_1^0'=n_promoted_1^post7, tmp___0^0'=tmp___0^post7, (n_promoted_1^0-n_promoted_1^post7 == 0 /\ tmp^0-tmp^post7 == 0 /\ -tmp___0^post7+tmp___0^0 == 0 /\ -1-i5^0+i5^post7 == 0), cost: 1 8: l6 -> l3 : i5^0'=i5^post8, tmp^0'=tmp^post8, n_promoted_1^0'=n_promoted_1^post8, tmp___0^0'=tmp___0^post8, (0 == 0 /\ n_promoted_1^post8-tmp^post8 == 0 /\ -tmp___0^post8+tmp___0^0 == 0 /\ i5^0-i5^post8 == 0), cost: 1 9: l7 -> l6 : i5^0'=i5^post9, tmp^0'=tmp^post9, n_promoted_1^0'=n_promoted_1^post9, tmp___0^0'=tmp___0^post9, (-tmp^post9+tmp^0 == 0 /\ i5^0-i5^post9 == 0 /\ -tmp___0^post9+tmp___0^0 == 0 /\ -n_promoted_1^post9+n_promoted_1^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l7 0: l0 -> l1 : i5^0'=i5^post0, tmp^0'=tmp^post0, n_promoted_1^0'=n_promoted_1^post0, tmp___0^0'=tmp___0^post0, (0 == 0 /\ -1023+n_promoted_1^0 <= 0 /\ n_promoted_1^0-n_promoted_1^post0 == 0 /\ i5^0-i5^post0 == 0 /\ tmp^0-tmp^post0 == 0), cost: 1 1: l0 -> l1 : i5^0'=i5^post1, tmp^0'=tmp^post1, n_promoted_1^0'=n_promoted_1^post1, tmp___0^0'=tmp___0^post1, (-n_promoted_1^post1+n_promoted_1^0 == 0 /\ 1024-n_promoted_1^0 <= 0 /\ i5^0-i5^post1 == 0 /\ -tmp^post1+tmp^0 == 0 /\ -tmp___0^post1+tmp___0^0 == 0), cost: 1 2: l1 -> l2 : i5^0'=i5^post2, tmp^0'=tmp^post2, n_promoted_1^0'=n_promoted_1^post2, tmp___0^0'=tmp___0^post2, (i5^post2 == 0 /\ -n_promoted_1^post2+n_promoted_1^0 == 0 /\ tmp^0-tmp^post2 == 0 /\ -tmp___0^post2+tmp___0^0 == 0), cost: 1 5: l2 -> l4 : i5^0'=i5^post5, tmp^0'=tmp^post5, n_promoted_1^0'=n_promoted_1^post5, tmp___0^0'=tmp___0^post5, (i5^0-i5^post5 == 0 /\ tmp^0-tmp^post5 == 0 /\ -tmp___0^post5+tmp___0^0 == 0 /\ -n_promoted_1^post5+n_promoted_1^0 == 0), cost: 1 3: l3 -> l0 : i5^0'=i5^post3, tmp^0'=tmp^post3, n_promoted_1^0'=n_promoted_1^post3, tmp___0^0'=tmp___0^post3, (i5^0-i5^post3 == 0 /\ 1-n_promoted_1^0 <= 0 /\ tmp^0-tmp^post3 == 0 /\ n_promoted_1^0-n_promoted_1^post3 == 0 /\ -tmp___0^post3+tmp___0^0 == 0), cost: 1 4: l3 -> l1 : i5^0'=i5^post4, tmp^0'=tmp^post4, n_promoted_1^0'=n_promoted_1^post4, tmp___0^0'=tmp___0^post4, (i5^0-i5^post4 == 0 /\ n_promoted_1^0 <= 0 /\ -tmp___0^post4+tmp___0^0 == 0 /\ -n_promoted_1^post4+n_promoted_1^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 7: l4 -> l2 : i5^0'=i5^post7, tmp^0'=tmp^post7, n_promoted_1^0'=n_promoted_1^post7, tmp___0^0'=tmp___0^post7, (n_promoted_1^0-n_promoted_1^post7 == 0 /\ tmp^0-tmp^post7 == 0 /\ -tmp___0^post7+tmp___0^0 == 0 /\ -1-i5^0+i5^post7 == 0), cost: 1 8: l6 -> l3 : i5^0'=i5^post8, tmp^0'=tmp^post8, n_promoted_1^0'=n_promoted_1^post8, tmp___0^0'=tmp___0^post8, (0 == 0 /\ n_promoted_1^post8-tmp^post8 == 0 /\ -tmp___0^post8+tmp___0^0 == 0 /\ i5^0-i5^post8 == 0), cost: 1 9: l7 -> l6 : i5^0'=i5^post9, tmp^0'=tmp^post9, n_promoted_1^0'=n_promoted_1^post9, tmp___0^0'=tmp___0^post9, (-tmp^post9+tmp^0 == 0 /\ i5^0-i5^post9 == 0 /\ -tmp___0^post9+tmp___0^0 == 0 /\ -n_promoted_1^post9+n_promoted_1^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : i5^0'=i5^post0, tmp^0'=tmp^post0, n_promoted_1^0'=n_promoted_1^post0, tmp___0^0'=tmp___0^post0, (0 == 0 /\ -1023+n_promoted_1^0 <= 0 /\ n_promoted_1^0-n_promoted_1^post0 == 0 /\ i5^0-i5^post0 == 0 /\ tmp^0-tmp^post0 == 0), cost: 1 New rule: l0 -> l1 : tmp___0^0'=tmp___0^post0, -1023+n_promoted_1^0 <= 0, cost: 1 Applied preprocessing Original rule: l0 -> l1 : i5^0'=i5^post1, tmp^0'=tmp^post1, n_promoted_1^0'=n_promoted_1^post1, tmp___0^0'=tmp___0^post1, (-n_promoted_1^post1+n_promoted_1^0 == 0 /\ 1024-n_promoted_1^0 <= 0 /\ i5^0-i5^post1 == 0 /\ -tmp^post1+tmp^0 == 0 /\ -tmp___0^post1+tmp___0^0 == 0), cost: 1 New rule: l0 -> l1 : -1024+n_promoted_1^0 >= 0, cost: 1 Applied preprocessing Original rule: l1 -> l2 : i5^0'=i5^post2, tmp^0'=tmp^post2, n_promoted_1^0'=n_promoted_1^post2, tmp___0^0'=tmp___0^post2, (i5^post2 == 0 /\ -n_promoted_1^post2+n_promoted_1^0 == 0 /\ tmp^0-tmp^post2 == 0 /\ -tmp___0^post2+tmp___0^0 == 0), cost: 1 New rule: l1 -> l2 : i5^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l0 : i5^0'=i5^post3, tmp^0'=tmp^post3, n_promoted_1^0'=n_promoted_1^post3, tmp___0^0'=tmp___0^post3, (i5^0-i5^post3 == 0 /\ 1-n_promoted_1^0 <= 0 /\ tmp^0-tmp^post3 == 0 /\ n_promoted_1^0-n_promoted_1^post3 == 0 /\ -tmp___0^post3+tmp___0^0 == 0), cost: 1 New rule: l3 -> l0 : -1+n_promoted_1^0 >= 0, cost: 1 Applied preprocessing Original rule: l3 -> l1 : i5^0'=i5^post4, tmp^0'=tmp^post4, n_promoted_1^0'=n_promoted_1^post4, tmp___0^0'=tmp___0^post4, (i5^0-i5^post4 == 0 /\ n_promoted_1^0 <= 0 /\ -tmp___0^post4+tmp___0^0 == 0 /\ -n_promoted_1^post4+n_promoted_1^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 New rule: l3 -> l1 : n_promoted_1^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l4 : i5^0'=i5^post5, tmp^0'=tmp^post5, n_promoted_1^0'=n_promoted_1^post5, tmp___0^0'=tmp___0^post5, (i5^0-i5^post5 == 0 /\ tmp^0-tmp^post5 == 0 /\ -tmp___0^post5+tmp___0^0 == 0 /\ -n_promoted_1^post5+n_promoted_1^0 == 0), cost: 1 New rule: l2 -> l4 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l2 : i5^0'=i5^post7, tmp^0'=tmp^post7, n_promoted_1^0'=n_promoted_1^post7, tmp___0^0'=tmp___0^post7, (n_promoted_1^0-n_promoted_1^post7 == 0 /\ tmp^0-tmp^post7 == 0 /\ -tmp___0^post7+tmp___0^0 == 0 /\ -1-i5^0+i5^post7 == 0), cost: 1 New rule: l4 -> l2 : i5^0'=1+i5^0, TRUE, cost: 1 Applied preprocessing Original rule: l6 -> l3 : i5^0'=i5^post8, tmp^0'=tmp^post8, n_promoted_1^0'=n_promoted_1^post8, tmp___0^0'=tmp___0^post8, (0 == 0 /\ n_promoted_1^post8-tmp^post8 == 0 /\ -tmp___0^post8+tmp___0^0 == 0 /\ i5^0-i5^post8 == 0), cost: 1 New rule: l6 -> l3 : tmp^0'=tmp^post8, n_promoted_1^0'=tmp^post8, 0 == 0, cost: 1 Applied preprocessing Original rule: l7 -> l6 : i5^0'=i5^post9, tmp^0'=tmp^post9, n_promoted_1^0'=n_promoted_1^post9, tmp___0^0'=tmp___0^post9, (-tmp^post9+tmp^0 == 0 /\ i5^0-i5^post9 == 0 /\ -tmp___0^post9+tmp___0^0 == 0 /\ -n_promoted_1^post9+n_promoted_1^0 == 0), cost: 1 New rule: l7 -> l6 : TRUE, cost: 1 Simplified rules Start location: l7 10: l0 -> l1 : tmp___0^0'=tmp___0^post0, -1023+n_promoted_1^0 <= 0, cost: 1 11: l0 -> l1 : -1024+n_promoted_1^0 >= 0, cost: 1 12: l1 -> l2 : i5^0'=0, TRUE, cost: 1 15: l2 -> l4 : TRUE, cost: 1 13: l3 -> l0 : -1+n_promoted_1^0 >= 0, cost: 1 14: l3 -> l1 : n_promoted_1^0 <= 0, cost: 1 16: l4 -> l2 : i5^0'=1+i5^0, TRUE, cost: 1 17: l6 -> l3 : tmp^0'=tmp^post8, n_promoted_1^0'=tmp^post8, 0 == 0, cost: 1 18: l7 -> l6 : TRUE, cost: 1 Eliminating location l6 by chaining: Applied chaining First rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS