Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254500670.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 PolyORBNT-PT-S05J80, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254500670
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 242K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 217K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 34K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 45K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 204K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 175K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 823K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.8M May 29 14:32 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 PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-00
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-01
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-02
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-03
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-04
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-05
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-06
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-07
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-08
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-09
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-10
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-11
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-12
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-13
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-14
FORMULA_NAME PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749098294018

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J80
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-05 04:38:15] [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-05 04:38:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 04:38:15] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2025-06-05 04:38:15] [INFO ] Transformed 1189 places.
[2025-06-05 04:38:15] [INFO ] Transformed 2350 transitions.
[2025-06-05 04:38:15] [INFO ] Parsed PT model containing 1189 places and 2350 transitions and 14464 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
[2025-06-05 04:38:16] [INFO ] Flatten gal took : 347 ms
RANDOM walk for 40000 steps (2755 resets) in 2712 ms. (14 steps per ms) remains 15/16 properties
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (71 resets) in 141 ms. (28 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (81 resets) in 102 ms. (38 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (47 resets) in 145 ms. (27 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (50 resets) in 65 ms. (60 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (49 resets) in 58 ms. (67 steps per ms) remains 15/15 properties
[2025-06-05 04:38:16] [INFO ] Flatten gal took : 186 ms
BEST_FIRST walk for 4002 steps (92 resets) in 242 ms. (16 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (78 resets) in 49 ms. (80 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (31 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (53 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (60 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
[2025-06-05 04:38:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9292170794473351368.gal : 90 ms
BEST_FIRST walk for 4003 steps (70 resets) in 51 ms. (76 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (50 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (38 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
[2025-06-05 04:38:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2487988119362799250.prop : 11 ms
BEST_FIRST walk for 4004 steps (44 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
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/ReachabilityCardinality9292170794473351368.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2487988119362799250.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4003 steps (65 resets) in 33 ms. (117 steps per ms) remains 15/15 properties

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
Loading property file /tmp/ReachabilityCardinality2487988119362799250.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :8 after 32
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :32 after 64
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :64 after 192
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :192 after 207
Interrupted probabilistic random walk after 74331 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 15
Probabilistic random walk after 74331 steps, saw 23567 distinct states, run finished after 3005 ms. (steps per millisecond=24 ) properties seen :0
[2025-06-05 04:38:19] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2025-06-05 04:38:19] [INFO ] Computed 182 invariants in 150 ms
[2025-06-05 04:38:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-04 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-12 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-13 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-14 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1024 variables, 82/82 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1024 variables, 1/83 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 0/83 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-01 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-06 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-07 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-08 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-09 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 136/1160 variables, 75/158 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1160 variables, 2/160 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1160 variables, 0/160 constraints. Problems are: Problem set: 9 solved, 6 unsolved
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-00 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-02 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-03 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-11 is UNSAT
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 28/1188 variables, 22/182 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1188 variables, 0/182 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1691/2879 variables, 1188/1370 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2879 variables, 1/1371 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2879 variables, 0/1371 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/2880 variables, 1/1372 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2880 variables, 0/1372 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2880 variables, 0/1372 constraints. Problems are: Problem set: 13 solved, 2 unsolved
No progress, stopping.
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :207 after 439
After SMT solving in domain Real declared 2880/2880 variables, and 1372 constraints, problems are : Problem set: 13 solved, 2 unsolved in 3502 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 1189/1189 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 420/458 variables, 38/38 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/38 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 370/828 variables, 66/104 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/828 variables, 0/104 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 220/1048 variables, 44/148 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1048 variables, 0/148 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 131/1179 variables, 25/173 constraints. Problems are: Problem set: 13 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:38:26] [INFO ] Deduced a trap composed of 24 places in 2191 ms of which 1624 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1179 variables, 1/174 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1179 variables, 0/174 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/1188 variables, 9/183 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1188 variables, 0/183 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1691/2879 variables, 1188/1371 constraints. Problems are: Problem set: 13 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2879/2880 variables, and 1372 constraints, problems are : Problem set: 13 solved, 2 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 1188/1189 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8797ms problems are : Problem set: 13 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 1184 transition count 1620
Reduce places removed 75 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 1109 transition count 1615
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 165 place count 1104 transition count 1615
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 165 place count 1104 transition count 1538
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 319 place count 1027 transition count 1538
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 320 place count 1026 transition count 1537
Iterating global reduction 3 with 1 rules applied. Total rules applied 321 place count 1026 transition count 1537
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 325 place count 1024 transition count 1535
Applied a total of 325 rules in 390 ms. Remains 1024 /1189 variables (removed 165) and now considering 1535/1695 (removed 160) transitions.
Running 1529 sub problems to find dead transitions.
[2025-06-05 04:38:28] [INFO ] Flow matrix only has 1531 transitions (discarded 4 similar events)
// Phase 1: matrix 1531 rows 1024 cols
[2025-06-05 04:38:29] [INFO ] Computed 177 invariants in 125 ms
[2025-06-05 04:38:29] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1019 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1529 unsolved
SMT process timed out in 22422ms, After SMT, problems are : Problem set: 0 solved, 1529 unsolved
Search for dead transitions found 0 dead transitions in 22431ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22840 ms. Remains : 1024/1189 places, 1535/1695 transitions.
RANDOM walk for 40000 steps (2008 resets) in 1187 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (118 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (104 resets) in 335 ms. (119 steps per ms) remains 1/2 properties
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-05 04:38:51] [INFO ] Flow matrix only has 1531 transitions (discarded 4 similar events)
[2025-06-05 04:38:51] [INFO ] Invariant cache hit.
[2025-06-05 04:38:51] [INFO ] State equation strengthened by 1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/267 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 293/560 variables, 71/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 350/910 variables, 70/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/910 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 103/1013 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1013 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/1023 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1023 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1531/2554 variables, 1023/1200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2554 variables, 1/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2554 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2555 variables, 1/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2555 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2555 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2555/2555 variables, and 1202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1024/1024 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/267 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 293/560 variables, 71/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 350/910 variables, 70/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/910 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 103/1013 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:38:54] [INFO ] Deduced a trap composed of 13 places in 587 ms of which 27 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1013 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1013 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/1023 variables, 10/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1023 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1531/2554 variables, 1023/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2554 variables, 1/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2554 variables, 1/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2554 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/2555 variables, 1/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2555 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2555 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2555/2555 variables, and 1204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3088 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1024/1024 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4217ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 21 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
FORMULA PolyORBNT-PT-S05J80-ReachabilityCardinality-2025-10 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 13 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 41089 ms.

BK_STOP 1749098336300

--------------------
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="PolyORBNT-PT-S05J80"
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 PolyORBNT-PT-S05J80, 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 r156-tall-174881254500670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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