Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339700334.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is ErlangenMainframeV0-PT-1007, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339700334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 60M
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 6 09:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 6 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 6 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 12:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 12:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 12:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 16K Jun 6 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Jun 6 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Jun 6 09:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 12:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 12:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 60M Jun 5 20:08 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 ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-00
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-01
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-02
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-03
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-04
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-05
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-06
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-07
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-08
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-09
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-10
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-11
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-12
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-13
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-14
FORMULA_NAME ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749363377459

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1007
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 06:16:18] [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]
[2025-06-08 06:16:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 06:16:20] [INFO ] Load time of PNML (sax parser for PT used): 2166 ms
[2025-06-08 06:16:21] [INFO ] Transformed 285 places.
[2025-06-08 06:16:21] [INFO ] Transformed 52780 transitions.
[2025-06-08 06:16:21] [INFO ] Found NUPN structural information;
[2025-06-08 06:16:21] [INFO ] Parsed PT model containing 285 places and 52780 transitions and 1225525 arcs in 2706 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 21565 ms. (1 steps per ms) remains 6/14 properties
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 8911 ms. (4 steps per ms) remains 5/6 properties
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 5355 ms. (7 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1095 ms. (36 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 4941 ms. (8 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2082 ms. (19 steps per ms) remains 5/5 properties
[2025-06-08 06:16:34] [INFO ] Flatten gal took : 10557 ms
// Phase 1: matrix 52780 rows 285 cols
[2025-06-08 06:16:35] [INFO ] Computed 26 invariants in 955 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 78/196 variables, 16/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 78/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 89/285 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 89/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 6596ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 118 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 52780/52780 transitions.
Graph (trivial) has 83 edges and 285 vertex of which 4 / 285 are part of one of the 2 SCC in 17 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 283 transition count 52758
Reduce places removed 18 places and 0 transitions.
[2025-06-08 06:16:42] [INFO ] Flatten gal took : 7675 ms
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 32 rules applied. Total rules applied 51 place count 265 transition count 52744
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 65 place count 251 transition count 52744
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 65 place count 251 transition count 52736
Deduced a syphon composed of 8 places in 86 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 81 place count 243 transition count 52736
[2025-06-08 06:16:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2615218220114188958.gal : 1171 ms
[2025-06-08 06:16:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6368814337539966869.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2615218220114188958.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6368814337539966869.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 107 place count 217 transition count 52710
Iterating global reduction 3 with 26 rules applied. Total rules applied 133 place count 217 transition count 52710
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 72 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 157 place count 205 transition count 52698
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 168 place count 205 transition count 52687
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 179 place count 194 transition count 52687
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 182 place count 194 transition count 52687
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 194 transition count 52687
Applied a total of 184 rules in 11567 ms. Remains 194 /285 variables (removed 91) and now considering 52687/52780 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11588 ms. Remains : 194/285 places, 52687/52780 transitions.
RANDOM walk for 40000 steps (8 resets) in 16741 ms. (2 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 5616 ms. (7 steps per ms) remains 4/5 properties
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 2889 ms. (13 steps per ms) remains 3/4 properties
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 895 ms. (44 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2135 ms. (18 steps per ms) remains 3/3 properties
[2025-06-08 06:17:01] [INFO ] Flow matrix only has 52686 transitions (discarded 1 similar events)
// Phase 1: matrix 52686 rows 194 cols
[2025-06-08 06:17:02] [INFO ] Computed 26 invariants in 872 ms
[2025-06-08 06:17:02] [INFO ] State equation strengthened by 17518 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/127 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 67/194 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
Loading property file /tmp/ReachabilityCardinality6368814337539966869.prop.
After SMT solving in domain Real declared 52880/52880 variables, and 220 constraints, problems are : Problem set: 0 solved, 3 unsolved in 36639 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 194/194 constraints, ReadFeed: 0/17518 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/127 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:17:49] [INFO ] Deduced a trap composed of 20 places in 9843 ms of which 593 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:17:52] [INFO ] Deduced a trap composed of 23 places in 2396 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:17:54] [INFO ] Deduced a trap composed of 26 places in 1902 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:18:08] [INFO ] Deduced a trap composed of 11 places in 14215 ms of which 767 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:18:20] [INFO ] Deduced a trap composed of 19 places in 11597 ms of which 614 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:18:22] [INFO ] Deduced a trap composed of 26 places in 2047 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 127/52880 variables, and 22 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45481 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/194 constraints, ReadFeed: 0/17518 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 83651ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 76 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 52687/52687 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 5 place count 194 transition count 52682
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 189 transition count 52680
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 187 transition count 52680
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 187 transition count 52677
Deduced a syphon composed of 3 places in 38 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 184 transition count 52677
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 25 place count 179 transition count 43925
Ensure Unique test removed 1 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 178 transition count 43925
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 177 transition count 41009
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 177 transition count 41009
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 176 transition count 29345
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 176 transition count 29345
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 20 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 67 place count 160 transition count 29329
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 160 transition count 29327
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 69 place count 160 transition count 29326
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 159 transition count 29326
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 73 place count 157 transition count 25438
Ensure Unique test removed 1 places
Iterating global reduction 4 with 3 rules applied. Total rules applied 76 place count 156 transition count 25438
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 81 place count 156 transition count 25433
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 86 place count 151 transition count 25433
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 88 place count 151 transition count 25433
Applied a total of 88 rules in 8151 ms. Remains 151 /194 variables (removed 43) and now considering 25433/52687 (removed 27254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8151 ms. Remains : 151/194 places, 25433/52687 transitions.
RANDOM walk for 40000 steps (8 resets) in 8353 ms. (4 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2771 ms. (14 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1046 ms. (38 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1270 ms. (31 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 96895 steps, run timeout after 9001 ms. (steps per millisecond=10 ) properties seen :0 out of 3
Probabilistic random walk after 96895 steps, saw 60909 distinct states, run finished after 9007 ms. (steps per millisecond=10 ) properties seen :0
[2025-06-08 06:18:46] [INFO ] Flow matrix only has 25429 transitions (discarded 4 similar events)
// Phase 1: matrix 25429 rows 151 cols
[2025-06-08 06:18:46] [INFO ] Computed 24 invariants in 252 ms
[2025-06-08 06:18:46] [INFO ] State equation strengthened by 11687 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/112 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 39/151 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25429/25580 variables, 151/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25580 variables, 11687/11862 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25580 variables, 0/11862 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/25580 variables, 0/11862 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25580/25580 variables, and 11862 constraints, problems are : Problem set: 0 solved, 3 unsolved in 17950 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 151/151 constraints, ReadFeed: 11687/11687 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/112 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:19:07] [INFO ] Deduced a trap composed of 20 places in 2706 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:19:09] [INFO ] Deduced a trap composed of 18 places in 2666 ms of which 83 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-08 is UNSAT
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 39/151 variables, 10/26 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:19:22] [INFO ] Deduced a trap composed of 10 places in 12173 ms of which 521 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:19:34] [INFO ] Deduced a trap composed of 12 places in 11513 ms of which 479 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
[2025-06-08 06:19:42] [INFO ] Deduced a trap composed of 20 places in 8263 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:19:53] [INFO ] Deduced a trap composed of 14 places in 10820 ms of which 448 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :13 after 73
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :73 after 575
[2025-06-08 06:20:04] [INFO ] Deduced a trap composed of 11 places in 10742 ms of which 425 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:20:15] [INFO ] Deduced a trap composed of 15 places in 11375 ms of which 442 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:20:25] [INFO ] Deduced a trap composed of 19 places in 9949 ms of which 520 ms to minimize.
SMT process timed out in 99496ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 22 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 25433/25433 transitions.
Graph (trivial) has 65 edges and 151 vertex of which 2 / 151 are part of one of the 1 SCC in 10 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 150 transition count 25414
Reduce places removed 17 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 22 rules applied. Total rules applied 40 place count 133 transition count 25409
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 45 place count 128 transition count 25409
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 45 place count 128 transition count 25405
Deduced a syphon composed of 4 places in 17 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 53 place count 124 transition count 25405
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 65 place count 112 transition count 12221
Ensure Unique test removed 1 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 78 place count 111 transition count 12221
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 111 transition count 12220
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 110 transition count 12220
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 108 transition count 8187
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 108 transition count 8187
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 126 place count 87 transition count 8166
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 136 place count 87 transition count 8156
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 139 place count 84 transition count 7904
Ensure Unique test removed 3 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 145 place count 81 transition count 7904
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 80 transition count 5312
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 80 transition count 5312
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 160 place count 80 transition count 5299
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 161 place count 79 transition count 5298
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 79 transition count 5298
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 79 transition count 5297
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 167 place count 79 transition count 5293
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 171 place count 75 transition count 5293
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 180 place count 75 transition count 5284
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 75 transition count 5284
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 182 place count 75 transition count 5283
Applied a total of 182 rules in 8538 ms. Remains 75 /151 variables (removed 76) and now considering 5283/25433 (removed 20150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8538 ms. Remains : 75/151 places, 5283/25433 transitions.
RANDOM walk for 40000 steps (8 resets) in 3103 ms. (12 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 825 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 426 ms. (93 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 166495 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 2
Probabilistic random walk after 166495 steps, saw 40171 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
[2025-06-08 06:20:38] [INFO ] Flow matrix only has 2691 transitions (discarded 2592 similar events)
// Phase 1: matrix 2691 rows 75 cols
[2025-06-08 06:20:38] [INFO ] Computed 20 invariants in 17 ms
[2025-06-08 06:20:38] [INFO ] State equation strengthened by 2611 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/46 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/75 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2691/2766 variables, 75/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2766 variables, 2611/2706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2766 variables, 0/2706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2766 variables, 0/2706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2766/2766 variables, and 2706 constraints, problems are : Problem set: 0 solved, 2 unsolved in 883 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 75/75 constraints, ReadFeed: 2611/2611 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/46 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:20:39] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:20:39] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/75 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:20:41] [INFO ] Deduced a trap composed of 8 places in 1515 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:20:42] [INFO ] Deduced a trap composed of 9 places in 1001 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:20:44] [INFO ] Deduced a trap composed of 8 places in 1674 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:20:45] [INFO ] Deduced a trap composed of 10 places in 1521 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:20:46] [INFO ] Deduced a trap composed of 9 places in 910 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:20:47] [INFO ] Deduced a trap composed of 11 places in 774 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:20:48] [INFO ] Deduced a trap composed of 12 places in 1040 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :575 after 2.27192e+06
[2025-06-08 06:20:49] [INFO ] Deduced a trap composed of 12 places in 982 ms of which 19 ms to minimize.
Problem ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-12 is UNSAT
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 8/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2691/2766 variables, 75/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2766 variables, 2611/2716 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2766 variables, 0/2716 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2766 variables, 0/2716 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2766/2766 variables, and 2716 constraints, problems are : Problem set: 1 solved, 1 unsolved in 11316 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 75/75 constraints, ReadFeed: 2611/2611 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12250ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 805 steps, including 39 resets, run visited all 1 properties in 44 ms. (steps per millisecond=18 )
FORMULA ErlangenMainframeV0-PT-1007-ReachabilityCardinality-2025-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 53 ms.
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 272050 ms.

BK_STOP 1749363650811

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="ErlangenMainframeV0-PT-1007"
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-5832"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV0-PT-1007, 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 r254-tall-174931339700334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-1007.tgz
mv ErlangenMainframeV0-PT-1007 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 ;