Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099920
details
property
value
status
complete
benchmark
Velroyen08-complInterv.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n143.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.138424 seconds
cpu usage
0.139523
user time
0.123164
system time
0.016359
max virtual memory
113188.0
max residence set size
29884.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: __init 0: f1_0_main_Load -> f51_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ arg2^2-arg2P0 == 0 /\ 1+arg2 > 0), cost: 1 1: f51_0_loop_LE -> f51_0_loop_LE : arg1'=arg1P1, arg2'=arg2P1, (1+arg1 > 0 /\ 1+2*arg1-arg2P1+arg1^2 == 0 /\ -9+arg2 > 0 /\ 1+arg1-arg1P1 == 0), cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f51_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ arg2^2-arg2P0 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f51_0_loop_LE : arg1'=arg2, arg2'=arg2^2, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f51_0_loop_LE -> f51_0_loop_LE : arg1'=arg1P1, arg2'=arg2P1, (1+arg1 > 0 /\ 1+2*arg1-arg2P1+arg1^2 == 0 /\ -9+arg2 > 0 /\ 1+arg1-arg1P1 == 0), cost: 1 New rule: f51_0_loop_LE -> f51_0_loop_LE : arg1'=1+arg1, arg2'=1+2*arg1+arg1^2, (1+arg1 > 0 /\ -9+arg2 > 0), cost: 1 Simplified rules Start location: __init 3: f1_0_main_Load -> f51_0_loop_LE : arg1'=arg2, arg2'=arg2^2, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 4: f51_0_loop_LE -> f51_0_loop_LE : arg1'=1+arg1, arg2'=1+2*arg1+arg1^2, (1+arg1 > 0 /\ -9+arg2 > 0), cost: 1 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied unrolling Original rule: f51_0_loop_LE -> f51_0_loop_LE : arg1'=1+arg1, arg2'=1+2*arg1+arg1^2, (1+arg1 > 0 /\ -9+arg2 > 0), cost: 1 New rule: f51_0_loop_LE -> f51_0_loop_LE : arg1'=2+arg1, arg2'=3+2*arg1+(1+arg1)^2, (-8+2*arg1+arg1^2 > 0 /\ 1+arg1 > 0 /\ -9+arg2 > 0 /\ 2+arg1 > 0), cost: 2 Applied non-termination processor Original rule: f51_0_loop_LE -> f51_0_loop_LE : arg1'=2+arg1, arg2'=3+2*arg1+(1+arg1)^2, (-8+2*arg1+arg1^2 > 0 /\ 1+arg1 > 0 /\ -9+arg2 > 0 /\ 2+arg1 > 0), cost: 2 New rule: f51_0_loop_LE -> [3] : (-8+2*arg1+arg1^2 > 0 /\ 1+arg1 > 0 /\ -9+arg2 > 0 /\ 2+arg1 > 0), cost: NONTERM Applied simplification Original rule: f51_0_loop_LE -> [3] : (-8+2*arg1+arg1^2 > 0 /\ 1+arg1 > 0 /\ -9+arg2 > 0 /\ 2+arg1 > 0), cost: NONTERM New rule: f51_0_loop_LE -> [3] : (-8+2*arg1+arg1^2 > 0 /\ -9+arg2 > 0 /\ 2+arg1 > 0), cost: NONTERM Accelerated simple loops Start location: __init 3: f1_0_main_Load -> f51_0_loop_LE : arg1'=arg2, arg2'=arg2^2, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 4: f51_0_loop_LE -> f51_0_loop_LE : arg1'=1+arg1, arg2'=1+2*arg1+arg1^2, (1+arg1 > 0 /\ -9+arg2 > 0), cost: 1 6: f51_0_loop_LE -> [3] : (-8+2*arg1+arg1^2 > 0 /\ -9+arg2 > 0 /\ 2+arg1 > 0), cost: NONTERM 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f51_0_loop_LE : arg1'=arg2, arg2'=arg2^2, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f51_0_loop_LE -> f51_0_loop_LE : arg1'=1+arg1, arg2'=1+2*arg1+arg1^2, (1+arg1 > 0 /\ -9+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f51_0_loop_LE : arg1'=1+arg2, arg2'=1+2*arg2+arg2^2, (arg1 > 0 /\ 1+arg2 > 0 /\ -9+arg2^2 > 0), cost: 2 Applied chaining First rule: f1_0_main_Load -> f51_0_loop_LE : arg1'=arg2, arg2'=arg2^2, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f51_0_loop_LE -> [3] : (-8+2*arg1+arg1^2 > 0 /\ -9+arg2 > 0 /\ 2+arg1 > 0), cost: NONTERM New rule: f1_0_main_Load -> [3] : (arg1 > 0 /\ 2+arg2 > 0 /\ -9+arg2^2 > 0), cost: NONTERM Applied deletion Removed the following rules: 4 6 Chained accelerated rules with incoming rules Start location: __init 3: f1_0_main_Load -> f51_0_loop_LE : arg1'=arg2, arg2'=arg2^2, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 7: f1_0_main_Load -> f51_0_loop_LE : arg1'=1+arg2, arg2'=1+2*arg2+arg2^2, (arg1 > 0 /\ 1+arg2 > 0 /\ -9+arg2^2 > 0), cost: 2 8: f1_0_main_Load -> [3] : (arg1 > 0 /\ 2+arg2 > 0 /\ -9+arg2^2 > 0), cost: NONTERM 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Removed unreachable locations and irrelevant leafs Start location: __init 8: f1_0_main_Load -> [3] : (arg1 > 0 /\ 2+arg2 > 0 /\ -9+arg2^2 > 0), cost: NONTERM 2: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Eliminating location f1_0_main_Load by chaining: Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1 Second rule: f1_0_main_Load -> [3] : (arg1 > 0 /\ 2+arg2 > 0 /\ -9+arg2^2 > 0), cost: NONTERM New rule: __init -> [3] : (arg1P2 > 0 /\ -9+arg2P2^2 > 0 /\ 2+arg2P2 > 0), cost: NONTERM Applied deletion Removed the following rules: 2 8
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS