Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487097358
details
property
value
status
complete
benchmark
array2.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n151.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.0484781 seconds
cpu usage
0.049479
user time
0.037999
system time
0.01148
max virtual memory
113188.0
max residence set size
18300.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, tmp^0'=tmp^post0, (tmp^0-tmp^post0 == 0 /\ i^0-i^post0 == 0 /\ 50-i^0 <= 0), cost: 1 1: l0 -> l2 : i^0'=i^post1, tmp^0'=tmp^post1, (-tmp^post1+tmp^0 == 0 /\ -1-i^0+i^post1 == 0 /\ -49+i^0 <= 0), cost: 1 2: l2 -> l0 : i^0'=i^post2, tmp^0'=tmp^post2, (-tmp^post2+tmp^0 == 0 /\ i^0-i^post2 == 0), cost: 1 3: l3 -> l2 : i^0'=i^post3, tmp^0'=tmp^post3, (0 == 0 /\ i^10 == 0 /\ i^post3 == 0), cost: 1 4: l4 -> l3 : i^0'=i^post4, tmp^0'=tmp^post4, (i^0-i^post4 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l4 1: l0 -> l2 : i^0'=i^post1, tmp^0'=tmp^post1, (-tmp^post1+tmp^0 == 0 /\ -1-i^0+i^post1 == 0 /\ -49+i^0 <= 0), cost: 1 2: l2 -> l0 : i^0'=i^post2, tmp^0'=tmp^post2, (-tmp^post2+tmp^0 == 0 /\ i^0-i^post2 == 0), cost: 1 3: l3 -> l2 : i^0'=i^post3, tmp^0'=tmp^post3, (0 == 0 /\ i^10 == 0 /\ i^post3 == 0), cost: 1 4: l4 -> l3 : i^0'=i^post4, tmp^0'=tmp^post4, (i^0-i^post4 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l2 : i^0'=i^post1, tmp^0'=tmp^post1, (-tmp^post1+tmp^0 == 0 /\ -1-i^0+i^post1 == 0 /\ -49+i^0 <= 0), cost: 1 New rule: l0 -> l2 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : i^0'=i^post2, tmp^0'=tmp^post2, (-tmp^post2+tmp^0 == 0 /\ i^0-i^post2 == 0), cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l2 : i^0'=i^post3, tmp^0'=tmp^post3, (0 == 0 /\ i^10 == 0 /\ i^post3 == 0), cost: 1 New rule: l3 -> l2 : i^0'=0, tmp^0'=tmp^post3, 0 == 0, cost: 1 Applied preprocessing Original rule: l4 -> l3 : i^0'=i^post4, tmp^0'=tmp^post4, (i^0-i^post4 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1 New rule: l4 -> l3 : TRUE, cost: 1 Simplified rules Start location: l4 5: l0 -> l2 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1 6: l2 -> l0 : TRUE, cost: 1 7: l3 -> l2 : i^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 : i^0'=0, tmp^0'=tmp^post3, 0 == 0, cost: 1 New rule: l4 -> l2 : i^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 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1 New rule: l2 -> l2 : i^0'=1+i^0, -49+i^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'=1+i^0, -49+i^0 <= 0, cost: 2 9: l4 -> l2 : i^0'=0, tmp^0'=tmp^post3, 0 == 0, cost: 2 Applied acceleration Original rule: l2 -> l2 : i^0'=1+i^0, -49+i^0 <= 0, cost: 2 New rule: l2 -> l2 : i^0'=i^0+n0, (n0 >= 0 /\ 50-i^0-n0 >= 0), cost: 2*n0 Applied instantiation Original rule: l2 -> l2 : i^0'=i^0+n0, (n0 >= 0 /\ 50-i^0-n0 >= 0), cost: 2*n0 New rule: l2 -> l2 : i^0'=50, (0 >= 0 /\ 50-i^0 >= 0), cost: 100-2*i^0 Applied simplification Original rule: l2 -> l2 : i^0'=50, (0 >= 0 /\ 50-i^0 >= 0), cost: 100-2*i^0 New rule: l2 -> l2 : i^0'=50, -50+i^0 <= 0, cost: 100-2*i^0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS