details

property	value
status	complete
benchmark	Velroyen08-moduloUp.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.868106 seconds
cpu usage	0.86257
user time	0.821538
system time	0.041032
max virtual memory	278168.0
max residence set size	28596.0

stage attributes

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

output

WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f1_0_main_Load -> f48_0_up_GE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 1: f48_0_up_GE -> f48_0_up_GE\' : arg1'=arg1P1, arg2'=arg2P1, (-15+arg1 < 0 /\ arg1-arg1P1 == 0), cost: 1 2: f48_0_up_GE\' -> f48_0_up_GE : arg1'=arg1P2, arg2'=arg2P2, (1+arg1-arg1P2-10*x40 == 0 /\ -15+arg1 < 0 /\ 1+arg1-10*x40 >= 0 /\ -9+arg1-10*x40 < 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f48_0_up_GE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f48_0_up_GE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f48_0_up_GE -> f48_0_up_GE\' : arg1'=arg1P1, arg2'=arg2P1, (-15+arg1 < 0 /\ arg1-arg1P1 == 0), cost: 1 New rule: f48_0_up_GE -> f48_0_up_GE\' : arg2'=arg2P1, 15-arg1 > 0, cost: 1 Applied preprocessing Original rule: f48_0_up_GE\' -> f48_0_up_GE : arg1'=arg1P2, arg2'=arg2P2, (1+arg1-arg1P2-10*x40 == 0 /\ -15+arg1 < 0 /\ 1+arg1-10*x40 >= 0 /\ -9+arg1-10*x40 < 0), cost: 1 New rule: f48_0_up_GE\' -> f48_0_up_GE : arg1'=1+arg1-10*x40, arg2'=arg2P2, (15-arg1 > 0 /\ 9-arg1+10*x40 > 0 /\ 1+arg1-10*x40 >= 0), cost: 1 Simplified rules Start location: __init 4: f1_0_main_Load -> f48_0_up_GE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 5: f48_0_up_GE -> f48_0_up_GE\' : arg2'=arg2P1, 15-arg1 > 0, cost: 1 6: f48_0_up_GE\' -> f48_0_up_GE : arg1'=1+arg1-10*x40, arg2'=arg2P2, (15-arg1 > 0 /\ 9-arg1+10*x40 > 0 /\ 1+arg1-10*x40 >= 0), cost: 1 3: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Eliminating location f1_0_main_Load by chaining: Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Second rule: f1_0_main_Load -> f48_0_up_GE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 New rule: __init -> f48_0_up_GE : arg1'=arg2P3, arg2'=arg2P0, (arg1P3 > 0 /\ 1+arg2P3 > 0), cost: 2 Applied deletion Removed the following rules: 3 4 Eliminating location f48_0_up_GE\' by chaining: Applied chaining First rule: f48_0_up_GE -> f48_0_up_GE\' : arg2'=arg2P1, 15-arg1 > 0, cost: 1 Second rule: f48_0_up_GE\' -> f48_0_up_GE : arg1'=1+arg1-10*x40, arg2'=arg2P2, (15-arg1 > 0 /\ 9-arg1+10*x40 > 0 /\ 1+arg1-10*x40 >= 0), cost: 1 New rule: f48_0_up_GE -> f48_0_up_GE : arg1'=1+arg1-10*x40, arg2'=arg2P2, (15-arg1 > 0 /\ 9-arg1+10*x40 > 0 /\ 1+arg1-10*x40 >= 0), cost: 2 Applied deletion Removed the following rules: 5 6 Eliminated locations on linear paths Start location: __init 8: f48_0_up_GE -> f48_0_up_GE : arg1'=1+arg1-10*x40, arg2'=arg2P2, (15-arg1 > 0 /\ 9-arg1+10*x40 > 0 /\ 1+arg1-10*x40 >= 0), cost: 2 7: __init -> f48_0_up_GE : arg1'=arg2P3, arg2'=arg2P0, (arg1P3 > 0 /\ 1+arg2P3 > 0), cost: 2 Applied acceleration Original rule: f48_0_up_GE -> f48_0_up_GE : arg1'=1+arg1-10*x40, arg2'=arg2P2, (15-arg1 > 0 /\ 9-arg1+10*x40 > 0 /\ 1+arg1-10*x40 >= 0), cost: 2 New rule: f48_0_up_GE -> f48_0_up_GE : arg1'=arg1+n0-10*n0*x40, arg2'=arg2P2, (arg1-10*(-1+n0)*x40+n0-10*x40 >= 0 /\ -1+n0 >= 0 /\ 1+arg1-10*x40 >= 0 /\ ((15-arg1 > 0 /\ 9-arg1+10*x40 > 0) \/ (15-arg1 > 0 /\ 16-arg1+10*(-1+n0)*x40-n0 > 0)) /\ ((10-arg1+10*(-1+n0)*x40-n0+10*x40 > 0 /\ 9-arg1+10*x40 > 0) \/ (15-arg1 > 0 /\ 10-arg1+10*(-1+n0)*x40-n0+10*x40 > 0))), cost: 2*n0 Applied simplification Original rule: f48_0_up_GE -> f48_0_up_GE : arg1'=arg1+n0-10*n0*x40, arg2'=arg2P2, (arg1-10*(-1+n0)*x40+n0-10*x40 >= 0 /\ -1+n0 >= 0 /\ 1+arg1-10*x40 >= 0 /\ ((15-arg1 > 0 /\ 9-arg1+10*x40 > 0) \/ (15-arg1 > 0 /\ 16-arg1+10*(-1+n0)*x40-n0 > 0)) /\ ((10-arg1+10*(-1+n0)*x40-n0+10*x40 > 0 /\ 9-arg1+10*x40 > 0) \/ (15-arg1 > 0 /\ 10-arg1+10*(-1+n0)*x40-n0+10*x40 > 0))), cost: 2*n0 New rule: f48_0_up_GE -> f48_0_up_GE : arg1'=arg1+n0-10*n0*x40, arg2'=arg2P2, (15-arg1 > 0 /\ 10-arg1+10*(-1+n0)*x40-n0+10*x40 > 0 /\ arg1-10*(-1+n0)*x40+n0-10*x40 >= 0 /\ -1+n0 >= 0 /\ 1+arg1-10*x40 >= 0), cost: 2*n0 Applied deletion Removed the following rules: 8 Accelerated simple loops Start location: __init 10: f48_0_up_GE -> f48_0_up_GE : arg1'=arg1+n0-10*n0*x40, arg2'=arg2P2, (15-arg1 > 0 /\ 10-arg1+10*(-1+n0)*x40-n0+10*x40 > 0 /\ arg1-10*(-1+n0)*x40+n0-10*x40 >= 0 /\ -1+n0 >= 0 /\ 1+arg1-10*x40 >= 0), cost: 2*n0 7: __init -> f48_0_up_GE : arg1'=arg2P3, arg2'=arg2P0, (arg1P3 > 0 /\ 1+arg2P3 > 0), cost: 2 Applied chaining First rule: __init -> f48_0_up_GE : arg1'=arg2P3, arg2'=arg2P0, (arg1P3 > 0 /\ 1+arg2P3 > 0), cost: 2 Second rule: f48_0_up_GE -> f48_0_up_GE : arg1'=arg1+n0-10*n0*x40, arg2'=arg2P2, (15-arg1 > 0 /\ 10-arg1+10*(-1+n0)*x40-n0+10*x40 > 0 /\ arg1-10*(-1+n0)*x40+n0-10*x40 >= 0 /\ -1+n0 >= 0 /\ 1+arg1-10*x40 >= 0), cost: 2*n0 New rule: __init -> f48_0_up_GE : arg1'=n0+arg2P3-10*n0*x40, arg2'=arg2P2, (-10*(-1+n0)*x40+n0+arg2P3-10*x40 >= 0 /\ 10+10*(-1+n0)*x40-n0-arg2P3+10*x40 > 0 /\ 15-arg2P3 > 0 /\ -1+n0 >= 0 /\ 1+arg2P3 > 0), cost: 2+2*n0 Applied deletion Removed the following rules: 10 popout

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

job log

popout

actions

all output return to ITS