fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r266-tall-174931350500313
Last Updated
June 24, 2025

About the Execution of 2024-gold for MedleyB-PT-B10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15688.360 210709.00 546091.00 346.80 F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r266-tall-174931350500313.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 gold2024
Input is MedleyB-PT-B10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-tall-174931350500313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 36M
-rw-r--r-- 1 mcc users 8.1K Jun 6 09:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 6 09:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 6 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 6 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 12:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 09:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 6 09:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 6 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 6 09:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 36M Jun 5 20:08 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1749324178383

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyB-PT-B10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-07 19:22:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-07 19:22:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 19:23:01] [INFO ] Load time of PNML (sax parser for PT used): 1536 ms
[2025-06-07 19:23:01] [INFO ] Transformed 1234 places.
[2025-06-07 19:23:01] [INFO ] Transformed 41201 transitions.
[2025-06-07 19:23:01] [INFO ] Found NUPN structural information;
[2025-06-07 19:23:01] [INFO ] Parsed PT model containing 1234 places and 41201 transitions and 720567 arcs in 1920 ms.
Graph (trivial) has 1260 edges and 1234 vertex of which 180 / 1234 are part of one of the 27 SCC in 13 ms
Free SCC test removed 153 places
Structural test allowed to assert that 788 places are NOT stable. Took 148 ms.
Ensure Unique test removed 171 transitions
Reduce redundant transitions removed 171 transitions.
RANDOM walk for 40000 steps (257 resets) in 4142 ms. (9 steps per ms) remains 446/446 properties
BEST_FIRST walk for 401 steps (8 resets) in 14 ms. (26 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 31 ms. (12 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 37 ms. (10 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 37 ms. (10 steps per ms) remains 446/446 properties
BEST_FIRST walk for 402 steps (8 resets) in 37 ms. (10 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 48 ms. (8 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 27 ms. (14 steps per ms) remains 446/446 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 446/446 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 446/446 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 446/446 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 446/446 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 446/446 properties
Interrupted probabilistic random walk after 27588 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :77 out of 446
Probabilistic random walk after 27588 steps, saw 9848 distinct states, run finished after 3006 ms. (steps per millisecond=9 ) properties seen :77
[2025-06-07 19:23:06] [INFO ] Flow matrix only has 41004 transitions (discarded 26 similar events)
// Phase 1: matrix 41004 rows 1081 cols
[2025-06-07 19:23:07] [INFO ] Computed 10 invariants in 772 ms
[2025-06-07 19:23:08] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 369/369 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Error getting values : (error "ParserException while parsing response: ((s12 (/ 1.0 2.0))
(s13 (/ 1.0 2.0))
(s14 (/ 1.0 2.0))
(s15 (/ 1.0 2.0))
(s16 (/ 1.0 2.0))
(s20 (/ 1.0 2.0))
(s47 (/ 1.0 2.0))
(s48 (/ 1.0 2.0))
(s52 (/ 1.0 2.0))
(s53 (/ 1.0 2.0))
(s54 (/ 1.0 2.0))
(s55 (/ 1.0 2.0))
(s56 (/ 1.0 2.0))
(s57 (/ 1.0 2.0))
(s58 (/ 1.0 2.0))
(s59 (/ 1.0 2.0))
(s60 (/ 1.0 2.0))
(s61 (/ 1.0 2.0))
(s62 (/ 1.0 2.0))
(s74 (/ 1.0 2.0))
(s86 (/ 1.0 2.0))
(s87 (/ 1.0 2.0))
(s91 (/ 1.0 2.0))
(s92 (/ 1.0 2.0))
(s93 (/ 1.0 2.0))
(s94 (/ 1.0 2.0))
(s95 (/ 1.0 2.0))
(s96 (/ 1.0 2.0))
(s97 (/ 1.0 2.0))
(s98 (/ 1.0 2.0))
(s99 (/ 1.0 2.0))
(s100 (/ 1.0 2.0))
(s101 (/ 1.0 2.0))
(s102 (/ 1.0 2.0))
(s103 (/ 1.0 2.0))
(s104 (/ 1.0 2.0))
(s105 (/ 1.0 2.0))
(s106 (/ 1.0 2.0))
(s108 (/ 1.0 2.0))
(s112 (/ 1.0 2.0))
(s129 (/ 1.0 2.0))
(s130 (/ 1.0 2.0))
(s131 (/ 1.0 2.0))
(s132 (/ 1.0 2.0))
(s133 (/ 1.0 2.0))
(s137 (/ 1.0 2.0))
(s152 (/ 1.0 2.0))
(s164 (/ 1.0 2.0))
(s165 (/ 1.0 2.0))
(s169 (/ 1.0 2.0))
(s170 (/ 1.0 2.0))
(s171 (/ 1.0 2.0))
(s172 (/ 1.0 2.0))
(s173 (/ 1.0 2.0))
(s174 (/ 1.0 2.0))
(s175 (/ 1.0 2.0))
(s176 (/ 1.0 2.0))
(s177 (/ 1.0 2.0))
(s178 (/ 1.0 2.0))
(s179 (/ 1.0 2.0))
(s191 (/ 1.0 2.0))
(s203 (/ 1.0 2.0))
(s204 (/ 1.0 2.0))
(s208 (/ 1.0 2.0))
(s209 (/ 1.0 2.0))
(s210 (/ 1.0 2.0))
(s211 (/ 1.0 2.0))
(s212 (/ 1.0 2.0))
(s213 (/ 1.0 2.0))
(s214 (/ 1.0 2.0))
(s215 (/ 1.0 2.0))
(s216 (/ 1.0 2.0))
(s217 (/ 1.0 2.0))
(s218 (/ 1.0 2.0))
(s219 (/ 1.0 2.0))
(s220 (/ 1.0 2.0))
(s221 (/ 1.0 2.0))
(s222 (/ 1.0 2.0))
(s223 (/ 1.0 2.0))
(s225 (/ 1.0 2.0))
(s229 (/ 1.0 2.0))
(s246 (/ 1.0 2.0))
(s247 (/ 1.0 2.0))
(s248 (/ 1.0 2.0))
(s249 (/ 1.0 2.0))
(s250 (/ 1.0 2.0))
(s254 (/ 1.0 2.0))
(s269 (/ 1.0 2.0))
(s281 (/ 1.0 2.0))
(s282 (/ 1.0 2.0))
(s286 (/ 1.0 2.0))
(s287 (/ 1.0 2.0))
(s288 (/ 1.0 2.0))
(s289 (/ 1.0 2.0))
(s290 (/ 1.0 2.0))
(s291 (/ 1.0 2.0))
(s292 (/ 1.0 2.0))
(s293 (/ 1.0 2.0))
(s294 (/ 1.0 2.0))
(s295 (/ 1.0 2.0))
(s296 (/ 1.0 2.0))
(s308 (/ 1.0 2.0))
(s320 (/ 1.0 2.0))
(s321 (/ 1.0 2.0))
(s325 (/ 1.0 2.0))
(s326 (/ 1.0 2.0))
(s327 (/ 1.0 2.0))
(s328 (/ 1.0 2.0))
(s329 (/ 1.0 2.0))
(s330 (/ 1.0 2.0))
(s331 (/ 1.0 2.0))
(s332 (/ 1.0 2.0))
(s333 (/ 1.0 2.0))
(s334 (/ 1.0 2.0))
(s335 (/ 1.0 2.0))
(s336 (/ 1.0 2.0))
(s337 (/ 1.0 2.0))
(s338 (/ 1.0 2.0))
(s339 (/ 1.0 2.0))
(s340 (/ 1.0 2.0))
(s342 (/ 1.0 2.0))
(s346 (/ 1.0 2.0))
(s363 (/ 1.0 2.0))
(s364 (/ 1.0 2.0))
(s365 (/ 1.0 2.0))
(s366 (/ 1.0 2.0))
(s367 (/ 1.0 2.0))
(s371 (/ 1.0 2.0))
(s386 (/ 1.0 2.0))
(s398 (/ 1.0 2.0))
(s399 (/ 1.0 2.0))
(s403 (/ 1.0 2.0))
(s404 (/ 1.0 2.0))
(s405 (/ 1.0 2.0))
(s406 (/ 1.0 2.0))
(s407 (/ 1.0 2.0))
(s408 (/ 1.0 2.0))
(s409 (/ 1.0 2.0))
(s410 (/ 1.0 2.0))
(s411 (/ 1.0 2.0))
(s412 (/ 1.0 2.0))
(s413 (/ 1.0 2.0))
(s425 (/ 1.0 2.0))
(s437 (/ 1.0 2.0))
(s438 (/ 1.0 2.0))
(s442 (/ 1.0 2.0))
(s443 (/ 1.0 2.0))
(s444 (/ 1.0 2.0))
(s445 (/ 1.0 2.0))
(s446 (/ 1.0 2.0))
(s447 (/ 1.0 2.0))
(s448 (/ 1.0 2.0))
(s449 (/ 1.0 2.0))
(s450 (/ 1.0 2.0))
(s451 (/ 1.0 2.0))
(s452 (/ 1.0 2.0))
(s453 (/ 1.0 2.0))
(s454 (/ 1.0 2.0))
(s455 (/ 1.0 2.0))
(s456 (/ 1.0 2.0))
(s457 (/ 1.0 2.0))
(s459 (/ 1.0 2.0))
(s463 (/ 1.0 2.0))
(s480 (/ 1.0 2.0))
(s481 (/ 1.0 2.0))
(s482 (/ 1.0 2.0))
(s483 (/ 1.0 2.0))
(s484 (/ 1.0 2.0))
(s488 (/ 1.0 2.0))
(s503 (/ 1.0 2.0))
(s515 (/ 1.0 2.0))
(s516 (/ 1.0 2.0))
(s520 (/ 1.0 2.0))
(s521 (/ 1.0 2.0))
(s522 (/ 1.0 2.0))
(s523 (/ 1.0 2.0))
(s524 (/ 1.0 2.0))
(s525 (/ 1.0 2.0))
(s526 (/ 1.0 2.0))
(s527 (/ 1.0 2.0))
(s528 (/ 1.0 2.0))
(s529 (/ 1.0 2.0))
(s530 (/ 1.0 2.0))
(s542 (/ 1.0 2.0))
(s554 (/ 1.0 2.0))
(s555 (/ 1.0 2.0))
(s559 (/ 1.0 2.0))
(s560 (/ 1.0 2.0))
(s561 (/ 1.0 2.0))
(s562 (/ 1.0 2.0))
(s563 (/ 1.0 2.0))
(s564 (/ 1.0 2.0))
(s565 (/ 1.0 2.0))
(s566 (/ 1.0 2.0))
(s567 (/ 1.0 2.0))
(s568 (/ 1.0 2.0))
(s569 (/ 1.0 2.0))
(s570 (/ 1.0 2.0))
(s571 (/ 1.0 2.0))
(s572 (/ 1.0 2.0))
(s573 (/ 1.0 2.0))
(s574 (/ 1.0 2.0))
(s576 (/ 1.0 2.0))
(s580 (/ 1.0 2.0))
(s597 (/ 1.0 2.0))
(s598 (/ 1.0 2.0))
(s599 (/ 1.0 2.0))
(s600 (/ 1.0 2.0))
(s601 (/ 1.0 2.0))
(s605 (/ 1.0 2.0))
(s620 (/ 1.0 2.0))
(s632 (/ 1.0 2.0))
(s633 (/ 1.0 2.0))
(s637 (/ 1.0 2.0))
(s638 (/ 1.0 2.0))
(s639 (/ 1.0 2.0))
(s640 (/ 1.0 2.0))
(s641 (/ 1.0 2.0))
(s642 (/ 1.0 2.0))
(s643 (/ 1.0 2.0))
(s644 (/ 1.0 2.0))
(s645 (/ 1.0 2.0))
(s646 (/ 1.0 2.0))
(s647 (/ 1.0 2.0))
(s659 (/ 1.0 2.0))
(s671 (/ 1.0 2.0))
(s672 (/ 1.0 2.0))
(s676 (/ 1.0 2.0))
(s677 (/ 1.0 2.0))
(s678 (/ 1.0 2.0))
(s679 (/ 1.0 2.0))
(s680 (/ 1.0 2.0))
(s681 (/ 1.0 2.0))
(s682 (/ 1.0 2.0))
(s683 (/ 1.0 2.0))
(s684 (/ 1.0 2.0))
(s685 (/ 1.0 2.0))
(s686 (/ 1.0 2.0))
(s687 (/ 1.0 2.0))
(s688 (/ 1.0 2.0))
(s689 (/ 1.0 2.0))
(s690 (/ 1.0 2.0))
(s691 (/ 1.0 2.0))
(s693 (/ 1.0 2.0))
(s697 (/ 1.0 2.0))
(s714 (/ 1.0 2.0))
(s715 (/ 1.0 2.0))
(s716 (/ 1.0 2.0))
(s717 (/ 1.0 2.0))
(s718 (/ 1.0 2.0))
(s722 (/ 1.0 2.0))
(s737 (/ 1.0 2.0))
(s749 (/ 1.0 2.0))
(s750 (/ 1.0 2.0))
(s754 (/ 1.0 2.0))
(s755 (/ 1.0 2.0))
(s756 (/ 1.0 2.0))
(s757 (/ 1.0 2.0))
(s758 (/ 1.0 2.0))
(s759 (/ 1.0 2.0))
(s760 (/ 1.0 2.0))
(s761 (/ 1.0 2.0))
(s762 (/ 1.0 2.0))
(s763 (/ 1.0 2.0))
(s764 (/ 1.0 2.0))
(s776 (/ 1.0 2.0))
(s788 (/ 1.0 2.0))
(s789 (/ 1.0 2.0))
(s793 (/ 1.0 2.0))
(s794 (/ 1.0 2.0))
(s795 (/ 1.0 2.0))
(s796 (/ 1.0 2.0))
(s797 (/ 1.0 2.0))
(s798 (/ 1.0 2.0))
(s799 (/ 1.0 2.0))
(s800 (/ 1.0 2.0))
(s801 (/ 1.0 2.0))
(s802 (/ 1.0 2.0))
(s803 (/ 1.0 2.0))
(s804 (/ 1.0 2.0))
(s805 (/ 1.0 2.0))
(s806 (/ 1.0 2.0))
(s807 (/ 1.0 2.0))
(s808 (/ 1.0 2.0))
(s810 (/ 1.0 2.0))
(s814 (/ 1.0 2.0))
(s831 (/ 1.0 2.0))
(s832 (/ 1.0 2.0))
(s833 (/ 1.0 2.0))
(s834 (/ 1.0 2.0))
(s835 (/ 1.0 2.0))
(s839 (/ 1.0 2.0))
(s854 (/ 1.0 2.0))
(s866 (/ 1.0 2.0))
(s867 (/ 1.0 2.0))
(s871 (/ 1.0 2.0))
(s872 (/ 1.0 2.0))
(s873 (/ 1.0 2.0))
(s874 (/ 1.0 2.0))
(s875 (/ 1.0 2.0))
(s876 (/ 1.0 2.0))
(s877 (/ 1.0 2.0))
(s878 (/ 1.0 2.0))
(s879 (/ 1.0 2.0))
(s880 (/ 1.0 2.0))
(s881 (/ 1.0 2.0))
(s893 (/ 1.0 2.0))
(s905 (/ 1.0 2.0))
(s906 (/ 1.0 2.0))
(s910 (/ 1.0 2.0))
(s911 (/ 1.0 2.0))
(s912 (/ 1.0 2.0))
(s913 (/ 1.0 2.0))
(s914 (/ 1.0 2.0))
(s915 (/ 1.0 2.0))
(s916 (/ 1.0 2.0))
(s917 (/ 1.0 2.0))
(s918 (/ 1.0 2.0))
(s919 (/ 1.0 2.0))
(s920 (/ 1.0 2.0))
(s921 (/ 1.0 2.0))
(s922 (/ 1.0 2.0))
(s923 (/ 1.0 2.0))
(s924 (/ 1.0 2.0))
(s925 (/ 1.0 2.0))
(s927 (/ 1.0 2.0))
(s931 (/ 1.0 2.0))
(s948 (/ 1.0 2.0))
(s949 (/ 1.0 2.0))
(s950 (/ 1.0 2.0))
(s951 (/ 1.0 2.0))
(s952 (/ 1.0 2.0))
(s956 (/ 1.0 2.0))
(s971 (/ 1.0 2.0))
(s983 (/ 1.0 2.0))
(s984 (/ 1.0 2.0))
(s988 (/ 1.0 2.0))
(s989 (/ 1.0 2.0))
(s990 (/ 1.0 2.0))
(s991 (/ 1.0 2.0))
(s992 (/ 1.0 2.0))
(s993 (/ 1.0 2.0))
(s994 (/ 1.0 2.0))
(s995 (/ 1.0 2.0))
(s996 (/ 1.0 2.0))
(s997 (/ 1.0 2.0))
(s998 (/ 1.0 2.0))
(s1010 (/ 1.0 2.0))
(s1022 (/ 1.0 2.0))
(s1023 timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/42085 variables, and 369 constraints, problems are : Problem set: 0 solved, 369 unsolved in 5116 ms.
Refiners :[Domain max(s): 369/1081 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1081 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 369/325 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 369/369 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 712/1081 variables, 10/379 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1081 variables, 712/1091 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2025-06-07 19:23:43] [INFO ] Deduced a trap composed of 178 places in 23879 ms of which 76 ms to minimize.
SMT process timed out in 36135ms, After SMT, problems are : Problem set: 0 solved, 369 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 369 out of 1081 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1081/1081 places, 41030/41030 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 533 transitions
Trivial Post-agglo rules discarded 533 transitions
Performed 533 trivial Post agglomeration. Transition count delta: 533
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 1081 transition count 40470
Reduce places removed 533 places and 0 transitions.
Iterating post reduction 1 with 533 rules applied. Total rules applied 1093 place count 548 transition count 40470
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 1093 place count 548 transition count 40452
Deduced a syphon composed of 18 places in 27 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 1129 place count 530 transition count 40452
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1132 place count 527 transition count 40449
Iterating global reduction 2 with 3 rules applied. Total rules applied 1135 place count 527 transition count 40449
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 14 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 1175 place count 507 transition count 40429
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 21 places in 38 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 1217 place count 486 transition count 40446
Free-agglomeration rule applied 70 times.
Iterating global reduction 2 with 70 rules applied. Total rules applied 1287 place count 486 transition count 40376
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 1357 place count 416 transition count 40376
Applied a total of 1357 rules in 16587 ms. Remains 416 /1081 variables (removed 665) and now considering 40376/41030 (removed 654) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16610 ms. Remains : 416/1081 places, 40376/41030 transitions.
RANDOM walk for 9441 steps (2 resets) in 120976 ms. (0 steps per ms) remains 59/369 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5739 ms. (69 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4797 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4786 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4756 ms. (84 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4777 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4789 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4807 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4789 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4752 ms. (84 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4922 ms. (81 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4787 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4759 ms. (84 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4743 ms. (84 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4782 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4772 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4833 ms. (82 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4774 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4919 ms. (81 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4792 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4775 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4762 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4741 ms. (84 steps per ms) remains 57/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4749 ms. (84 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4796 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4744 ms. (84 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4784 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4894 ms. (81 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4750 ms. (84 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4743 ms. (84 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4787 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4801 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4804 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4780 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4835 ms. (82 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4752 ms. (84 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4826 ms. (82 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4779 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4764 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4789 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4817 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4753 ms. (84 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4764 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4837 ms. (82 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4843 ms. (82 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4889 ms. (81 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4827 ms. (82 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4846 ms. (82 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4821 ms. (82 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4810 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4830 ms. (82 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4860 ms. (82 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4826 ms. (82 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4768 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4811 ms. (83 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5445 ms. (73 steps per ms) remains 56/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4801 ms. (83 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4748 ms. (84 steps per ms) remains 56/56 properties
[2025-06-07 19:25:39] [INFO ] Flow matrix only has 40375 transitions (discarded 1 similar events)
// Phase 1: matrix 40375 rows 416 cols
[2025-06-07 19:25:39] [INFO ] Computed 10 invariants in 452 ms
[2025-06-07 19:25:41] [INFO ] State equation strengthened by 6614 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 219/275 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 141/416 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 40375/40791 variables, 416/426 constraints. Problems are: Problem set: 0 solved, 56 unsolved
SMT process timed out in 47426ms, After SMT, problems are : Problem set: 0 solved, 56 unsolved
Fused 56 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 56 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 40376/40376 transitions.
Graph (complete) has 1170 edges and 416 vertex of which 402 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.75 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 402 transition count 40171
Reduce places removed 191 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 209 rules applied. Total rules applied 408 place count 211 transition count 40153
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 417 place count 202 transition count 40153
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 417 place count 202 transition count 40141
Deduced a syphon composed of 12 places in 12 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 441 place count 190 transition count 40141
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 507 place count 124 transition count 40075
Iterating global reduction 3 with 66 rules applied. Total rules applied 573 place count 124 transition count 40075
Ensure Unique test removed 38088 transitions
Reduce isomorphic transitions removed 38088 transitions.
Iterating post reduction 3 with 38088 rules applied. Total rules applied 38661 place count 124 transition count 1987
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 38662 place count 123 transition count 1986
Iterating global reduction 4 with 1 rules applied. Total rules applied 38663 place count 123 transition count 1986
Performed 10 Post agglomeration using F-continuation condition with reduction of 264 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 38683 place count 113 transition count 1712
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 38730 place count 113 transition count 1665
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 38738 place count 105 transition count 1657
Iterating global reduction 5 with 8 rules applied. Total rules applied 38746 place count 105 transition count 1657
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 38753 place count 105 transition count 1650
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 38771 place count 96 transition count 1641
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 38780 place count 96 transition count 1632
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 38789 place count 87 transition count 1623
Iterating global reduction 7 with 9 rules applied. Total rules applied 38798 place count 87 transition count 1623
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 7 with 511 rules applied. Total rules applied 39309 place count 87 transition count 1112
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 8 with 29 rules applied. Total rules applied 39338 place count 87 transition count 1083
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 39348 place count 82 transition count 1078
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 39355 place count 82 transition count 1071
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 39357 place count 82 transition count 1071
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 39358 place count 81 transition count 1070
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 39359 place count 80 transition count 1070
Performed 9 Post agglomeration using F-continuation condition with reduction of 738 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 21 rules applied. Total rules applied 39380 place count 68 transition count 323
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 189 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 9 with 198 rules applied. Total rules applied 39578 place count 68 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 10 with 32 rules applied. Total rules applied 39610 place count 68 transition count 93
Applied a total of 39610 rules in 2154 ms. Remains 68 /416 variables (removed 348) and now considering 93/40376 (removed 40283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2155 ms. Remains : 68/416 places, 93/40376 transitions.
RANDOM walk for 425 steps (4 resets) in 11 ms. (35 steps per ms) remains 0/56 properties
Able to resolve query StableMarking after proving 448 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 209333 ms.
ITS solved all properties within timeout

BK_STOP 1749324389092

--------------------
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="MedleyB-PT-B10"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is MedleyB-PT-B10, 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 r266-tall-174931350500313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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