details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.0464978218079 seconds
cpu usage	0.042456703
max memory	1970176.0

stage attributes

key	value
output-size	4218
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Initial ITS Start location: __init 0: f1_0_main_Load -> f42_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 1: f42_0_loop_LE -> f42_0_loop_LE : arg1'=arg1P1, arg2'=arg2P1, (-2+arg1 > 0 /\ 1+arg1-arg1P1 == 0), cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f42_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f42_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f42_0_loop_LE -> f42_0_loop_LE : arg1'=arg1P1, arg2'=arg2P1, (-2+arg1 > 0 /\ 1+arg1-arg1P1 == 0), cost: 1 New rule: f42_0_loop_LE -> f42_0_loop_LE : arg1'=1+arg1, arg2'=arg2P1, -2+arg1 > 0, cost: 1 Simplified rules Start location: __init 3: f1_0_main_Load -> f42_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 4: f42_0_loop_LE -> f42_0_loop_LE : arg1'=1+arg1, arg2'=arg2P1, -2+arg1 > 0, cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied nonterm Original rule: f42_0_loop_LE -> f42_0_loop_LE : arg1'=1+arg1, arg2'=arg2P1, -2+arg1 > 0, cost: 1 New rule: f42_0_loop_LE -> [3] : -2+arg1 > 0, cost: NONTERM Applied acceleration Original rule: f42_0_loop_LE -> f42_0_loop_LE : arg1'=1+arg1, arg2'=arg2P1, -2+arg1 > 0, cost: 1 New rule: f42_0_loop_LE -> f42_0_loop_LE : arg1'=arg1+n0, arg2'=arg2P1, -2+arg1 > 0, cost: n0 Applied deletion Removed the following rules: 4 Accelerated simple loops Start location: __init 3: f1_0_main_Load -> f42_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 5: f42_0_loop_LE -> [3] : -2+arg1 > 0, cost: NONTERM 6: f42_0_loop_LE -> f42_0_loop_LE : arg1'=arg1+n0, arg2'=arg2P1, -2+arg1 > 0, cost: n0 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f42_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f42_0_loop_LE -> [3] : -2+arg1 > 0, cost: NONTERM New rule: f1_0_main_Load -> [3] : (arg1 > 0 /\ -2+arg2 > 0), cost: NONTERM Applied chaining First rule: f1_0_main_Load -> f42_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f42_0_loop_LE -> f42_0_loop_LE : arg1'=arg1+n0, arg2'=arg2P1, -2+arg1 > 0, cost: n0 New rule: f1_0_main_Load -> f42_0_loop_LE : arg1'=n0+arg2, arg2'=arg2P1, (arg1 > 0 /\ -2+arg2 > 0), cost: 1+n0 Applied deletion Removed the following rules: 5 6 Chained accelerated rules with incoming rules Start location: __init 3: f1_0_main_Load -> f42_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 7: f1_0_main_Load -> [3] : (arg1 > 0 /\ -2+arg2 > 0), cost: NONTERM 8: f1_0_main_Load -> f42_0_loop_LE : arg1'=n0+arg2, arg2'=arg2P1, (arg1 > 0 /\ -2+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] : (arg1 > 0 /\ -2+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] : (arg1 > 0 /\ -2+arg2 > 0), cost: NONTERM New rule: __init -> [3] : (-2+arg2P2 > 0 /\ arg1P2 > 0), cost: NONTERM popout

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

job log

popout

actions

all output return to Integer Transition Systems