details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.138025999069 seconds
cpu usage	0.135590883
max memory	1.26976E7

stage attributes

key	value
output-size	7381
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: f1_0_main_Load -> f62_0_loop_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 28 > 0 /\ 28-arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 1: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=arg1P1, arg2'=arg2P1, (-arg1P1 == 0 /\ -35+arg1 > 0), cost: 1 2: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -31+arg1 < 0 /\ -36+arg1 < 0 /\ -1+arg1-arg1P2 == 0), cost: 1 3: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=arg1P3, arg2'=arg2P3, (-36+arg1 < 0 /\ 35-arg1P3 == 0 /\ -30+arg1 > 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f62_0_loop_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 28 > 0 /\ 28-arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f62_0_loop_EQ : arg1'=28+arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=arg1P1, arg2'=arg2P1, (-arg1P1 == 0 /\ -35+arg1 > 0), cost: 1 New rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=0, arg2'=arg2P1, -35+arg1 > 0, cost: 1 Applied preprocessing Original rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ -31+arg1 < 0 /\ -36+arg1 < 0 /\ -1+arg1-arg1P2 == 0), cost: 1 New rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ 31-arg1 > 0), cost: 1 Applied preprocessing Original rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=arg1P3, arg2'=arg2P3, (-36+arg1 < 0 /\ 35-arg1P3 == 0 /\ -30+arg1 > 0), cost: 1 New rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=35, arg2'=arg2P3, (36-arg1 > 0 /\ -30+arg1 > 0), cost: 1 Simplified rules Start location: __init 5: f1_0_main_Load -> f62_0_loop_EQ : arg1'=28+arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 6: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=0, arg2'=arg2P1, -35+arg1 > 0, cost: 1 7: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ 31-arg1 > 0), cost: 1 8: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=35, arg2'=arg2P3, (36-arg1 > 0 /\ -30+arg1 > 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied acceleration Original rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=-1+arg1, arg2'=arg2P2, (arg1 > 0 /\ 31-arg1 > 0), cost: 1 New rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=arg1-n3, arg2'=arg2P2, (1+arg1-n3 > 0 /\ -1+n3 >= 0 /\ 31-arg1 > 0), cost: n3 Applied instantiation Original rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=arg1-n3, arg2'=arg2P2, (1+arg1-n3 > 0 /\ -1+n3 >= 0 /\ 31-arg1 > 0), cost: n3 New rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=0, arg2'=arg2P2, (1 > 0 /\ -1+arg1 >= 0 /\ 31-arg1 > 0), cost: arg1 Applied nonterm Original rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=35, arg2'=arg2P3, (36-arg1 > 0 /\ -30+arg1 > 0), cost: 1 New rule: f62_0_loop_EQ -> [3] : (36-arg1 > 0 /\ -30+arg1 > 0), cost: NONTERM Applied acceleration Original rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=35, arg2'=arg2P3, (36-arg1 > 0 /\ -30+arg1 > 0), cost: 1 New rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=35, arg2'=arg2P3, (36-arg1 > 0 /\ -30+arg1 > 0), cost: n5 Applied simplification Original rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=0, arg2'=arg2P2, (1 > 0 /\ -1+arg1 >= 0 /\ 31-arg1 > 0), cost: arg1 New rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=0, arg2'=arg2P2, (-1+arg1 >= 0 /\ 31-arg1 > 0), cost: arg1 Applied deletion Removed the following rules: 7 8 Accelerated simple loops Start location: __init 5: f1_0_main_Load -> f62_0_loop_EQ : arg1'=28+arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 6: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=0, arg2'=arg2P1, -35+arg1 > 0, cost: 1 10: f62_0_loop_EQ -> [3] : (36-arg1 > 0 /\ -30+arg1 > 0), cost: NONTERM 11: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=35, arg2'=arg2P3, (36-arg1 > 0 /\ -30+arg1 > 0), cost: n5 12: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=0, arg2'=arg2P2, (-1+arg1 >= 0 /\ 31-arg1 > 0), cost: arg1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f62_0_loop_EQ : arg1'=28+arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f62_0_loop_EQ -> f62_0_loop_EQ : arg1'=0, arg2'=arg2P1, -35+arg1 > 0, cost: 1 New rule: f1_0_main_Load -> f62_0_loop_EQ : arg1'=0, arg2'=arg2P1, (arg1 > 0 /\ -7+arg2 > 0), cost: 2 popout

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

job log

popout

actions

all output return to Integer Transition Systems