details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.0855461 seconds
cpu usage	0.087353
user time	0.06736
system time	0.019993
max virtual memory	113188.0
max residence set size	20440.0

stage attributes

key	value
starexec-result	NO

output

NO Initial ITS Start location: __init 0: f1_0_main_Load -> f31_0_loop_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 1: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=arg1P1, arg2'=arg2P1, (1+arg1-arg1P1 == 0 /\ -5+arg1 > 0), cost: 1 2: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -arg1P2 == 0 /\ -6+arg1 < 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f31_0_loop_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f31_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=arg1P1, arg2'=arg2P1, (1+arg1-arg1P1 == 0 /\ -5+arg1 > 0), cost: 1 New rule: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=1+arg1, arg2'=arg2P1, -5+arg1 > 0, cost: 1 Applied preprocessing Original rule: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -arg1P2 == 0 /\ -6+arg1 < 0), cost: 1 New rule: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=0, arg2'=arg2P2, (arg1 > 0 /\ 6-arg1 > 0), cost: 1 Simplified rules Start location: __init 4: f1_0_main_Load -> f31_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 5: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=1+arg1, arg2'=arg2P1, -5+arg1 > 0, cost: 1 6: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=0, arg2'=arg2P2, (arg1 > 0 /\ 6-arg1 > 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied nonterm Original rule: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=1+arg1, arg2'=arg2P1, -5+arg1 > 0, cost: 1 New rule: f31_0_loop_EQ -> [3] : -5+arg1 > 0, cost: NONTERM Applied acceleration Original rule: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=1+arg1, arg2'=arg2P1, -5+arg1 > 0, cost: 1 New rule: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=arg1+n1, arg2'=arg2P1, -5+arg1 > 0, cost: n1 Applied deletion Removed the following rules: 5 Accelerated simple loops Start location: __init 4: f1_0_main_Load -> f31_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 6: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=0, arg2'=arg2P2, (arg1 > 0 /\ 6-arg1 > 0), cost: 1 7: f31_0_loop_EQ -> [3] : -5+arg1 > 0, cost: NONTERM 8: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=arg1+n1, arg2'=arg2P1, -5+arg1 > 0, cost: n1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f31_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=0, arg2'=arg2P2, (arg1 > 0 /\ 6-arg1 > 0), cost: 1 New rule: f1_0_main_Load -> f31_0_loop_EQ : arg1'=0, arg2'=arg2P2, (arg1 > 0 /\ arg2 > 0 /\ 6-arg2 > 0), cost: 2 Applied chaining First rule: f1_0_main_Load -> f31_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f31_0_loop_EQ -> [3] : -5+arg1 > 0, cost: NONTERM New rule: f1_0_main_Load -> [3] : (arg1 > 0 /\ -5+arg2 > 0), cost: NONTERM Applied chaining First rule: f1_0_main_Load -> f31_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f31_0_loop_EQ -> f31_0_loop_EQ : arg1'=arg1+n1, arg2'=arg2P1, -5+arg1 > 0, cost: n1 New rule: f1_0_main_Load -> f31_0_loop_EQ : arg1'=arg2+n1, arg2'=arg2P1, (arg1 > 0 /\ -5+arg2 > 0), cost: 1+n1 Applied deletion Removed the following rules: 6 7 8 Chained accelerated rules with incoming rules Start location: __init 4: f1_0_main_Load -> f31_0_loop_EQ : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 9: f1_0_main_Load -> f31_0_loop_EQ : arg1'=0, arg2'=arg2P2, (arg1 > 0 /\ arg2 > 0 /\ 6-arg2 > 0), cost: 2 10: f1_0_main_Load -> [3] : (arg1 > 0 /\ -5+arg2 > 0), cost: NONTERM 11: f1_0_main_Load -> f31_0_loop_EQ : arg1'=arg2+n1, arg2'=arg2P1, (arg1 > 0 /\ -5+arg2 > 0), cost: 1+n1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init 10: f1_0_main_Load -> [3] : (arg1 > 0 /\ -5+arg2 > 0), cost: NONTERM 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 popout

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

job log

popout

actions

all output return to ITS