details

property	value
status	complete
benchmark	ex31.t2_fixed.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n003.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	4.23180484772 seconds
cpu usage	5.383899499
max memory	3.7462016E8

stage attributes

key	value
output-size	3352
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, l6, true> <l1, l2, (undef1 = undef1), par{hi^0 -> undef1}> <l1, l2, (undef4 = undef4), par{lo^0 -> undef4}> <l3, l4, ((0 + lo^0) <= (0 + hi^0))> <l3, l1, ((1 + hi^0) <= (0 + lo^0))> <l2, l3, true> <l5, l2, true, par{hi^0 -> 0, lo^0 -> 99}> <l6, l5, true> Fresh variables: undef1, undef4, Undef variables: undef1, undef4, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (hi^0 = 0) /\ (lo^0 = 99)> <l2, l4, ((0 + lo^0) <= (0 + hi^0))> <l2, l2, ((1 + hi^0) <= (0 + lo^0)) /\ (undef1 = undef1), par{hi^0 -> undef1}> <l2, l2, ((1 + hi^0) <= (0 + lo^0)) /\ (undef4 = undef4), par{lo^0 -> undef4}> Fresh variables: undef1, undef4, Undef variables: undef1, undef4, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 1 + hi^0 <= lo^0, {hi^0 -> undef1, rest remain the same}> <l2, l2, 1 + hi^0 <= lo^0, {lo^0 -> undef4, rest remain the same}> Variables: hi^0, lo^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l2, hi^0 = 0 /\ lo^0 = 99, {all remain the same}> Graph 2 <l2, l4, lo^0 <= hi^0, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 4 , 2 ) ******************************************************************************************* ******************************** 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