Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273623
details
property
value
status
complete
benchmark
Velroyen08-whileNested.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n109.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
64.1677 seconds
cpu usage
64.1194
user time
61.4591
system time
2.66033
max virtual memory
802488.0
max residence set size
130748.0
stage attributes
key
value
starexec-result
NO
output
64.09/64.16 NO 64.09/64.16 64.09/64.16 Solver Timeout: 4 64.09/64.16 Global Timeout: 300 64.09/64.16 No parsing errors! 64.09/64.16 Init Location: 0 64.09/64.16 Transitions: 64.09/64.16 <l0, l4, true> 64.09/64.16 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2, arg3 -> undef3}> 64.09/64.16 <l2, l3, (arg1 < 10), par{arg2 -> arg1, arg3 -> arg1}> 64.09/64.16 <l3, l2, (0 = arg2) /\ (0 = arg3), par{arg1 -> (arg1 + 1), arg2 -> undef8, arg3 -> undef9}> 64.09/64.16 <l3, l3, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> 64.09/64.16 <l4, l1, true, par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 64.09/64.16 64.09/64.16 Fresh variables: 64.09/64.16 undef2, undef3, undef8, undef9, undef13, undef14, undef15, 64.09/64.16 64.09/64.16 Undef variables: 64.09/64.16 undef2, undef3, undef8, undef9, undef13, undef14, undef15, 64.09/64.16 64.09/64.16 Abstraction variables: 64.09/64.16 64.09/64.16 Exit nodes: 64.09/64.16 64.09/64.16 Accepting locations: 64.09/64.16 64.09/64.16 Asserts: 64.09/64.16 64.09/64.16 Preprocessed LLVMGraph 64.09/64.16 Init Location: 0 64.09/64.16 Transitions: 64.09/64.16 <l0, l3, (arg1 = undef14) /\ (arg2 = undef14) /\ (arg3 = undef14) /\ (undef13 > 0) /\ (undef14 > ~(1)) /\ (undef14 < 10)> 64.09/64.16 <l3, l3, (0 = arg2) /\ (0 = arg3) /\ ((arg1 + 1) < 10), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (arg1 + 1)}> 64.09/64.16 <l3, l3, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> 64.09/64.16 64.09/64.16 Fresh variables: 64.09/64.16 undef2, undef3, undef8, undef9, undef13, undef14, undef15, 64.09/64.16 64.09/64.16 Undef variables: 64.09/64.16 undef2, undef3, undef8, undef9, undef13, undef14, undef15, 64.09/64.16 64.09/64.16 Abstraction variables: 64.09/64.16 64.09/64.16 Exit nodes: 64.09/64.16 64.09/64.16 Accepting locations: 64.09/64.16 64.09/64.16 Asserts: 64.09/64.16 64.09/64.16 ************************************************************* 64.09/64.16 ******************************************************************************************* 64.09/64.16 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 64.09/64.16 ******************************************************************************************* 64.09/64.16 64.09/64.16 Init Location: 0 64.09/64.16 Graph 0: 64.09/64.16 Transitions: 64.09/64.16 Variables: 64.09/64.16 64.09/64.16 Graph 1: 64.09/64.16 Transitions: 64.09/64.16 <l3, l3, arg1 <= 8 /\ arg2 = 0 /\ arg3 = 0, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 64.09/64.16 <l3, l3, 1 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> 64.09/64.16 Variables: 64.09/64.16 arg1, arg2, arg3 64.09/64.16 64.09/64.16 Precedence: 64.09/64.16 Graph 0 64.09/64.16 64.09/64.16 Graph 1 64.09/64.16 <l0, l3, 0 <= undef14 /\ 1 <= undef13 /\ undef14 <= 9 /\ arg1 = undef14 /\ arg2 = undef14 /\ arg3 = undef14, {all remain the same}> 64.09/64.16 64.09/64.16 Map Locations to Subgraph: 64.09/64.16 ( 0 , 0 ) 64.09/64.16 ( 3 , 1 ) 64.09/64.16 64.09/64.16 ******************************************************************************************* 64.09/64.16 ******************************** CHECKING ASSERTIONS ******************************** 64.09/64.16 ******************************************************************************************* 64.09/64.16 64.09/64.16 Proving termination of subgraph 0 64.09/64.16 Proving termination of subgraph 1 64.09/64.16 Checking unfeasibility... 64.09/64.16 Time used: 0.005417 64.09/64.16 64.09/64.16 Checking conditional termination of SCC {l3}... 64.09/64.16 64.09/64.16 LOG: CALL solveLinear 64.09/64.16 64.09/64.16 LOG: RETURN solveLinear - Elapsed time: 0.001380s 64.09/64.16 �[33mRanking function: �[36m8 - arg1�[0m 64.09/64.16 New Graphs: 64.09/64.16 Transitions: 64.09/64.16 <l3, l3, 1 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> 64.09/64.16 Variables: 64.09/64.16 arg2, arg3 64.09/64.16 Checking conditional termination of SCC {l3}... 64.09/64.16 64.09/64.16 LOG: CALL solveLinear 64.09/64.16
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