Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737229
details
property
value
status
complete
benchmark
array_free2.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n104.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0307319164276 seconds
cpu usage
0.026952978
max memory
4616192.0
stage attributes
key
value
output-size
2600
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, l8, true> <l1, l2, true, par{i1^0 -> (1 + i1^0)}> <l3, l1, true> <l4, l3, true> <l4, l1, true> <l4, l3, true> <l5, l6, (42 <= (0 + i1^0))> <l5, l4, ((1 + i1^0) <= 42)> <l2, l5, true> <l7, l2, true, par{i1^0 -> 0}> <l8, l7, true> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (i1^0 = 0)> <l2, l6, (42 <= (0 + i1^0))> <l2, l2, ((1 + i1^0) <= 42), par{i1^0 -> (1 + i1^0)}> <l2, l2, ((1 + i1^0) <= 42), par{i1^0 -> (1 + i1^0)}> <l2, l2, ((1 + i1^0) <= 42), par{i1^0 -> (1 + i1^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, i1^0 <= 41, {i1^0 -> 1 + i1^0, rest remain the same}> <l2, l2, i1^0 <= 41, {i1^0 -> 1 + i1^0, rest remain the same}> <l2, l2, i1^0 <= 41, {i1^0 -> 1 + i1^0, rest remain the same}> Variables: i1^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l2, i1^0 = 0, {all remain the same}> Graph 2 <l2, l6, 42 <= i1^0, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634