details

property	value
status	complete
benchmark	ex02_rec.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.237181 seconds
cpu usage	0.240604
user time	0.199136
system time	0.041468
max virtual memory	113188.0
max residence set size	18948.0

stage attributes

key	value
starexec-result	NO

output

NO Initial ITS Start location: __init 0: f1_0_main_Load -> f31_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 1: f31_0_loop_LE -> f31_0_loop_LE : arg1'=arg1P1, arg2'=arg2P1, (5-arg1P1 == 0 /\ 5-arg1 == 0), cost: 1 2: f31_0_loop_LE -> f31_0_loop_LE : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -1+arg1-arg1P2 == 0 /\ -5+arg1 < 0), cost: 1 3: f31_0_loop_LE -> f31_0_loop_LE : arg1'=arg1P3, arg2'=arg2P3, (-1+arg1-arg1P3 == 0 /\ -5+arg1 > 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f31_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f31_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=arg1P1, arg2'=arg2P1, (5-arg1P1 == 0 /\ 5-arg1 == 0), cost: 1 New rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=5, arg2'=arg2P1, -5+arg1 == 0, cost: 1 Applied preprocessing Original rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -1+arg1-arg1P2 == 0 /\ -5+arg1 < 0), cost: 1 New rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ 5-arg1 > 0), cost: 1 Applied preprocessing Original rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=arg1P3, arg2'=arg2P3, (-1+arg1-arg1P3 == 0 /\ -5+arg1 > 0), cost: 1 New rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P3, -5+arg1 > 0, cost: 1 Simplified rules Start location: __init 5: f1_0_main_Load -> f31_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 6: f31_0_loop_LE -> f31_0_loop_LE : arg1'=5, arg2'=arg2P1, -5+arg1 == 0, cost: 1 7: f31_0_loop_LE -> f31_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ 5-arg1 > 0), cost: 1 8: f31_0_loop_LE -> f31_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P3, -5+arg1 > 0, cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied nonterm Original rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=5, arg2'=arg2P1, -5+arg1 == 0, cost: 1 New rule: f31_0_loop_LE -> [3] : (-5+arg1 >= 0 /\ 5-arg1 >= 0), cost: NONTERM Applied acceleration Original rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=5, arg2'=arg2P1, -5+arg1 == 0, cost: 1 New rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=5, arg2'=arg2P1, (-5+arg1 >= 0 /\ 5-arg1 >= 0), cost: n2 Applied acceleration Original rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ 5-arg1 > 0), cost: 1 New rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=arg1-n4, arg2'=arg2P2, (1+arg1-n4 > 0 /\ 5-arg1 > 0 /\ -1+n4 >= 0), cost: n4 Applied instantiation Original rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=arg1-n4, arg2'=arg2P2, (1+arg1-n4 > 0 /\ 5-arg1 > 0 /\ -1+n4 >= 0), cost: n4 New rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=0, arg2'=arg2P2, (1 > 0 /\ -1+arg1 >= 0 /\ 5-arg1 > 0), cost: arg1 Applied acceleration Original rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P3, -5+arg1 > 0, cost: 1 New rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=arg1-n6, arg2'=arg2P3, (-4+arg1-n6 > 0 /\ -1+n6 >= 0), cost: n6 Applied instantiation Original rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=arg1-n6, arg2'=arg2P3, (-4+arg1-n6 > 0 /\ -1+n6 >= 0), cost: n6 New rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=5, arg2'=arg2P3, (1 > 0 /\ -6+arg1 >= 0), cost: -5+arg1 Applied simplification Original rule: f31_0_loop_LE -> [3] : (-5+arg1 >= 0 /\ 5-arg1 >= 0), cost: NONTERM New rule: f31_0_loop_LE -> [3] : (-5+arg1 <= 0 /\ -5+arg1 >= 0), cost: NONTERM Applied simplification Original rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=5, arg2'=arg2P1, (-5+arg1 >= 0 /\ 5-arg1 >= 0), cost: n2 New rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=5, arg2'=arg2P1, (-5+arg1 <= 0 /\ -5+arg1 >= 0), cost: n2 Applied simplification Original rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=0, arg2'=arg2P2, (1 > 0 /\ -1+arg1 >= 0 /\ 5-arg1 > 0), cost: arg1 New rule: f31_0_loop_LE -> f31_0_loop_LE : arg1'=0, arg2'=arg2P2, (-1+arg1 >= 0 /\ 5-arg1 > 0), cost: arg1 Applied simplification Original rule: popout

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

job log

popout

actions

all output return to ITS