Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842000459.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is BusinessProcesses-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.5K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 5 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:43 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 59K 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 BusinessProcesses-PT-02-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779610067104

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 08:07:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 08:07:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:07:48] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2026-05-24 08:07:48] [INFO ] Transformed 262 places.
[2026-05-24 08:07:48] [INFO ] Transformed 219 transitions.
[2026-05-24 08:07:48] [INFO ] Found NUPN structural information;
[2026-05-24 08:07:48] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 239 transition count 204
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 35 place count 210 transition count 175
Iterating global reduction 1 with 29 rules applied. Total rules applied 64 place count 210 transition count 175
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 78 place count 196 transition count 161
Iterating global reduction 1 with 14 rules applied. Total rules applied 92 place count 196 transition count 161
Applied a total of 92 rules in 56 ms. Remains 196 /245 variables (removed 49) and now considering 161/204 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4284894918640835417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8369806563755360928.kers'
[2026-05-24 08:07:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4284894918640835417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8369806563755360928.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 161 rows 196 cols 455 entries
Finished phase 1 with 146 SingleSign rule and 13 generalized
[2026-05-24 08:07:48] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8369806563755360928.kers
Total runtime 2 ms.
[2026-05-24 08:07:48] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-24 08:07:48] [INFO ] Invariant cache hit.
[2026-05-24 08:07:49] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2026-05-24 08:07:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 161/357 variables, 196/264 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 12 (OVERLAPS) 0/357 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 267 constraints, problems are : Problem set: 0 solved, 160 unsolved in 15472 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 33/70 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 161/357 variables, 196/266 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 160/426 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 14/440 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/357 variables, and 443 constraints, problems are : Problem set: 0 solved, 160 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45544ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 45556ms
Starting structural reductions in LTL mode, iteration 1 : 196/245 places, 161/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46182 ms. Remains : 196/245 places, 161/204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 161/161 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2026-05-24 08:08:34] [INFO ] Invariant cache hit.
[2026-05-24 08:08:34] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-24 08:08:34] [INFO ] Invariant cache hit.
[2026-05-24 08:08:35] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 196/196 places, 161/161 transitions.
Support contains 14 out of 196 places after structural reductions.
[2026-05-24 08:08:35] [INFO ] Flatten gal took : 33 ms
[2026-05-24 08:08:35] [INFO ] Flatten gal took : 13 ms
[2026-05-24 08:08:35] [INFO ] Input system was already deterministic with 161 transitions.
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (531 resets) in 847 ms. (47 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (103 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (100 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
[2026-05-24 08:08:35] [INFO ] Invariant cache hit.
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) 39/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 118/161 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/173 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 139/312 variables, 173/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 33/345 variables, 14/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/357 variables, 9/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/357 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 233 constraints, problems are : Problem set: 0 solved, 2 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 196/196 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) 39/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 118/161 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 12/173 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 139/312 variables, 173/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 33/345 variables, 14/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 5/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/345 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/357 variables, 9/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/357 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 357/357 variables, and 245 constraints, problems are : Problem set: 0 solved, 2 unsolved in 810 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 983ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 239 ms.
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 161/161 transitions.
Graph (trivial) has 95 edges and 196 vertex of which 6 / 196 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 376 edges and 191 vertex of which 188 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 188 transition count 123
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 161 transition count 123
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 56 place count 161 transition count 87
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 134 place count 119 transition count 87
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 138 place count 115 transition count 83
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 115 transition count 83
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 64 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 243 place count 64 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 244 place count 63 transition count 33
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 245 place count 63 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 62 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 61 transition count 32
Applied a total of 247 rules in 42 ms. Remains 61 /196 variables (removed 135) and now considering 32/161 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 61/196 places, 32/161 transitions.
RANDOM walk for 488 steps (19 resets) in 7 ms. (61 steps per ms) remains 0/2 properties
Computed a total of 189 stabilizing places and 152 stable transitions
Graph (complete) has 383 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X((X(p2)&&(!p3 U (!p2||G(!p3)))))&&p1))&&p0)))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 161/161 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 192 transition count 157
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 192 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 191 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 191 transition count 156
Applied a total of 10 rules in 11 ms. Remains 191 /196 variables (removed 5) and now considering 156/161 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9912491678429084742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6898332645325909503.kers'
[2026-05-24 08:08:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9912491678429084742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6898332645325909503.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 156 rows 191 cols 445 entries
Finished phase 1 with 141 SingleSign rule and 13 generalized
[2026-05-24 08:08:37] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6898332645325909503.kers
Total runtime 1 ms.
[2026-05-24 08:08:37] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-24 08:08:37] [INFO ] Invariant cache hit.
[2026-05-24 08:08:37] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2026-05-24 08:08:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (OVERLAPS) 156/347 variables, 191/258 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 15 (OVERLAPS) 0/347 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 261 constraints, problems are : Problem set: 0 solved, 155 unsolved in 15172 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 33/70 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 156/347 variables, 191/261 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 155/416 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 347/347 variables, and 430 constraints, problems are : Problem set: 0 solved, 155 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45219ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 45223ms
Starting structural reductions in LTL mode, iteration 1 : 191/196 places, 156/161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45503 ms. Remains : 191/196 places, 156/161 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X((X(p2)&&(!p3 U (!p2||G(!p3)))))&&p1))&&p0)))'
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p2) (NOT p0) (NOT p1) p3), (OR (NOT p2) (NOT p0) (NOT p1) p3), true, (OR (NOT p2) (NOT p1) p3), (OR (NOT p2) p3), (NOT p2), (AND p2 p3)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-01 finished in 45985 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 161/161 transitions.
Graph (trivial) has 96 edges and 196 vertex of which 6 / 196 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 377 edges and 191 vertex of which 188 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 187 transition count 126
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 162 transition count 126
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 52 place count 162 transition count 88
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 136 place count 116 transition count 88
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 140 place count 112 transition count 84
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 112 transition count 84
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 236 place count 66 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 65 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 238 place count 64 transition count 37
Applied a total of 238 rules in 30 ms. Remains 64 /196 variables (removed 132) and now considering 37/161 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-646000180393451186.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9429487320590134805.kers'
[2026-05-24 08:09:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-646000180393451186.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9429487320590134805.kers]
Normalized transition count is 36 out of 37 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 36 rows 50 cols 129 entries
Finished phase 1 with 33 SingleSign rule and 3 generalized
[2026-05-24 08:09:23] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9429487320590134805.kers
Total runtime 1 ms.
[2026-05-24 08:09:23] [INFO ] Implicit Places using invariants in 57 ms returned [60, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/196 places, 37/161 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 62/196 places, 37/161 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-07
Stuttering criterion allowed to conclude after 34509 steps with 4679 reset in 120 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-07 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 161/161 transitions.
Graph (trivial) has 96 edges and 196 vertex of which 6 / 196 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 377 edges and 191 vertex of which 188 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 187 transition count 124
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 160 transition count 124
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 56 place count 160 transition count 87
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 137 place count 116 transition count 87
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 142 place count 111 transition count 82
Iterating global reduction 2 with 5 rules applied. Total rules applied 147 place count 111 transition count 82
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 243 place count 62 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 61 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 245 place count 60 transition count 34
Applied a total of 245 rules in 26 ms. Remains 60 /196 variables (removed 136) and now considering 34/161 (removed 127) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7463592500564305194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9044059216140080334.kers'
[2026-05-24 08:09:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7463592500564305194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9044059216140080334.kers]
Normalized transition count is 33 out of 34 initially.
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 0 ms.
// Phase 1: matrix 33 rows 38 cols 96 entries
Finished phase 1 with 26 SingleSign rule and 7 generalized
[2026-05-24 08:09:23] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9044059216140080334.kers
Total runtime 0 ms.
[2026-05-24 08:09:23] [INFO ] Implicit Places using invariants in 42 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/196 places, 34/161 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 71 ms. Remains : 59/196 places, 34/161 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-10 finished in 134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 161/161 transitions.
Graph (trivial) has 97 edges and 196 vertex of which 6 / 196 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 377 edges and 191 vertex of which 188 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 187 transition count 123
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 159 transition count 123
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 58 place count 159 transition count 87
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 79 rules applied. Total rules applied 137 place count 116 transition count 87
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 142 place count 111 transition count 82
Iterating global reduction 2 with 5 rules applied. Total rules applied 147 place count 111 transition count 82
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 245 place count 61 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 246 place count 60 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 247 place count 59 transition count 33
Applied a total of 247 rules in 26 ms. Remains 59 /196 variables (removed 137) and now considering 33/161 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-377105359189099058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10046346865618299606.kers'
[2026-05-24 08:09:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-377105359189099058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10046346865618299606.kers]
Normalized transition count is 32 out of 33 initially.
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 0 ms.
// Phase 1: matrix 32 rows 38 cols 97 entries
Finished phase 1 with 29 SingleSign rule and 3 generalized
[2026-05-24 08:09:23] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10046346865618299606.kers
Total runtime 0 ms.
[2026-05-24 08:09:23] [INFO ] Implicit Places using invariants in 46 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/196 places, 33/161 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76 ms. Remains : 58/196 places, 33/161 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-12
Product exploration explored 100000 steps with 30313 reset in 162 ms.
Product exploration explored 100000 steps with 30451 reset in 203 ms.
Computed a total of 58 stabilizing places and 32 stable transitions
Computed a total of 58 stabilizing places and 32 stable transitions
Detected a total of 58/58 stabilizing places and 32/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 61 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (14286 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 34869 steps (4613 resets) in 117 ms. (295 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 49 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Knowledge-based reduction took 270 ms.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 33/33 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6927282420987002391.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8624580930801472387.kers'
[2026-05-24 08:09:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6927282420987002391.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8624580930801472387.kers]
Normalized transition count is 32 out of 33 initially.
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 32 rows 38 cols 97 entries
Finished phase 1 with 29 SingleSign rule and 3 generalized
[2026-05-24 08:09:24] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8624580930801472387.kers
Total runtime 0 ms.
[2026-05-24 08:09:24] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 08:09:24] [INFO ] Invariant cache hit.
[2026-05-24 08:09:24] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 16, 20, 21, 22, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 132 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/58 places, 33/33 transitions.
Graph (complete) has 65 edges and 33 vertex of which 31 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 31 transition count 27
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 26 transition count 27
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 24 transition count 25
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 25
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 24 place count 19 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 18 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 18 transition count 19
Applied a total of 27 rules in 4 ms. Remains 18 /33 variables (removed 15) and now considering 19/33 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2588944550015066432.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3201387823399980222.kers'
[2026-05-24 08:09:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2588944550015066432.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3201387823399980222.kers]
Normalized transition count is 18 out of 19 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 18 cols 40 entries
Finished phase 1 with 15 SingleSign rule and 2 generalized
[2026-05-24 08:09:24] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3201387823399980222.kers
Total runtime 0 ms.
[2026-05-24 08:09:24] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-24 08:09:24] [INFO ] Invariant cache hit.
[2026-05-24 08:09:24] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/58 places, 19/33 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 196 ms. Remains : 18/58 places, 19/33 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Graph (complete) has 46 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 18 stabilizing places and 18 stable transitions
Detected a total of 18/18 stabilizing places and 18/19 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 49 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 36757 steps (14598 resets) in 65 ms. (556 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 53 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Knowledge-based reduction took 153 ms.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 17666 steps with 5836 reset in 14 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-12 finished in 1261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 161/161 transitions.
Graph (trivial) has 97 edges and 196 vertex of which 6 / 196 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 377 edges and 191 vertex of which 188 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 187 transition count 124
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 160 transition count 124
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 56 place count 160 transition count 87
Deduced a syphon composed of 37 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 138 place count 115 transition count 87
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 109 transition count 81
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 109 transition count 81
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 246 place count 60 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 247 place count 59 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 248 place count 58 transition count 33
Applied a total of 248 rules in 17 ms. Remains 58 /196 variables (removed 138) and now considering 33/161 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-142748411534584238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4436885010706666225.kers'
[2026-05-24 08:09:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-142748411534584238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4436885010706666225.kers]
Normalized transition count is 32 out of 33 initially.
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 0 ms.
// Phase 1: matrix 32 rows 36 cols 92 entries
Finished phase 1 with 29 SingleSign rule and 3 generalized
[2026-05-24 08:09:24] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4436885010706666225.kers
Total runtime 0 ms.
[2026-05-24 08:09:24] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 08:09:24] [INFO ] Invariant cache hit.
[2026-05-24 08:09:24] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 16, 18, 20, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 114 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/196 places, 33/161 transitions.
Graph (complete) has 65 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 32 transition count 27
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 27 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 26 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 26 transition count 26
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 22 place count 21 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 20 transition count 21
Applied a total of 24 rules in 2 ms. Remains 20 /34 variables (removed 14) and now considering 21/33 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-984954173530660571.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10485834600806468011.kers'
[2026-05-24 08:09:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-984954173530660571.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10485834600806468011.kers]
Normalized transition count is 20 out of 21 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 20 cols 44 entries
Finished phase 1 with 17 SingleSign rule and 2 generalized
[2026-05-24 08:09:24] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10485834600806468011.kers
Total runtime 0 ms.
[2026-05-24 08:09:25] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 08:09:25] [INFO ] Invariant cache hit.
[2026-05-24 08:09:25] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/196 places, 21/161 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 184 ms. Remains : 20/196 places, 21/161 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-14 finished in 281 ms.
All properties solved by simple procedures.
Total runtime 96815 ms.

BK_STOP 1779610165160

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="BusinessProcesses-PT-02"
export BK_EXAMINATION="LTLCardinality"
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 BusinessProcesses-PT-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842000459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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