Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737986
details
property
value
status
complete
benchmark
ListContent.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n009.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
4.35830187798 seconds
cpu usage
5.782461059
max memory
2.47947264E8
stage attributes
key
value
output-size
5613
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l5, true> <l1, l2, (undef1 <= arg1) /\ (arg1 > ~(1)) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2}> <l3, l2, (arg1 > 0) /\ (undef3 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}> <l2, l2, (undef5 <= arg1) /\ (undef7 > 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6}> <l3, l4, (arg2 > ~(1)) /\ (undef8 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef8, arg2 -> 1}> <l4, l4, (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> <l5, l3, true, par{arg1 -> undef12, arg2 -> undef13}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (undef12 > 0) /\ (undef3 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}> <l0, l4, (undef13 > ~(1)) /\ (undef8 > ~(1)) /\ (undef12 > 0), par{arg1 -> undef8, arg2 -> 1}> <l2, l2, (undef5 <= arg1) /\ (undef7 > 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6}> <l4, l4, (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l4, l4, 1 <= arg1 /\ 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Graph 2: Transitions: <l2, l2, 1 <= arg1 /\ 1 <= undef5 /\ 1 <= undef7 /\ undef5 <= arg1, {arg1 -> undef5, arg2 -> undef6, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 <l0, l4, 1 <= undef12 /\ 0 <= undef8 /\ 0 <= undef13, {arg1 -> undef8, arg2 -> 1, rest remain the same}> Graph 2 <l0, l2, 1 <= undef12 /\ 0 <= undef3, {arg1 -> undef3, arg2 -> undef4, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 2 ) ( 4 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634