About the Execution of ITS-Tools for HealthRecord-PT-07
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
414.207 | 64421.00 | 81784.00 | 305.90 | 5.2471E+0008 ? 1 10 | 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.r180-tall-171640604100752.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 HealthRecord-PT-07, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604100752
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K 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.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 20:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K 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 1716519858165
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-24 03:04:19] [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-24 03:04:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:04:19] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-24 03:04:19] [INFO ] Transformed 155 places.
[2024-05-24 03:04:19] [INFO ] Transformed 320 transitions.
[2024-05-24 03:04:19] [INFO ] Found NUPN structural information;
[2024-05-24 03:04:19] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 173 ms.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 38 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 155/155 places, 282/282 transitions.
[2024-05-24 03:04:19] [INFO ] Redundant transitions in 21 ms returned []
Running 281 sub problems to find dead transitions.
// Phase 1: matrix 282 rows 155 cols
[2024-05-24 03:04:19] [INFO ] Computed 18 invariants in 18 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 11/155 variables, 10/154 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 11/165 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:22] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 13 ms to minimize.
[2024-05-24 03:04:22] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
[2024-05-24 03:04:22] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:04:22] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:04:22] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:04:22] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:04:22] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:04:22] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 2 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2024-05-24 03:04:23] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 2 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 4 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:04:24] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:25] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:04:25] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:04:25] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:04:25] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:04:25] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 2 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 20/233 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:04:27] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 20/253 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 2 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 2 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:04:29] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:04:29] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:04:29] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:04:29] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:04:29] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 20/273 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:30] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:04:30] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:04:30] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:04:30] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:04:30] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:04:30] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:04:30] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:04:30] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:04:31] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:04:31] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:04:31] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:04:31] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:04:31] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:04:31] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:04:31] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:04:31] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:04:31] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:04:31] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:04:31] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:04:31] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:04:33] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:04:33] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:04:33] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 20/313 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:33] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:04:33] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:04:33] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:04:33] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:04:33] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:04:35] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 18/331 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:36] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:36] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:04:36] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:04:36] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:04:36] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 2 ms to minimize.
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:39] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:04:39] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:04:39] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:04:39] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:39] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:04:39] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:04:39] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:04:39] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:04:39] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:04:41] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:04:41] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:04:41] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:04:41] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:04:41] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:04:42] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/155 variables, 13/384 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:43] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:04:44] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:04:44] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:04:44] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:44] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:04:44] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:04:45] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:04:45] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:04:45] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:04:45] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:04:45] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:04:45] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:04:45] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:04:45] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:04:45] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:04:45] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:04:45] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/155 variables, 17/401 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:47] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:04:47] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:47] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:04:47] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/155 variables, 4/405 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:49] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:04:49] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:04:49] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:04:49] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:04:49] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:04:49] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 155/437 variables, and 411 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30024 ms.
Refiners :[Domain max(s): 155/155 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 238/238 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 11/155 variables, 10/154 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 11/165 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 238/411 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 282/437 variables, 155/566 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 281/847 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-24 03:04:57] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:04:57] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 2/849 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 849 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30016 ms.
Refiners :[Domain max(s): 155/155 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 240/240 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 60378 ms. Remains : 155/155 places, 282/282 transitions.
Final net has 155 places and 282 transitions.
[2024-05-24 03:05:20] [INFO ] Flatten gal took : 78 ms
[2024-05-24 03:05:20] [INFO ] Applying decomposition
[2024-05-24 03:05:20] [INFO ] Flatten gal took : 16 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/graph17003492109362567746.txt' '-o' '/tmp/graph17003492109362567746.bin' '-w' '/tmp/graph17003492109362567746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17003492109362567746.bin' '-l' '-1' '-v' '-w' '/tmp/graph17003492109362567746.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:05:20] [INFO ] Decomposing Gal with order
[2024-05-24 03:05:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:05:20] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-24 03:05:20] [INFO ] Flatten gal took : 176 ms
[2024-05-24 03:05:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2024-05-24 03:05:20] [INFO ] Time to serialize gal into /tmp/StateSpace17866733313975191725.gal : 31 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/StateSpace17866733313975191725.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 ...220
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,5.24712e+08,1.83313,66632,1469,2775,66277,30652,371,173787,347,475475,0
Total reachable state count : 524711692
Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 10
STATE_SPACE MAX_TOKEN_PER_MARKING 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 524711692
STATE_SPACE STATES 524711692 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 63218 ms.
BK_STOP 1716519922586
--------------------
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="HealthRecord-PT-07"
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 HealthRecord-PT-07, 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 r180-tall-171640604100752"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-07.tgz
mv HealthRecord-PT-07 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 '
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 ;