Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098330
details
property
value
status
complete
benchmark
ex1.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n144.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.0290339 seconds
cpu usage
0.029888
user time
0.02062
system time
0.009268
max virtual memory
113188.0
max residence set size
7300.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l4 0: l0 -> l1 : i^0'=i^post0, ret_pair5^0'=ret_pair5^post0, j^0'=j^post0, (0 == 0 /\ -1-i^0+i^post0 == 0 /\ -2+j^post0-j^0 == 0), cost: 1 1: l0 -> l2 : i^0'=i^post1, ret_pair5^0'=ret_pair5^post1, j^0'=j^post1, (ret_pair5^0-ret_pair5^post1 == 0 /\ i^0-i^post1 == 0 /\ j^0-j^post1 == 0), cost: 1 2: l1 -> l0 : i^0'=i^post2, ret_pair5^0'=ret_pair5^post2, j^0'=j^post2, (ret_pair5^0-ret_pair5^post2 == 0 /\ j^0-j^post2 == 0 /\ i^0-i^post2 == 0), cost: 1 3: l3 -> l1 : i^0'=i^post3, ret_pair5^0'=ret_pair5^post3, j^0'=j^post3, (i^post3 == 0 /\ j^post3 == 0 /\ ret_pair5^0-ret_pair5^post3 == 0), cost: 1 4: l4 -> l3 : i^0'=i^post4, ret_pair5^0'=ret_pair5^post4, j^0'=j^post4, (ret_pair5^0-ret_pair5^post4 == 0 /\ j^0-j^post4 == 0 /\ i^0-i^post4 == 0), cost: 1 Removed unreachable rules and leafs Start location: l4 0: l0 -> l1 : i^0'=i^post0, ret_pair5^0'=ret_pair5^post0, j^0'=j^post0, (0 == 0 /\ -1-i^0+i^post0 == 0 /\ -2+j^post0-j^0 == 0), cost: 1 2: l1 -> l0 : i^0'=i^post2, ret_pair5^0'=ret_pair5^post2, j^0'=j^post2, (ret_pair5^0-ret_pair5^post2 == 0 /\ j^0-j^post2 == 0 /\ i^0-i^post2 == 0), cost: 1 3: l3 -> l1 : i^0'=i^post3, ret_pair5^0'=ret_pair5^post3, j^0'=j^post3, (i^post3 == 0 /\ j^post3 == 0 /\ ret_pair5^0-ret_pair5^post3 == 0), cost: 1 4: l4 -> l3 : i^0'=i^post4, ret_pair5^0'=ret_pair5^post4, j^0'=j^post4, (ret_pair5^0-ret_pair5^post4 == 0 /\ j^0-j^post4 == 0 /\ i^0-i^post4 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : i^0'=i^post0, ret_pair5^0'=ret_pair5^post0, j^0'=j^post0, (0 == 0 /\ -1-i^0+i^post0 == 0 /\ -2+j^post0-j^0 == 0), cost: 1 New rule: l0 -> l1 : i^0'=1+i^0, ret_pair5^0'=ret_pair5^post0, j^0'=2+j^0, 0 == 0, cost: 1 Applied preprocessing Original rule: l1 -> l0 : i^0'=i^post2, ret_pair5^0'=ret_pair5^post2, j^0'=j^post2, (ret_pair5^0-ret_pair5^post2 == 0 /\ j^0-j^post2 == 0 /\ i^0-i^post2 == 0), cost: 1 New rule: l1 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l1 : i^0'=i^post3, ret_pair5^0'=ret_pair5^post3, j^0'=j^post3, (i^post3 == 0 /\ j^post3 == 0 /\ ret_pair5^0-ret_pair5^post3 == 0), cost: 1 New rule: l3 -> l1 : i^0'=0, j^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l3 : i^0'=i^post4, ret_pair5^0'=ret_pair5^post4, j^0'=j^post4, (ret_pair5^0-ret_pair5^post4 == 0 /\ j^0-j^post4 == 0 /\ i^0-i^post4 == 0), cost: 1 New rule: l4 -> l3 : TRUE, cost: 1 Simplified rules Start location: l4 5: l0 -> l1 : i^0'=1+i^0, ret_pair5^0'=ret_pair5^post0, j^0'=2+j^0, 0 == 0, cost: 1 6: l1 -> l0 : TRUE, cost: 1 7: l3 -> l1 : i^0'=0, 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 -> l1 : i^0'=0, j^0'=0, TRUE, cost: 1 New rule: l4 -> l1 : i^0'=0, j^0'=0, TRUE, cost: 2 Applied deletion Removed the following rules: 7 8 Eliminating location l0 by chaining: Applied chaining First rule: l1 -> l0 : TRUE, cost: 1 Second rule: l0 -> l1 : i^0'=1+i^0, ret_pair5^0'=ret_pair5^post0, j^0'=2+j^0, 0 == 0, cost: 1 New rule: l1 -> l1 : i^0'=1+i^0, ret_pair5^0'=ret_pair5^post0, j^0'=2+j^0, 0 == 0, cost: 2 Applied deletion Removed the following rules: 5 6 Eliminated locations on linear paths Start location: l4 10: l1 -> l1 : i^0'=1+i^0, ret_pair5^0'=ret_pair5^post0, j^0'=2+j^0, 0 == 0, cost: 2 9: l4 -> l1 : i^0'=0, j^0'=0, TRUE, cost: 2 Applied nonterm Original rule: l1 -> l1 : i^0'=1+i^0, ret_pair5^0'=ret_pair5^post0, j^0'=2+j^0, 0 == 0, cost: 2 New rule: l1 -> [5] : 0 >= 0, cost: NONTERM Applied acceleration Original rule: l1 -> l1 : i^0'=1+i^0, ret_pair5^0'=ret_pair5^post0, j^0'=2+j^0, 0 == 0, cost: 2 New rule: l1 -> l1 : i^0'=i^0+n0, ret_pair5^0'=ret_pair5^post0, j^0'=j^0+2*n0, 0 >= 0, cost: 2*n0 Applied deletion Removed the following rules: 10 Accelerated simple loops Start location: l4
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS