details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.052395 seconds
cpu usage	0.05318
user time	0.044842
system time	0.008338
max virtual memory	113188.0
max residence set size	7948.0

stage attributes

key	value
starexec-result	NO

output

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

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

job log

popout

actions

all output return to ITS