fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r128-smll-174876524100216
Last Updated
June 24, 2025

About the Execution of ITS-Tools for MedleyA-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 66624.00 0.00 0.00 2.0182E+0007 ? 1 7 normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100216.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is MedleyA-PT-15, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100216
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 110K May 29 14:32 model.pnml

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

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

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1748869189115

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202505121319
[2025-06-02 12:59:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 12:59:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 12:59:52] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2025-06-02 12:59:52] [INFO ] Transformed 192 places.
[2025-06-02 12:59:52] [INFO ] Transformed 475 transitions.
[2025-06-02 12:59:52] [INFO ] Found NUPN structural information;
[2025-06-02 12:59:52] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 474 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 192/192 places, 473/473 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:59:52] [INFO ] Redundant transitions in 49 ms returned []
Running 468 sub problems to find dead transitions.
// Phase 1: matrix 469 rows 192 cols
[2025-06-02 12:59:52] [INFO ] Computed 7 invariants in 28 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 7/198 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:08] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:08] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:08] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:08] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:09] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:09] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:09] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:09] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:09] [INFO ] Deduced a trap composed of 19 places in 300 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:10] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:10] [INFO ] Deduced a trap composed of 99 places in 250 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:10] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:10] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:11] [INFO ] Deduced a trap composed of 30 places in 335 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:11] [INFO ] Deduced a trap composed of 38 places in 299 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:12] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:12] [INFO ] Deduced a trap composed of 96 places in 260 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:13] [INFO ] Deduced a trap composed of 45 places in 322 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:13] [INFO ] Deduced a trap composed of 65 places in 296 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:14] [INFO ] Deduced a trap composed of 30 places in 281 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:15] [INFO ] Deduced a trap composed of 99 places in 217 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:15] [INFO ] Deduced a trap composed of 41 places in 274 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:15] [INFO ] Deduced a trap composed of 99 places in 214 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:16] [INFO ] Deduced a trap composed of 121 places in 174 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:17] [INFO ] Deduced a trap composed of 97 places in 219 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:17] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:18] [INFO ] Deduced a trap composed of 125 places in 270 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:18] [INFO ] Deduced a trap composed of 45 places in 285 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:19] [INFO ] Deduced a trap composed of 29 places in 351 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:19] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:20] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:22] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 12/231 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 192/661 variables, and 231 constraints, problems are : Problem set: 0 solved, 468 unsolved in 30054 ms.
Refiners :[Domain max(s): 192/192 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/192 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 7/198 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 32/231 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:30] [INFO ] Deduced a trap composed of 121 places in 203 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:30] [INFO ] Deduced a trap composed of 97 places in 242 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:30] [INFO ] Deduced a trap composed of 96 places in 252 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:31] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:31] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:31] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:00:32] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 7 (OVERLAPS) 469/661 variables, 192/430 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 468/898 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 661/661 variables, and 898 constraints, problems are : Problem set: 0 solved, 468 unsolved in 30039 ms.
Refiners :[Domain max(s): 192/192 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60665ms problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 60733ms
Starting structural reductions in STATESPACE mode, iteration 1 : 192/192 places, 469/473 transitions.
Finished structural reductions in STATESPACE mode , in 1 iterations and 61049 ms. Remains : 192/192 places, 469/473 transitions.
Final net has 192 places and 469 transitions.
[2025-06-02 13:00:53] [INFO ] Flatten gal took : 144 ms
[2025-06-02 13:00:54] [INFO ] Applying decomposition
[2025-06-02 13:00:54] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1185613555398917421.txt' '-o' '/tmp/graph1185613555398917421.bin' '-w' '/tmp/graph1185613555398917421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1185613555398917421.bin' '-l' '-1' '-v' '-w' '/tmp/graph1185613555398917421.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:00:54] [INFO ] Decomposing Gal with order
[2025-06-02 13:00:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:00:54] [INFO ] Removed a total of 613 redundant transitions.
[2025-06-02 13:00:54] [INFO ] Flatten gal took : 183 ms
[2025-06-02 13:00:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 32 ms.
[2025-06-02 13:00:54] [INFO ] Time to serialize gal into /tmp/StateSpace3328086751614523801.gal : 24 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace3328086751614523801.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...219
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.01815e+07,0.786336,19524,1373,105,24419,1272,783,74554,89,4362,0
Total reachable state count : 20181500

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 7
STATE_SPACE MAX_TOKEN_PER_MARKING 7 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 20181500
STATE_SPACE STATES 20181500 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 63824 ms.

BK_STOP 1748869255739

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="MedleyA-PT-15"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-15, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524100216"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-15.tgz
mv MedleyA-PT-15 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;