fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r026-smll-171620167300264
Last Updated
July 7, 2024

About the Execution of ITS-Tools for AutonomousCar-PT-03b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
406.016 65693.00 89919.00 249.00 1.4445E+0008 ? 1 8 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.r026-smll-171620167300264.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 itstools
Input is AutonomousCar-PT-03b, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167300264
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 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 75K May 18 16:42 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 1716322291566

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-21 20:11:34] [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]
[2024-05-21 20:11:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:11:34] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-05-21 20:11:34] [INFO ] Transformed 190 places.
[2024-05-21 20:11:34] [INFO ] Transformed 273 transitions.
[2024-05-21 20:11:34] [INFO ] Found NUPN structural information;
[2024-05-21 20:11:34] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 405 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 190/190 places, 273/273 transitions.
[2024-05-21 20:11:35] [INFO ] Redundant transitions in 26 ms returned []
Running 272 sub problems to find dead transitions.
// Phase 1: matrix 273 rows 190 cols
[2024-05-21 20:11:35] [INFO ] Computed 8 invariants in 18 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 189/189 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-21 20:11:43] [INFO ] Deduced a trap composed of 18 places in 329 ms of which 45 ms to minimize.
[2024-05-21 20:11:43] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 3 ms to minimize.
[2024-05-21 20:11:43] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 4 ms to minimize.
[2024-05-21 20:11:43] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 3 ms to minimize.
[2024-05-21 20:11:43] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 3 ms to minimize.
[2024-05-21 20:11:43] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
[2024-05-21 20:11:44] [INFO ] Deduced a trap composed of 45 places in 434 ms of which 1 ms to minimize.
[2024-05-21 20:11:44] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 3 ms to minimize.
[2024-05-21 20:11:44] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:11:44] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:11:45] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:11:45] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 3 ms to minimize.
[2024-05-21 20:11:45] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 3 ms to minimize.
[2024-05-21 20:11:45] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 2 ms to minimize.
[2024-05-21 20:11:45] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-21 20:11:45] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:11:45] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 3 ms to minimize.
[2024-05-21 20:11:45] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-05-21 20:11:46] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-05-21 20:11:46] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-21 20:11:47] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 4 ms to minimize.
[2024-05-21 20:11:47] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 3 ms to minimize.
[2024-05-21 20:11:47] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 3 ms to minimize.
[2024-05-21 20:11:48] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-05-21 20:11:48] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 2 ms to minimize.
[2024-05-21 20:11:48] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 3 ms to minimize.
[2024-05-21 20:11:48] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:11:49] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 3 ms to minimize.
[2024-05-21 20:11:49] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-21 20:11:49] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-05-21 20:11:50] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
[2024-05-21 20:11:50] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-21 20:11:51] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 3 ms to minimize.
[2024-05-21 20:11:52] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 4 ms to minimize.
[2024-05-21 20:11:52] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-05-21 20:11:52] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 3 ms to minimize.
[2024-05-21 20:11:52] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 6 ms to minimize.
[2024-05-21 20:11:53] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 3 ms to minimize.
[2024-05-21 20:11:53] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2024-05-21 20:11:53] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 4 ms to minimize.
[2024-05-21 20:11:53] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-21 20:11:53] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2024-05-21 20:11:54] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-21 20:11:57] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:11:58] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 9 (OVERLAPS) 273/463 variables, 190/433 constraints. Problems are: Problem set: 2 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 433 constraints, problems are : Problem set: 2 solved, 270 unsolved in 30041 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 2 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 188/188 constraints. Problems are: Problem set: 2 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/188 constraints. Problems are: Problem set: 2 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 2/190 variables, 8/196 constraints. Problems are: Problem set: 2 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 2/198 constraints. Problems are: Problem set: 2 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 45/243 constraints. Problems are: Problem set: 2 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/243 constraints. Problems are: Problem set: 2 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 273/463 variables, 190/433 constraints. Problems are: Problem set: 2 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 270/703 constraints. Problems are: Problem set: 2 solved, 270 unsolved
[2024-05-21 20:12:13] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:12:13] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-21 20:12:14] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-21 20:12:15] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 4/707 constraints. Problems are: Problem set: 2 solved, 270 unsolved
[2024-05-21 20:12:21] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-21 20:12:23] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 2/709 constraints. Problems are: Problem set: 2 solved, 270 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 0/709 constraints. Problems are: Problem set: 2 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 709 constraints, problems are : Problem set: 2 solved, 270 unsolved in 30022 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 270/272 constraints, Known Traps: 51/51 constraints]
After SMT, in 60796ms problems are : Problem set: 2 solved, 270 unsolved
Search for dead transitions found 2 dead transitions in 60855ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 190/190 places, 271/273 transitions.
Reduce places removed 1 places and 0 transitions.
Starting structural reductions in STATESPACE mode, iteration 2 : 189/190 places, 271/273 transitions.
Finished structural reductions in STATESPACE mode , in 2 iterations and 61181 ms. Remains : 189/190 places, 271/273 transitions.
Final net has 189 places and 271 transitions.
[2024-05-21 20:12:36] [INFO ] Flatten gal took : 83 ms
[2024-05-21 20:12:36] [INFO ] Applying decomposition
[2024-05-21 20:12:36] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12541519387841076564.txt' '-o' '/tmp/graph12541519387841076564.bin' '-w' '/tmp/graph12541519387841076564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12541519387841076564.bin' '-l' '-1' '-v' '-w' '/tmp/graph12541519387841076564.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:12:36] [INFO ] Decomposing Gal with order
[2024-05-21 20:12:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:12:36] [INFO ] Removed a total of 206 redundant transitions.
[2024-05-21 20:12:36] [INFO ] Flatten gal took : 130 ms
[2024-05-21 20:12:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 17 ms.
[2024-05-21 20:12:37] [INFO ] Time to serialize gal into /tmp/StateSpace6487768287486982440.gal : 14 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace6487768287486982440.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.44453e+08,0.129995,5600,435,95,3254,506,450,4262,72,1077,0
Total reachable state count : 144452774

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

BK_STOP 1716322357259

--------------------
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
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="AutonomousCar-PT-03b"
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-5568"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-03b, 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 r026-smll-171620167300264"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-03b.tgz
mv AutonomousCar-PT-03b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;