Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098813
details
property
value
status
complete
benchmark
dsa_test6.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n140.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.043466 seconds
cpu usage
0.044305
user time
0.031619
system time
0.012686
max virtual memory
113188.0
max residence set size
18452.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: l4 0: l0 -> l1 : i4^0'=i4^post0, tmp^0'=tmp^post0, (tmp^0-tmp^post0 == 0 /\ i4^0-i4^post0 == 0 /\ 10-i4^0 <= 0), cost: 1 1: l0 -> l2 : i4^0'=i4^post1, tmp^0'=tmp^post1, (-tmp^post1+tmp^0 == 0 /\ -1-i4^0+i4^post1 == 0 /\ -9+i4^0 <= 0), cost: 1 2: l2 -> l0 : i4^0'=i4^post2, tmp^0'=tmp^post2, (-tmp^post2+tmp^0 == 0 /\ i4^0-i4^post2 == 0), cost: 1 3: l3 -> l2 : i4^0'=i4^post3, tmp^0'=tmp^post3, (0 == 0 /\ i4^post3 == 0), cost: 1 4: l4 -> l3 : i4^0'=i4^post4, tmp^0'=tmp^post4, (i4^0-i4^post4 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l4 1: l0 -> l2 : i4^0'=i4^post1, tmp^0'=tmp^post1, (-tmp^post1+tmp^0 == 0 /\ -1-i4^0+i4^post1 == 0 /\ -9+i4^0 <= 0), cost: 1 2: l2 -> l0 : i4^0'=i4^post2, tmp^0'=tmp^post2, (-tmp^post2+tmp^0 == 0 /\ i4^0-i4^post2 == 0), cost: 1 3: l3 -> l2 : i4^0'=i4^post3, tmp^0'=tmp^post3, (0 == 0 /\ i4^post3 == 0), cost: 1 4: l4 -> l3 : i4^0'=i4^post4, tmp^0'=tmp^post4, (i4^0-i4^post4 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l2 : i4^0'=i4^post1, tmp^0'=tmp^post1, (-tmp^post1+tmp^0 == 0 /\ -1-i4^0+i4^post1 == 0 /\ -9+i4^0 <= 0), cost: 1 New rule: l0 -> l2 : i4^0'=1+i4^0, -9+i4^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : i4^0'=i4^post2, tmp^0'=tmp^post2, (-tmp^post2+tmp^0 == 0 /\ i4^0-i4^post2 == 0), cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l2 : i4^0'=i4^post3, tmp^0'=tmp^post3, (0 == 0 /\ i4^post3 == 0), cost: 1 New rule: l3 -> l2 : i4^0'=0, tmp^0'=tmp^post3, 0 == 0, cost: 1 Applied preprocessing Original rule: l4 -> l3 : i4^0'=i4^post4, tmp^0'=tmp^post4, (i4^0-i4^post4 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 New rule: l4 -> l3 : TRUE, cost: 1 Simplified rules Start location: l4 5: l0 -> l2 : i4^0'=1+i4^0, -9+i4^0 <= 0, cost: 1 6: l2 -> l0 : TRUE, cost: 1 7: l3 -> l2 : i4^0'=0, tmp^0'=tmp^post3, 0 == 0, 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 : i4^0'=0, tmp^0'=tmp^post3, 0 == 0, cost: 1 New rule: l4 -> l2 : i4^0'=0, tmp^0'=tmp^post3, 0 == 0, cost: 2 Applied deletion Removed the following rules: 7 8 Eliminating location l0 by chaining: Applied chaining First rule: l2 -> l0 : TRUE, cost: 1 Second rule: l0 -> l2 : i4^0'=1+i4^0, -9+i4^0 <= 0, cost: 1 New rule: l2 -> l2 : i4^0'=1+i4^0, -9+i4^0 <= 0, cost: 2 Applied deletion Removed the following rules: 5 6 Eliminated locations on linear paths Start location: l4 10: l2 -> l2 : i4^0'=1+i4^0, -9+i4^0 <= 0, cost: 2 9: l4 -> l2 : i4^0'=0, tmp^0'=tmp^post3, 0 == 0, cost: 2 Applied acceleration Original rule: l2 -> l2 : i4^0'=1+i4^0, -9+i4^0 <= 0, cost: 2 New rule: l2 -> l2 : i4^0'=i4^0+n0, (10-i4^0-n0 >= 0 /\ n0 >= 0), cost: 2*n0 Applied instantiation Original rule: l2 -> l2 : i4^0'=i4^0+n0, (10-i4^0-n0 >= 0 /\ n0 >= 0), cost: 2*n0 New rule: l2 -> l2 : i4^0'=10, (0 >= 0 /\ 10-i4^0 >= 0), cost: 20-2*i4^0 Applied simplification Original rule: l2 -> l2 : i4^0'=10, (0 >= 0 /\ 10-i4^0 >= 0), cost: 20-2*i4^0 New rule: l2 -> l2 : i4^0'=10, -10+i4^0 <= 0, cost: 20-2*i4^0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS