Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739397
details
property
value
status
complete
benchmark
small22.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n020.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
4.21587705612 seconds
cpu usage
5.348908194
max memory
1.13287168E8
stage attributes
key
value
output-size
3581
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/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, (1 <= (0 + x^0)), par{y^0 -> (0 + x^0)}> <l2, l3, (1 <= (0 + y^0)), par{y^0 -> (~(1) + y^0)}> <l3, l2, true> <l2, l4, true> <l4, l1, true, par{y^0 -> (1 + y^0)}> <l4, l1, true, par{x^0 -> (~(1) + x^0), y^0 -> (1 + y^0)}> <l5, l1, true> <l6, l5, true> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (y^0 = (0 + x^0)) /\ (1 <= (0 + x^0))> <l2, l2, (1 <= (0 + y^0)), par{y^0 -> (~(1) + y^0)}> <l2, l2, (1 <= (0 + x^0)), par{y^0 -> (0 + x^0)}> <l2, l2, (1 <= (0 + (~(1) + x^0))), par{x^0 -> (~(1) + x^0), y^0 -> (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: <l2, l2, 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}> <l2, l2, 1 <= x^0, {y^0 -> x^0, rest remain the same}> <l2, l2, 2 <= x^0, {x^0 -> -1 + x^0, y^0 -> -1 + x^0, rest remain the same}> Variables: y^0, x^0 Precedence: Graph 0 Graph 1 <l0, l2, 1 <= x^0 /\ x^0 = y^0, {all 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.006476 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001245s �[33mRanking function: �[36mx^0�[0m New Graphs:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634