Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876523900086.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 Medical-PT-22, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876523900086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 Medical-PT-22-ReachabilityCardinality-2023-08
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2023-09
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2025-00
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2025-01
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2025-02
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2025-03
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2025-04
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2025-05
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2025-06
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2025-07
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2025-10
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2025-11
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2025-12
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2025-13
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2025-14
FORMULA_NAME Medical-PT-22-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748830494435

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 02:14:56] [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-02 02:14:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 02:14:57] [INFO ] Load time of PNML (sax parser for PT used): 933 ms
[2025-06-02 02:14:57] [INFO ] Transformed 312 places.
[2025-06-02 02:14:57] [INFO ] Transformed 5431 transitions.
[2025-06-02 02:14:57] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 1205 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 242 places in 30 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-22-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40028 steps (169 resets) in 1143 ms. (34 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 542 ms. (73 steps per ms) remains 4/4 properties
[2025-06-02 02:14:58] [INFO ] Flatten gal took : 132 ms
[2025-06-02 02:14:58] [INFO ] Flatten gal took : 61 ms
BEST_FIRST walk for 40003 steps (37 resets) in 373 ms. (106 steps per ms) remains 4/4 properties
[2025-06-02 02:14:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15511654551888678712.gal : 94 ms
BEST_FIRST walk for 40004 steps (31 resets) in 323 ms. (123 steps per ms) remains 4/4 properties
[2025-06-02 02:14:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10110398527927681627.prop : 2 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/ReachabilityCardinality15511654551888678712.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10110398527927681627.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 436 ms. (91 steps per ms) remains 4/4 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 ...330
Loading property file /tmp/ReachabilityCardinality10110398527927681627.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 35
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :35 after 120
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :120 after 560
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :560 after 2300
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2300 after 817972
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :817972 after 3.18237e+06
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :3.18237e+06 after 7.90197e+06
Interrupted probabilistic random walk after 390572 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 4
Probabilistic random walk after 390572 steps, saw 229470 distinct states, run finished after 3008 ms. (steps per millisecond=129 ) properties seen :0
[2025-06-02 02:15:02] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2025-06-02 02:15:02] [INFO ] Computed 10 invariants in 9 ms
[2025-06-02 02:15:02] [INFO ] State equation strengthened by 56 read => feed constraints.
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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem Medical-PT-22-ReachabilityCardinality-2025-05 is UNSAT
FORMULA Medical-PT-22-ReachabilityCardinality-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem Medical-PT-22-ReachabilityCardinality-2025-06 is UNSAT
FORMULA Medical-PT-22-ReachabilityCardinality-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 142/166 variables, 24/28 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 27/55 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 76/242 variables, 36/91 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 3/94 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 29/123 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/123 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/247 variables, 2/125 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 5/130 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/130 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/251 variables, 4/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 1/135 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/251 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 135 constraints, problems are : Problem set: 2 solved, 2 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 117/135 variables, 18/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 27/48 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 81/216 variables, 31/79 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 2/81 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 24/105 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 2/107 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:03] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 20 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 1/108 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/221 variables, 2/110 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 3/113 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:03] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 1/114 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:04] [INFO ] Deduced a trap along path composed of 6 places in 60 ms of which 15 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 1/115 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:04] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 1/116 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/221 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 28/249 variables, 15/131 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/249 variables, 2/133 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/249 variables, 5/138 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/249 variables, 0/138 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/250 variables, 1/139 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/250 variables, 1/140 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/250 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/251 variables, 1/141 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/251 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/251 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 141 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1659 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2479ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 238 ms.
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 227/227 transitions.
Graph (complete) has 347 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 67 transition count 225
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 65 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 64 transition count 225
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 64 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 11 place count 62 transition count 223
Applied a total of 11 rules in 89 ms. Remains 62 /69 variables (removed 7) and now considering 223/227 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 62/69 places, 223/227 transitions.
RANDOM walk for 40037 steps (8 resets) in 269 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 337317 steps, run timeout after 3013 ms. (steps per millisecond=111 ) properties seen :0 out of 2
Probabilistic random walk after 337317 steps, saw 202080 distinct states, run finished after 3014 ms. (steps per millisecond=111 ) properties seen :0
[2025-06-02 02:15:08] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2025-06-02 02:15:08] [INFO ] Computed 8 invariants in 8 ms
[2025-06-02 02:15:08] [INFO ] State equation strengthened by 57 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/51 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 141/192 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 52/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/193 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 46/239 variables, 32/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/239 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/51 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 141/192 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 52/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/193 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 46/239 variables, 32/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 5/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/239 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 129 constraints, problems are : Problem set: 0 solved, 2 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 224 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 223/223 transitions.
Applied a total of 0 rules in 10 ms. Remains 62 /62 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 62/62 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 223/223 transitions.
Applied a total of 0 rules in 10 ms. Remains 62 /62 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2025-06-02 02:15:09] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2025-06-02 02:15:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:15:09] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 02:15:09] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2025-06-02 02:15:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:15:09] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 02:15:09] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:15:09] [INFO ] Redundant transitions in 17 ms returned []
Running 221 sub problems to find dead transitions.
[2025-06-02 02:15:09] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2025-06-02 02:15:09] [INFO ] Invariant cache hit.
[2025-06-02 02:15:09] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:10] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :7.90197e+06 after 1.7332e+07
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:11] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:11] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 177/238 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 57/129 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/239 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:22] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:23] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 8 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:23] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:23] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:23] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 4 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD140 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 5/136 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/136 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/239 variables, 0/136 constraints. Problems are: Problem set: 7 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 136 constraints, problems are : Problem set: 7 solved, 214 unsolved in 22908 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 6/14 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 177/238 variables, 61/75 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 57/132 constraints. Problems are: Problem set: 7 solved, 214 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD145 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 164/296 constraints. Problems are: Problem set: 17 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:35] [INFO ] Deduced a trap along path composed of 6 places in 43 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:36] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:36] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:37] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:37] [INFO ] Deduced a trap along path composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD149 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 5/301 constraints. Problems are: Problem set: 27 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:41] [INFO ] Deduced a trap along path composed of 4 places in 46 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/302 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/302 constraints. Problems are: Problem set: 28 solved, 193 unsolved
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
At refinement iteration 9 (OVERLAPS) 1/239 variables, 1/303 constraints. Problems are: Problem set: 48 solved, 173 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 45/348 constraints. Problems are: Problem set: 53 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 3/351 constraints. Problems are: Problem set: 53 solved, 168 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.7332e+07 after 3.61828e+07
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:15:57] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 1/352 constraints. Problems are: Problem set: 53 solved, 168 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 239/239 variables, and 352 constraints, problems are : Problem set: 53 solved, 168 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 209/221 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 53245ms problems are : Problem set: 53 solved, 168 unsolved
Search for dead transitions found 53 dead transitions in 53257ms
Found 53 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 53 transitions
Dead transitions reduction (with SMT) removed 53 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/62 places, 170/223 transitions.
Reduce places removed 11 places and 60 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 51 transition count 110
Reduce places removed 6 places and 31 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 45 transition count 79
Reduce places removed 2 places and 10 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 43 transition count 69
Reduce places removed 2 places and 11 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21 place count 41 transition count 58
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 22 place count 40 transition count 54
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 22 rules in 9 ms. Remains 40 /62 variables (removed 22) and now considering 54/170 (removed 116) transitions.
[2025-06-02 02:16:02] [INFO ] Flow matrix only has 48 transitions (discarded 6 similar events)
// Phase 1: matrix 48 rows 40 cols
[2025-06-02 02:16:02] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:16:02] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 02:16:02] [INFO ] Flow matrix only has 48 transitions (discarded 6 similar events)
[2025-06-02 02:16:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:16:02] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 02:16:02] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 40/62 places, 54/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 53909 ms. Remains : 40/62 places, 54/223 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA Medical-PT-22-ReachabilityCardinality-2023-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-ReachabilityCardinality-2023-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 66319 ms.

BK_STOP 1748830563071

--------------------
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="Medical-PT-22"
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 Medical-PT-22, 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 r128-smll-174876523900086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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