details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.557969093323 seconds
cpu usage	0.554085056
max memory	1.8235392E7

stage attributes

key	value
output-size	3656
starexec-result	WORST_CASE(Omega(0),?)

output

/export/starexec/sandbox/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f1_0_main_Load -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 1: f145_0_main_LE -> f145_0_main_LE : arg1'=arg1P1, arg2'=arg2P1, (2-arg2P1+arg2 == 0 /\ -arg1+arg2 < 0 /\ 1+arg1-arg1P1 == 0), cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied preprocessing Original rule: f145_0_main_LE -> f145_0_main_LE : arg1'=arg1P1, arg2'=arg2P1, (2-arg2P1+arg2 == 0 /\ -arg1+arg2 < 0 /\ 1+arg1-arg1P1 == 0), cost: 1 New rule: f145_0_main_LE -> f145_0_main_LE : arg1'=1+arg1, arg2'=2+arg2, arg1-arg2 > 0, cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 3: f145_0_main_LE -> f145_0_main_LE : arg1'=1+arg1, arg2'=2+arg2, arg1-arg2 > 0, cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied acceleration Original rule: f145_0_main_LE -> f145_0_main_LE : arg1'=1+arg1, arg2'=2+arg2, arg1-arg2 > 0, cost: 1 New rule: f145_0_main_LE -> f145_0_main_LE : arg1'=arg1+n0, arg2'=arg2+2*n0, (1+arg1-arg2-n0 > 0 /\ n0 >= 0), cost: n0 Applied instantiation Original rule: f145_0_main_LE -> f145_0_main_LE : arg1'=arg1+n0, arg2'=arg2+2*n0, (1+arg1-arg2-n0 > 0 /\ n0 >= 0), cost: n0 New rule: f145_0_main_LE -> f145_0_main_LE : arg1'=2*arg1-arg2, arg2'=2*arg1-arg2, (1 > 0 /\ arg1-arg2 >= 0), cost: arg1-arg2 Applied simplification Original rule: f145_0_main_LE -> f145_0_main_LE : arg1'=2*arg1-arg2, arg2'=2*arg1-arg2, (1 > 0 /\ arg1-arg2 >= 0), cost: arg1-arg2 New rule: f145_0_main_LE -> f145_0_main_LE : arg1'=2*arg1-arg2, arg2'=2*arg1-arg2, arg1-arg2 >= 0, cost: arg1-arg2 Applied deletion Removed the following rules: 3 Accelerated simple loops Start location: __init 0: f1_0_main_Load -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 5: f145_0_main_LE -> f145_0_main_LE : arg1'=2*arg1-arg2, arg2'=2*arg1-arg2, arg1-arg2 >= 0, cost: arg1-arg2 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f145_0_main_LE -> f145_0_main_LE : arg1'=2*arg1-arg2, arg2'=2*arg1-arg2, arg1-arg2 >= 0, cost: arg1-arg2 New rule: f1_0_main_Load -> f145_0_main_LE : arg1'=2*arg1P0-arg2P0, arg2'=2*arg1P0-arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ arg1P0-arg2P0 >= 0 /\ 1+arg2 > 0), cost: 1+arg1P0-arg2P0 Applied deletion Removed the following rules: 5 Chained accelerated rules with incoming rules Start location: __init 0: f1_0_main_Load -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 6: f1_0_main_Load -> f145_0_main_LE : arg1'=2*arg1P0-arg2P0, arg2'=2*arg1P0-arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ arg1P0-arg2P0 >= 0 /\ 1+arg2 > 0), cost: 1+arg1P0-arg2P0 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init <empty> Computing asymptotic complexity Proved the following lower bound Complexity: Unknown Cpx degree: ? Solved cost: 0 Rule cost: 0 popout

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

job log

popout

actions

all output return to Integer Transition Systems