details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.706051 seconds
cpu usage	0.708129
user time	0.679721
system time	0.028408
max virtual memory	292752.0
max residence set size	20028.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 -> f458_0_sort_GE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, 1-arg1P0 == 0, cost: 1 1: f458_0_sort_GE -> f543_0_sort_GE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1 > 0 /\ 100-arg1-arg3P1 == 0 /\ -100+arg1 < 0 /\ arg1-arg1P1 == 0 /\ -arg2P1 == 0), cost: 1 2: f543_0_sort_GE -> f458_0_sort_GE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (arg3-arg2 <= 0 /\ 1+arg1-arg1P2 == 0), cost: 1 3: f543_0_sort_GE -> f543_0_sort_GE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (arg1 > 0 /\ 100-arg1-arg3P3 == 0 /\ -99+arg2 < 0 /\ arg3-arg2 > 0 /\ -100+arg2 < 0 /\ arg1-arg1P3 == 0 /\ x80-x70 <= 0 /\ 1+arg2 > 0 /\ 1-arg2P3+arg2 == 0), cost: 1 4: f543_0_sort_GE -> f543_0_sort_GE : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (arg1 > 0 /\ 100-arg1-arg3P4 == 0 /\ arg1-arg1P4 == 0 /\ -99+arg2 < 0 /\ arg3-arg2 > 0 /\ -100+arg2 < 0 /\ x130-x120 > 0 /\ 1+arg2 > 0 /\ 1-arg2P4+arg2 == 0), cost: 1 5: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_ConstantStackPush -> f458_0_sort_GE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, 1-arg1P0 == 0, cost: 1 New rule: f1_0_main_ConstantStackPush -> f458_0_sort_GE : arg1'=1, arg3'=arg3P0, arg2'=arg2P0, TRUE, cost: 1 Applied preprocessing Original rule: f458_0_sort_GE -> f543_0_sort_GE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1 > 0 /\ 100-arg1-arg3P1 == 0 /\ -100+arg1 < 0 /\ arg1-arg1P1 == 0 /\ -arg2P1 == 0), cost: 1 New rule: f458_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=0, (arg1 > 0 /\ 100-arg1 > 0), cost: 1 Applied preprocessing Original rule: f543_0_sort_GE -> f458_0_sort_GE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (arg3-arg2 <= 0 /\ 1+arg1-arg1P2 == 0), cost: 1 New rule: f543_0_sort_GE -> f458_0_sort_GE : arg1'=1+arg1, arg3'=arg3P2, arg2'=arg2P2, arg3-arg2 <= 0, cost: 1 Applied preprocessing Original rule: f543_0_sort_GE -> f543_0_sort_GE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (arg1 > 0 /\ 100-arg1-arg3P3 == 0 /\ -99+arg2 < 0 /\ arg3-arg2 > 0 /\ -100+arg2 < 0 /\ arg1-arg1P3 == 0 /\ x80-x70 <= 0 /\ 1+arg2 > 0 /\ 1-arg2P3+arg2 == 0), cost: 1 New rule: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=1+arg2, (arg1 > 0 /\ arg3-arg2 > 0 /\ 99-arg2 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f543_0_sort_GE -> f543_0_sort_GE : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (arg1 > 0 /\ 100-arg1-arg3P4 == 0 /\ arg1-arg1P4 == 0 /\ -99+arg2 < 0 /\ arg3-arg2 > 0 /\ -100+arg2 < 0 /\ x130-x120 > 0 /\ 1+arg2 > 0 /\ 1-arg2P4+arg2 == 0), cost: 1 New rule: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=1+arg2, (arg1 > 0 /\ arg3-arg2 > 0 /\ 99-arg2 > 0 /\ 1+arg2 > 0), cost: 1 Applied deletion Removed the following rules: 9 Simplified rules Start location: __init 6: f1_0_main_ConstantStackPush -> f458_0_sort_GE : arg1'=1, arg3'=arg3P0, arg2'=arg2P0, TRUE, cost: 1 7: f458_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=0, (arg1 > 0 /\ 100-arg1 > 0), cost: 1 8: f543_0_sort_GE -> f458_0_sort_GE : arg1'=1+arg1, arg3'=arg3P2, arg2'=arg2P2, arg3-arg2 <= 0, cost: 1 10: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=1+arg2, (arg1 > 0 /\ arg3-arg2 > 0 /\ 99-arg2 > 0 /\ 1+arg2 > 0), cost: 1 5: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, TRUE, cost: 1 Applied acceleration Original rule: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=1+arg2, (arg1 > 0 /\ arg3-arg2 > 0 /\ 99-arg2 > 0 /\ 1+arg2 > 0), cost: 1 New rule: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=n0+arg2, (arg1 > 0 /\ 101-arg1-n0-arg2 > 0 /\ arg3-arg2 > 0 /\ 100-n0-arg2 > 0 /\ 1+arg2 > 0 /\ -1+n0 >= 0), cost: n0 Applied instantiation Original rule: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=n0+arg2, (arg1 > 0 /\ 101-arg1-n0-arg2 > 0 /\ arg3-arg2 > 0 /\ 100-n0-arg2 > 0 /\ 1+arg2 > 0 /\ -1+n0 >= 0), cost: n0 New rule: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=100-arg1, (arg1 > 0 /\ 1 > 0 /\ arg3-arg2 > 0 /\ 99-arg1-arg2 >= 0 /\ 1+arg2 > 0), cost: 100-arg1-arg2 Applied instantiation Original rule: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=n0+arg2, (arg1 > 0 /\ 101-arg1-n0-arg2 > 0 /\ arg3-arg2 > 0 /\ 100-n0-arg2 > 0 /\ 1+arg2 > 0 /\ -1+n0 >= 0), cost: n0 New rule: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=99, (arg1 > 0 /\ 98-arg2 >= 0 /\ 1 > 0 /\ arg3-arg2 > 0 /\ 2-arg1 > 0 /\ 1+arg2 > 0), cost: 99-arg2 Applied simplification Original rule: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=100-arg1, (arg1 > 0 /\ 1 > 0 /\ arg3-arg2 > 0 /\ 99-arg1-arg2 >= 0 /\ 1+arg2 > 0), cost: 100-arg1-arg2 New rule: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=100-arg1, (arg1 > 0 /\ arg3-arg2 > 0 /\ 99-arg1-arg2 >= 0 /\ 1+arg2 > 0), cost: 100-arg1-arg2 Applied simplification Original rule: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=99, (arg1 > 0 /\ 98-arg2 >= 0 /\ 1 > 0 /\ arg3-arg2 > 0 /\ 2-arg1 > 0 /\ 1+arg2 > 0), cost: 99-arg2 New rule: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=99, (arg1 > 0 /\ arg3-arg2 > 0 /\ 2-arg1 > 0 /\ -98+arg2 <= 0 /\ 1+arg2 > 0), cost: 99-arg2 Applied deletion Removed the following rules: 10 Accelerated simple loops Start location: __init 6: f1_0_main_ConstantStackPush -> f458_0_sort_GE : arg1'=1, arg3'=arg3P0, arg2'=arg2P0, TRUE, cost: 1 7: f458_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=0, (arg1 > 0 /\ 100-arg1 > 0), cost: 1 8: f543_0_sort_GE -> f458_0_sort_GE : arg1'=1+arg1, arg3'=arg3P2, arg2'=arg2P2, arg3-arg2 <= 0, cost: 1 13: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=100-arg1, (arg1 > 0 /\ arg3-arg2 > 0 /\ 99-arg1-arg2 >= 0 /\ 1+arg2 > 0), cost: 100-arg1-arg2 14: f543_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=99, (arg1 > 0 /\ arg3-arg2 > 0 /\ 2-arg1 > 0 /\ -98+arg2 <= 0 /\ 1+arg2 > 0), cost: 99-arg2 5: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, TRUE, cost: 1 Applied chaining First rule: f458_0_sort_GE -> f543_0_sort_GE : arg3'=100-arg1, arg2'=0, (arg1 > 0 /\ 100-arg1 > 0), cost: 1 popout

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

job log

popout

actions

all output return to ITS