details

property	value
status	complete
benchmark	p-32.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.140739 seconds
cpu usage	0.143916
user time	0.131558
system time	0.012358
max virtual memory	113188.0
max residence set size	8088.0

stage attributes

key	value
starexec-result	NO

output

NO Initial ITS Start location: l5 0: l0 -> l1 : Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (x_5^0-x_5^post0 == 0 /\ Result_4^0-Result_4^post0 == 0), cost: 1 1: l1 -> l2 : Result_4^0'=Result_4^post1, x_5^0'=x_5^post1, (0 == 0 /\ -x_5^post1+x_5^0 == 0 /\ -x_5^0 <= 0 /\ x_5^0 <= 0), cost: 1 2: l1 -> l3 : Result_4^0'=Result_4^post2, x_5^0'=x_5^post2, (0 == 0 /\ -1-x_5^10+x_5^post2 == 0 /\ Result_4^0-Result_4^post2 == 0 /\ -x_5^0 <= 0 /\ 1-x_5^0 <= 0), cost: 1 4: l1 -> l4 : Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (0 == 0 /\ Result_4^0-Result_4^post4 == 0 /\ 1+x_5^0 <= 0 /\ 1-x_5^11+x_5^post4 == 0), cost: 1 3: l3 -> l1 : Result_4^0'=Result_4^post3, x_5^0'=x_5^post3, (Result_4^0-Result_4^post3 == 0 /\ -x_5^post3+x_5^0 == 0), cost: 1 5: l4 -> l1 : Result_4^0'=Result_4^post5, x_5^0'=x_5^post5, (Result_4^0-Result_4^post5 == 0 /\ -x_5^post5+x_5^0 == 0), cost: 1 6: l5 -> l0 : Result_4^0'=Result_4^post6, x_5^0'=x_5^post6, (Result_4^0-Result_4^post6 == 0 /\ x_5^0-x_5^post6 == 0), cost: 1 Removed unreachable rules and leafs Start location: l5 0: l0 -> l1 : Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (x_5^0-x_5^post0 == 0 /\ Result_4^0-Result_4^post0 == 0), cost: 1 2: l1 -> l3 : Result_4^0'=Result_4^post2, x_5^0'=x_5^post2, (0 == 0 /\ -1-x_5^10+x_5^post2 == 0 /\ Result_4^0-Result_4^post2 == 0 /\ -x_5^0 <= 0 /\ 1-x_5^0 <= 0), cost: 1 4: l1 -> l4 : Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (0 == 0 /\ Result_4^0-Result_4^post4 == 0 /\ 1+x_5^0 <= 0 /\ 1-x_5^11+x_5^post4 == 0), cost: 1 3: l3 -> l1 : Result_4^0'=Result_4^post3, x_5^0'=x_5^post3, (Result_4^0-Result_4^post3 == 0 /\ -x_5^post3+x_5^0 == 0), cost: 1 5: l4 -> l1 : Result_4^0'=Result_4^post5, x_5^0'=x_5^post5, (Result_4^0-Result_4^post5 == 0 /\ -x_5^post5+x_5^0 == 0), cost: 1 6: l5 -> l0 : Result_4^0'=Result_4^post6, x_5^0'=x_5^post6, (Result_4^0-Result_4^post6 == 0 /\ x_5^0-x_5^post6 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : Result_4^0'=Result_4^post0, x_5^0'=x_5^post0, (x_5^0-x_5^post0 == 0 /\ Result_4^0-Result_4^post0 == 0), cost: 1 New rule: l0 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l3 : Result_4^0'=Result_4^post2, x_5^0'=x_5^post2, (0 == 0 /\ -1-x_5^10+x_5^post2 == 0 /\ Result_4^0-Result_4^post2 == 0 /\ -x_5^0 <= 0 /\ 1-x_5^0 <= 0), cost: 1 New rule: l1 -> l3 : x_5^0'=1+x_5^10, -1+x_5^0 >= 0, cost: 1 Applied preprocessing Original rule: l3 -> l1 : Result_4^0'=Result_4^post3, x_5^0'=x_5^post3, (Result_4^0-Result_4^post3 == 0 /\ -x_5^post3+x_5^0 == 0), cost: 1 New rule: l3 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l4 : Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (0 == 0 /\ Result_4^0-Result_4^post4 == 0 /\ 1+x_5^0 <= 0 /\ 1-x_5^11+x_5^post4 == 0), cost: 1 New rule: l1 -> l4 : x_5^0'=-1+x_5^11, 1+x_5^0 <= 0, cost: 1 Applied preprocessing Original rule: l4 -> l1 : Result_4^0'=Result_4^post5, x_5^0'=x_5^post5, (Result_4^0-Result_4^post5 == 0 /\ -x_5^post5+x_5^0 == 0), cost: 1 New rule: l4 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l5 -> l0 : Result_4^0'=Result_4^post6, x_5^0'=x_5^post6, (Result_4^0-Result_4^post6 == 0 /\ x_5^0-x_5^post6 == 0), cost: 1 New rule: l5 -> l0 : TRUE, cost: 1 Simplified rules Start location: l5 7: l0 -> l1 : TRUE, cost: 1 8: l1 -> l3 : x_5^0'=1+x_5^10, -1+x_5^0 >= 0, cost: 1 10: l1 -> l4 : x_5^0'=-1+x_5^11, 1+x_5^0 <= 0, cost: 1 9: l3 -> l1 : TRUE, cost: 1 11: l4 -> l1 : TRUE, cost: 1 12: l5 -> l0 : TRUE, cost: 1 Eliminating location l0 by chaining: Applied chaining First rule: l5 -> l0 : TRUE, cost: 1 Second rule: l0 -> l1 : TRUE, cost: 1 New rule: l5 -> l1 : TRUE, cost: 2 Applied deletion Removed the following rules: 7 12 Eliminating location l3 by chaining: Applied chaining First rule: l1 -> l3 : x_5^0'=1+x_5^10, -1+x_5^0 >= 0, cost: 1 Second rule: l3 -> l1 : TRUE, cost: 1 New rule: l1 -> l1 : x_5^0'=1+x_5^10, -1+x_5^0 >= 0, cost: 2 Applied deletion Removed the following rules: 8 9 Eliminating location l4 by chaining: Applied chaining First rule: l1 -> l4 : x_5^0'=-1+x_5^11, 1+x_5^0 <= 0, cost: 1 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to ITS