details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.660752058029 seconds
cpu usage	0.657408862
max memory	1.626112E7

stage attributes

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

output

/export/starexec/sandbox2/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f1_0_main_Load -> f193_0_count_GE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (arg1 > 0 /\ 1+arg4P0 > 0 /\ 1+arg3P0 > 0 /\ arg1P0 > 0 /\ 1+arg2 > 0 /\ arg2P0 > 0), cost: 1 1: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, arg4'=arg4P1, (2-arg2+arg4 <= 0 /\ arg1 > 0 /\ arg2P1 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ arg2 > 0 /\ -arg3P1+arg3 == 0 /\ arg3-arg4 > 0 /\ 2-arg1+arg3 <= 0 /\ arg1P1 > 0 /\ 1-arg4P1+arg4 == 0), cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, arg4'=arg4P2, TRUE, cost: 1 Applied preprocessing Original rule: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, arg4'=arg4P1, (2-arg2+arg4 <= 0 /\ arg1 > 0 /\ arg2P1 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ arg2 > 0 /\ -arg3P1+arg3 == 0 /\ arg3-arg4 > 0 /\ 2-arg1+arg3 <= 0 /\ arg1P1 > 0 /\ 1-arg4P1+arg4 == 0), cost: 1 New rule: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=1+arg4, (2-arg2+arg4 <= 0 /\ arg2P1 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ arg3-arg4 > 0 /\ 2-arg1+arg3 <= 0 /\ arg1P1 > 0), cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f193_0_count_GE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (arg1 > 0 /\ 1+arg4P0 > 0 /\ 1+arg3P0 > 0 /\ arg1P0 > 0 /\ 1+arg2 > 0 /\ arg2P0 > 0), cost: 1 3: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=1+arg4, (2-arg2+arg4 <= 0 /\ arg2P1 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ arg3-arg4 > 0 /\ 2-arg1+arg3 <= 0 /\ arg1P1 > 0), cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, arg4'=arg4P2, TRUE, cost: 1 Applied acceleration Original rule: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=1+arg4, (2-arg2+arg4 <= 0 /\ arg2P1 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ arg3-arg4 > 0 /\ 2-arg1+arg3 <= 0 /\ arg1P1 > 0), cost: 1 New rule: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=arg4+n0, (arg2P1 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ 1+arg3-arg4-n0 > 0 /\ arg1-arg1P1 >= 0 /\ -1+n0 >= 0 /\ arg1P1 > 0 /\ ((-2+arg2-arg4 >= 0 /\ -1+arg2P1-arg4-n0 >= 0) \/ (-1+arg2P1-arg4-n0 >= 0 /\ 1-arg2P1+arg2 >= 0)) /\ ((-2+arg1-arg3 >= 0 /\ -2-arg3+arg1P1 >= 0) \/ (arg1-arg1P1 >= 0 /\ -2-arg3+arg1P1 >= 0))), cost: n0 Applied instantiation Original rule: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=arg4+n0, (arg2P1 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ 1+arg3-arg4-n0 > 0 /\ arg1-arg1P1 >= 0 /\ -1+n0 >= 0 /\ arg1P1 > 0 /\ ((-2+arg2-arg4 >= 0 /\ -1+arg2P1-arg4-n0 >= 0) \/ (-1+arg2P1-arg4-n0 >= 0 /\ 1-arg2P1+arg2 >= 0)) /\ ((-2+arg1-arg3 >= 0 /\ -2-arg3+arg1P1 >= 0) \/ (arg1-arg1P1 >= 0 /\ -2-arg3+arg1P1 >= 0))), cost: n0 New rule: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=-1+arg2P1, (2-arg2P1+arg3 > 0 /\ arg2P1 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ -2+arg2P1-arg4 >= 0 /\ arg1P1 > 0 /\ ((0 >= 0 /\ 1-arg2P1+arg2 >= 0) \/ (0 >= 0 /\ -2+arg2-arg4 >= 0)) /\ ((-2+arg1-arg3 >= 0 /\ -2-arg3+arg1P1 >= 0) \/ (arg1-arg1P1 >= 0 /\ -2-arg3+arg1P1 >= 0))), cost: -1+arg2P1-arg4 Applied instantiation Original rule: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=arg4+n0, (arg2P1 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ 1+arg3-arg4-n0 > 0 /\ arg1-arg1P1 >= 0 /\ -1+n0 >= 0 /\ arg1P1 > 0 /\ ((-2+arg2-arg4 >= 0 /\ -1+arg2P1-arg4-n0 >= 0) \/ (-1+arg2P1-arg4-n0 >= 0 /\ 1-arg2P1+arg2 >= 0)) /\ ((-2+arg1-arg3 >= 0 /\ -2-arg3+arg1P1 >= 0) \/ (arg1-arg1P1 >= 0 /\ -2-arg3+arg1P1 >= 0))), cost: n0 New rule: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=arg3, (1 > 0 /\ arg2P1 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ -1+arg3-arg4 >= 0 /\ arg1P1 > 0 /\ ((arg1-arg1P1 >= 0 /\ -2-arg3+arg1P1 >= 0) \/ (-2+arg1-arg3 >= 0 /\ -2-arg3+arg1P1 >= 0)) /\ ((-2+arg2-arg4 >= 0 /\ -1+arg2P1-arg3 >= 0) \/ (1-arg2P1+arg2 >= 0 /\ -1+arg2P1-arg3 >= 0))), cost: arg3-arg4 Applied simplification Original rule: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=-1+arg2P1, (2-arg2P1+arg3 > 0 /\ arg2P1 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ -2+arg2P1-arg4 >= 0 /\ arg1P1 > 0 /\ ((0 >= 0 /\ 1-arg2P1+arg2 >= 0) \/ (0 >= 0 /\ -2+arg2-arg4 >= 0)) /\ ((-2+arg1-arg3 >= 0 /\ -2-arg3+arg1P1 >= 0) \/ (arg1-arg1P1 >= 0 /\ -2-arg3+arg1P1 >= 0))), cost: -1+arg2P1-arg4 New rule: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=-1+arg2P1, (2-arg2P1+arg3 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ -2+arg2P1-arg4 >= 0 /\ -2-arg3+arg1P1 >= 0), cost: -1+arg2P1-arg4 Applied simplification Original rule: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=arg3, (1 > 0 /\ arg2P1 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ -1+arg3-arg4 >= 0 /\ arg1P1 > 0 /\ ((arg1-arg1P1 >= 0 /\ -2-arg3+arg1P1 >= 0) \/ (-2+arg1-arg3 >= 0 /\ -2-arg3+arg1P1 >= 0)) /\ ((-2+arg2-arg4 >= 0 /\ -1+arg2P1-arg3 >= 0) \/ (1-arg2P1+arg2 >= 0 /\ -1+arg2P1-arg3 >= 0))), cost: arg3-arg4 New rule: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=arg3, (1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ -1+arg3-arg4 >= 0 /\ -2-arg3+arg1P1 >= 0 /\ -1+arg2P1-arg3 >= 0), cost: arg3-arg4 Applied deletion Removed the following rules: 3 Accelerated simple loops Start location: __init 0: f1_0_main_Load -> f193_0_count_GE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (arg1 > 0 /\ 1+arg4P0 > 0 /\ 1+arg3P0 > 0 /\ arg1P0 > 0 /\ 1+arg2 > 0 /\ arg2P0 > 0), cost: 1 6: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=-1+arg2P1, (2-arg2P1+arg3 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ -2+arg2P1-arg4 >= 0 /\ -2-arg3+arg1P1 >= 0), cost: -1+arg2P1-arg4 7: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=arg3, (1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ -1+arg3-arg4 >= 0 /\ -2-arg3+arg1P1 >= 0 /\ -1+arg2P1-arg3 >= 0), cost: arg3-arg4 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, arg4'=arg4P2, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f193_0_count_GE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (arg1 > 0 /\ 1+arg4P0 > 0 /\ 1+arg3P0 > 0 /\ arg1P0 > 0 /\ 1+arg2 > 0 /\ arg2P0 > 0), cost: 1 Second rule: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=-1+arg2P1, (2-arg2P1+arg3 > 0 /\ 1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ -2+arg2P1-arg4 >= 0 /\ -2-arg3+arg1P1 >= 0), cost: -1+arg2P1-arg4 New rule: f1_0_main_Load -> f193_0_count_GE : arg1'=arg1P1, arg3'=arg3P0, arg2'=arg2P1, arg4'=-1+arg2P1, (arg1 > 0 /\ 1+arg4P0 > 0 /\ -2+arg1P1-arg3P0 >= 0 /\ 1+arg2 > 0 /\ 2-arg2P1+arg3P0 > 0 /\ -2+arg2P1-arg4P0 >= 0), cost: arg2P1-arg4P0 Applied chaining First rule: f1_0_main_Load -> f193_0_count_GE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (arg1 > 0 /\ 1+arg4P0 > 0 /\ 1+arg3P0 > 0 /\ arg1P0 > 0 /\ 1+arg2 > 0 /\ arg2P0 > 0), cost: 1 Second rule: f193_0_count_GE -> f193_0_count_GE : arg1'=arg1P1, arg2'=arg2P1, arg4'=arg3, (1-arg2P1+arg2 >= 0 /\ 1+arg4 > 0 /\ arg1-arg1P1 >= 0 /\ -1+arg3-arg4 >= 0 /\ -2-arg3+arg1P1 >= 0 /\ -1+arg2P1-arg3 >= 0), cost: arg3-arg4 New rule: f1_0_main_Load -> f193_0_count_GE : arg1'=arg1P1, arg3'=arg3P0, arg2'=arg2P1, arg4'=arg3P0, (arg1 > 0 /\ 1+arg4P0 > 0 /\ -2+arg1P1-arg3P0 >= 0 /\ -1+arg2P1-arg3P0 >= 0 /\ 1+arg2 > 0 /\ -1-arg4P0+arg3P0 >= 0), cost: 1-arg4P0+arg3P0 Applied deletion Removed the following rules: 6 7 Chained accelerated rules with incoming rules Start location: __init 0: f1_0_main_Load -> f193_0_count_GE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, arg4'=arg4P0, (arg1 > 0 /\ 1+arg4P0 > 0 /\ 1+arg3P0 > 0 /\ arg1P0 > 0 /\ 1+arg2 > 0 /\ arg2P0 > 0), cost: 1 8: f1_0_main_Load -> f193_0_count_GE : arg1'=arg1P1, arg3'=arg3P0, arg2'=arg2P1, arg4'=-1+arg2P1, (arg1 > 0 /\ 1+arg4P0 > 0 /\ -2+arg1P1-arg3P0 >= 0 /\ 1+arg2 > 0 /\ 2-arg2P1+arg3P0 > 0 /\ -2+arg2P1-arg4P0 >= 0), cost: arg2P1-arg4P0 9: f1_0_main_Load -> f193_0_count_GE : arg1'=arg1P1, arg3'=arg3P0, arg2'=arg2P1, arg4'=arg3P0, (arg1 > 0 /\ 1+arg4P0 > 0 /\ -2+arg1P1-arg3P0 >= 0 /\ -1+arg2P1-arg3P0 >= 0 /\ 1+arg2 > 0 /\ -1-arg4P0+arg3P0 >= 0), cost: 1-arg4P0+arg3P0 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, arg4'=arg4P2, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init <empty> popout

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

job log

popout

actions

all output return to Integer Transition Systems