Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737830
details
property
value
status
complete
benchmark
CountMetaList.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
4.62167787552 seconds
cpu usage
6.709079442
max memory
4.1408512E8
stage attributes
key
value
output-size
13822
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l6, true> <l1, l2, (undef1 <= arg1) /\ (arg1 > ~(1)) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4}> <l3, l2, (arg1 > 0) /\ (undef5 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}> <l2, l2, ((undef9 + 2) <= arg1) /\ (arg1 > 2) /\ (undef9 > ~(1)), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}> <l2, l2, ((undef13 + 2) <= arg1) /\ (arg1 > 1) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16}> <l2, l2, (arg1 >= undef17) /\ (arg1 > 2) /\ (undef17 > 0), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}> <l3, l4, (arg2 > ~(1)) /\ (undef22 > ~(1)) /\ (arg1 > 0), par{arg1 -> 0, arg2 -> undef22, arg3 -> 1, arg4 -> undef24}> <l4, l5, (undef27 > ~(1)) /\ (arg2 > arg1) /\ (arg3 > 0), par{arg1 -> arg2, arg2 -> arg1, arg3 -> undef27, arg4 -> (arg3 + 1)}> <l5, l4, (0 = arg3), par{arg1 -> (arg2 + 1), arg2 -> arg1, arg3 -> arg4, arg4 -> undef32}> <l5, l5, (arg3 > 0), par{arg3 -> (arg3 - 1)}> <l6, l3, true, par{arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef22, undef24, undef27, undef32, undef37, undef38, undef39, undef40, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef22, undef24, undef27, undef32, undef37, undef38, undef39, undef40, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (undef37 > 0) /\ (undef5 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}> <l0, l5, (undef38 > ~(1)) /\ (undef22 > ~(1)) /\ (undef37 > 0) /\ (undef27 > ~(1)) /\ (undef22 > 0) /\ (1 > 0), par{arg1 -> undef22, arg2 -> 0, arg3 -> undef27, arg4 -> (1 + 1)}> <l2, l2, ((undef9 + 2) <= arg1) /\ (arg1 > 2) /\ (undef9 > ~(1)), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}> <l2, l2, ((undef13 + 2) <= arg1) /\ (arg1 > 1) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16}> <l2, l2, (arg1 >= undef17) /\ (arg1 > 2) /\ (undef17 > 0), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}> <l5, l5, (0 = arg3) /\ (undef27 > ~(1)) /\ (arg1 > (arg2 + 1)) /\ (arg4 > 0), par{arg1 -> arg1, arg2 -> (arg2 + 1), arg3 -> undef27, arg4 -> (arg4 + 1)}> <l5, l5, (arg3 > 0), par{arg3 -> (arg3 - 1)}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef22, undef24, undef27, undef32, undef37, undef38, undef39, undef40, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef22, undef24, undef27, undef32, undef37, undef38, undef39, undef40, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l5, l5, 1 <= arg4 /\ 0 <= undef27 /\ 2 + arg2 <= arg1 /\ arg3 = 0, {arg2 -> 1 + arg2, arg3 -> undef27, arg4 -> 1 + arg4, rest remain the same}> <l5, l5, 1 <= arg3, {arg3 -> -1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 2: Transitions: <l2, l2, 0 <= undef9 /\ 2 + undef9 <= arg1 /\ 3 <= arg1, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> <l2, l2, 0 <= undef13 /\ 2 <= arg1 /\ 2 + undef13 <= arg1, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> <l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Precedence: Graph 0 Graph 1 <l0, l5, 1 <= undef22 /\ 1 <= undef37 /\ 0 <= undef27 /\ 0 <= undef38, {arg1 -> undef22, arg2 -> 0, arg3 -> undef27, arg4 -> 2, rest remain the same}> Graph 2 <l0, l2, 1 <= undef37 /\ 0 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}> Map Locations to Subgraph:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634