Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r120-tall-167814498400253.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DES-PT-05b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r120-tall-167814498400253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 73K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678393286700

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-05b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 20:21:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 20:21:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:21:28] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-09 20:21:28] [INFO ] Transformed 300 places.
[2023-03-09 20:21:28] [INFO ] Transformed 251 transitions.
[2023-03-09 20:21:28] [INFO ] Found NUPN structural information;
[2023-03-09 20:21:28] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 117 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 6 ms.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 213) seen :196
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 251 rows 300 cols
[2023-03-09 20:21:29] [INFO ] Computed 65 place invariants in 18 ms
[2023-03-09 20:21:29] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 20:21:29] [INFO ] [Nat]Absence check using 40 positive place invariants in 22 ms returned sat
[2023-03-09 20:21:29] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 20:21:30] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 20:21:30] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 6 ms to minimize.
[2023-03-09 20:21:30] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2023-03-09 20:21:30] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2023-03-09 20:21:30] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2023-03-09 20:21:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 365 ms
[2023-03-09 20:21:30] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2023-03-09 20:21:30] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2023-03-09 20:21:30] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2023-03-09 20:21:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2023-03-09 20:21:31] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2023-03-09 20:21:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-09 20:21:31] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2023-03-09 20:21:31] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2023-03-09 20:21:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2023-03-09 20:21:31] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2023-03-09 20:21:31] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2023-03-09 20:21:31] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2023-03-09 20:21:31] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2023-03-09 20:21:31] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-09 20:21:31] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2023-03-09 20:21:31] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2023-03-09 20:21:32] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2023-03-09 20:21:32] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 0 ms to minimize.
[2023-03-09 20:21:32] [INFO ] Deduced a trap composed of 39 places in 340 ms of which 0 ms to minimize.
[2023-03-09 20:21:33] [INFO ] Deduced a trap composed of 32 places in 472 ms of which 0 ms to minimize.
[2023-03-09 20:21:33] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2023-03-09 20:21:33] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1815 ms
[2023-03-09 20:21:33] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2023-03-09 20:21:33] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2023-03-09 20:21:33] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2023-03-09 20:21:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 270 ms
[2023-03-09 20:21:33] [INFO ] After 3758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 260 ms.
[2023-03-09 20:21:33] [INFO ] After 4360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 1136 ms.
Support contains 17 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 251/251 transitions.
Graph (complete) has 561 edges and 300 vertex of which 294 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.13 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 294 transition count 225
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 43 place count 274 transition count 225
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 43 place count 274 transition count 216
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 61 place count 265 transition count 216
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 80 place count 246 transition count 197
Iterating global reduction 2 with 19 rules applied. Total rules applied 99 place count 246 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 99 place count 246 transition count 196
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 245 transition count 196
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 116 place count 230 transition count 181
Iterating global reduction 2 with 15 rules applied. Total rules applied 131 place count 230 transition count 181
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 146 place count 230 transition count 166
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 149 place count 228 transition count 165
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 149 place count 228 transition count 162
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 155 place count 225 transition count 162
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 307 place count 149 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 311 place count 147 transition count 88
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 312 place count 147 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 313 place count 146 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 314 place count 145 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 315 place count 144 transition count 86
Applied a total of 315 rules in 176 ms. Remains 144 /300 variables (removed 156) and now considering 86/251 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 144/300 places, 86/251 transitions.
Incomplete random walk after 1000000 steps, including 47656 resets, run finished after 11377 ms. (steps per millisecond=87 ) properties (out of 17) seen :12
Incomplete Best-First random walk after 1000001 steps, including 9069 resets, run finished after 3819 ms. (steps per millisecond=261 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9127 resets, run finished after 4642 ms. (steps per millisecond=215 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9215 resets, run finished after 3641 ms. (steps per millisecond=274 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9139 resets, run finished after 3987 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9064 resets, run finished after 2556 ms. (steps per millisecond=391 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 86 rows 144 cols
[2023-03-09 20:22:05] [INFO ] Computed 64 place invariants in 7 ms
[2023-03-09 20:22:05] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 20:22:05] [INFO ] [Nat]Absence check using 39 positive place invariants in 5 ms returned sat
[2023-03-09 20:22:05] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-09 20:22:05] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 20:22:05] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2023-03-09 20:22:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-09 20:22:05] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-09 20:22:05] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 618 ms.
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 86/86 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 144 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 143 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 142 transition count 84
Applied a total of 4 rules in 10 ms. Remains 142 /144 variables (removed 2) and now considering 84/86 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 142/144 places, 84/86 transitions.
Incomplete random walk after 1000000 steps, including 47681 resets, run finished after 7570 ms. (steps per millisecond=132 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9089 resets, run finished after 2128 ms. (steps per millisecond=469 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9238 resets, run finished after 2217 ms. (steps per millisecond=451 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9240 resets, run finished after 3031 ms. (steps per millisecond=329 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9118 resets, run finished after 4004 ms. (steps per millisecond=249 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9186 resets, run finished after 4525 ms. (steps per millisecond=220 ) properties (out of 5) seen :0
Finished probabilistic random walk after 68176 steps, run visited all 5 properties in 353 ms. (steps per millisecond=193 )
Probabilistic random walk after 68176 steps, saw 18151 distinct states, run finished after 354 ms. (steps per millisecond=192 ) properties seen :5
Able to resolve query StableMarking after proving 214 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 61573 ms.
ITS solved all properties within timeout

BK_STOP 1678393351312

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="DES-PT-05b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5348"
echo " Executing tool marciexred"
echo " Input is DES-PT-05b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r120-tall-167814498400253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05b.tgz
mv DES-PT-05b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;