fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r078-tall-171620514900108
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for CANInsertWithFailure-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5828.964 359167.00 541268.00 912.30 F 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.r078-tall-171620514900108.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 greatspnxred
Input is CANInsertWithFailure-PT-100, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-171620514900108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 60M May 18 16:42 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 1716271422467

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CANInsertWithFailure-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 06:03:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-21 06:03:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 06:03:45] [INFO ] Load time of PNML (sax parser for PT used): 1322 ms
[2024-05-21 06:03:45] [INFO ] Transformed 21204 places.
[2024-05-21 06:03:45] [INFO ] Transformed 60600 transitions.
[2024-05-21 06:03:45] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1610 ms.
RANDOM walk for 40000 steps (15 resets) in 6669 ms. (5 steps per ms) remains 16083/21204 properties
BEST_FIRST walk for 124 steps (0 resets) in 20 ms. (5 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 60 ms. (2 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 37 ms. (3 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 19 ms. (6 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 28 ms. (4 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 18 ms. (6 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 31 ms. (3 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 28 ms. (4 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 23 ms. (5 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 16083/16083 properties
// Phase 1: matrix 60600 rows 21204 cols
[2024-05-21 06:04:16] [INFO ] Computed 103 invariants in 28433 ms
[2024-05-21 06:04:17] [INFO ] State equation strengthened by 19900 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16083/81804 variables, and 0 constraints, problems are : Problem set: 0 solved, 16083 unsolved in 5521 ms.
Refiners :[Positive P Invariants (semi-flows): 0/101 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/21204 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 16083/16083 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16083 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16083/81804 variables, and 0 constraints, problems are : Problem set: 0 solved, 16083 unsolved in 5231 ms.
Refiners :[Positive P Invariants (semi-flows): 0/101 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/21204 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 0/16083 constraints, Known Traps: 0/0 constraints]
After SMT, in 142881ms problems are : Problem set: 0 solved, 16083 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16083 out of 21204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21204/21204 places, 60600/60600 transitions.
Graph (complete) has 81501 edges and 21204 vertex of which 21203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.91 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 401 place count 21203 transition count 60200
Reduce places removed 400 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 401 rules applied. Total rules applied 802 place count 20803 transition count 60199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 803 place count 20802 transition count 60199
Performed 1443 Post agglomeration using F-continuation condition.Transition count delta: 1443
Deduced a syphon composed of 1443 places in 33 ms
Reduce places removed 1443 places and 0 transitions.
Iterating global reduction 3 with 2886 rules applied. Total rules applied 3689 place count 19359 transition count 58756
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3690 place count 19359 transition count 58755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3691 place count 19358 transition count 58755
Partial Free-agglomeration rule applied 2696 times.
Drop transitions (Partial Free agglomeration) removed 2696 transitions
Iterating global reduction 4 with 2696 rules applied. Total rules applied 6387 place count 19358 transition count 58755
Applied a total of 6387 rules in 4304 ms. Remains 19358 /21204 variables (removed 1846) and now considering 58755/60600 (removed 1845) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4323 ms. Remains : 19358/21204 places, 58755/60600 transitions.
RANDOM walk for 724294 steps (748 resets) in 120004 ms. (6 steps per ms) remains 14/16083 properties
BEST_FIRST walk for 4000004 steps (36 resets) in 12037 ms. (332 steps per ms) remains 11/14 properties
BEST_FIRST walk for 4000004 steps (32 resets) in 10239 ms. (390 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4000004 steps (34 resets) in 10268 ms. (389 steps per ms) remains 8/10 properties
BEST_FIRST walk for 4000004 steps (36 resets) in 10393 ms. (384 steps per ms) remains 6/8 properties
BEST_FIRST walk for 4000004 steps (34 resets) in 10209 ms. (391 steps per ms) remains 1/6 properties
BEST_FIRST walk for 4000004 steps (35 resets) in 10101 ms. (395 steps per ms) remains 1/1 properties
[2024-05-21 06:07:02] [INFO ] Flow matrix only has 58537 transitions (discarded 218 similar events)
// Phase 1: matrix 58537 rows 19358 cols
[2024-05-21 06:07:30] [INFO ] Computed 102 invariants in 27698 ms
[2024-05-21 06:07:30] [INFO ] State equation strengthened by 25152 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19157/19158 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 196/19354 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19354 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/19356 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19356 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 77893/77895 variables, and 19458 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29710 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 19356/19358 constraints, ReadFeed: 0/25152 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19157/19158 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 06:08:03] [INFO ] Deduced a trap composed of 5 places in 1323 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19158 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 196/19354 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19354 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/19356 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 06:09:41] [INFO ] Deduced a trap composed of 156 places in 93402 ms of which 137 ms to minimize.
SMT process timed out in 159148ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 19358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19358/19358 places, 58755/58755 transitions.
Graph (complete) has 80823 edges and 19358 vertex of which 5 are kept as prefixes of interest. Removing 19353 places using SCC suffix rule.13 ms
Discarding 19353 places :
Also discarding 58651 output transitions
Drop transitions (Output transitions of discarded places.) removed 58651 transitions
Drop transitions (Empty/Sink Transition effects.) removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 104 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 104 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 2 transition count 2
Applied a total of 106 rules in 78 ms. Remains 2 /19358 variables (removed 19356) and now considering 2/58755 (removed 58753) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 2/19358 places, 2/58755 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Able to resolve query StableMarking after proving 21204 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 357917 ms.
ITS solved all properties within timeout

BK_STOP 1716271781634

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="CANInsertWithFailure-PT-100"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is CANInsertWithFailure-PT-100, 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 r078-tall-171620514900108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-100.tgz
mv CANInsertWithFailure-PT-100 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 ;