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.r498-tall-171640618000493.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 ltsminxred
Input is HealthRecord-PT-12, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r498-tall-171640618000493
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 20:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 20:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:03 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717194044171

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:20:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 22:20:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:20:45] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-31 22:20:45] [INFO ] Transformed 160 places.
[2024-05-31 22:20:45] [INFO ] Transformed 340 transitions.
[2024-05-31 22:20:45] [INFO ] Found NUPN structural information;
[2024-05-31 22:20:45] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 173 ms.
Graph (trivial) has 274 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Structural test allowed to assert that 31 places are NOT stable. Took 20 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3204 resets) in 1495 ms. (26 steps per ms) remains 56/129 properties
BEST_FIRST walk for 4004 steps (37 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (37 resets) in 37 ms. (105 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (36 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (37 resets) in 39 ms. (100 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (34 resets) in 15 ms. (250 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4001 steps (37 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (39 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (36 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (36 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (35 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (37 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (35 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (33 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (37 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (38 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (33 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (37 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (38 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (37 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (34 resets) in 20 ms. (190 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (37 resets) in 8 ms. (444 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (37 resets) in 9 ms. (400 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (36 resets) in 8 ms. (444 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (37 resets) in 8 ms. (444 steps per ms) remains 43/53 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4003 steps (37 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (33 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 8 ms. (444 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (38 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (40 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (37 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (36 resets) in 7 ms. (500 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (38 resets) in 7 ms. (500 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (38 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (38 resets) in 7 ms. (500 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (37 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (37 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (37 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
[2024-05-31 22:20:46] [INFO ] Flow matrix only has 292 transitions (discarded 16 similar events)
// Phase 1: matrix 292 rows 156 cols
[2024-05-31 22:20:46] [INFO ] Computed 18 invariants in 12 ms
[2024-05-31 22:20:46] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 54/95 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 54/105 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 61/156 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 61/174 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 291/447 variables, 156/330 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 1/448 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 0/448 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 331 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1591 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 54/95 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 54/105 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 14 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 2 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:20:49] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:20:49] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:20:49] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:20:49] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:20:49] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:20:49] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-31 22:20:49] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-31 22:20:49] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:20:49] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 61/156 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 61/197 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-31 22:20:49] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:20:49] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:20:49] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 5 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 2 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 2 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 2 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:20:51] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 3 ms to minimize.
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:20:52] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:20:53] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:20:53] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
SMT process timed out in 6695ms, After SMT, problems are : Problem set: 0 solved, 41 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 308/308 transitions.
Graph (complete) has 678 edges and 156 vertex of which 147 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 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 0 with 9 rules applied. Total rules applied 10 place count 147 transition count 290
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 12 place count 146 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 146 transition count 288
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 14 place count 145 transition count 288
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 67 place count 92 transition count 182
Iterating global reduction 2 with 53 rules applied. Total rules applied 120 place count 92 transition count 182
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 125 place count 87 transition count 172
Iterating global reduction 2 with 5 rules applied. Total rules applied 130 place count 87 transition count 172
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 138 place count 87 transition count 164
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 150 place count 81 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 155 place count 81 transition count 188
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 81 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 159 place count 79 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 79 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 163 place count 77 transition count 184
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 77 transition count 184
Applied a total of 164 rules in 70 ms. Remains 77 /156 variables (removed 79) and now considering 184/308 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 77/156 places, 184/308 transitions.
RANDOM walk for 4000000 steps (724484 resets) in 19612 ms. (203 steps per ms) remains 30/41 properties
BEST_FIRST walk for 400004 steps (10826 resets) in 366 ms. (1089 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (10804 resets) in 346 ms. (1152 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (10794 resets) in 343 ms. (1162 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (10836 resets) in 347 ms. (1149 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (10912 resets) in 349 ms. (1142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (10755 resets) in 359 ms. (1111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (10822 resets) in 347 ms. (1149 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (10824 resets) in 344 ms. (1159 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (10875 resets) in 387 ms. (1030 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (10729 resets) in 388 ms. (1028 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (10803 resets) in 342 ms. (1166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (10796 resets) in 340 ms. (1173 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (10819 resets) in 345 ms. (1156 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (10758 resets) in 354 ms. (1126 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (10724 resets) in 350 ms. (1139 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (10866 resets) in 357 ms. (1117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (10873 resets) in 353 ms. (1129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (10815 resets) in 347 ms. (1149 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (10752 resets) in 346 ms. (1152 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (10812 resets) in 354 ms. (1126 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (10831 resets) in 346 ms. (1152 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (10827 resets) in 345 ms. (1156 steps per ms) remains 26/30 properties
BEST_FIRST walk for 400002 steps (10813 resets) in 337 ms. (1183 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (10807 resets) in 342 ms. (1166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (10833 resets) in 335 ms. (1190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (10795 resets) in 344 ms. (1159 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (10793 resets) in 334 ms. (1194 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (10776 resets) in 335 ms. (1190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (10796 resets) in 333 ms. (1197 steps per ms) remains 26/26 properties
[2024-05-31 22:21:01] [INFO ] Flow matrix only has 165 transitions (discarded 19 similar events)
// Phase 1: matrix 165 rows 77 cols
[2024-05-31 22:21:01] [INFO ] Computed 9 invariants in 4 ms
[2024-05-31 22:21:01] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 6/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 45/77 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 165/242 variables, 77/86 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 93 constraints, problems are : Problem set: 0 solved, 26 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 6/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 45/77 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 165/242 variables, 77/86 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 26/119 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 2 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 15/134 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/242 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 147 constraints, problems are : Problem set: 0 solved, 26 unsolved in 2586 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 28/28 constraints]
After SMT, in 2989ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 17 different solutions.
Parikh walk visited 23 properties in 1317 ms.
Support contains 3 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 184/184 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 77 transition count 182
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 75 transition count 181
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 31 place count 49 transition count 129
Iterating global reduction 2 with 26 rules applied. Total rules applied 57 place count 49 transition count 129
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 45 transition count 121
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 45 transition count 121
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 42 transition count 112
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 42 transition count 112
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 39 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 39 transition count 106
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 95 place count 39 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 38 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 36 transition count 96
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 36 transition count 175
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 107 place count 35 transition count 171
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 108 place count 34 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 34 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 33 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 33 transition count 127
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 123 place count 33 transition count 115
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 132 place count 33 transition count 115
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 140 place count 33 transition count 115
Applied a total of 140 rules in 30 ms. Remains 33 /77 variables (removed 44) and now considering 115/184 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 33/77 places, 115/184 transitions.
RANDOM walk for 2628853 steps (262464 resets) in 13030 ms. (201 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 131 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 26354 ms.
ITS solved all properties within timeout

BK_STOP 1717194071711

--------------------
content from stderr:

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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-12"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ltsminxred"
echo " Input is HealthRecord-PT-12, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r498-tall-171640618000493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-12.tgz
mv HealthRecord-PT-12 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;