details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.0342931 seconds
cpu usage	0.034824
user time	0.027327
system time	0.007497
max virtual memory	113188.0
max residence set size	7672.0

stage attributes

key	value
starexec-result	NO

output

NO Initial ITS Start location: __init 0: f1_0_main_ConstantStackPush -> f37_0_loop_InvokeMethod : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 1: f37_0_loop_InvokeMethod -> f37_0_loop_InvokeMethod : arg1'=arg1P1, arg2'=arg2P1, TRUE, cost: 1 2: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied nonterm Original rule: f37_0_loop_InvokeMethod -> f37_0_loop_InvokeMethod : arg1'=arg1P1, arg2'=arg2P1, TRUE, cost: 1 New rule: f37_0_loop_InvokeMethod -> [3] : TRUE, cost: NONTERM Applied acceleration Original rule: f37_0_loop_InvokeMethod -> f37_0_loop_InvokeMethod : arg1'=arg1P1, arg2'=arg2P1, TRUE, cost: 1 New rule: f37_0_loop_InvokeMethod -> f37_0_loop_InvokeMethod : arg1'=arg1P1, arg2'=arg2P1, TRUE, cost: n0 Applied deletion Removed the following rules: 1 Accelerated simple loops Start location: __init 0: f1_0_main_ConstantStackPush -> f37_0_loop_InvokeMethod : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 3: f37_0_loop_InvokeMethod -> [3] : TRUE, cost: NONTERM 4: f37_0_loop_InvokeMethod -> f37_0_loop_InvokeMethod : arg1'=arg1P1, arg2'=arg2P1, TRUE, cost: n0 2: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied chaining First rule: f1_0_main_ConstantStackPush -> f37_0_loop_InvokeMethod : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f37_0_loop_InvokeMethod -> [3] : TRUE, cost: NONTERM New rule: f1_0_main_ConstantStackPush -> [3] : (arg1 > 0 /\ 1+arg2 > 0), cost: NONTERM Applied chaining First rule: f1_0_main_ConstantStackPush -> f37_0_loop_InvokeMethod : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f37_0_loop_InvokeMethod -> f37_0_loop_InvokeMethod : arg1'=arg1P1, arg2'=arg2P1, TRUE, cost: n0 New rule: f1_0_main_ConstantStackPush -> f37_0_loop_InvokeMethod : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ 1+arg2 > 0), cost: 1+n0 Applied deletion Removed the following rules: 3 4 Chained accelerated rules with incoming rules Start location: __init 0: f1_0_main_ConstantStackPush -> f37_0_loop_InvokeMethod : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 5: f1_0_main_ConstantStackPush -> [3] : (arg1 > 0 /\ 1+arg2 > 0), cost: NONTERM 6: f1_0_main_ConstantStackPush -> f37_0_loop_InvokeMethod : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ 1+arg2 > 0), cost: 1+n0 2: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init 5: f1_0_main_ConstantStackPush -> [3] : (arg1 > 0 /\ 1+arg2 > 0), cost: NONTERM 2: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Eliminating location f1_0_main_ConstantStackPush by chaining: Applied chaining First rule: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Second rule: f1_0_main_ConstantStackPush -> [3] : (arg1 > 0 /\ 1+arg2 > 0), cost: NONTERM New rule: __init -> [3] : (1+arg2P2 > 0 /\ arg1P2 > 0), cost: NONTERM Applied deletion Removed the following rules: 2 5 Eliminated locations on linear paths Start location: __init 7: __init -> [3] : (1+arg2P2 > 0 /\ arg1P2 > 0), cost: NONTERM Computing asymptotic complexity Proved nontermination of rule 7 via SMT. Proved the following lower bound Complexity: Nonterm Cpx degree: Nonterm Solved cost: NONTERM Rule cost: NONTERM Rule guard: (1+arg2P2 > 0 /\ arg1P2 > 0) popout

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

job log

popout

actions

all output return to ITS