Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098624
details
property
value
status
complete
benchmark
slayer-n2.t2.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.0385089 seconds
cpu usage
0.039432
user time
0.028526
system time
0.010906
max virtual memory
113188.0
max residence set size
7968.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l5 0: l0 -> l1 : a_19^0'=a_19^post0, i_20^0'=i_20^post0, st_14^0'=st_14^post0, i_13^0'=i_13^post0, rt_11^0'=rt_11^post0, (i_13^post0 <= 0 /\ i_13^post0 == 0 /\ -i_13^post0 <= 0 /\ st_14^0-st_14^post0 == 0 /\ a_19^0-a_19^post0 == 0 /\ -rt_11^post0+rt_11^0 == 0 /\ i_20^0-i_20^post0 == 0), cost: 1 2: l1 -> l3 : a_19^0'=a_19^post2, i_20^0'=i_20^post2, st_14^0'=st_14^post2, i_13^0'=i_13^post2, rt_11^0'=rt_11^post2, (-st_14^0+rt_11^post2 == 0 /\ a_19^0-a_19^post2 == 0 /\ i_20^0-i_20^post2 == 0 /\ -st_14^post2+st_14^0 == 0 /\ 10-i_13^0 <= 0 /\ -i_13^post2+i_13^0 == 0), cost: 1 3: l1 -> l4 : a_19^0'=a_19^post3, i_20^0'=i_20^post3, st_14^0'=st_14^post3, i_13^0'=i_13^post3, rt_11^0'=rt_11^post3, (0 == 0 /\ 1-i_13^0+i_13^post3 == 0 /\ a_19^0-a_19^post3 == 0 /\ st_14^0-st_14^post3 == 0 /\ -9+i_20^post3 <= 0 /\ 1-i_20^post3+i_13^post3 <= 0 /\ -9+i_13^0 <= 0 /\ -rt_11^post3+rt_11^0 == 0 /\ -1+i_20^post3-i_13^post3 <= 0), cost: 1 1: l2 -> l1 : a_19^0'=a_19^post1, i_20^0'=i_20^post1, st_14^0'=st_14^post1, i_13^0'=i_13^post1, rt_11^0'=rt_11^post1, (0 == 0 /\ -a_19^post1+i_13^post1 <= 0 /\ i_20^0-i_20^post1 == 0 /\ 1-i_13^0+i_13^10 == 0 /\ -rt_11^post1+rt_11^0 == 0 /\ a_19^post1-i_13^post1 <= 0 /\ 1+i_13^post1 <= 0 /\ -1-i_13^post1 <= 0 /\ -st_14^post1+st_14^0 == 0 /\ -9+i_13^0 <= 0), cost: 1 4: l4 -> l1 : a_19^0'=a_19^post4, i_20^0'=i_20^post4, st_14^0'=st_14^post4, i_13^0'=i_13^post4, rt_11^0'=rt_11^post4, (-rt_11^post4+rt_11^0 == 0 /\ -i_13^post4+i_13^0 == 0 /\ i_20^0-i_20^post4 == 0 /\ -st_14^post4+st_14^0 == 0 /\ a_19^0-a_19^post4 == 0), cost: 1 5: l5 -> l0 : a_19^0'=a_19^post5, i_20^0'=i_20^post5, st_14^0'=st_14^post5, i_13^0'=i_13^post5, rt_11^0'=rt_11^post5, (-rt_11^post5+rt_11^0 == 0 /\ st_14^0-st_14^post5 == 0 /\ i_13^0-i_13^post5 == 0 /\ i_20^0-i_20^post5 == 0 /\ a_19^0-a_19^post5 == 0), cost: 1 Removed unreachable rules and leafs Start location: l5 0: l0 -> l1 : a_19^0'=a_19^post0, i_20^0'=i_20^post0, st_14^0'=st_14^post0, i_13^0'=i_13^post0, rt_11^0'=rt_11^post0, (i_13^post0 <= 0 /\ i_13^post0 == 0 /\ -i_13^post0 <= 0 /\ st_14^0-st_14^post0 == 0 /\ a_19^0-a_19^post0 == 0 /\ -rt_11^post0+rt_11^0 == 0 /\ i_20^0-i_20^post0 == 0), cost: 1 3: l1 -> l4 : a_19^0'=a_19^post3, i_20^0'=i_20^post3, st_14^0'=st_14^post3, i_13^0'=i_13^post3, rt_11^0'=rt_11^post3, (0 == 0 /\ 1-i_13^0+i_13^post3 == 0 /\ a_19^0-a_19^post3 == 0 /\ st_14^0-st_14^post3 == 0 /\ -9+i_20^post3 <= 0 /\ 1-i_20^post3+i_13^post3 <= 0 /\ -9+i_13^0 <= 0 /\ -rt_11^post3+rt_11^0 == 0 /\ -1+i_20^post3-i_13^post3 <= 0), cost: 1 4: l4 -> l1 : a_19^0'=a_19^post4, i_20^0'=i_20^post4, st_14^0'=st_14^post4, i_13^0'=i_13^post4, rt_11^0'=rt_11^post4, (-rt_11^post4+rt_11^0 == 0 /\ -i_13^post4+i_13^0 == 0 /\ i_20^0-i_20^post4 == 0 /\ -st_14^post4+st_14^0 == 0 /\ a_19^0-a_19^post4 == 0), cost: 1 5: l5 -> l0 : a_19^0'=a_19^post5, i_20^0'=i_20^post5, st_14^0'=st_14^post5, i_13^0'=i_13^post5, rt_11^0'=rt_11^post5, (-rt_11^post5+rt_11^0 == 0 /\ st_14^0-st_14^post5 == 0 /\ i_13^0-i_13^post5 == 0 /\ i_20^0-i_20^post5 == 0 /\ a_19^0-a_19^post5 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : a_19^0'=a_19^post0, i_20^0'=i_20^post0, st_14^0'=st_14^post0, i_13^0'=i_13^post0, rt_11^0'=rt_11^post0, (i_13^post0 <= 0 /\ i_13^post0 == 0 /\ -i_13^post0 <= 0 /\ st_14^0-st_14^post0 == 0 /\ a_19^0-a_19^post0 == 0 /\ -rt_11^post0+rt_11^0 == 0 /\ i_20^0-i_20^post0 == 0), cost: 1 New rule: l0 -> l1 : i_13^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l4 : a_19^0'=a_19^post3, i_20^0'=i_20^post3, st_14^0'=st_14^post3, i_13^0'=i_13^post3, rt_11^0'=rt_11^post3, (0 == 0 /\ 1-i_13^0+i_13^post3 == 0 /\ a_19^0-a_19^post3 == 0 /\ st_14^0-st_14^post3 == 0 /\ -9+i_20^post3 <= 0 /\ 1-i_20^post3+i_13^post3 <= 0 /\ -9+i_13^0 <= 0 /\ -rt_11^post3+rt_11^0 == 0 /\ -1+i_20^post3-i_13^post3 <= 0), cost: 1 New rule: l1 -> l4 : i_20^0'=i_13^0, i_13^0'=-1+i_13^0, -9+i_13^0 <= 0, cost: 1 Applied preprocessing Original rule: l4 -> l1 : a_19^0'=a_19^post4, i_20^0'=i_20^post4, st_14^0'=st_14^post4, i_13^0'=i_13^post4, rt_11^0'=rt_11^post4, (-rt_11^post4+rt_11^0 == 0 /\ -i_13^post4+i_13^0 == 0 /\ i_20^0-i_20^post4 == 0 /\ -st_14^post4+st_14^0 == 0 /\ a_19^0-a_19^post4 == 0), cost: 1 New rule: l4 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l5 -> l0 : a_19^0'=a_19^post5, i_20^0'=i_20^post5, st_14^0'=st_14^post5, i_13^0'=i_13^post5, rt_11^0'=rt_11^post5, (-rt_11^post5+rt_11^0 == 0 /\ st_14^0-st_14^post5 == 0 /\ i_13^0-i_13^post5 == 0 /\ i_20^0-i_20^post5 == 0 /\ a_19^0-a_19^post5 == 0), cost: 1 New rule: l5 -> l0 : TRUE, cost: 1 Simplified rules Start location: l5 6: l0 -> l1 : i_13^0'=0, TRUE, cost: 1 7: l1 -> l4 : i_20^0'=i_13^0, i_13^0'=-1+i_13^0, -9+i_13^0 <= 0, cost: 1 8: l4 -> l1 : TRUE, cost: 1 9: l5 -> l0 : TRUE, cost: 1 Eliminating location l0 by chaining: Applied chaining First rule: l5 -> l0 : TRUE, cost: 1 Second rule: l0 -> l1 : i_13^0'=0, TRUE, cost: 1 New rule: l5 -> l1 : i_13^0'=0, TRUE, cost: 2 Applied deletion Removed the following rules: 6 9 Eliminating location l4 by chaining: Applied chaining First rule: l1 -> l4 : i_20^0'=i_13^0, i_13^0'=-1+i_13^0, -9+i_13^0 <= 0, cost: 1 Second rule: l4 -> l1 : TRUE, cost: 1 New rule: l1 -> l1 : i_20^0'=i_13^0, i_13^0'=-1+i_13^0, -9+i_13^0 <= 0, cost: 2 Applied deletion Removed the following rules: 7 8 Eliminated locations on linear paths Start location: l5 11: l1 -> l1 : i_20^0'=i_13^0, i_13^0'=-1+i_13^0, -9+i_13^0 <= 0, cost: 2 10: l5 -> l1 : i_13^0'=0, TRUE, cost: 2 Applied nonterm Original rule: l1 -> l1 : i_20^0'=i_13^0, i_13^0'=-1+i_13^0, -9+i_13^0 <= 0, cost: 2 New rule: l1 -> [6] : 9-i_13^0 >= 0, cost: NONTERM Applied acceleration Original rule: l1 -> l1 : i_20^0'=i_13^0, i_13^0'=-1+i_13^0, -9+i_13^0 <= 0, cost: 2 New rule: l1 -> l1 : i_20^0'=1-n0+i_13^0, i_13^0'=-n0+i_13^0, 9-i_13^0 >= 0, cost: 2*n0 Applied simplification Original rule: l1 -> [6] : 9-i_13^0 >= 0, cost: NONTERM New rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS