Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969019800030.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is Medical-PT-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019800030
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.4K Mar 7 18:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 7 18:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 18:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 18:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 7 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 7 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 7 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779691622232

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 06:47:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 06:47:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 06:47:04] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2026-05-25 06:47:04] [INFO ] Transformed 312 places.
[2026-05-25 06:47:04] [INFO ] Transformed 5431 transitions.
[2026-05-25 06:47:04] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 242 places in 21 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-08-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (192 resets) in 1230 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (700 resets) in 365 ms. (109 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (45 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (44 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
[2026-05-25 06:47:04] [INFO ] Flatten gal took : 127 ms
[2026-05-25 06:47:04] [INFO ] Flatten gal took : 53 ms
BEST_FIRST walk for 40004 steps (53 resets) in 218 ms. (182 steps per ms) remains 4/4 properties
[2026-05-25 06:47:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2528451139765464119.gal : 30 ms
[2026-05-25 06:47:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1239177343771435088.prop : 1 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2528451139765464119.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1239177343771435088.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1239177343771435088.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 35
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :35 after 120
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :120 after 660
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :660 after 26265
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :26265 after 111405
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :111405 after 281025
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :281025 after 619605
Interrupted probabilistic random walk after 294977 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 4
Probabilistic random walk after 294977 steps, saw 165740 distinct states, run finished after 3040 ms. (steps per millisecond=97 ) properties seen :0
[2026-05-25 06:47:08] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3756903859451028075.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18254564094471231593.kers'
[2026-05-25 06:47:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3756903859451028075.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18254564094471231593.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 69 cols 762 entries
Finished phase 1 with 59 SingleSign rule and 0 generalized
[2026-05-25 06:47:08] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18254564094471231593.kers
Total runtime 1 ms.
[2026-05-25 06:47:08] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem Medical-PT-08-ReachabilityCardinality-2024-02 is UNSAT
FORMULA Medical-PT-08-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem Medical-PT-08-ReachabilityCardinality-2024-05 is UNSAT
FORMULA Medical-PT-08-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 17/23 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 130/153 variables, 23/27 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 30/57 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/57 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 59/212 variables, 28/85 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 2/87 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 15/102 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/217 variables, 2/104 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 1/105 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 29/246 variables, 12/117 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 1/118 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 11/129 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 5/251 variables, 5/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/251 variables, 1/135 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/251 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/251 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 135 constraints, problems are : Problem set: 2 solved, 2 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 85/99 variables, 14/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 10/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 102/201 variables, 27/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 2/55 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 35/90 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 1/91 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7/208 variables, 3/94 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 2/96 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 1/97 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 38/246 variables, 21/118 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 2/120 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 11/131 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/246 variables, 1/132 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/246 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 5/251 variables, 5/137 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/251 variables, 1/138 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/251 variables, 0/138 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/251 variables, 3/141 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/251 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/251 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 141 constraints, problems are : Problem set: 2 solved, 2 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 981ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 116 ms.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 227/227 transitions.
Graph (complete) has 347 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 68 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 65 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 64 transition count 224
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 64 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 62 transition count 222
Applied a total of 13 rules in 42 ms. Remains 62 /69 variables (removed 7) and now considering 222/227 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 62/69 places, 222/227 transitions.
RANDOM walk for 40024 steps (8 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :619605 after 1.2961e+06
Interrupted probabilistic random walk after 603680 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 2
Probabilistic random walk after 603680 steps, saw 342525 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
[2026-05-25 06:47:12] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14963414111425294054.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17153080036670281121.kers'
[2026-05-25 06:47:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14963414111425294054.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17153080036670281121.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 176 rows 61 cols 691 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-25 06:47:12] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17153080036670281121.kers
Total runtime 1 ms.
[2026-05-25 06:47:12] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/97 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 114/211 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/212 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 26/238 variables, 23/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 128 constraints, problems are : Problem set: 0 solved, 2 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/97 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 114/211 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/212 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 26/238 variables, 23/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/238 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/238 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/238 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/238 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 131 constraints, problems are : Problem set: 0 solved, 2 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 474ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 62/62 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-25 06:47:12] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2026-05-25 06:47:12] [INFO ] Invariant cache hit.
[2026-05-25 06:47:12] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 06:47:12] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2026-05-25 06:47:12] [INFO ] Invariant cache hit.
[2026-05-25 06:47:12] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-25 06:47:13] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2026-05-25 06:47:13] [INFO ] Redundant transitions in 4 ms returned []
Running 221 sub problems to find dead transitions.
[2026-05-25 06:47:13] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2026-05-25 06:47:13] [INFO ] Invariant cache hit.
[2026-05-25 06:47:13] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/11 constraints. Problems are: Problem set: 2 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 1/62 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 219 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 1/14 constraints. Problems are: Problem set: 17 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 17 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 176/238 variables, 62/76 constraints. Problems are: Problem set: 17 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 57/133 constraints. Problems are: Problem set: 17 solved, 204 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/133 constraints. Problems are: Problem set: 17 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/133 constraints. Problems are: Problem set: 17 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 133 constraints, problems are : Problem set: 17 solved, 204 unsolved in 7076 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 17 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 4/12 constraints. Problems are: Problem set: 17 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 17 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/13 constraints. Problems are: Problem set: 17 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/14 constraints. Problems are: Problem set: 17 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 17 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 176/238 variables, 62/76 constraints. Problems are: Problem set: 17 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 57/133 constraints. Problems are: Problem set: 17 solved, 204 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 204/337 constraints. Problems are: Problem set: 55 solved, 166 unsolved
Problem TDEAD89 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 5/342 constraints. Problems are: Problem set: 56 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 1/343 constraints. Problems are: Problem set: 56 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 1/344 constraints. Problems are: Problem set: 56 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 1/345 constraints. Problems are: Problem set: 56 solved, 165 unsolved
Problem TDEAD64 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 4/349 constraints. Problems are: Problem set: 63 solved, 158 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 1/350 constraints. Problems are: Problem set: 63 solved, 158 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 1/351 constraints. Problems are: Problem set: 63 solved, 158 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 2/353 constraints. Problems are: Problem set: 63 solved, 158 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.2961e+06 after 2.64844e+06
At refinement iteration 17 (INCLUDED_ONLY) 0/238 variables, 3/356 constraints. Problems are: Problem set: 63 solved, 158 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/238 variables, 0/356 constraints. Problems are: Problem set: 63 solved, 158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/238 variables, and 356 constraints, problems are : Problem set: 63 solved, 158 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 204/221 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 37239ms problems are : Problem set: 63 solved, 158 unsolved
Search for dead transitions found 63 dead transitions in 37243ms
Found 63 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 63 transitions
Dead transitions reduction (with SMT) removed 63 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/62 places, 159/222 transitions.
Reduce places removed 11 places and 56 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 51 transition count 103
Reduce places removed 7 places and 28 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 44 transition count 75
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 43 transition count 67
Reduce places removed 1 places and 10 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 42 transition count 57
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 21 place count 41 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 21 rules in 11 ms. Remains 41 /62 variables (removed 21) and now considering 53/159 (removed 106) transitions.
[2026-05-25 06:47:50] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6270200508102024837.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7134282764432130786.kers'
[2026-05-25 06:47:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6270200508102024837.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7134282764432130786.kers]
Culling trivial invariants: removing 3 columns.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 47 rows 35 cols 152 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-25 06:47:50] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7134282764432130786.kers
Total runtime 0 ms.
[2026-05-25 06:47:50] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-25 06:47:50] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2026-05-25 06:47:50] [INFO ] Invariant cache hit.
[2026-05-25 06:47:50] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-25 06:47:50] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 41/62 places, 53/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37680 ms. Remains : 41/62 places, 53/222 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA Medical-PT-08-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 46905 ms.

BK_STOP 1779691670589

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="Medical-PT-08"
export BK_EXAMINATION="ReachabilityCardinality"
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-5973"
echo " Executing tool itstools"
echo " Input is Medical-PT-08, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969019800030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Medical-PT-08.tgz
mv Medical-PT-08 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;