Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273611
details
property
value
status
complete
benchmark
Velroyen08-sunset.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n019.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
49.5779 seconds
cpu usage
49.5305
user time
47.1065
system time
2.42396
max virtual memory
1187716.0
max residence set size
481044.0
stage attributes
key
value
starexec-result
NO
output
49.49/49.57 NO 49.49/49.57 49.49/49.57 Solver Timeout: 4 49.49/49.57 Global Timeout: 300 49.49/49.57 No parsing errors! 49.49/49.57 Init Location: 0 49.49/49.57 Transitions: 49.49/49.57 <l0, l3, true> 49.49/49.57 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 49.49/49.57 <l2, l2, (arg1 < 31) /\ (arg1 < 25) /\ (arg1 > 10), par{arg1 -> (arg1 - 1), arg2 -> undef4}> 49.49/49.57 <l2, l2, (arg1 < 31) /\ (arg1 > 25), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 49.49/49.57 <l2, l2, (25 = arg1), par{arg1 -> 29, arg2 -> undef8}> 49.49/49.57 <l2, l2, (arg1 > 30), par{arg1 -> 20, arg2 -> undef10}> 49.49/49.57 <l3, l1, true, par{arg1 -> undef11, arg2 -> undef12}> 49.49/49.57 49.49/49.57 Fresh variables: 49.49/49.57 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 49.49/49.57 49.49/49.57 Undef variables: 49.49/49.57 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 49.49/49.57 49.49/49.57 Abstraction variables: 49.49/49.57 49.49/49.57 Exit nodes: 49.49/49.57 49.49/49.57 Accepting locations: 49.49/49.57 49.49/49.57 Asserts: 49.49/49.57 49.49/49.57 Preprocessed LLVMGraph 49.49/49.57 Init Location: 0 49.49/49.57 Transitions: 49.49/49.57 <l0, l2, (arg1 = undef12) /\ (undef11 > 0) /\ (undef12 > ~(1))> 49.49/49.57 <l2, l2, (arg1 < 31) /\ (arg1 < 25) /\ (arg1 > 10), par{arg1 -> (arg1 - 1)}> 49.49/49.57 <l2, l2, (arg1 < 31) /\ (arg1 > 25), par{arg1 -> (arg1 - 1)}> 49.49/49.57 <l2, l2, (25 = arg1), par{arg1 -> 29}> 49.49/49.57 <l2, l2, (arg1 > 30), par{arg1 -> 20}> 49.49/49.57 49.49/49.57 Fresh variables: 49.49/49.57 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 49.49/49.57 49.49/49.57 Undef variables: 49.49/49.57 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 49.49/49.57 49.49/49.57 Abstraction variables: 49.49/49.57 49.49/49.57 Exit nodes: 49.49/49.57 49.49/49.57 Accepting locations: 49.49/49.57 49.49/49.57 Asserts: 49.49/49.57 49.49/49.57 ************************************************************* 49.49/49.57 ******************************************************************************************* 49.49/49.57 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 49.49/49.57 ******************************************************************************************* 49.49/49.57 49.49/49.57 Init Location: 0 49.49/49.57 Graph 0: 49.49/49.57 Transitions: 49.49/49.57 Variables: 49.49/49.57 49.49/49.57 Graph 1: 49.49/49.57 Transitions: 49.49/49.57 <l2, l2, arg1 <= 24 /\ 11 <= arg1, {arg1 -> -1 + arg1, rest remain the same}> 49.49/49.57 <l2, l2, arg1 <= 30 /\ 26 <= arg1, {arg1 -> -1 + arg1, rest remain the same}> 49.49/49.57 <l2, l2, arg1 = 25, {arg1 -> 29, rest remain the same}> 49.49/49.57 <l2, l2, 31 <= arg1, {arg1 -> 20, rest remain the same}> 49.49/49.57 Variables: 49.49/49.57 arg1 49.49/49.57 49.49/49.57 Precedence: 49.49/49.57 Graph 0 49.49/49.57 49.49/49.57 Graph 1 49.49/49.57 <l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = undef12, {all remain the same}> 49.49/49.57 49.49/49.57 Map Locations to Subgraph: 49.49/49.57 ( 0 , 0 ) 49.49/49.57 ( 2 , 1 ) 49.49/49.57 49.49/49.57 ******************************************************************************************* 49.49/49.57 ******************************** CHECKING ASSERTIONS ******************************** 49.49/49.57 ******************************************************************************************* 49.49/49.57 49.49/49.57 Proving termination of subgraph 0 49.49/49.57 Proving termination of subgraph 1 49.49/49.57 Checking unfeasibility... 49.49/49.57 Time used: 0.007629 49.49/49.57 49.49/49.57 Checking conditional termination of SCC {l2}... 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.001479s 49.49/49.57 49.49/49.57 LOG: CALL solveLinear 49.49/49.57 49.49/49.57 LOG: RETURN solveLinear - Elapsed time: 0.007554s 49.49/49.57 �[33mPiecewise ranking function: �[36mmin(-418 + 38*arg1,532)�[0m
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer_Transition_Systems 2019-03-29 01.54