details

property	value
status	complete
benchmark	pearl-necklace.t2.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n145.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.16761 seconds
cpu usage	0.170601
user time	0.153779
system time	0.016822
max virtual memory	113188.0
max residence set size	19180.0

stage attributes

key	value
starexec-result	WORST_CASE(Omega(0),?)

output

WORST_CASE(Omega(0),?) Initial ITS Start location: l9 0: l0 -> l1 : i1^0'=i1^post0, i3^0'=i3^post0, n^0'=n^post0, i2^0'=i2^post0, i4^0'=i4^post0, (n^0-n^post0 == 0 /\ i1^0-i1^post0 == 0 /\ 1+i4^post0-i4^0 == 0 /\ -i2^post0+i2^0 == 0 /\ i3^0-i3^post0 == 0 /\ 1-i4^0 <= 0), cost: 1 1: l1 -> l0 : i1^0'=i1^post1, i3^0'=i3^post1, n^0'=n^post1, i2^0'=i2^post1, i4^0'=i4^post1, (-n^post1+n^0 == 0 /\ i1^0-i1^post1 == 0 /\ i2^0-i2^post1 == 0 /\ -i4^post1+i4^0 == 0 /\ -i3^post1+i3^0 == 0), cost: 1 2: l2 -> l0 : i1^0'=i1^post2, i3^0'=i3^post2, n^0'=n^post2, i2^0'=i2^post2, i4^0'=i4^post2, (i1^0-i1^post2 == 0 /\ -i2^post2+i2^0 == 0 /\ -n^post2+n^0 == 0 /\ -i3^0+i4^post2 == 0 /\ i3^0-i3^post2 == 0 /\ -i3^0+n^0 <= 0), cost: 1 3: l2 -> l3 : i1^0'=i1^post3, i3^0'=i3^post3, n^0'=n^post3, i2^0'=i2^post3, i4^0'=i4^post3, (-i4^post3+i4^0 == 0 /\ -1-i3^0+i3^post3 == 0 /\ n^0-n^post3 == 0 /\ i2^0-i2^post3 == 0 /\ i1^0-i1^post3 == 0 /\ 1+i3^0-n^0 <= 0), cost: 1 4: l3 -> l2 : i1^0'=i1^post4, i3^0'=i3^post4, n^0'=n^post4, i2^0'=i2^post4, i4^0'=i4^post4, (-i4^post4+i4^0 == 0 /\ -n^post4+n^0 == 0 /\ -i2^post4+i2^0 == 0 /\ i1^0-i1^post4 == 0 /\ i3^0-i3^post4 == 0), cost: 1 5: l4 -> l2 : i1^0'=i1^post5, i3^0'=i3^post5, n^0'=n^post5, i2^0'=i2^post5, i4^0'=i4^post5, (i3^post5-i2^0 == 0 /\ -i4^post5+i4^0 == 0 /\ n^0-n^post5 == 0 /\ i2^0 <= 0 /\ i1^0-i1^post5 == 0 /\ -i2^post5+i2^0 == 0), cost: 1 6: l4 -> l5 : i1^0'=i1^post6, i3^0'=i3^post6, n^0'=n^post6, i2^0'=i2^post6, i4^0'=i4^post6, (i4^0-i4^post6 == 0 /\ -n^post6+n^0 == 0 /\ 1-i2^0 <= 0 /\ 1+i2^post6-i2^0 == 0 /\ i1^0-i1^post6 == 0 /\ i3^0-i3^post6 == 0), cost: 1 7: l5 -> l4 : i1^0'=i1^post7, i3^0'=i3^post7, n^0'=n^post7, i2^0'=i2^post7, i4^0'=i4^post7, (-i2^post7+i2^0 == 0 /\ i3^0-i3^post7 == 0 /\ i1^0-i1^post7 == 0 /\ n^0-n^post7 == 0 /\ -i4^post7+i4^0 == 0), cost: 1 8: l6 -> l4 : i1^0'=i1^post8, i3^0'=i3^post8, n^0'=n^post8, i2^0'=i2^post8, i4^0'=i4^post8, (-i4^post8+i4^0 == 0 /\ -i1^0+n^0 <= 0 /\ -i1^0+i2^post8 == 0 /\ i1^0-i1^post8 == 0 /\ i3^0-i3^post8 == 0 /\ -n^post8+n^0 == 0), cost: 1 9: l6 -> l7 : i1^0'=i1^post9, i3^0'=i3^post9, n^0'=n^post9, i2^0'=i2^post9, i4^0'=i4^post9, (1+i1^0-n^0 <= 0 /\ -1-i1^0+i1^post9 == 0 /\ -i4^post9+i4^0 == 0 /\ n^0-n^post9 == 0 /\ -i2^post9+i2^0 == 0 /\ i3^0-i3^post9 == 0), cost: 1 10: l7 -> l6 : i1^0'=i1^post10, i3^0'=i3^post10, n^0'=n^post10, i2^0'=i2^post10, i4^0'=i4^post10, (i4^0-i4^post10 == 0 /\ -n^post10+n^0 == 0 /\ -i2^post10+i2^0 == 0 /\ i1^0-i1^post10 == 0 /\ i3^0-i3^post10 == 0), cost: 1 11: l8 -> l6 : i1^0'=i1^post11, i3^0'=i3^post11, n^0'=n^post11, i2^0'=i2^post11, i4^0'=i4^post11, (n^0-n^post11 == 0 /\ -i4^post11+i4^0 == 0 /\ i1^0-i1^post11 == 0 /\ i3^0-i3^post11 == 0 /\ -i2^post11+i2^0 == 0), cost: 1 12: l9 -> l8 : i1^0'=i1^post12, i3^0'=i3^post12, n^0'=n^post12, i2^0'=i2^post12, i4^0'=i4^post12, (-n^post12+n^0 == 0 /\ i4^0-i4^post12 == 0 /\ i1^0-i1^post12 == 0 /\ i2^0-i2^post12 == 0 /\ -i3^post12+i3^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : i1^0'=i1^post0, i3^0'=i3^post0, n^0'=n^post0, i2^0'=i2^post0, i4^0'=i4^post0, (n^0-n^post0 == 0 /\ i1^0-i1^post0 == 0 /\ 1+i4^post0-i4^0 == 0 /\ -i2^post0+i2^0 == 0 /\ i3^0-i3^post0 == 0 /\ 1-i4^0 <= 0), cost: 1 New rule: l0 -> l1 : i4^0'=-1+i4^0, -1+i4^0 >= 0, cost: 1 Applied preprocessing Original rule: l1 -> l0 : i1^0'=i1^post1, i3^0'=i3^post1, n^0'=n^post1, i2^0'=i2^post1, i4^0'=i4^post1, (-n^post1+n^0 == 0 /\ i1^0-i1^post1 == 0 /\ i2^0-i2^post1 == 0 /\ -i4^post1+i4^0 == 0 /\ -i3^post1+i3^0 == 0), cost: 1 New rule: l1 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l0 : i1^0'=i1^post2, i3^0'=i3^post2, n^0'=n^post2, i2^0'=i2^post2, i4^0'=i4^post2, (i1^0-i1^post2 == 0 /\ -i2^post2+i2^0 == 0 /\ -n^post2+n^0 == 0 /\ -i3^0+i4^post2 == 0 /\ i3^0-i3^post2 == 0 /\ -i3^0+n^0 <= 0), cost: 1 New rule: l2 -> l0 : i4^0'=i3^0, -i3^0+n^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l3 : i1^0'=i1^post3, i3^0'=i3^post3, n^0'=n^post3, i2^0'=i2^post3, i4^0'=i4^post3, (-i4^post3+i4^0 == 0 /\ -1-i3^0+i3^post3 == 0 /\ n^0-n^post3 == 0 /\ i2^0-i2^post3 == 0 /\ i1^0-i1^post3 == 0 /\ 1+i3^0-n^0 <= 0), cost: 1 New rule: l2 -> l3 : i3^0'=1+i3^0, 1+i3^0-n^0 <= 0, cost: 1 Applied preprocessing Original rule: l3 -> l2 : i1^0'=i1^post4, i3^0'=i3^post4, n^0'=n^post4, i2^0'=i2^post4, i4^0'=i4^post4, (-i4^post4+i4^0 == 0 /\ -n^post4+n^0 == 0 /\ -i2^post4+i2^0 == 0 /\ i1^0-i1^post4 == 0 /\ i3^0-i3^post4 == 0), cost: 1 New rule: l3 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l2 : i1^0'=i1^post5, i3^0'=i3^post5, n^0'=n^post5, i2^0'=i2^post5, i4^0'=i4^post5, (i3^post5-i2^0 == 0 /\ -i4^post5+i4^0 == 0 /\ n^0-n^post5 == 0 /\ i2^0 <= 0 /\ i1^0-i1^post5 == 0 /\ -i2^post5+i2^0 == 0), cost: 1 New rule: l4 -> l2 : i3^0'=i2^0, i2^0 <= 0, cost: 1 Applied preprocessing Original rule: l4 -> l5 : i1^0'=i1^post6, i3^0'=i3^post6, n^0'=n^post6, i2^0'=i2^post6, i4^0'=i4^post6, (i4^0-i4^post6 == 0 /\ -n^post6+n^0 == 0 /\ 1-i2^0 <= 0 /\ 1+i2^post6-i2^0 == 0 /\ i1^0-i1^post6 == 0 /\ i3^0-i3^post6 == 0), cost: 1 New rule: l4 -> l5 : i2^0'=-1+i2^0, -1+i2^0 >= 0, cost: 1 Applied preprocessing Original rule: l5 -> l4 : i1^0'=i1^post7, i3^0'=i3^post7, n^0'=n^post7, i2^0'=i2^post7, i4^0'=i4^post7, (-i2^post7+i2^0 == 0 /\ i3^0-i3^post7 == 0 /\ i1^0-i1^post7 == 0 /\ n^0-n^post7 == 0 /\ -i4^post7+i4^0 == 0), cost: 1 New rule: l5 -> l4 : TRUE, cost: 1 Applied preprocessing Original rule: l6 -> l4 : i1^0'=i1^post8, i3^0'=i3^post8, n^0'=n^post8, i2^0'=i2^post8, i4^0'=i4^post8, (-i4^post8+i4^0 == 0 /\ -i1^0+n^0 <= 0 /\ -i1^0+i2^post8 == 0 /\ i1^0-i1^post8 == 0 /\ i3^0-i3^post8 == 0 /\ -n^post8+n^0 == 0), cost: 1 New rule: l6 -> l4 : i2^0'=i1^0, -i1^0+n^0 <= 0, cost: 1 Applied preprocessing Original rule: l6 -> l7 : i1^0'=i1^post9, i3^0'=i3^post9, n^0'=n^post9, i2^0'=i2^post9, i4^0'=i4^post9, (1+i1^0-n^0 <= 0 /\ -1-i1^0+i1^post9 == 0 /\ -i4^post9+i4^0 == 0 /\ n^0-n^post9 == 0 /\ -i2^post9+i2^0 == 0 /\ i3^0-i3^post9 == 0), cost: 1 New rule: l6 -> l7 : i1^0'=1+i1^0, 1+i1^0-n^0 <= 0, cost: 1 Applied preprocessing Original rule: l7 -> l6 : i1^0'=i1^post10, i3^0'=i3^post10, n^0'=n^post10, i2^0'=i2^post10, i4^0'=i4^post10, (i4^0-i4^post10 == 0 /\ -n^post10+n^0 == 0 /\ -i2^post10+i2^0 == 0 /\ i1^0-i1^post10 == 0 /\ i3^0-i3^post10 == 0), cost: 1 New rule: l7 -> l6 : TRUE, cost: 1 Applied preprocessing Original rule: l8 -> l6 : i1^0'=i1^post11, i3^0'=i3^post11, n^0'=n^post11, i2^0'=i2^post11, i4^0'=i4^post11, (n^0-n^post11 == 0 /\ -i4^post11+i4^0 == 0 /\ i1^0-i1^post11 == 0 /\ i3^0-i3^post11 == 0 /\ -i2^post11+i2^0 == 0), cost: 1 New rule: l8 -> l6 : TRUE, cost: 1 Applied preprocessing Original rule: l9 -> l8 : i1^0'=i1^post12, i3^0'=i3^post12, n^0'=n^post12, i2^0'=i2^post12, i4^0'=i4^post12, (-n^post12+n^0 == 0 /\ i4^0-i4^post12 == 0 /\ i1^0-i1^post12 == 0 /\ i2^0-i2^post12 == 0 /\ -i3^post12+i3^0 == 0), cost: 1 New rule: l9 -> l8 : TRUE, cost: 1 Simplified rules Start location: l9 13: l0 -> l1 : i4^0'=-1+i4^0, -1+i4^0 >= 0, cost: 1 popout

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

job log

popout

actions

all output return to ITS