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.r010-oct2-167813599400654.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599400654
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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 517K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678701196124

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:53:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:53:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:53:18] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-13 09:53:18] [INFO ] Transformed 357 places.
[2023-03-13 09:53:18] [INFO ] Transformed 1128 transitions.
[2023-03-13 09:53:18] [INFO ] Found NUPN structural information;
[2023-03-13 09:53:18] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 87 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 9) seen :5
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1128 rows 357 cols
[2023-03-13 09:53:19] [INFO ] Computed 13 place invariants in 24 ms
[2023-03-13 09:53:19] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-13 09:53:19] [INFO ] After 336ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-13 09:53:20] [INFO ] Deduced a trap composed of 13 places in 688 ms of which 6 ms to minimize.
[2023-03-13 09:53:21] [INFO ] Deduced a trap composed of 17 places in 356 ms of which 1 ms to minimize.
[2023-03-13 09:53:21] [INFO ] Deduced a trap composed of 29 places in 601 ms of which 14 ms to minimize.
[2023-03-13 09:53:22] [INFO ] Deduced a trap composed of 23 places in 525 ms of which 2 ms to minimize.
[2023-03-13 09:53:22] [INFO ] Deduced a trap composed of 22 places in 767 ms of which 12 ms to minimize.
[2023-03-13 09:53:23] [INFO ] Deduced a trap composed of 46 places in 410 ms of which 1 ms to minimize.
[2023-03-13 09:53:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3631 ms
[2023-03-13 09:53:23] [INFO ] After 3994ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 09:53:23] [INFO ] After 4343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 09:53:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-13 09:53:24] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-13 09:53:25] [INFO ] Deduced a trap composed of 13 places in 851 ms of which 1 ms to minimize.
[2023-03-13 09:53:26] [INFO ] Deduced a trap composed of 12 places in 838 ms of which 14 ms to minimize.
[2023-03-13 09:53:26] [INFO ] Deduced a trap composed of 15 places in 713 ms of which 1 ms to minimize.
[2023-03-13 09:53:27] [INFO ] Deduced a trap composed of 35 places in 469 ms of which 0 ms to minimize.
[2023-03-13 09:53:27] [INFO ] Deduced a trap composed of 23 places in 364 ms of which 1 ms to minimize.
[2023-03-13 09:53:28] [INFO ] Deduced a trap composed of 35 places in 597 ms of which 1 ms to minimize.
[2023-03-13 09:53:28] [INFO ] Deduced a trap composed of 28 places in 388 ms of which 1 ms to minimize.
[2023-03-13 09:53:29] [INFO ] Deduced a trap composed of 35 places in 493 ms of which 1 ms to minimize.
[2023-03-13 09:53:29] [INFO ] Deduced a trap composed of 24 places in 380 ms of which 0 ms to minimize.
[2023-03-13 09:53:30] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 1 ms to minimize.
[2023-03-13 09:53:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5796 ms
[2023-03-13 09:53:30] [INFO ] After 6266ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-13 09:53:30] [INFO ] After 6627ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Graph (trivial) has 341 edges and 357 vertex of which 4 / 357 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1428 edges and 355 vertex of which 349 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 349 transition count 961
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 205 rules applied. Total rules applied 366 place count 191 transition count 914
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 393 place count 164 transition count 914
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 393 place count 164 transition count 908
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 405 place count 158 transition count 908
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 436 place count 127 transition count 877
Iterating global reduction 3 with 31 rules applied. Total rules applied 467 place count 127 transition count 877
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 723 place count 127 transition count 621
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 723 place count 127 transition count 619
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 727 place count 125 transition count 619
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 736 place count 116 transition count 554
Iterating global reduction 4 with 9 rules applied. Total rules applied 745 place count 116 transition count 554
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 4 with 16 rules applied. Total rules applied 761 place count 116 transition count 538
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 769 place count 108 transition count 538
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 847 place count 69 transition count 499
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 855 place count 61 transition count 427
Iterating global reduction 6 with 8 rules applied. Total rules applied 863 place count 61 transition count 427
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 864 place count 61 transition count 426
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 872 place count 61 transition count 418
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 880 place count 53 transition count 418
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 882 place count 53 transition count 418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 883 place count 52 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 884 place count 51 transition count 417
Applied a total of 884 rules in 268 ms. Remains 51 /357 variables (removed 306) and now considering 417/1128 (removed 711) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 51/357 places, 417/1128 transitions.
Finished random walk after 90 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=90 )
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 12175 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: AutonomousCar_PT_08b
(NrP: 357 NrTr: 1128 NrArc: 9454)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.085sec

net check time: 0m 0.001sec

init dd package: 0m 2.896sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7276536 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16100788 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.003sec

758174 760951 761251 773336 773835 772714 779092 787843 788816 786151 794757 788319 786879 789665 794110 796121 805747 808065 806515 810233 811784 821397 823190 819926 813164 811913 821233 815244 808545 810061 819600 819514 820047 837558 840679 838895 838396 849133 850543 854948 854776 855145 874189 874703 875053 866651 863432 857704 863104 856804 855505 878773 863099 855550 847826 840792 831353 855017 862076 862034 863128 892396 900373 901152 899157 897748 895740 898258 898993 897519 902030 898297 896157 896507 935824 934865 934835 938027 934506 993055 974315

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="AutonomousCar-PT-08b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is AutonomousCar-PT-08b, 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 r010-oct2-167813599400654"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08b.tgz
mv AutonomousCar-PT-08b 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;