Integer Transition Systems pair #487526579

details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.114251852036 seconds
cpu usage	0.110726705
max memory	2.3015424E7

stage attributes

key	value
output-size	6662
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO

Initial ITS
Start location: l3
   0: l0 -> l1 : __const_1000^0'=__const_1000^post0, x^0'=x^post0, __const_200^0'=__const_200^post0, (__const_1000^0-__const_1000^post0 == 0 /\ -__const_1000^0-x^0+x^post0 == 0 /\ -__const_200^post0+__const_200^0 == 0 /\ 1+__const_200^0-x^post0 <= 0), cost: 1
   1: l1 -> l0 : __const_1000^0'=__const_1000^post1, x^0'=x^post1, __const_200^0'=__const_200^post1, (x^0-x^post1 == 0 /\ __const_1000^0-__const_1000^post1 == 0 /\ __const_200^0-__const_200^post1 == 0), cost: 1
   2: l2 -> l0 : __const_1000^0'=__const_1000^post2, x^0'=x^post2, __const_200^0'=__const_200^post2, (x^0-x^post2 == 0 /\ __const_200^0-__const_200^post2 == 0 /\ __const_1000^0-__const_1000^post2 == 0), cost: 1
   3: l3 -> l2 : __const_1000^0'=__const_1000^post3, x^0'=x^post3, __const_200^0'=__const_200^post3, (__const_200^0-__const_200^post3 == 0 /\ __const_1000^0-__const_1000^post3 == 0 /\ x^0-x^post3 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l1 : __const_1000^0'=__const_1000^post0, x^0'=x^post0, __const_200^0'=__const_200^post0, (__const_1000^0-__const_1000^post0 == 0 /\ -__const_1000^0-x^0+x^post0 == 0 /\ -__const_200^post0+__const_200^0 == 0 /\ 1+__const_200^0-x^post0 <= 0), cost: 1
New rule:
l0 -> l1 : x^0'=__const_1000^0+x^0, 1-__const_1000^0-x^0+__const_200^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l1 -> l0 : __const_1000^0'=__const_1000^post1, x^0'=x^post1, __const_200^0'=__const_200^post1, (x^0-x^post1 == 0 /\ __const_1000^0-__const_1000^post1 == 0 /\ __const_200^0-__const_200^post1 == 0), cost: 1
New rule:
l1 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l2 -> l0 : __const_1000^0'=__const_1000^post2, x^0'=x^post2, __const_200^0'=__const_200^post2, (x^0-x^post2 == 0 /\ __const_200^0-__const_200^post2 == 0 /\ __const_1000^0-__const_1000^post2 == 0), cost: 1
New rule:
l2 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l3 -> l2 : __const_1000^0'=__const_1000^post3, x^0'=x^post3, __const_200^0'=__const_200^post3, (__const_200^0-__const_200^post3 == 0 /\ __const_1000^0-__const_1000^post3 == 0 /\ x^0-x^post3 == 0), cost: 1
New rule:
l3 -> l2 : TRUE, cost: 1

Simplified rules
Start location: l3
   4: l0 -> l1 : x^0'=__const_1000^0+x^0, 1-__const_1000^0-x^0+__const_200^0 <= 0, cost: 1
   5: l1 -> l0 : TRUE, cost: 1
   6: l2 -> l0 : TRUE, cost: 1
   7: l3 -> l2 : TRUE, cost: 1


Eliminating location l2 by chaining:

Applied chaining
First rule:
l3 -> l2 : TRUE, cost: 1
Second rule:
l2 -> l0 : TRUE, cost: 1
New rule:
l3 -> l0 : TRUE, cost: 2

Applied deletion
Removed the following rules: 6 7

Eliminating location l1 by chaining:

Applied chaining
First rule:
l0 -> l1 : x^0'=__const_1000^0+x^0, 1-__const_1000^0-x^0+__const_200^0 <= 0, cost: 1
Second rule:
l1 -> l0 : TRUE, cost: 1
New rule:
l0 -> l0 : x^0'=__const_1000^0+x^0, 1-__const_1000^0-x^0+__const_200^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 4 5

Eliminated locations on linear paths
Start location: l3
   9: l0 -> l0 : x^0'=__const_1000^0+x^0, 1-__const_1000^0-x^0+__const_200^0 <= 0, cost: 2
   8: l3 -> l0 : TRUE, cost: 2


Applied acceleration
Original rule:
l0 -> l0 : x^0'=__const_1000^0+x^0, 1-__const_1000^0-x^0+__const_200^0 <= 0, cost: 2
New rule:
l0 -> l0 : x^0'=x^0+__const_1000^0*n0, (-1+__const_1000^0+x^0-__const_200^0+__const_1000^0*(-1+n0) >= 0 /\ -1+__const_1000^0+x^0-__const_200^0 >= 0 /\ n0 >= 0), cost: 2*n0

Applied recurrent set
Original rule:
l0 -> l0 : x^0'=__const_1000^0+x^0, 1-__const_1000^0-x^0+__const_200^0 <= 0, cost: 2
New rule:
l0 -> [4] : (1-__const_1000^0-x^0+__const_200^0 <= 0 /\ 1-__const_1000^0 <= 0), cost: NONTERM

Applied fixed-point processor
Original rule:
l0 -> l0 : x^0'=__const_1000^0+x^0, 1-__const_1000^0-x^0+__const_200^0 <= 0, cost: 2
New rule:
l0 -> [4] : (1-__const_1000^0-x^0+__const_200^0 <= 0 /\ -__const_1000^0 == 0), cost: NONTERM

Applied deletion
Removed the following rules: 9

popout

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

job log

popout

actions all output return to Integer Transition Systems