Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738178
details
property
value
status
complete
benchmark
Et2.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n081.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.68523311615 seconds
cpu usage
1.852771697
max memory
2.82226688E8
stage attributes
key
value
output-size
13939
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l3, true> <l1, l2, (undef1 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0) /\ (0 = arg2), par{arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0}> <l1, l2, (undef7 <= arg1) /\ (undef8 > ~(1)) /\ (arg1 > 0) /\ (undef7 > 0) /\ (1 = arg2), par{arg1 -> undef7, arg2 -> undef8, arg3 -> 0, arg4 -> 1, arg5 -> 1, arg6 -> 1}> <l1, l2, (undef15 > ~(1)) /\ (arg2 > 1) /\ (undef14 > ~(1)) /\ (undef13 <= arg1) /\ (arg1 > 0) /\ (undef13 > 0), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> arg2, arg5 -> 2, arg6 -> arg2}> <l2, l2, (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg3 > 0) /\ (undef19 <= arg1) /\ (arg1 > 0) /\ (undef19 > 0) /\ (arg4 = arg6), par{arg1 -> undef19, arg2 -> (arg2 - 1), arg3 -> (arg2 - 1), arg6 -> arg4}> <l2, l2, (arg3 > 0) /\ (arg4 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (undef31 > ~(1)) /\ (undef25 <= arg1) /\ (arg1 > 0) /\ (undef25 > 0) /\ (arg4 = arg6), par{arg1 -> undef25, arg2 -> ((arg2 - 1) - undef31), arg3 -> ((arg2 - 1) - undef31), arg5 -> (arg5 + 1), arg6 -> arg4}> <l3, l1, true, par{arg1 -> undef32, arg2 -> undef33, arg3 -> undef34, arg4 -> undef35, arg5 -> undef36, arg6 -> undef37}> Fresh variables: undef1, undef7, undef8, undef13, undef14, undef15, undef19, undef25, undef31, undef32, undef33, undef34, undef35, undef36, undef37, Undef variables: undef1, undef7, undef8, undef13, undef14, undef15, undef19, undef25, undef31, undef32, undef33, undef34, undef35, undef36, undef37, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (undef1 <= undef32) /\ (undef32 > 0) /\ (undef1 > 0) /\ (0 = undef33), par{arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0}> <l0, l2, (undef7 <= undef32) /\ (undef8 > ~(1)) /\ (undef32 > 0) /\ (undef7 > 0) /\ (1 = undef33), par{arg1 -> undef7, arg2 -> undef8, arg3 -> 0, arg4 -> 1, arg5 -> 1, arg6 -> 1}> <l0, l2, (undef15 > ~(1)) /\ (undef33 > 1) /\ (undef14 > ~(1)) /\ (undef13 <= undef32) /\ (undef32 > 0) /\ (undef13 > 0), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef33, arg5 -> 2, arg6 -> undef33}> <l2, l2, (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg3 > 0) /\ (undef19 <= arg1) /\ (arg1 > 0) /\ (undef19 > 0) /\ (arg4 = arg6), par{arg1 -> undef19, arg2 -> (arg2 - 1), arg3 -> (arg2 - 1), arg6 -> arg4}> <l2, l2, (arg3 > 0) /\ (arg4 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (undef31 > ~(1)) /\ (undef25 <= arg1) /\ (arg1 > 0) /\ (undef25 > 0) /\ (arg4 = arg6), par{arg1 -> undef25, arg2 -> ((arg2 - 1) - undef31), arg3 -> ((arg2 - 1) - undef31), arg5 -> (arg5 + 1), arg6 -> arg4}> Fresh variables: undef1, undef7, undef8, undef13, undef14, undef15, undef19, undef25, undef31, undef32, undef33, undef34, undef35, undef36, undef37, Undef variables: undef1, undef7, undef8, undef13, undef14, undef15, undef19, undef25, undef31, undef32, undef33, undef34, undef35, undef36, undef37, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, undef19 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef19 /\ arg4 = arg6, {arg1 -> undef19, arg2 -> -1 + arg2, arg3 -> -1 + arg2, arg6 -> arg4, rest remain the same}> <l2, l2, undef25 <= arg1 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef31 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ 1 <= undef25 /\ arg4 = arg6, {arg1 -> undef25, arg2 -> -1 + arg2 - undef31, arg3 -> -1 + arg2 - undef31, arg5 -> 1 + arg5, arg6 -> arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6 Precedence: Graph 0 Graph 1 <l0, l2, undef1 <= undef32 /\ 1 <= undef1 /\ 1 <= undef32 /\ undef33 = 0, {arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, rest remain the same}> <l0, l2, undef7 <= undef32 /\ 0 <= undef8 /\ 1 <= undef7 /\ 1 <= undef32 /\ undef33 = 1, {arg1 -> undef7, arg2 -> undef8, arg3 -> 0, arg4 -> 1, arg5 -> 1, arg6 -> 1, rest remain the same}> <l0, l2, undef13 <= undef32 /\ 0 <= undef14 /\ 0 <= undef15 /\ 1 <= undef13 /\ 1 <= undef32 /\ 2 <= undef33, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef33, arg5 -> 2, arg6 -> undef33, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.011931 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634