Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487097859
details
property
value
status
complete
benchmark
ex31.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n147.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.265148 seconds
cpu usage
0.270432
user time
0.242867
system time
0.027565
max virtual memory
113188.0
max residence set size
19284.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l5 0: l0 -> l1 : hi^0'=hi^post0, lo^0'=lo^post0, (0 == 0 /\ lo^0-lo^post0 == 0), cost: 1 1: l0 -> l1 : hi^0'=hi^post1, lo^0'=lo^post1, (0 == 0 /\ hi^0-hi^post1 == 0), cost: 1 4: l1 -> l2 : hi^0'=hi^post4, lo^0'=lo^post4, (hi^0-hi^post4 == 0 /\ -lo^post4+lo^0 == 0), cost: 1 2: l2 -> l3 : hi^0'=hi^post2, lo^0'=lo^post2, (-lo^post2+lo^0 == 0 /\ hi^0-hi^post2 == 0 /\ -hi^0+lo^0 <= 0), cost: 1 3: l2 -> l0 : hi^0'=hi^post3, lo^0'=lo^post3, (hi^0-hi^post3 == 0 /\ 1+hi^0-lo^0 <= 0 /\ lo^0-lo^post3 == 0), cost: 1 5: l4 -> l1 : hi^0'=hi^post5, lo^0'=lo^post5, (hi^post5 == 0 /\ -99+lo^post5 == 0), cost: 1 6: l5 -> l4 : hi^0'=hi^post6, lo^0'=lo^post6, (-lo^post6+lo^0 == 0 /\ hi^0-hi^post6 == 0), cost: 1 Removed unreachable rules and leafs Start location: l5 0: l0 -> l1 : hi^0'=hi^post0, lo^0'=lo^post0, (0 == 0 /\ lo^0-lo^post0 == 0), cost: 1 1: l0 -> l1 : hi^0'=hi^post1, lo^0'=lo^post1, (0 == 0 /\ hi^0-hi^post1 == 0), cost: 1 4: l1 -> l2 : hi^0'=hi^post4, lo^0'=lo^post4, (hi^0-hi^post4 == 0 /\ -lo^post4+lo^0 == 0), cost: 1 3: l2 -> l0 : hi^0'=hi^post3, lo^0'=lo^post3, (hi^0-hi^post3 == 0 /\ 1+hi^0-lo^0 <= 0 /\ lo^0-lo^post3 == 0), cost: 1 5: l4 -> l1 : hi^0'=hi^post5, lo^0'=lo^post5, (hi^post5 == 0 /\ -99+lo^post5 == 0), cost: 1 6: l5 -> l4 : hi^0'=hi^post6, lo^0'=lo^post6, (-lo^post6+lo^0 == 0 /\ hi^0-hi^post6 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : hi^0'=hi^post0, lo^0'=lo^post0, (0 == 0 /\ lo^0-lo^post0 == 0), cost: 1 New rule: l0 -> l1 : hi^0'=hi^post0, 0 == 0, cost: 1 Applied preprocessing Original rule: l0 -> l1 : hi^0'=hi^post1, lo^0'=lo^post1, (0 == 0 /\ hi^0-hi^post1 == 0), cost: 1 New rule: l0 -> l1 : lo^0'=lo^post1, 0 == 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : hi^0'=hi^post3, lo^0'=lo^post3, (hi^0-hi^post3 == 0 /\ 1+hi^0-lo^0 <= 0 /\ lo^0-lo^post3 == 0), cost: 1 New rule: l2 -> l0 : 1+hi^0-lo^0 <= 0, cost: 1 Applied preprocessing Original rule: l1 -> l2 : hi^0'=hi^post4, lo^0'=lo^post4, (hi^0-hi^post4 == 0 /\ -lo^post4+lo^0 == 0), cost: 1 New rule: l1 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l1 : hi^0'=hi^post5, lo^0'=lo^post5, (hi^post5 == 0 /\ -99+lo^post5 == 0), cost: 1 New rule: l4 -> l1 : hi^0'=0, lo^0'=99, TRUE, cost: 1 Applied preprocessing Original rule: l5 -> l4 : hi^0'=hi^post6, lo^0'=lo^post6, (-lo^post6+lo^0 == 0 /\ hi^0-hi^post6 == 0), cost: 1 New rule: l5 -> l4 : TRUE, cost: 1 Simplified rules Start location: l5 7: l0 -> l1 : hi^0'=hi^post0, 0 == 0, cost: 1 8: l0 -> l1 : lo^0'=lo^post1, 0 == 0, cost: 1 10: l1 -> l2 : TRUE, cost: 1 9: l2 -> l0 : 1+hi^0-lo^0 <= 0, cost: 1 11: l4 -> l1 : hi^0'=0, lo^0'=99, TRUE, cost: 1 12: l5 -> l4 : TRUE, cost: 1 Eliminating location l4 by chaining: Applied chaining First rule: l5 -> l4 : TRUE, cost: 1 Second rule: l4 -> l1 : hi^0'=0, lo^0'=99, TRUE, cost: 1 New rule: l5 -> l1 : hi^0'=0, lo^0'=99, TRUE, cost: 2 Applied deletion Removed the following rules: 11 12 Eliminating location l2 by chaining: Applied chaining First rule: l1 -> l2 : TRUE, cost: 1 Second rule: l2 -> l0 : 1+hi^0-lo^0 <= 0, cost: 1 New rule: l1 -> l0 : 1+hi^0-lo^0 <= 0, cost: 2 Applied deletion Removed the following rules: 9 10 Eliminated locations on linear paths Start location: l5 7: l0 -> l1 : hi^0'=hi^post0, 0 == 0, cost: 1 8: l0 -> l1 : lo^0'=lo^post1, 0 == 0, cost: 1 14: l1 -> l0 : 1+hi^0-lo^0 <= 0, cost: 2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS