Integer Transition Systems pair #487528274

details

property	value
status	complete
benchmark	Velroyen08-ex08.jar-obl-8.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n149.star.cs.uiowa.edu
space	From_AProVE_2014

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	1.49598908424 seconds
cpu usage	1.503475448
max memory	4.6616576E7

stage attributes

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

output

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


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


WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f115_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg2-arg2P0 == 0 /\ arg1 > 0 /\ -arg1P0 == 0 /\ 1+arg2 > 0), cost: 1
   1: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P1, arg2'=arg2P1, (1-arg2 == 0 /\ 1-arg1P1 == 0 /\ 2-arg2P1 == 0), cost: 1
   2: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P2, arg2'=arg2P2, (-10+arg2 < 0 /\ 1-arg1P2 == 0 /\ 1-arg1 == 0 /\ -1+arg2 > 0 /\ 1-arg2P2+arg2 == 0), cost: 1
   3: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P3, arg2'=arg2P3, (-1+arg2-arg2P3 == 0 /\ -10+arg2 < 0 /\ -arg1 == 0 /\ -1+arg2 > 0 /\ -arg1P3 == 0), cost: 1
   4: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P4, arg2'=arg2P4, (-10+arg2 > 0 /\ 1-arg1 == 0 /\ 1-arg2P4+arg2 == 0 /\ 1-arg1P4 == 0), cost: 1
   5: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P5, arg2'=arg2P5, (-10+arg2 > 0 /\ -arg1 == 0 /\ -arg1P5 == 0 /\ -1+arg2-arg2P5 == 0), cost: 1
   6: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P6, arg2'=arg2P6, (-arg1P6 == 0 /\ 10-arg2 == 0 /\ 9-arg2P6 == 0), cost: 1
   7: __init -> f1_0_main_Load : arg1'=arg1P7, arg2'=arg2P7, TRUE, cost: 1


Applied preprocessing
Original rule:
f1_0_main_Load -> f115_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg2-arg2P0 == 0 /\ arg1 > 0 /\ -arg1P0 == 0 /\ 1+arg2 > 0), cost: 1
New rule:
f1_0_main_Load -> f115_0_loop_LE : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P1, arg2'=arg2P1, (1-arg2 == 0 /\ 1-arg1P1 == 0 /\ 2-arg2P1 == 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=2, -1+arg2 == 0, cost: 1

Applied preprocessing
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P2, arg2'=arg2P2, (-10+arg2 < 0 /\ 1-arg1P2 == 0 /\ 1-arg1 == 0 /\ -1+arg2 > 0 /\ 1-arg2P2+arg2 == 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, (-1+arg1 == 0 /\ -1+arg2 > 0 /\ 10-arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P3, arg2'=arg2P3, (-1+arg2-arg2P3 == 0 /\ -10+arg2 < 0 /\ -arg1 == 0 /\ -1+arg2 > 0 /\ -arg1P3 == 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-1+arg2, (arg1 == 0 /\ -1+arg2 > 0 /\ 10-arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P4, arg2'=arg2P4, (-10+arg2 > 0 /\ 1-arg1 == 0 /\ 1-arg2P4+arg2 == 0 /\ 1-arg1P4 == 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, (-10+arg2 > 0 /\ -1+arg1 == 0), cost: 1

Applied preprocessing
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P5, arg2'=arg2P5, (-10+arg2 > 0 /\ -arg1 == 0 /\ -arg1P5 == 0 /\ -1+arg2-arg2P5 == 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-1+arg2, (arg1 == 0 /\ -10+arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P6, arg2'=arg2P6, (-arg1P6 == 0 /\ 10-arg2 == 0 /\ 9-arg2P6 == 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=9, -10+arg2 == 0, cost: 1

Simplified rules
Start location: __init
   8: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   9: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=2, -1+arg2 == 0, cost: 1
  10: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, (-1+arg1 == 0 /\ -1+arg2 > 0 /\ 10-arg2 > 0), cost: 1
  11: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-1+arg2, (arg1 == 0 /\ -1+arg2 > 0 /\ 10-arg2 > 0), cost: 1
  12: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, (-10+arg2 > 0 /\ -1+arg1 == 0), cost: 1
  13: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-1+arg2, (arg1 == 0 /\ -10+arg2 > 0), cost: 1
  14: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=9, -10+arg2 == 0, cost: 1
   7: __init -> f1_0_main_Load : arg1'=arg1P7, arg2'=arg2P7, TRUE, cost: 1


Applied acceleration
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, (-1+arg1 == 0 /\ -1+arg2 > 0 /\ 10-arg2 > 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=n6+arg2, (11-n6-arg2 > 0 /\ -1+n6 >= 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0 /\ -1+arg2 > 0), cost: n6

Applied instantiation
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=n6+arg2, (11-n6-arg2 > 0 /\ -1+n6 >= 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0 /\ -1+arg2 > 0), cost: n6
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=10, (1 > 0 /\ 9-arg2 >= 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0 /\ -1+arg2 > 0), cost: 10-arg2

Applied acceleration
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-1+arg2, (arg1 == 0 /\ -1+arg2 > 0 /\ 10-arg2 > 0), cost: 1
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-n8+arg2, (arg1 >= 0 /\ -arg1 >= 0 /\ 10-arg2 > 0 /\ -n8+arg2 > 0 /\ -1+n8 >= 0), cost: n8

Applied instantiation
Original rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-n8+arg2, (arg1 >= 0 /\ -arg1 >= 0 /\ 10-arg2 > 0 /\ -n8+arg2 > 0 /\ -1+n8 >= 0), cost: n8
New rule:
f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=1, (arg1 >= 0 /\ 1 > 0 /\ -arg1 >= 0 /\ -2+arg2 >= 0 /\ 10-arg2 > 0), cost: -1+arg2

Applied nonterm
Original rule:

popout

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

job log

popout

actions all output return to Integer Transition Systems