details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	1.10695195198 seconds
cpu usage	1.104465297
max memory	1.3991936E7

stage attributes

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

output

/export/starexec/sandbox2/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f1_0_main_ConstantStackPush -> f137_0_test_GE : arg1'=arg1P0, arg2'=arg2P0, (10-arg2P0 == 0 /\ -arg1P0 == 0), cost: 1 1: f137_0_test_GE -> f137_0_test_GE : arg1'=arg1P1, arg2'=arg2P1, (arg1-arg2P1 == 0 /\ -arg1P1 == 0 /\ arg2 > 0 /\ arg1-arg2 < 0), cost: 1 2: f137_0_test_GE -> f137_0_test_GE : arg1'=arg1P2, arg2'=arg2P2, (-arg2P2+arg2 == 0 /\ 1+arg1-arg1P2 == 0 /\ arg2 > 0 /\ arg1-arg2 < 0), cost: 1 3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_ConstantStackPush -> f137_0_test_GE : arg1'=arg1P0, arg2'=arg2P0, (10-arg2P0 == 0 /\ -arg1P0 == 0), cost: 1 New rule: f1_0_main_ConstantStackPush -> f137_0_test_GE : arg1'=0, arg2'=10, TRUE, cost: 1 Applied preprocessing Original rule: f137_0_test_GE -> f137_0_test_GE : arg1'=arg1P1, arg2'=arg2P1, (arg1-arg2P1 == 0 /\ -arg1P1 == 0 /\ arg2 > 0 /\ arg1-arg2 < 0), cost: 1 New rule: f137_0_test_GE -> f137_0_test_GE : arg1'=0, arg2'=arg1, (-arg1+arg2 > 0 /\ arg2 > 0), cost: 1 Applied preprocessing Original rule: f137_0_test_GE -> f137_0_test_GE : arg1'=arg1P2, arg2'=arg2P2, (-arg2P2+arg2 == 0 /\ 1+arg1-arg1P2 == 0 /\ arg2 > 0 /\ arg1-arg2 < 0), cost: 1 New rule: f137_0_test_GE -> f137_0_test_GE : arg1'=1+arg1, (-arg1+arg2 > 0 /\ arg2 > 0), cost: 1 Simplified rules Start location: __init 4: f1_0_main_ConstantStackPush -> f137_0_test_GE : arg1'=0, arg2'=10, TRUE, cost: 1 5: f137_0_test_GE -> f137_0_test_GE : arg1'=0, arg2'=arg1, (-arg1+arg2 > 0 /\ arg2 > 0), cost: 1 6: f137_0_test_GE -> f137_0_test_GE : arg1'=1+arg1, (-arg1+arg2 > 0 /\ arg2 > 0), cost: 1 3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied acceleration Original rule: f137_0_test_GE -> f137_0_test_GE : arg1'=1+arg1, (-arg1+arg2 > 0 /\ arg2 > 0), cost: 1 New rule: f137_0_test_GE -> f137_0_test_GE : arg1'=arg1+n2, (n2 >= 0 /\ arg2 > 0 /\ 1-arg1-n2+arg2 > 0), cost: n2 Applied instantiation Original rule: f137_0_test_GE -> f137_0_test_GE : arg1'=arg1+n2, (n2 >= 0 /\ arg2 > 0 /\ 1-arg1-n2+arg2 > 0), cost: n2 New rule: f137_0_test_GE -> f137_0_test_GE : arg1'=arg2, (1 > 0 /\ -arg1+arg2 >= 0 /\ arg2 > 0), cost: -arg1+arg2 Applied simplification Original rule: f137_0_test_GE -> f137_0_test_GE : arg1'=arg2, (1 > 0 /\ -arg1+arg2 >= 0 /\ arg2 > 0), cost: -arg1+arg2 New rule: f137_0_test_GE -> f137_0_test_GE : arg1'=arg2, (-arg1+arg2 >= 0 /\ arg2 > 0), cost: -arg1+arg2 Applied deletion Removed the following rules: 6 Accelerated simple loops Start location: __init 4: f1_0_main_ConstantStackPush -> f137_0_test_GE : arg1'=0, arg2'=10, TRUE, cost: 1 5: f137_0_test_GE -> f137_0_test_GE : arg1'=0, arg2'=arg1, (-arg1+arg2 > 0 /\ arg2 > 0), cost: 1 8: f137_0_test_GE -> f137_0_test_GE : arg1'=arg2, (-arg1+arg2 >= 0 /\ arg2 > 0), cost: -arg1+arg2 3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Applied chaining First rule: f1_0_main_ConstantStackPush -> f137_0_test_GE : arg1'=0, arg2'=10, TRUE, cost: 1 Second rule: f137_0_test_GE -> f137_0_test_GE : arg1'=0, arg2'=arg1, (-arg1+arg2 > 0 /\ arg2 > 0), cost: 1 New rule: f1_0_main_ConstantStackPush -> f137_0_test_GE : arg1'=0, arg2'=0, 10 > 0, cost: 2 Applied chaining First rule: f1_0_main_ConstantStackPush -> f137_0_test_GE : arg1'=0, arg2'=10, TRUE, cost: 1 Second rule: f137_0_test_GE -> f137_0_test_GE : arg1'=arg2, (-arg1+arg2 >= 0 /\ arg2 > 0), cost: -arg1+arg2 New rule: f1_0_main_ConstantStackPush -> f137_0_test_GE : arg1'=10, arg2'=10, (10 > 0 /\ 10 >= 0), cost: 11 Applied deletion Removed the following rules: 5 8 Chained accelerated rules with incoming rules Start location: __init 4: f1_0_main_ConstantStackPush -> f137_0_test_GE : arg1'=0, arg2'=10, TRUE, cost: 1 9: f1_0_main_ConstantStackPush -> f137_0_test_GE : arg1'=0, arg2'=0, 10 > 0, cost: 2 10: f1_0_main_ConstantStackPush -> f137_0_test_GE : arg1'=10, arg2'=10, (10 > 0 /\ 10 >= 0), cost: 11 3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P3, arg2'=arg2P3, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init popout

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

job log

popout

actions

all output return to Integer Transition Systems