About the Execution of LTSMin+red for TokenRing-PT-030
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
14079.972 | 318813.00 | 404354.00 | 1776.50 | FTFFFTTFTT??T?FT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r540-smll-171690573800190.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is TokenRing-PT-030, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r540-smll-171690573800190
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 257M
-rw-r--r-- 1 mcc users 1.4M Apr 11 23:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.5M Apr 11 23:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17M Apr 11 21:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 59M Apr 11 21:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 678K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1M Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 20M Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5M Apr 12 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12M Apr 12 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 27M Apr 12 02:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91M Apr 12 02:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 102K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 262K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-00
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-01
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-02
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-03
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-04
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-05
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-06
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-07
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-08
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-09
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-10
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-11
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-12
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-13
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-14
FORMULA_NAME TokenRing-PT-030-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717256476467
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:41:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:41:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:41:19] [INFO ] Load time of PNML (sax parser for PT used): 1098 ms
[2024-06-01 15:41:20] [INFO ] Transformed 961 places.
[2024-06-01 15:41:20] [INFO ] Transformed 27931 transitions.
[2024-06-01 15:41:20] [INFO ] Found NUPN structural information;
[2024-06-01 15:41:20] [INFO ] Parsed PT model containing 961 places and 27931 transitions and 111724 arcs in 1527 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 365 ms.
Working with output stream class java.io.PrintStream
FORMULA TokenRing-PT-030-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-030-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-030-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-030-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-030-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-030-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-030-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-030-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-030-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-030-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3728 ms. (10 steps per ms) remains 3/6 properties
FORMULA TokenRing-PT-030-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-030-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-030-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 2416 ms. (16 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1287 ms. (31 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1960 ms. (20 steps per ms) remains 3/3 properties
// Phase 1: matrix 27931 rows 961 cols
[2024-06-01 15:41:24] [INFO ] Computed 31 invariants in 215 ms
[2024-06-01 15:41:25] [INFO ] State equation strengthened by 27030 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 676/744 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 676/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 22165/28892 variables, and 1512 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5549 ms.
Refiners :[Domain max(s): 744/961 constraints, Positive P Invariants (semi-flows): 24/31 constraints, State Equation: 744/961 constraints, ReadFeed: 0/27030 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 676/744 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 676/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 12150ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 68 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 27931/27931 transitions.
Applied a total of 0 rules in 2255 ms. Remains 961 /961 variables (removed 0) and now considering 27931/27931 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2280 ms. Remains : 961/961 places, 27931/27931 transitions.
RANDOM walk for 40000 steps (8 resets) in 1974 ms. (20 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1134 ms. (35 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1521 ms. (26 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1110 ms. (36 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 8575 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :0 out of 3
Probabilistic random walk after 8575 steps, saw 3331 distinct states, run finished after 3007 ms. (steps per millisecond=2 ) properties seen :0
[2024-06-01 15:41:43] [INFO ] Invariant cache hit.
[2024-06-01 15:41:43] [INFO ] State equation strengthened by 27030 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 676/744 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 676/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 21421/22165 variables, 744/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22165 variables, 15330/16842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22165 variables, 0/16842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6450/28615 variables, 10800/27642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/28615 variables, 840/28482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28615 variables, 0/28482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 277/28892 variables, 217/28699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/28892 variables, 217/28916 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/28892 variables, 7/28923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/28892 variables, 60/28983 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 28892/28892 variables, and 28983 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45018 ms.
Refiners :[Domain max(s): 961/961 constraints, Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 961/961 constraints, ReadFeed: 27030/27030 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 676/744 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 676/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 21421/22165 variables, 744/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22165 variables, 15330/16842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22165 variables, 0/16842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6450/28615 variables, 10800/27642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 28615/28892 variables, and 28482 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45018 ms.
Refiners :[Domain max(s): 744/961 constraints, Positive P Invariants (semi-flows): 24/31 constraints, State Equation: 744/961 constraints, ReadFeed: 26970/27030 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 90884ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 68 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 27931/27931 transitions.
Applied a total of 0 rules in 2047 ms. Remains 961 /961 variables (removed 0) and now considering 27931/27931 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2048 ms. Remains : 961/961 places, 27931/27931 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 27931/27931 transitions.
Applied a total of 0 rules in 2049 ms. Remains 961 /961 variables (removed 0) and now considering 27931/27931 (removed 0) transitions.
[2024-06-01 15:43:18] [INFO ] Invariant cache hit.
[2024-06-01 15:43:21] [INFO ] Implicit Places using invariants in 3249 ms returned []
Implicit Place search using SMT only with invariants took 3264 ms to find 0 implicit places.
Running 27901 sub problems to find dead transitions.
[2024-06-01 15:43:21] [INFO ] Invariant cache hit.
[2024-06-01 15:43:23] [INFO ] State equation strengthened by 27030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/961 variables, 961/961 constraints. Problems are: Problem set: 0 solved, 27901 unsolved
SMT process timed out in 190152ms, After SMT, problems are : Problem set: 0 solved, 27901 unsolved
Search for dead transitions found 0 dead transitions in 190522ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196002 ms. Remains : 961/961 places, 27931/27931 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 24123 edges and 961 vertex of which 864 / 961 are part of one of the 30 SCC in 43 ms
Free SCC test removed 834 places
Drop transitions (Empty/Sink Transition effects.) removed 24096 transitions
Ensure Unique test removed 3516 transitions
Reduce isomorphic transitions removed 27612 transitions.
Graph (complete) has 319 edges and 127 vertex of which 120 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 120 transition count 294
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 95 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 94 transition count 293
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 94 transition count 292
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 93 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 180 transitions
Redundant transition composition rules discarded 180 transitions
Iterating global reduction 3 with 180 rules applied. Total rules applied 236 place count 93 transition count 112
Applied a total of 236 rules in 193 ms. Remains 93 /961 variables (removed 868) and now considering 112/27931 (removed 27819) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 112 rows 93 cols
[2024-06-01 15:46:32] [INFO ] Computed 24 invariants in 1 ms
[2024-06-01 15:46:32] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 15:46:32] [INFO ] [Nat]Absence check using 24 positive place invariants in 6 ms returned sat
[2024-06-01 15:46:32] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 15:46:32] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 15:46:32] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 607 ms.
[2024-06-01 15:46:32] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-06-01 15:46:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 961 places, 27931 transitions and 111724 arcs took 127 ms.
[2024-06-01 15:46:34] [INFO ] Flatten gal took : 1391 ms
Total runtime 316364 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TokenRing-PT-030"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is TokenRing-PT-030, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r540-smll-171690573800190"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-030.tgz
mv TokenRing-PT-030 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;