details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.475452 seconds
cpu usage	0.480018
user time	0.455836
system time	0.024182
max virtual memory	113188.0
max residence set size	19560.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_ConstantStackPush -> f108_0_add_GT : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (-arg3P0 == 0 /\ -arg2P0 == 0 /\ -arg1P0 == 0), cost: 1 1: f108_0_add_GT -> f108_0_add_GT : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (1+arg2-arg2P1 == 0 /\ -arg3+arg2 == 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0 /\ -1001+arg2 < 0 /\ 1+arg2-arg3P1 == 0 /\ arg1-arg1P1+arg2 == 0), cost: 1 2: f108_0_add_GT -> f208_0_add_GT : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (-arg1P2 == 0 /\ -arg3+arg2 == 0 /\ -arg3P2 == 0 /\ -arg2P2 == 0 /\ -1000+arg2 > 0), cost: 1 3: f208_0_add_GT -> f208_0_add_GT : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (2-arg3P3+arg2 == 0 /\ -arg3+arg2 == 0 /\ 2+arg2-arg2P3 == 0 /\ 1+arg1 > 0 /\ arg1-arg1P3+arg2 == 0 /\ 1+arg2 > 0 /\ -1001+arg2 < 0), cost: 1 4: f208_0_add_GT -> f311_0_add_GT : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (-arg2P4 == 0 /\ -arg1P4 == 0 /\ -arg3+arg2 == 0 /\ -arg3P4 == 0 /\ -1000+arg2 > 0), cost: 1 5: f311_0_add_GT -> f311_0_add_GT : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, (arg1-arg1P5+arg2 == 0 /\ -arg3+arg2 == 0 /\ 1+arg1 > 0 /\ 3+arg2-arg2P5 == 0 /\ 1+arg2 > 0 /\ -1001+arg2 < 0 /\ 3-arg3P5+arg2 == 0), cost: 1 6: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P6, arg3'=arg3P6, arg2'=arg2P6, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_ConstantStackPush -> f108_0_add_GT : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (-arg3P0 == 0 /\ -arg2P0 == 0 /\ -arg1P0 == 0), cost: 1 New rule: f1_0_main_ConstantStackPush -> f108_0_add_GT : arg1'=0, arg3'=0, arg2'=0, TRUE, cost: 1 Applied preprocessing Original rule: f108_0_add_GT -> f108_0_add_GT : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (1+arg2-arg2P1 == 0 /\ -arg3+arg2 == 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0 /\ -1001+arg2 < 0 /\ 1+arg2-arg3P1 == 0 /\ arg1-arg1P1+arg2 == 0), cost: 1 New rule: f108_0_add_GT -> f108_0_add_GT : arg1'=arg1+arg2, arg3'=1+arg2, arg2'=1+arg2, (1001-arg2 > 0 /\ -arg3+arg2 == 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f108_0_add_GT -> f208_0_add_GT : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (-arg1P2 == 0 /\ -arg3+arg2 == 0 /\ -arg3P2 == 0 /\ -arg2P2 == 0 /\ -1000+arg2 > 0), cost: 1 New rule: f108_0_add_GT -> f208_0_add_GT : arg1'=0, arg3'=0, arg2'=0, (-arg3+arg2 == 0 /\ -1000+arg2 > 0), cost: 1 Applied preprocessing Original rule: f208_0_add_GT -> f208_0_add_GT : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (2-arg3P3+arg2 == 0 /\ -arg3+arg2 == 0 /\ 2+arg2-arg2P3 == 0 /\ 1+arg1 > 0 /\ arg1-arg1P3+arg2 == 0 /\ 1+arg2 > 0 /\ -1001+arg2 < 0), cost: 1 New rule: f208_0_add_GT -> f208_0_add_GT : arg1'=arg1+arg2, arg3'=2+arg2, arg2'=2+arg2, (1001-arg2 > 0 /\ -arg3+arg2 == 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f208_0_add_GT -> f311_0_add_GT : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (-arg2P4 == 0 /\ -arg1P4 == 0 /\ -arg3+arg2 == 0 /\ -arg3P4 == 0 /\ -1000+arg2 > 0), cost: 1 New rule: f208_0_add_GT -> f311_0_add_GT : arg1'=0, arg3'=0, arg2'=0, (-arg3+arg2 == 0 /\ -1000+arg2 > 0), cost: 1 Applied preprocessing Original rule: f311_0_add_GT -> f311_0_add_GT : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, (arg1-arg1P5+arg2 == 0 /\ -arg3+arg2 == 0 /\ 1+arg1 > 0 /\ 3+arg2-arg2P5 == 0 /\ 1+arg2 > 0 /\ -1001+arg2 < 0 /\ 3-arg3P5+arg2 == 0), cost: 1 New rule: f311_0_add_GT -> f311_0_add_GT : arg1'=arg1+arg2, arg3'=3+arg2, arg2'=3+arg2, (1001-arg2 > 0 /\ -arg3+arg2 == 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0), cost: 1 Simplified rules Start location: __init 7: f1_0_main_ConstantStackPush -> f108_0_add_GT : arg1'=0, arg3'=0, arg2'=0, TRUE, cost: 1 8: f108_0_add_GT -> f108_0_add_GT : arg1'=arg1+arg2, arg3'=1+arg2, arg2'=1+arg2, (1001-arg2 > 0 /\ -arg3+arg2 == 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0), cost: 1 9: f108_0_add_GT -> f208_0_add_GT : arg1'=0, arg3'=0, arg2'=0, (-arg3+arg2 == 0 /\ -1000+arg2 > 0), cost: 1 10: f208_0_add_GT -> f208_0_add_GT : arg1'=arg1+arg2, arg3'=2+arg2, arg2'=2+arg2, (1001-arg2 > 0 /\ -arg3+arg2 == 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0), cost: 1 11: f208_0_add_GT -> f311_0_add_GT : arg1'=0, arg3'=0, arg2'=0, (-arg3+arg2 == 0 /\ -1000+arg2 > 0), cost: 1 12: f311_0_add_GT -> f311_0_add_GT : arg1'=arg1+arg2, arg3'=3+arg2, arg2'=3+arg2, (1001-arg2 > 0 /\ -arg3+arg2 == 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0), cost: 1 6: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P6, arg3'=arg3P6, arg2'=arg2P6, TRUE, cost: 1 Applied acceleration Original rule: f108_0_add_GT -> f108_0_add_GT : arg1'=arg1+arg2, arg3'=1+arg2, arg2'=1+arg2, (1001-arg2 > 0 /\ -arg3+arg2 == 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0), cost: 1 New rule: f108_0_add_GT -> f108_0_add_GT : arg1'=arg1+n0*arg2-1/2*n0+1/2*n0^2, arg3'=n0+arg2, arg2'=n0+arg2, (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ -1+n0 >= 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0 /\ 1002-n0-arg2 > 0), cost: n0 Applied instantiation Original rule: f108_0_add_GT -> f108_0_add_GT : arg1'=arg1+n0*arg2-1/2*n0+1/2*n0^2, arg3'=n0+arg2, arg2'=n0+arg2, (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ -1+n0 >= 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0 /\ 1002-n0-arg2 > 0), cost: n0 New rule: f108_0_add_GT -> f108_0_add_GT : arg1'=-1001/2-arg2*(-1001+arg2)+arg1+1/2*arg2+1/2*(-1001+arg2)^2, arg3'=1001, arg2'=1001, (1 > 0 /\ arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0 /\ 1000-arg2 >= 0), cost: 1001-arg2 Applied simplification Original rule: f108_0_add_GT -> f108_0_add_GT : arg1'=-1001/2-arg2*(-1001+arg2)+arg1+1/2*arg2+1/2*(-1001+arg2)^2, arg3'=1001, arg2'=1001, (1 > 0 /\ arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0 /\ 1000-arg2 >= 0), cost: 1001-arg2 New rule: f108_0_add_GT -> f108_0_add_GT : arg1'=-1001/2-arg2*(-1001+arg2)+arg1+1/2*arg2+1/2*(-1001+arg2)^2, arg3'=1001, arg2'=1001, (arg3-arg2 >= 0 /\ -arg3+arg2 >= 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0 /\ 1000-arg2 >= 0), cost: 1001-arg2 Applied deletion Removed the following rules: 8 Applied acceleration Original rule: f208_0_add_GT -> f208_0_add_GT : arg1'=arg1+arg2, arg3'=2+arg2, arg2'=2+arg2, (1001-arg2 > 0 /\ -arg3+arg2 == 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0), cost: 1 New rule: f208_0_add_GT -> f208_0_add_GT : arg1'=arg1+arg2*n3-n3+n3^2, arg3'=arg2+2*n3, arg2'=arg2+2*n3, (-1+n3 >= 0 /\ arg3-arg2 >= 0 /\ 1003-arg2-2*n3 > 0 /\ -arg3+arg2 >= 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0), cost: n3 Applied deletion Removed the following rules: 10 Applied acceleration Original rule: f311_0_add_GT -> f311_0_add_GT : arg1'=arg1+arg2, arg3'=3+arg2, arg2'=3+arg2, (1001-arg2 > 0 /\ -arg3+arg2 == 0 /\ 1+arg1 > 0 /\ 1+arg2 > 0), cost: 1 New rule: f311_0_add_GT -> f311_0_add_GT : arg1'=arg1+3/2*n6^2-3/2*n6+n6*arg2, arg3'=3*n6+arg2, arg2'=3*n6+arg2, (arg3-arg2 >= 0 /\ 1004-3*n6-arg2 > 0 /\ -arg3+arg2 >= 0 /\ 1+arg1 > 0 /\ -1+n6 >= 0 /\ 1+arg2 > 0), cost: n6 Applied deletion Removed the following rules: 12 Accelerated simple loops popout

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

job log

popout

actions

all output return to ITS