Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099194
details
property
value
status
complete
benchmark
PastaB10.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n144.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
1.17712 seconds
cpu usage
1.18195
user time
1.1567
system time
0.025254
max virtual memory
292752.0
max residence set size
20132.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 -> f148_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ arg2P0+arg1P0-arg3P0 == 0 /\ 1+arg2 > 0), cost: 1 1: f148_0_main_LE -> f148_0_main_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1 > 0 /\ arg3 > 0 /\ -1+arg1+arg2-arg3P1 == 0 /\ arg2-arg2P1 == 0 /\ 1+arg2 > 0 /\ -1+arg1-arg1P1 == 0), cost: 1 2: f148_0_main_LE -> f148_0_main_LE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (-arg1P2 == 0 /\ arg3 > 0 /\ -arg1 == 0 /\ -arg2 == 0 /\ -arg3P2 == 0 /\ -arg2P2 == 0), cost: 1 3: f148_0_main_LE -> f148_0_main_LE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (arg3 > 0 /\ -arg1 == 0 /\ -arg1P3 == 0 /\ arg2 > 0 /\ -1-arg3P3+arg2 == 0 /\ -1+arg2-arg2P3 == 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f148_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P0 > 0 /\ arg2P0+arg1P0-arg3P0 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f148_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=-arg1P0+arg3P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1-arg1P0+arg3P0 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f148_0_main_LE -> f148_0_main_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1 > 0 /\ arg3 > 0 /\ -1+arg1+arg2-arg3P1 == 0 /\ arg2-arg2P1 == 0 /\ 1+arg2 > 0 /\ -1+arg1-arg1P1 == 0), cost: 1 New rule: f148_0_main_LE -> f148_0_main_LE : arg1'=-1+arg1, arg3'=-1+arg1+arg2, (arg1 > 0 /\ arg3 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f148_0_main_LE -> f148_0_main_LE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (-arg1P2 == 0 /\ arg3 > 0 /\ -arg1 == 0 /\ -arg2 == 0 /\ -arg3P2 == 0 /\ -arg2P2 == 0), cost: 1 New rule: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=0, arg2'=0, (arg1 == 0 /\ arg3 > 0 /\ arg2 == 0), cost: 1 Applied preprocessing Original rule: f148_0_main_LE -> f148_0_main_LE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (arg3 > 0 /\ -arg1 == 0 /\ -arg1P3 == 0 /\ arg2 > 0 /\ -1-arg3P3+arg2 == 0 /\ -1+arg2-arg2P3 == 0), cost: 1 New rule: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=-1+arg2, arg2'=-1+arg2, (arg1 == 0 /\ arg3 > 0 /\ arg2 > 0), cost: 1 Simplified rules Start location: __init 5: f1_0_main_Load -> f148_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=-arg1P0+arg3P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1-arg1P0+arg3P0 > 0 /\ 1+arg2 > 0), cost: 1 6: f148_0_main_LE -> f148_0_main_LE : arg1'=-1+arg1, arg3'=-1+arg1+arg2, (arg1 > 0 /\ arg3 > 0 /\ 1+arg2 > 0), cost: 1 7: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=0, arg2'=0, (arg1 == 0 /\ arg3 > 0 /\ arg2 == 0), cost: 1 8: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=-1+arg2, arg2'=-1+arg2, (arg1 == 0 /\ arg3 > 0 /\ arg2 > 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1 Applied acceleration Original rule: f148_0_main_LE -> f148_0_main_LE : arg1'=-1+arg1, arg3'=-1+arg1+arg2, (arg1 > 0 /\ arg3 > 0 /\ 1+arg2 > 0), cost: 1 New rule: f148_0_main_LE -> f148_0_main_LE : arg1'=arg1-n2, arg3'=arg1-n2+arg2, (arg3 > 0 /\ -1+n2 >= 0 /\ 1+arg2 > 0 /\ 1+arg1-n2+arg2 > 0 /\ 1+arg1-n2 > 0), cost: n2 Applied instantiation Original rule: f148_0_main_LE -> f148_0_main_LE : arg1'=arg1-n2, arg3'=arg1-n2+arg2, (arg3 > 0 /\ -1+n2 >= 0 /\ 1+arg2 > 0 /\ 1+arg1-n2+arg2 > 0 /\ 1+arg1-n2 > 0), cost: n2 New rule: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=arg2, (1 > 0 /\ arg3 > 0 /\ -1+arg1 >= 0 /\ 1+arg2 > 0), cost: arg1 Applied instantiation Original rule: f148_0_main_LE -> f148_0_main_LE : arg1'=arg1-n2, arg3'=arg1-n2+arg2, (arg3 > 0 /\ -1+n2 >= 0 /\ 1+arg2 > 0 /\ 1+arg1-n2+arg2 > 0 /\ 1+arg1-n2 > 0), cost: n2 New rule: f148_0_main_LE -> f148_0_main_LE : arg1'=-arg2, arg3'=0, (1 > 0 /\ arg3 > 0 /\ 1-arg2 > 0 /\ 1+arg2 > 0 /\ -1+arg1+arg2 >= 0), cost: arg1+arg2 Applied acceleration Original rule: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=-1+arg2, arg2'=-1+arg2, (arg1 == 0 /\ arg3 > 0 /\ arg2 > 0), cost: 1 New rule: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=-n6+arg2, arg2'=-n6+arg2, (arg1 >= 0 /\ arg3 > 0 /\ -1+n6 >= 0 /\ -arg1 >= 0 /\ 1-n6+arg2 > 0), cost: n6 Applied instantiation Original rule: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=-n6+arg2, arg2'=-n6+arg2, (arg1 >= 0 /\ arg3 > 0 /\ -1+n6 >= 0 /\ -arg1 >= 0 /\ 1-n6+arg2 > 0), cost: n6 New rule: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=0, arg2'=0, (arg1 >= 0 /\ 1 > 0 /\ arg3 > 0 /\ -arg1 >= 0 /\ -1+arg2 >= 0), cost: arg2 Applied simplification Original rule: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=arg2, (1 > 0 /\ arg3 > 0 /\ -1+arg1 >= 0 /\ 1+arg2 > 0), cost: arg1 New rule: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=arg2, (arg3 > 0 /\ -1+arg1 >= 0 /\ 1+arg2 > 0), cost: arg1 Applied simplification Original rule: f148_0_main_LE -> f148_0_main_LE : arg1'=-arg2, arg3'=0, (1 > 0 /\ arg3 > 0 /\ 1-arg2 > 0 /\ 1+arg2 > 0 /\ -1+arg1+arg2 >= 0), cost: arg1+arg2 New rule: f148_0_main_LE -> f148_0_main_LE : arg1'=-arg2, arg3'=0, (arg3 > 0 /\ 1-arg2 > 0 /\ 1+arg2 > 0 /\ -1+arg1+arg2 >= 0), cost: arg1+arg2 Applied simplification Original rule: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=0, arg2'=0, (arg1 >= 0 /\ 1 > 0 /\ arg3 > 0 /\ -arg1 >= 0 /\ -1+arg2 >= 0), cost: arg2 New rule: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=0, arg2'=0, (arg1 <= 0 /\ arg1 >= 0 /\ arg3 > 0 /\ -1+arg2 >= 0), cost: arg2 Applied deletion Removed the following rules: 6 8 Accelerated simple loops Start location: __init 5: f1_0_main_Load -> f148_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=-arg1P0+arg3P0, (arg1 > 0 /\ 1+arg1P0 > 0 /\ 1-arg1P0+arg3P0 > 0 /\ 1+arg2 > 0), cost: 1 7: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=0, arg2'=0, (arg1 == 0 /\ arg3 > 0 /\ arg2 == 0), cost: 1 12: f148_0_main_LE -> f148_0_main_LE : arg1'=0, arg3'=arg2, (arg3 > 0 /\ -1+arg1 >= 0 /\ 1+arg2 > 0), cost: arg1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS