Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739871
details
property
value
status
complete
benchmark
janne_complex.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n049.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
18.3346209526 seconds
cpu usage
35.079369533
max memory
9.99297024E8
stage attributes
key
value
output-size
9846
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, l10, true> <l1, l2, (30 <= (0 + a4^0)) /\ (undef6 = 1), par{answer^0 -> (0 + undef6), ret_complex6^0 -> undef6}> <l1, l3, ((1 + a4^0) <= 30)> <l4, l1, true> <l3, l5, true> <l6, l3, (13 <= (0 + b5^0)), par{a4^0 -> (1 + a4^0)}> <l6, l3, ((0 + b5^0) <= 12), par{a4^0 -> (10 + a4^0)}> <l7, l3, ((1 + b5^0) <= 10), par{a4^0 -> (1 + a4^0)}> <l7, l6, (10 <= (0 + b5^0))> <l8, l7, ((0 + b5^0) <= 5), par{b5^0 -> (2 + b5^0)}> <l8, l7, (6 <= (0 + b5^0)) /\ (undef58 = undef58), par{b5^0 -> undef58}> <l5, l4, ((0 + a4^0) <= (0 + b5^0)), par{a4^0 -> (2 + a4^0), b5^0 -> (~(10) + b5^0)}> <l5, l8, ((1 + b5^0) <= (0 + a4^0))> <l9, l4, (undef74 = 1) /\ (undef77 = 1), par{a4^0 -> (0 + undef74), a^0 -> undef74, answer^0 -> 0, b5^0 -> (0 + undef77), b^0 -> undef77}> <l10, l9, true> Fresh variables: undef6, undef58, undef74, undef77, Undef variables: undef6, undef58, undef74, undef77, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l3, (a4^0 = (0 + undef74)) /\ (b5^0 = (0 + undef77)) /\ (undef74 = 1) /\ (undef77 = 1) /\ ((1 + (0 + undef74)) <= 30)> <l3, l2, ((0 + a4^0) <= (0 + b5^0)) /\ (30 <= (0 + (2 + a4^0))) /\ (undef6 = 1), par{a4^0 -> (2 + a4^0), b5^0 -> (~(10) + b5^0)}> <l3, l3, ((0 + a4^0) <= (0 + b5^0)) /\ ((1 + (2 + a4^0)) <= 30), par{a4^0 -> (2 + a4^0), b5^0 -> (~(10) + b5^0)}> <l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ ((0 + b5^0) <= 5) /\ ((1 + (2 + b5^0)) <= 10), par{a4^0 -> (1 + a4^0), b5^0 -> (2 + b5^0)}> <l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ (6 <= (0 + b5^0)) /\ (undef58 = undef58) /\ ((1 + undef58) <= 10), par{a4^0 -> (1 + a4^0), b5^0 -> undef58}> <l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ (6 <= (0 + b5^0)) /\ (undef58 = undef58) /\ (10 <= (0 + undef58)) /\ (13 <= (0 + undef58)), par{a4^0 -> (1 + a4^0), b5^0 -> undef58}> <l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ (6 <= (0 + b5^0)) /\ (undef58 = undef58) /\ (10 <= (0 + undef58)) /\ ((0 + undef58) <= 12), par{a4^0 -> (10 + a4^0), b5^0 -> undef58}> Fresh variables: undef6, undef58, undef74, undef77, Undef variables: undef6, undef58, undef74, undef77, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, a4^0 <= b5^0 /\ a4^0 <= 27, {a4^0 -> 2 + a4^0, b5^0 -> -10 + b5^0, rest remain the same}> <l3, l3, 1 + b5^0 <= a4^0 /\ b5^0 <= 5, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}> <l3, l3, 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}> <l3, l3, 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}> <l3, l3, 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}> Variables: a4^0, b5^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l3, a4^0 = undef74 /\ b5^0 = undef77 /\ undef74 = 1 /\ undef77 = 1, {all remain the same}> Graph 2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634