Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381740549
details
property
value
status
complete
benchmark
ruslan-benchmarks_misc_n-38.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
74.8474040031 seconds
cpu usage
183.658069424
max memory
8.00796672E8
stage attributes
key
value
output-size
124952
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, l16, true> <l1, l2, true> <l3, l1, true> <l3, l1, true> <l3, l4, true> <l5, l3, true> <l5, l3, true> <l5, l4, true> <l6, l5, ((1 + loop_count^0) <= (0 + loop_max^0))> <l6, l7, ((0 + loop_max^0) <= (0 + loop_count^0))> <l7, l8, true> <l4, l9, ((1 + nPacketsOld^0) <= (0 + nPackets^0))> <l4, l9, ((1 + nPackets^0) <= (0 + nPacketsOld^0))> <l4, l7, ((0 + nPackets^0) <= (0 + nPacketsOld^0)) /\ ((0 + nPacketsOld^0) <= (0 + nPackets^0))> <l10, l4, true, par{loop_count^0 -> (1 + loop_count^0)}> <l11, l4, ((0 + tmp___0^0) <= 0) /\ (0 <= (0 + tmp___0^0))> <l11, l10, (1 <= (0 + tmp___0^0))> <l11, l10, ((1 + tmp___0^0) <= 0)> <l12, l11, (undef108 = undef108), par{tmp___0^0 -> undef108}> <l13, l12, true, par{nPackets^0 -> (1 + nPackets^0)}> <l14, l12, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0))> <l14, l13, (1 <= (0 + tmp^0))> <l14, l13, ((1 + tmp^0) <= 0)> <l15, l14, (undef137 = undef137), par{tmp^0 -> undef137}> <l2, l15, true> <l9, l6, true, par{nPacketsOld^0 -> (0 + nPackets^0)}> <l16, l9, true> Fresh variables: undef108, undef137, Undef variables: undef108, undef137, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l9, true> <l9, l14, ((1 + loop_count^0) <= (0 + loop_max^0)) /\ (undef137 = undef137), par{nPacketsOld^0 -> (0 + nPackets^0), tmp^0 -> undef137}> <l9, l14, ((1 + loop_count^0) <= (0 + loop_max^0)) /\ (undef137 = undef137), par{nPacketsOld^0 -> (0 + nPackets^0), tmp^0 -> undef137}> <l9, l8, ((1 + loop_count^0) <= (0 + loop_max^0)) /\ ((0 + nPackets^0) <= (0 + (0 + nPackets^0))) /\ ((0 + (0 + nPackets^0)) <= (0 + nPackets^0)), par{nPacketsOld^0 -> (0 + nPackets^0)}> <l9, l14, ((1 + loop_count^0) <= (0 + loop_max^0)) /\ (undef137 = undef137), par{nPacketsOld^0 -> (0 + nPackets^0), tmp^0 -> undef137}> <l9, l14, ((1 + loop_count^0) <= (0 + loop_max^0)) /\ (undef137 = undef137), par{nPacketsOld^0 -> (0 + nPackets^0), tmp^0 -> undef137}> <l9, l8, ((1 + loop_count^0) <= (0 + loop_max^0)) /\ ((0 + nPackets^0) <= (0 + (0 + nPackets^0))) /\ ((0 + (0 + nPackets^0)) <= (0 + nPackets^0)), par{nPacketsOld^0 -> (0 + nPackets^0)}> <l9, l8, ((1 + loop_count^0) <= (0 + loop_max^0)) /\ ((0 + nPackets^0) <= (0 + (0 + nPackets^0))) /\ ((0 + (0 + nPackets^0)) <= (0 + nPackets^0)), par{nPacketsOld^0 -> (0 + nPackets^0)}> <l9, l8, ((0 + loop_max^0) <= (0 + loop_count^0)), par{nPacketsOld^0 -> (0 + nPackets^0)}> <l14, l9, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ ((0 + undef108) <= 0) /\ (0 <= (0 + undef108)) /\ ((1 + nPacketsOld^0) <= (0 + nPackets^0))> <l14, l9, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ ((0 + undef108) <= 0) /\ (0 <= (0 + undef108)) /\ ((1 + nPackets^0) <= (0 + nPacketsOld^0))> <l14, l8, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ ((0 + undef108) <= 0) /\ (0 <= (0 + undef108)) /\ ((0 + nPackets^0) <= (0 + nPacketsOld^0)) /\ ((0 + nPacketsOld^0) <= (0 + nPackets^0))> <l14, l9, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ (1 <= (0 + undef108)) /\ ((1 + nPacketsOld^0) <= (0 + nPackets^0)), par{loop_count^0 -> (1 + loop_count^0)}> <l14, l9, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ (1 <= (0 + undef108)) /\ ((1 + nPackets^0) <= (0 + nPacketsOld^0)), par{loop_count^0 -> (1 + loop_count^0)}> <l14, l8, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ (1 <= (0 + undef108)) /\ ((0 + nPackets^0) <= (0 + nPacketsOld^0)) /\ ((0 + nPacketsOld^0) <= (0 + nPackets^0)), par{loop_count^0 -> (1 + loop_count^0)}> <l14, l9, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ ((1 + undef108) <= 0) /\ ((1 + nPacketsOld^0) <= (0 + nPackets^0)), par{loop_count^0 -> (1 + loop_count^0)}> <l14, l9, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ ((1 + undef108) <= 0) /\ ((1 + nPackets^0) <= (0 + nPacketsOld^0)), par{loop_count^0 -> (1 + loop_count^0)}> <l14, l8, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ ((1 + undef108) <= 0) /\ ((0 + nPackets^0) <= (0 + nPacketsOld^0)) /\ ((0 + nPacketsOld^0) <= (0 + nPackets^0)), par{loop_count^0 -> (1 + loop_count^0)}> <l14, l9, (1 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ ((0 + undef108) <= 0) /\ (0 <= (0 + undef108)) /\ ((1 + nPacketsOld^0) <= (0 + (1 + nPackets^0))), par{nPackets^0 -> (1 + nPackets^0)}> <l14, l9, (1 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ ((0 + undef108) <= 0) /\ (0 <= (0 + undef108)) /\ ((1 + (1 + nPackets^0)) <= (0 + nPacketsOld^0)), par{nPackets^0 -> (1 + nPackets^0)}> <l14, l8, (1 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ ((0 + undef108) <= 0) /\ (0 <= (0 + undef108)) /\ ((0 + (1 + nPackets^0)) <= (0 + nPacketsOld^0)) /\ ((0 + nPacketsOld^0) <= (0 + (1 + nPackets^0))), par{nPackets^0 -> (1 + nPackets^0)}> <l14, l9, (1 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ (1 <= (0 + undef108)) /\ ((1 + nPacketsOld^0) <= (0 + (1 + nPackets^0))), par{loop_count^0 -> (1 + loop_count^0), nPackets^0 -> (1 + nPackets^0)}> <l14, l9, (1 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ (1 <= (0 + undef108)) /\ ((1 + (1 + nPackets^0)) <= (0 + nPacketsOld^0)), par{loop_count^0 -> (1 + loop_count^0), nPackets^0 -> (1 + nPackets^0)}> <l14, l8, (1 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ (1 <= (0 + undef108)) /\ ((0 + (1 + nPackets^0)) <= (0 + nPacketsOld^0)) /\ ((0 + nPacketsOld^0) <= (0 + (1 + nPackets^0))), par{loop_count^0 -> (1 + loop_count^0), nPackets^0 -> (1 + nPackets^0)}> <l14, l9, (1 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ ((1 + undef108) <= 0) /\ ((1 + nPacketsOld^0) <= (0 + (1 + nPackets^0))), par{loop_count^0 -> (1 + loop_count^0), nPackets^0 -> (1 + nPackets^0)}> <l14, l9, (1 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ ((1 + undef108) <= 0) /\ ((1 + (1 + nPackets^0)) <= (0 + nPacketsOld^0)), par{loop_count^0 -> (1 + loop_count^0), nPackets^0 -> (1 + nPackets^0)}> <l14, l8, (1 <= (0 + tmp^0)) /\ (undef108 = undef108) /\ ((1 + undef108) <= 0) /\ ((0 + (1 + nPackets^0)) <= (0 + nPacketsOld^0)) /\ ((0 + nPacketsOld^0) <= (0 + (1 + nPackets^0))), par{loop_count^0 -> (1 + loop_count^0), nPackets^0 -> (1 + nPackets^0)}> <l14, l9, ((1 + tmp^0) <= 0) /\ (undef108 = undef108) /\ ((0 + undef108) <= 0) /\ (0 <= (0 + undef108)) /\ ((1 + nPacketsOld^0) <= (0 + (1 + nPackets^0))), par{nPackets^0 -> (1 + nPackets^0)}> <l14, l9, ((1 + tmp^0) <= 0) /\ (undef108 = undef108) /\ ((0 + undef108) <= 0) /\ (0 <= (0 + undef108)) /\ ((1 + (1 + nPackets^0)) <= (0 + nPacketsOld^0)), par{nPackets^0 -> (1 + nPackets^0)}> <l14, l8, ((1 + tmp^0) <= 0) /\ (undef108 = undef108) /\ ((0 + undef108) <= 0) /\ (0 <= (0 + undef108)) /\ ((0 + (1 + nPackets^0)) <= (0 + nPacketsOld^0)) /\ ((0 + nPacketsOld^0) <= (0 + (1 + nPackets^0))), par{nPackets^0 -> (1 + nPackets^0)}> <l14, l9, ((1 + tmp^0) <= 0) /\ (undef108 = undef108) /\ (1 <= (0 + undef108)) /\ ((1 + nPacketsOld^0) <= (0 + (1 + nPackets^0))), par{loop_count^0 -> (1 + loop_count^0), nPackets^0 -> (1 + nPackets^0)}> <l14, l9, ((1 + tmp^0) <= 0) /\ (undef108 = undef108) /\ (1 <= (0 + undef108)) /\ ((1 + (1 + nPackets^0)) <= (0 + nPacketsOld^0)), par{loop_count^0 -> (1 + loop_count^0), nPackets^0 -> (1 + nPackets^0)}> <l14, l8, ((1 + tmp^0) <= 0) /\ (undef108 = undef108) /\ (1 <= (0 + undef108)) /\ ((0 + (1 + nPackets^0)) <= (0 + nPacketsOld^0)) /\ ((0 + nPacketsOld^0) <= (0 + (1 + nPackets^0))), par{loop_count^0 -> (1 + loop_count^0), nPackets^0 -> (1 + nPackets^0)}> <l14, l9, ((1 + tmp^0) <= 0) /\ (undef108 = undef108) /\ ((1 + undef108) <= 0) /\ ((1 + nPacketsOld^0) <= (0 + (1 + nPackets^0))), par{loop_count^0 -> (1 + loop_count^0), nPackets^0 -> (1 + nPackets^0)}> <l14, l9, ((1 + tmp^0) <= 0) /\ (undef108 = undef108) /\ ((1 + undef108) <= 0) /\ ((1 + (1 + nPackets^0)) <= (0 + nPacketsOld^0)), par{loop_count^0 -> (1 + loop_count^0), nPackets^0 -> (1 + nPackets^0)}> <l14, l8, ((1 + tmp^0) <= 0) /\ (undef108 = undef108) /\ ((1 + undef108) <= 0) /\ ((0 + (1 + nPackets^0)) <= (0 + nPacketsOld^0)) /\ ((0 + nPacketsOld^0) <= (0 + (1 + nPackets^0))), par{loop_count^0 -> (1 + loop_count^0), nPackets^0 -> (1 + nPackets^0)}> Fresh variables: undef108, undef137, Undef variables:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634