Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099482
details
property
value
status
complete
benchmark
CountUpRound.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n148.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
1.59555 seconds
cpu usage
1.60343
user time
1.56302
system time
0.040409
max virtual memory
292752.0
max residence set size
31548.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f1_0_main_Load -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 1: f145_0_main_LE -> f145_0_main_LE\' : arg1'=arg1P1, arg2'=arg2P1, (1+arg2-2*x100 == 0 /\ -arg1+arg2 < 0 /\ 1+arg2 > 0 /\ -arg2P1+arg2 == 0 /\ arg1-arg1P1 == 0), cost: 1 3: f145_0_main_LE -> f145_0_main_LE\' : arg1'=arg1P3, arg2'=arg2P3, (-arg2P3+arg2 == 0 /\ -arg1+arg2 < 0 /\ 1+arg2 > 0 /\ arg1-arg1P3 == 0 /\ arg2-2*x160 == 0), cost: 1 2: f145_0_main_LE\' -> f145_0_main_LE : arg1'=arg1P2, arg2'=arg2P2, (1-2*x130+arg2 >= 0 /\ 1-2*x130+arg2 == 0 /\ 1+arg2-arg2P2 == 0 /\ arg1-arg1P2 == 0 /\ -arg1+arg2 < 0 /\ 1+arg2 > 0 /\ -1-2*x130+arg2 < 0), cost: 1 4: f145_0_main_LE\' -> f145_0_main_LE : arg1'=arg1P4, arg2'=arg2P4, (1+arg2-2*x190 >= 0 /\ arg2-2*x190 == 0 /\ 2-arg2P4+arg2 == 0 /\ arg1-arg1P4 == 0 /\ -arg1+arg2 < 0 /\ 1+arg2 > 0 /\ -1+arg2-2*x190 < 0), cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Applied preprocessing Original rule: f145_0_main_LE -> f145_0_main_LE\' : arg1'=arg1P1, arg2'=arg2P1, (1+arg2-2*x100 == 0 /\ -arg1+arg2 < 0 /\ 1+arg2 > 0 /\ -arg2P1+arg2 == 0 /\ arg1-arg1P1 == 0), cost: 1 New rule: f145_0_main_LE -> f145_0_main_LE\' : (1+arg2-2*x100 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1 Applied preprocessing Original rule: f145_0_main_LE\' -> f145_0_main_LE : arg1'=arg1P2, arg2'=arg2P2, (1-2*x130+arg2 >= 0 /\ 1-2*x130+arg2 == 0 /\ 1+arg2-arg2P2 == 0 /\ arg1-arg1P2 == 0 /\ -arg1+arg2 < 0 /\ 1+arg2 > 0 /\ -1-2*x130+arg2 < 0), cost: 1 New rule: f145_0_main_LE\' -> f145_0_main_LE : arg2'=1+arg2, (1-2*x130+arg2 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1 Applied preprocessing Original rule: f145_0_main_LE -> f145_0_main_LE\' : arg1'=arg1P3, arg2'=arg2P3, (-arg2P3+arg2 == 0 /\ -arg1+arg2 < 0 /\ 1+arg2 > 0 /\ arg1-arg1P3 == 0 /\ arg2-2*x160 == 0), cost: 1 New rule: f145_0_main_LE -> f145_0_main_LE\' : (1+arg2 > 0 /\ arg1-arg2 > 0 /\ arg2-2*x160 == 0), cost: 1 Applied preprocessing Original rule: f145_0_main_LE\' -> f145_0_main_LE : arg1'=arg1P4, arg2'=arg2P4, (1+arg2-2*x190 >= 0 /\ arg2-2*x190 == 0 /\ 2-arg2P4+arg2 == 0 /\ arg1-arg1P4 == 0 /\ -arg1+arg2 < 0 /\ 1+arg2 > 0 /\ -1+arg2-2*x190 < 0), cost: 1 New rule: f145_0_main_LE\' -> f145_0_main_LE : arg2'=2+arg2, (arg2-2*x190 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 6: f145_0_main_LE -> f145_0_main_LE\' : (1+arg2-2*x100 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1 8: f145_0_main_LE -> f145_0_main_LE\' : (1+arg2 > 0 /\ arg1-arg2 > 0 /\ arg2-2*x160 == 0), cost: 1 7: f145_0_main_LE\' -> f145_0_main_LE : arg2'=1+arg2, (1-2*x130+arg2 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1 9: f145_0_main_LE\' -> f145_0_main_LE : arg2'=2+arg2, (arg2-2*x190 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Eliminating location f1_0_main_Load by chaining: Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Second rule: f1_0_main_Load -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 New rule: __init -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (1+arg2P5 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ arg1P5 > 0), cost: 2 Applied deletion Removed the following rules: 0 5 Eliminated locations on linear paths Start location: __init 6: f145_0_main_LE -> f145_0_main_LE\' : (1+arg2-2*x100 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1 8: f145_0_main_LE -> f145_0_main_LE\' : (1+arg2 > 0 /\ arg1-arg2 > 0 /\ arg2-2*x160 == 0), cost: 1 7: f145_0_main_LE\' -> f145_0_main_LE : arg2'=1+arg2, (1-2*x130+arg2 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1 9: f145_0_main_LE\' -> f145_0_main_LE : arg2'=2+arg2, (arg2-2*x190 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1 10: __init -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (1+arg2P5 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ arg1P5 > 0), cost: 2 Eliminating location f145_0_main_LE\' by chaining: Applied chaining First rule: f145_0_main_LE -> f145_0_main_LE\' : (1+arg2-2*x100 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1 Second rule: f145_0_main_LE\' -> f145_0_main_LE : arg2'=1+arg2, (1-2*x130+arg2 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1 New rule: f145_0_main_LE -> f145_0_main_LE : arg2'=1+arg2, (1+arg2-2*x100 == 0 /\ 1-2*x130+arg2 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 2 Applied chaining First rule: f145_0_main_LE -> f145_0_main_LE\' : (1+arg2 > 0 /\ arg1-arg2 > 0 /\ arg2-2*x160 == 0), cost: 1 Second rule: f145_0_main_LE\' -> f145_0_main_LE : arg2'=2+arg2, (arg2-2*x190 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 1 New rule: f145_0_main_LE -> f145_0_main_LE : arg2'=2+arg2, (arg2-2*x190 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0 /\ arg2-2*x160 == 0), cost: 2 Applied deletion Removed the following rules: 6 7 8 9 Eliminated locations on tree-shaped paths Start location: __init 11: f145_0_main_LE -> f145_0_main_LE : arg2'=1+arg2, (1+arg2-2*x100 == 0 /\ 1-2*x130+arg2 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 2 12: f145_0_main_LE -> f145_0_main_LE : arg2'=2+arg2, (arg2-2*x190 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0 /\ arg2-2*x160 == 0), cost: 2 10: __init -> f145_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (1+arg2P5 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ arg1P5 > 0), cost: 2 Applied acceleration Original rule: f145_0_main_LE -> f145_0_main_LE : arg2'=1+arg2, (1+arg2-2*x100 == 0 /\ 1-2*x130+arg2 == 0 /\ 1+arg2 > 0 /\ arg1-arg2 > 0), cost: 2 New rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS