details

property	value
status	complete
benchmark	Nest.jar-obl-8.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_AProVE_2014

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.107280015945 seconds
cpu usage	0.104506292
max memory	1.2685312E7

stage attributes

key	value
output-size	8876
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 -> f66_0_nest_NE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ arg2 > 0), cost: 1 1: f66_0_nest_NE -> f66_0_nest_NE : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -1+arg1-arg1P1 == 0 /\ -1 < 0), cost: 1 2: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg1'=arg1P2, arg2'=arg2P2, (1-arg1P2 == 0 /\ 1-arg1 == 0), cost: 1 4: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg1'=arg1P4, arg2'=arg2P4, (arg1 > 0 /\ arg1-arg1P4 == 0 /\ -1 < 0), cost: 1 3: f115_0_nest_InvokeMethod -> f66_0_nest_NE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ -arg1P3 == 0), cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Applied preprocessing Original rule: f66_0_nest_NE -> f66_0_nest_NE : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -1+arg1-arg1P1 == 0 /\ -1 < 0), cost: 1 New rule: f66_0_nest_NE -> f66_0_nest_NE : arg1'=-1+arg1, arg2'=arg2P1, arg1 > 0, cost: 1 Applied preprocessing Original rule: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg1'=arg1P2, arg2'=arg2P2, (1-arg1P2 == 0 /\ 1-arg1 == 0), cost: 1 New rule: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg1'=1, arg2'=arg2P2, -1+arg1 == 0, cost: 1 Applied preprocessing Original rule: f115_0_nest_InvokeMethod -> f66_0_nest_NE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ -arg1P3 == 0), cost: 1 New rule: f115_0_nest_InvokeMethod -> f66_0_nest_NE : arg1'=0, arg2'=arg2P3, arg1 > 0, cost: 1 Applied preprocessing Original rule: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg1'=arg1P4, arg2'=arg2P4, (arg1 > 0 /\ arg1-arg1P4 == 0 /\ -1 < 0), cost: 1 New rule: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg2'=arg2P4, arg1 > 0, cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f66_0_nest_NE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ arg2 > 0), cost: 1 6: f66_0_nest_NE -> f66_0_nest_NE : arg1'=-1+arg1, arg2'=arg2P1, arg1 > 0, cost: 1 7: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg1'=1, arg2'=arg2P2, -1+arg1 == 0, cost: 1 9: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg2'=arg2P4, arg1 > 0, cost: 1 8: f115_0_nest_InvokeMethod -> f66_0_nest_NE : arg1'=0, arg2'=arg2P3, arg1 > 0, cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Applied acceleration Original rule: f66_0_nest_NE -> f66_0_nest_NE : arg1'=-1+arg1, arg2'=arg2P1, arg1 > 0, cost: 1 New rule: f66_0_nest_NE -> f66_0_nest_NE : arg1'=arg1-n0, arg2'=arg2P1, (-1+n0 >= 0 /\ 1+arg1-n0 > 0), cost: n0 Applied instantiation Original rule: f66_0_nest_NE -> f66_0_nest_NE : arg1'=arg1-n0, arg2'=arg2P1, (-1+n0 >= 0 /\ 1+arg1-n0 > 0), cost: n0 New rule: f66_0_nest_NE -> f66_0_nest_NE : arg1'=0, arg2'=arg2P1, (1 > 0 /\ -1+arg1 >= 0), cost: arg1 Applied simplification Original rule: f66_0_nest_NE -> f66_0_nest_NE : arg1'=0, arg2'=arg2P1, (1 > 0 /\ -1+arg1 >= 0), cost: arg1 New rule: f66_0_nest_NE -> f66_0_nest_NE : arg1'=0, arg2'=arg2P1, -1+arg1 >= 0, cost: arg1 Applied deletion Removed the following rules: 6 Accelerated simple loops Start location: __init 0: f1_0_main_Load -> f66_0_nest_NE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ arg2 > 0), cost: 1 7: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg1'=1, arg2'=arg2P2, -1+arg1 == 0, cost: 1 9: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg2'=arg2P4, arg1 > 0, cost: 1 11: f66_0_nest_NE -> f66_0_nest_NE : arg1'=0, arg2'=arg2P1, -1+arg1 >= 0, cost: arg1 8: f115_0_nest_InvokeMethod -> f66_0_nest_NE : arg1'=0, arg2'=arg2P3, arg1 > 0, cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f66_0_nest_NE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ arg2 > 0), cost: 1 Second rule: f66_0_nest_NE -> f66_0_nest_NE : arg1'=0, arg2'=arg2P1, -1+arg1 >= 0, cost: arg1 New rule: f1_0_main_Load -> f66_0_nest_NE : arg1'=0, arg2'=arg2P1, (arg1 > 0 /\ arg2 > 0 /\ -1+arg1P0 >= 0), cost: 1+arg1P0 Applied deletion Removed the following rules: 11 Chained accelerated rules with incoming rules Start location: __init 0: f1_0_main_Load -> f66_0_nest_NE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ arg2 > 0), cost: 1 12: f1_0_main_Load -> f66_0_nest_NE : arg1'=0, arg2'=arg2P1, (arg1 > 0 /\ arg2 > 0 /\ -1+arg1P0 >= 0), cost: 1+arg1P0 7: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg1'=1, arg2'=arg2P2, -1+arg1 == 0, cost: 1 9: f66_0_nest_NE -> f115_0_nest_InvokeMethod : arg2'=arg2P4, arg1 > 0, cost: 1 popout

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

job log

popout

actions

all output return to Integer Transition Systems