Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640604200798.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is HealthRecord-PT-13, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604200798
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 20:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 71K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716520776085

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-24 03:19:37] [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]
[2024-05-24 03:19:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:19:37] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-24 03:19:37] [INFO ] Transformed 161 places.
[2024-05-24 03:19:37] [INFO ] Transformed 341 transitions.
[2024-05-24 03:19:37] [INFO ] Found NUPN structural information;
[2024-05-24 03:19:37] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:19:38] [INFO ] Flatten gal took : 132 ms
[2024-05-24 03:19:38] [INFO ] Flatten gal took : 49 ms
[2024-05-24 03:19:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14226988256619871251.gal : 34 ms
RANDOM walk for 40000 steps (3131 resets) in 2147 ms. (18 steps per ms) remains 11/13 properties
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 03:19:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality612819835951012601.prop : 4 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14226988256619871251.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality612819835951012601.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (433 resets) in 401 ms. (99 steps per ms) remains 11/11 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality612819835951012601.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :9 after 97
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :97 after 649
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :649 after 4755
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :4755 after 6697
BEST_FIRST walk for 40004 steps (434 resets) in 188 ms. (211 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :6697 after 7777
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :7777 after 10693
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :10693 after 56641
BEST_FIRST walk for 40004 steps (421 resets) in 526 ms. (75 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :56641 after 62473
BEST_FIRST walk for 40003 steps (436 resets) in 508 ms. (78 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :62473 after 100381
BEST_FIRST walk for 40004 steps (430 resets) in 649 ms. (61 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (431 resets) in 64 ms. (615 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (432 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (427 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (432 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (425 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (444 resets) in 62 ms. (634 steps per ms) remains 10/11 properties
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-24 03:19:39] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2024-05-24 03:19:39] [INFO ] Computed 18 invariants in 16 ms
[2024-05-24 03:19:39] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 36/131 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 36/141 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 30/161 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 30/179 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem HealthRecord-PT-13-ReachabilityCardinality-2024-00 is UNSAT
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 300/461 variables, 161/340 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1/462 variables, 1/341 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/462 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
Invariant property HealthRecord-PT-13-ReachabilityCardinality-2024-04 does not hold.
After SMT solving in domain Real declared 462/462 variables, and 341 constraints, problems are : Problem set: 1 solved, 9 unsolved in 1014 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 39/127 variables, 10/98 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 39/137 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 14 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
Problem HealthRecord-PT-13-ReachabilityCardinality-2024-14 is UNSAT
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 9/146 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-24 03:19:41] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:19:41] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 2/148 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-24 03:19:41] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/149 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-24 03:19:41] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:19:41] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:19:41] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 3/152 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-24 03:19:41] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 1/153 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 34/161 variables, 8/161 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 34/195 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-24 03:19:41] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:19:41] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:19:41] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:19:41] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 20/215 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 2 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 2 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 15/230 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :100381 after 548185
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 9 ms to minimize.
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 6/236 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:19:45] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:19:45] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:19:45] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/161 variables, 10/246 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 161/462 variables, and 246 constraints, problems are : Problem set: 2 solved, 8 unsolved in 5015 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/161 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 67/67 constraints]
After SMT, in 6154ms problems are : Problem set: 2 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 313/313 transitions.
Graph (trivial) has 77 edges and 161 vertex of which 4 / 161 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 685 edges and 159 vertex of which 151 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Discarding 8 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 151 transition count 295
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 150 transition count 294
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 43 place count 112 transition count 218
Iterating global reduction 2 with 38 rules applied. Total rules applied 81 place count 112 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 110 transition count 227
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 110 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 86 place count 110 transition count 225
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 109 transition count 225
Applied a total of 88 rules in 75 ms. Remains 109 /161 variables (removed 52) and now considering 225/313 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 109/161 places, 225/313 transitions.
RANDOM walk for 40000 steps (3433 resets) in 390 ms. (102 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (472 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (464 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (481 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (495 resets) in 45 ms. (869 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (483 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (468 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (476 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (484 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 904816 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :2 out of 8
Probabilistic random walk after 904816 steps, saw 122159 distinct states, run finished after 3011 ms. (steps per millisecond=300 ) properties seen :2
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 225 rows 109 cols
[2024-05-24 03:19:48] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 03:19:48] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 15/109 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 225/334 variables, 109/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/334 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 125 constraints, problems are : Problem set: 0 solved, 6 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 13 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 15/109 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:19:50] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:19:50] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:19:50] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 225/334 variables, 109/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 6/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 6/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/334 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/334 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 153 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1577 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 22/22 constraints]
After SMT, in 1868ms problems are : Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :548185 after 894721
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 368 ms.
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 225/225 transitions.
Graph (trivial) has 143 edges and 109 vertex of which 4 / 109 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 452 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 105 transition count 218
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 102 transition count 215
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 101 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 100 transition count 213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 15 place count 100 transition count 212
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 17 place count 99 transition count 212
Discarding 43 places :
Symmetric choice reduction at 4 with 43 rule applications. Total rules 60 place count 56 transition count 126
Iterating global reduction 4 with 43 rules applied. Total rules applied 103 place count 56 transition count 126
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 112 place count 47 transition count 104
Iterating global reduction 4 with 9 rules applied. Total rules applied 121 place count 47 transition count 104
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 126 place count 47 transition count 99
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 128 place count 45 transition count 93
Iterating global reduction 5 with 2 rules applied. Total rules applied 130 place count 45 transition count 93
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 132 place count 43 transition count 89
Iterating global reduction 5 with 2 rules applied. Total rules applied 134 place count 43 transition count 89
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 139 place count 43 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 151 place count 37 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 155 place count 37 transition count 116
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 157 place count 35 transition count 107
Iterating global reduction 7 with 2 rules applied. Total rules applied 159 place count 35 transition count 107
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 164 place count 35 transition count 102
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 165 place count 34 transition count 100
Iterating global reduction 8 with 1 rules applied. Total rules applied 166 place count 34 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 171 place count 34 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 172 place count 34 transition count 94
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 177 place count 34 transition count 89
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 182 place count 29 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 186 place count 29 transition count 85
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 187 place count 29 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 188 place count 28 transition count 84
Applied a total of 188 rules in 36 ms. Remains 28 /109 variables (removed 81) and now considering 84/225 (removed 141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 28/109 places, 84/225 transitions.
RANDOM walk for 40000 steps (11085 resets) in 606 ms. (65 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1373 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 465 steps, run visited all 1 properties in 5 ms. (steps per millisecond=93 )
Probabilistic random walk after 465 steps, saw 186 distinct states, run finished after 8 ms. (steps per millisecond=58 ) properties seen :1
FORMULA HealthRecord-PT-13-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
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 13987 ms.

BK_STOP 1716520791259

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="HealthRecord-PT-13"
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-5568"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-13, 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 r180-tall-171640604200798"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-13.tgz
mv HealthRecord-PT-13 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;