Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739436
details
property
value
status
complete
benchmark
n-18a.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n010.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
4.53890895844 seconds
cpu usage
6.624351891
max memory
2.77823488E8
stage attributes
key
value
output-size
6157
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> <l2, l3, (undef5 = ((0 + x_5^0) + y_6^0)) /\ (0 <= (~(1) + (~(1) * undef5))) /\ (undef4 = undef4), par{Result_4^0 -> undef4, x_5^0 -> undef5}> <l2, l4, (undef8 = ((0 + x_5^0) + y_6^0)) /\ ((0 + (~(1) * undef8)) <= 0), par{x_5^0 -> undef8}> <l4, l2, true> <l5, l1, true> Fresh variables: undef4, undef5, undef8, Undef variables: undef4, undef5, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, true> <l2, l3, (undef5 = ((0 + x_5^0) + y_6^0)) /\ (0 <= (~(1) + (~(1) * undef5))) /\ (undef4 = undef4), par{x_5^0 -> undef5}> <l2, l2, (undef8 = ((0 + x_5^0) + y_6^0)) /\ ((0 + (~(1) * undef8)) <= 0), par{x_5^0 -> undef8}> Fresh variables: undef4, undef5, undef8, Undef variables: undef4, undef5, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 0 <= undef8 /\ x_5^0 + y_6^0 = undef8, {x_5^0 -> undef8, rest remain the same}> Variables: x_5^0, y_6^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l2, true, {all remain the same}> Graph 2 <l2, l3, 1 + undef5 <= 0 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001825 Checking conditional termination of SCC {l2}...
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634