details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.0785529 seconds
cpu usage	0.080033
user time	0.066449
system time	0.013584
max virtual memory	113188.0
max residence set size	18212.0

stage attributes

key	value
starexec-result	NO

output

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

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

job log

popout

actions

all output return to ITS