Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098339
details
property
value
status
complete
benchmark
ex12.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.054708 seconds
cpu usage
0.055536
user time
0.0406
system time
0.014936
max virtual memory
113188.0
max residence set size
18312.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: l4 0: l0 -> l1 : i^0'=i^post0, j^0'=j^post0, (j^0-j^post0 == 0 /\ i^0-i^post0 == 0 /\ 20-j^0 <= 0), cost: 1 1: l0 -> l2 : i^0'=i^post1, j^0'=j^post1, (-j^post1+j^0 == 0 /\ -19+j^0 <= 0 /\ i^0-i^post1 == 0), cost: 1 2: l2 -> l0 : i^0'=i^post2, j^0'=j^post2, (-2+j^post2-j^0 == 0 /\ -2-j^post2+i^post2 == 0), cost: 1 3: l3 -> l2 : i^0'=i^post3, j^0'=j^post3, (i^0-i^post3 == 0 /\ j^post3 == 0), cost: 1 4: l4 -> l3 : i^0'=i^post4, j^0'=j^post4, (i^0-i^post4 == 0 /\ -j^post4+j^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l4 1: l0 -> l2 : i^0'=i^post1, j^0'=j^post1, (-j^post1+j^0 == 0 /\ -19+j^0 <= 0 /\ i^0-i^post1 == 0), cost: 1 2: l2 -> l0 : i^0'=i^post2, j^0'=j^post2, (-2+j^post2-j^0 == 0 /\ -2-j^post2+i^post2 == 0), cost: 1 3: l3 -> l2 : i^0'=i^post3, j^0'=j^post3, (i^0-i^post3 == 0 /\ j^post3 == 0), cost: 1 4: l4 -> l3 : i^0'=i^post4, j^0'=j^post4, (i^0-i^post4 == 0 /\ -j^post4+j^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l2 : i^0'=i^post1, j^0'=j^post1, (-j^post1+j^0 == 0 /\ -19+j^0 <= 0 /\ i^0-i^post1 == 0), cost: 1 New rule: l0 -> l2 : -19+j^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : i^0'=i^post2, j^0'=j^post2, (-2+j^post2-j^0 == 0 /\ -2-j^post2+i^post2 == 0), cost: 1 New rule: l2 -> l0 : i^0'=4+j^0, j^0'=2+j^0, TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l2 : i^0'=i^post3, j^0'=j^post3, (i^0-i^post3 == 0 /\ j^post3 == 0), cost: 1 New rule: l3 -> l2 : j^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l3 : i^0'=i^post4, j^0'=j^post4, (i^0-i^post4 == 0 /\ -j^post4+j^0 == 0), cost: 1 New rule: l4 -> l3 : TRUE, cost: 1 Simplified rules Start location: l4 5: l0 -> l2 : -19+j^0 <= 0, cost: 1 6: l2 -> l0 : i^0'=4+j^0, j^0'=2+j^0, TRUE, cost: 1 7: l3 -> l2 : j^0'=0, TRUE, cost: 1 8: l4 -> l3 : TRUE, cost: 1 Eliminating location l3 by chaining: Applied chaining First rule: l4 -> l3 : TRUE, cost: 1 Second rule: l3 -> l2 : j^0'=0, TRUE, cost: 1 New rule: l4 -> l2 : j^0'=0, TRUE, cost: 2 Applied deletion Removed the following rules: 7 8 Eliminating location l0 by chaining: Applied chaining First rule: l2 -> l0 : i^0'=4+j^0, j^0'=2+j^0, TRUE, cost: 1 Second rule: l0 -> l2 : -19+j^0 <= 0, cost: 1 New rule: l2 -> l2 : i^0'=4+j^0, j^0'=2+j^0, -17+j^0 <= 0, cost: 2 Applied deletion Removed the following rules: 5 6 Eliminated locations on linear paths Start location: l4 10: l2 -> l2 : i^0'=4+j^0, j^0'=2+j^0, -17+j^0 <= 0, cost: 2 9: l4 -> l2 : j^0'=0, TRUE, cost: 2 Applied acceleration Original rule: l2 -> l2 : i^0'=4+j^0, j^0'=2+j^0, -17+j^0 <= 0, cost: 2 New rule: l2 -> l2 : i^0'=2+2*n0+j^0, j^0'=2*n0+j^0, (19-2*n0-j^0 >= 0 /\ -1+n0 >= 0), cost: 2*n0 Applied deletion Removed the following rules: 10 Accelerated simple loops Start location: l4 11: l2 -> l2 : i^0'=2+2*n0+j^0, j^0'=2*n0+j^0, (19-2*n0-j^0 >= 0 /\ -1+n0 >= 0), cost: 2*n0 9: l4 -> l2 : j^0'=0, TRUE, 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