details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.0999870300293 seconds
cpu usage	0.09517476
max memory	1.2570624E7

stage attributes

key	value
output-size	8307
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Initial ITS Start location: __init 0: f238_0_createIntList_Return -> f376_0_main_FieldAccess : arg1'=arg1P0, arg2'=arg2P0, (-arg1+arg1P0 <= 0 /\ 1+arg1P0 > 0 /\ 1+arg1 > 0), cost: 1 2: f376_0_main_FieldAccess -> f376_0_main_FieldAccess : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -arg1+arg1P2 <= 0 /\ arg1P2 > 0 /\ x70 > 0), cost: 1 1: f1_0_main_Load -> f376_0_main_FieldAccess : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ 1+arg1P1 > 0), cost: 1 3: f1_0_main_Load -> f491_0_createIntList_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ 1+arg1P3 > 0 /\ 1-arg2P3 == 0 /\ 1+arg2 > 0), cost: 1 4: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=arg1P4, arg2'=arg2P4, (arg1 > 0 /\ 1-arg2P4+arg2 == 0 /\ arg2 > 0 /\ -1+arg1-arg1P4 == 0), cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Removed unreachable rules and leafs Start location: __init 2: f376_0_main_FieldAccess -> f376_0_main_FieldAccess : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -arg1+arg1P2 <= 0 /\ arg1P2 > 0 /\ x70 > 0), cost: 1 1: f1_0_main_Load -> f376_0_main_FieldAccess : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ 1+arg1P1 > 0), cost: 1 3: f1_0_main_Load -> f491_0_createIntList_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ 1+arg1P3 > 0 /\ 1-arg2P3 == 0 /\ 1+arg2 > 0), cost: 1 4: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=arg1P4, arg2'=arg2P4, (arg1 > 0 /\ 1-arg2P4+arg2 == 0 /\ arg2 > 0 /\ -1+arg1-arg1P4 == 0), cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Applied preprocessing Original rule: f376_0_main_FieldAccess -> f376_0_main_FieldAccess : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -arg1+arg1P2 <= 0 /\ arg1P2 > 0 /\ x70 > 0), cost: 1 New rule: f376_0_main_FieldAccess -> f376_0_main_FieldAccess : arg1'=arg1P2, arg2'=arg2P2, (-arg1+arg1P2 <= 0 /\ arg1P2 > 0), cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f491_0_createIntList_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ 1+arg1P3 > 0 /\ 1-arg2P3 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f491_0_createIntList_LE : arg1'=arg1P3, arg2'=1, (arg1 > 0 /\ 1+arg1P3 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=arg1P4, arg2'=arg2P4, (arg1 > 0 /\ 1-arg2P4+arg2 == 0 /\ arg2 > 0 /\ -1+arg1-arg1P4 == 0), cost: 1 New rule: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=-1+arg1, arg2'=1+arg2, (arg1 > 0 /\ arg2 > 0), cost: 1 Simplified rules Start location: __init 6: f376_0_main_FieldAccess -> f376_0_main_FieldAccess : arg1'=arg1P2, arg2'=arg2P2, (-arg1+arg1P2 <= 0 /\ arg1P2 > 0), cost: 1 1: f1_0_main_Load -> f376_0_main_FieldAccess : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ 1+arg1P1 > 0), cost: 1 7: f1_0_main_Load -> f491_0_createIntList_LE : arg1'=arg1P3, arg2'=1, (arg1 > 0 /\ 1+arg1P3 > 0 /\ 1+arg2 > 0), cost: 1 8: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=-1+arg1, arg2'=1+arg2, (arg1 > 0 /\ arg2 > 0), cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Applied nonterm Original rule: f376_0_main_FieldAccess -> f376_0_main_FieldAccess : arg1'=arg1P2, arg2'=arg2P2, (-arg1+arg1P2 <= 0 /\ arg1P2 > 0), cost: 1 New rule: f376_0_main_FieldAccess -> [5] : (arg1-arg1P2 >= 0 /\ arg1P2 > 0), cost: NONTERM Applied acceleration Original rule: f376_0_main_FieldAccess -> f376_0_main_FieldAccess : arg1'=arg1P2, arg2'=arg2P2, (-arg1+arg1P2 <= 0 /\ arg1P2 > 0), cost: 1 New rule: f376_0_main_FieldAccess -> f376_0_main_FieldAccess : arg1'=arg1P2, arg2'=arg2P2, (arg1-arg1P2 >= 0 /\ arg1P2 > 0), cost: n0 Applied deletion Removed the following rules: 6 Applied acceleration Original rule: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=-1+arg1, arg2'=1+arg2, (arg1 > 0 /\ arg2 > 0), cost: 1 New rule: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=arg1-n3, arg2'=arg2+n3, (1+arg1-n3 > 0 /\ arg2 > 0 /\ n3 >= 0), cost: n3 Applied instantiation Original rule: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=arg1-n3, arg2'=arg2+n3, (1+arg1-n3 > 0 /\ arg2 > 0 /\ n3 >= 0), cost: n3 New rule: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=0, arg2'=arg1+arg2, (arg1 >= 0 /\ 1 > 0 /\ arg2 > 0), cost: arg1 Applied simplification Original rule: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=0, arg2'=arg1+arg2, (arg1 >= 0 /\ 1 > 0 /\ arg2 > 0), cost: arg1 New rule: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=0, arg2'=arg1+arg2, (arg1 >= 0 /\ arg2 > 0), cost: arg1 Applied deletion Removed the following rules: 8 Accelerated simple loops Start location: __init 9: f376_0_main_FieldAccess -> [5] : (arg1-arg1P2 >= 0 /\ arg1P2 > 0), cost: NONTERM 10: f376_0_main_FieldAccess -> f376_0_main_FieldAccess : arg1'=arg1P2, arg2'=arg2P2, (arg1-arg1P2 >= 0 /\ arg1P2 > 0), cost: n0 1: f1_0_main_Load -> f376_0_main_FieldAccess : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ 1+arg1P1 > 0), cost: 1 7: f1_0_main_Load -> f491_0_createIntList_LE : arg1'=arg1P3, arg2'=1, (arg1 > 0 /\ 1+arg1P3 > 0 /\ 1+arg2 > 0), cost: 1 12: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=0, arg2'=arg1+arg2, (arg1 >= 0 /\ arg2 > 0), cost: arg1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 popout

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

job log

popout

actions

all output return to Integer Transition Systems