details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.838361 seconds
cpu usage	0.837138
user time	0.79077
system time	0.046368
max virtual memory	278168.0
max residence set size	20140.0

stage attributes

key	value
starexec-result	NO

output

NO Initial ITS Start location: __init 0: f1_0_main_Load -> f51_0_increase_GE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0 /\ -arg1P0+arg2 == 0), cost: 1 1: f51_0_increase_GE -> f83_0_increase_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1-arg2P1 == 0 /\ -10+arg1 < 0 /\ arg1-arg1P1 == 0 /\ arg1-arg3P1 == 0), cost: 1 2: f83_0_increase_LE -> f51_0_increase_GE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (-arg3+arg2 == 0 /\ 1+arg1-arg1P2 == 0 /\ -6+arg2 < 0), cost: 1 3: f83_0_increase_LE -> f83_0_increase_LE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (1+arg2-arg2P3 == 0 /\ -arg3+arg2 == 0 /\ 1-arg3P3+arg2 == 0 /\ -5+arg2 > 0 /\ arg1-arg1P3 == 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f51_0_increase_GE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0 /\ -arg1P0+arg2 == 0), cost: 1 New rule: f1_0_main_Load -> f51_0_increase_GE : arg1'=arg2, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f51_0_increase_GE -> f83_0_increase_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1-arg2P1 == 0 /\ -10+arg1 < 0 /\ arg1-arg1P1 == 0 /\ arg1-arg3P1 == 0), cost: 1 New rule: f51_0_increase_GE -> f83_0_increase_LE : arg3'=arg1, arg2'=arg1, 10-arg1 > 0, cost: 1 Applied preprocessing Original rule: f83_0_increase_LE -> f51_0_increase_GE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (-arg3+arg2 == 0 /\ 1+arg1-arg1P2 == 0 /\ -6+arg2 < 0), cost: 1 New rule: f83_0_increase_LE -> f51_0_increase_GE : arg1'=1+arg1, arg3'=arg3P2, arg2'=arg2P2, (-arg3+arg2 == 0 /\ 6-arg2 > 0), cost: 1 Applied preprocessing Original rule: f83_0_increase_LE -> f83_0_increase_LE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (1+arg2-arg2P3 == 0 /\ -arg3+arg2 == 0 /\ 1-arg3P3+arg2 == 0 /\ -5+arg2 > 0 /\ arg1-arg1P3 == 0), cost: 1 New rule: f83_0_increase_LE -> f83_0_increase_LE : arg3'=1+arg2, arg2'=1+arg2, (-arg3+arg2 == 0 /\ -5+arg2 > 0), cost: 1 Simplified rules Start location: __init 5: f1_0_main_Load -> f51_0_increase_GE : arg1'=arg2, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 6: f51_0_increase_GE -> f83_0_increase_LE : arg3'=arg1, arg2'=arg1, 10-arg1 > 0, cost: 1 7: f83_0_increase_LE -> f51_0_increase_GE : arg1'=1+arg1, arg3'=arg3P2, arg2'=arg2P2, (-arg3+arg2 == 0 /\ 6-arg2 > 0), cost: 1 8: f83_0_increase_LE -> f83_0_increase_LE : arg3'=1+arg2, arg2'=1+arg2, (-arg3+arg2 == 0 /\ -5+arg2 > 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1 Applied nonterm Original rule: f83_0_increase_LE -> f83_0_increase_LE : arg3'=1+arg2, arg2'=1+arg2, (-arg3+arg2 == 0 /\ -5+arg2 > 0), cost: 1 New rule: f83_0_increase_LE -> [4] : (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ -5+arg2 > 0), cost: NONTERM Applied acceleration Original rule: f83_0_increase_LE -> f83_0_increase_LE : arg3'=1+arg2, arg2'=1+arg2, (-arg3+arg2 == 0 /\ -5+arg2 > 0), cost: 1 New rule: f83_0_increase_LE -> f83_0_increase_LE : arg3'=n0+arg2, arg2'=n0+arg2, (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ -5+arg2 > 0), cost: n0 Applied deletion Removed the following rules: 8 Accelerated simple loops Start location: __init 5: f1_0_main_Load -> f51_0_increase_GE : arg1'=arg2, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 6: f51_0_increase_GE -> f83_0_increase_LE : arg3'=arg1, arg2'=arg1, 10-arg1 > 0, cost: 1 7: f83_0_increase_LE -> f51_0_increase_GE : arg1'=1+arg1, arg3'=arg3P2, arg2'=arg2P2, (-arg3+arg2 == 0 /\ 6-arg2 > 0), cost: 1 9: f83_0_increase_LE -> [4] : (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ -5+arg2 > 0), cost: NONTERM 10: f83_0_increase_LE -> f83_0_increase_LE : arg3'=n0+arg2, arg2'=n0+arg2, (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ -5+arg2 > 0), cost: n0 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1 Applied chaining First rule: f51_0_increase_GE -> f83_0_increase_LE : arg3'=arg1, arg2'=arg1, 10-arg1 > 0, cost: 1 Second rule: f83_0_increase_LE -> [4] : (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ -5+arg2 > 0), cost: NONTERM New rule: f51_0_increase_GE -> [4] : (10-arg1 > 0 /\ -5+arg1 > 0), cost: NONTERM Applied chaining First rule: f51_0_increase_GE -> f83_0_increase_LE : arg3'=arg1, arg2'=arg1, 10-arg1 > 0, cost: 1 Second rule: f83_0_increase_LE -> f83_0_increase_LE : arg3'=n0+arg2, arg2'=n0+arg2, (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ -5+arg2 > 0), cost: n0 New rule: f51_0_increase_GE -> f83_0_increase_LE : arg3'=arg1+n0, arg2'=arg1+n0, (10-arg1 > 0 /\ -5+arg1 > 0), cost: 1+n0 Applied deletion Removed the following rules: 9 10 Chained accelerated rules with incoming rules Start location: __init 5: f1_0_main_Load -> f51_0_increase_GE : arg1'=arg2, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 6: f51_0_increase_GE -> f83_0_increase_LE : arg3'=arg1, arg2'=arg1, 10-arg1 > 0, cost: 1 11: f51_0_increase_GE -> [4] : (10-arg1 > 0 /\ -5+arg1 > 0), cost: NONTERM 12: f51_0_increase_GE -> f83_0_increase_LE : arg3'=arg1+n0, arg2'=arg1+n0, (10-arg1 > 0 /\ -5+arg1 > 0), cost: 1+n0 7: f83_0_increase_LE -> f51_0_increase_GE : arg1'=1+arg1, arg3'=arg3P2, arg2'=arg2P2, (-arg3+arg2 == 0 /\ 6-arg2 > 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1 Eliminating location f1_0_main_Load by chaining: popout

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

job log

popout

actions

all output return to ITS