Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737235
details
property
value
status
complete
benchmark
consts1nt.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n007.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
13.6275281906 seconds
cpu usage
23.883953862
max memory
2.24878592E8
stage attributes
key
value
output-size
4252
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, true, par{x^0 -> (~(1) + x^0)}> <l2, l3, ((1 + x^0) <= 300)> <l2, l3, (301 <= (0 + x^0))> <l3, l1, true> <l4, l1, true, par{x^0 -> 100}> <l5, l4, true> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, (x^0 = 100)> <l1, l1, ((1 + (~(1) + x^0)) <= 300), par{x^0 -> (~(1) + x^0)}> <l1, l1, (301 <= (0 + (~(1) + x^0))), par{x^0 -> (~(1) + x^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: <l1, l1, x^0 <= 300, {x^0 -> -1 + x^0, rest remain the same}> <l1, l1, 302 <= x^0, {x^0 -> -1 + x^0, rest remain the same}> Variables: x^0 Precedence: Graph 0 Graph 1 <l0, l1, x^0 = 100, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.08902 �[33mSome transition disabled by a set of invariant(s):�[0m �[36mInvariant at l1: x^0 <= 101�[0m �[33mStrengthening and disabling transitions...�[0m > It's unfeasible. Removing transition: <l1, l1, 302 <= x^0, {x^0 -> -1 + x^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): <l1, l1, x^0 <= 101, {x^0 -> -1 + x^0, rest remain the same}>
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634