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.r564-tall-171734907800183.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 FireWire-PT-16, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907800183
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 84K Jun 2 16:33 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 1717362185163

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:03:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 21:03:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:03:06] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-02 21:03:06] [INFO ] Transformed 254 places.
[2024-06-02 21:03:06] [INFO ] Transformed 368 transitions.
[2024-06-02 21:03:06] [INFO ] Found NUPN structural information;
[2024-06-02 21:03:06] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 213 ms.
Graph (trivial) has 218 edges and 254 vertex of which 19 / 254 are part of one of the 3 SCC in 4 ms
Free SCC test removed 16 places
Structural test allowed to assert that 59 places are NOT stable. Took 20 ms.
Ensure Unique test removed 17 transitions
Reduce redundant transitions removed 17 transitions.
RANDOM walk for 40000 steps (1095 resets) in 2851 ms. (14 steps per ms) remains 133/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 401 steps (8 resets) in 5 ms. (66 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
[2024-06-02 21:03:07] [INFO ] Flow matrix only has 349 transitions (discarded 2 similar events)
// Phase 1: matrix 349 rows 238 cols
[2024-06-02 21:03:07] [INFO ] Computed 5 invariants in 20 ms
[2024-06-02 21:03:07] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 78/211 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 78/215 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 27/238 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 27/243 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 348/586 variables, 238/481 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 1/587 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 587/587 variables, and 482 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5060 ms.
Refiners :[Domain max(s): 238/238 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 238/238 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 78/211 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 78/215 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-02 21:03:13] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 19 ms to minimize.
[2024-06-02 21:03:13] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:03:13] [INFO ] Deduced a trap composed of 111 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:03:13] [INFO ] Deduced a trap composed of 120 places in 80 ms of which 2 ms to minimize.
[2024-06-02 21:03:14] [INFO ] Deduced a trap composed of 87 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:03:14] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 2 ms to minimize.
[2024-06-02 21:03:14] [INFO ] Deduced a trap composed of 99 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:03:14] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:03:14] [INFO ] Deduced a trap composed of 114 places in 60 ms of which 2 ms to minimize.
[2024-06-02 21:03:14] [INFO ] Deduced a trap composed of 116 places in 64 ms of which 2 ms to minimize.
[2024-06-02 21:03:14] [INFO ] Deduced a trap composed of 113 places in 63 ms of which 3 ms to minimize.
[2024-06-02 21:03:14] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:03:14] [INFO ] Deduced a trap composed of 120 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:03:15] [INFO ] Deduced a trap composed of 114 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:03:15] [INFO ] Deduced a trap composed of 117 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:03:15] [INFO ] Deduced a trap composed of 110 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 16/231 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-02 21:03:15] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-06-02 21:03:15] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 2 ms to minimize.
[2024-06-02 21:03:15] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:03:16] [INFO ] Deduced a trap composed of 116 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-02 21:03:16] [INFO ] Deduced a trap composed of 112 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:03:17] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 211/587 variables, and 237 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5014 ms.
Refiners :[Domain max(s): 211/238 constraints, Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 0/238 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/133 constraints, Known Traps: 22/22 constraints]
After SMT, in 10176ms problems are : Problem set: 0 solved, 133 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 133 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 351/351 transitions.
Graph (complete) has 581 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 235 transition count 306
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 44 rules applied. Total rules applied 90 place count 194 transition count 303
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 192 transition count 303
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 92 place count 192 transition count 300
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 98 place count 189 transition count 300
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 185 transition count 296
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 185 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 185 transition count 295
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 135 place count 171 transition count 281
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 145 place count 166 transition count 283
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 153 place count 166 transition count 275
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 161 place count 158 transition count 275
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 162 place count 158 transition count 275
Applied a total of 162 rules in 69 ms. Remains 158 /238 variables (removed 80) and now considering 275/351 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 158/238 places, 275/351 transitions.
RANDOM walk for 4000000 steps (452380 resets) in 32869 ms. (121 steps per ms) remains 114/133 properties
BEST_FIRST walk for 40003 steps (1444 resets) in 127 ms. (312 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (1413 resets) in 133 ms. (298 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (1413 resets) in 112 ms. (354 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (1418 resets) in 101 ms. (392 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (1427 resets) in 105 ms. (377 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (1406 resets) in 101 ms. (392 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (1429 resets) in 103 ms. (384 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (1405 resets) in 164 ms. (242 steps per ms) remains 111/114 properties
BEST_FIRST walk for 40002 steps (1436 resets) in 159 ms. (250 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1433 resets) in 187 ms. (212 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (1444 resets) in 186 ms. (213 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1401 resets) in 233 ms. (170 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1432 resets) in 184 ms. (216 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40001 steps (1419 resets) in 136 ms. (291 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1433 resets) in 106 ms. (373 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1425 resets) in 99 ms. (400 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1449 resets) in 105 ms. (377 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1425 resets) in 101 ms. (392 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1411 resets) in 99 ms. (400 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (1433 resets) in 102 ms. (388 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40000 steps (1432 resets) in 104 ms. (380 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1442 resets) in 100 ms. (396 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1422 resets) in 102 ms. (388 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1428 resets) in 102 ms. (388 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1438 resets) in 103 ms. (384 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1398 resets) in 100 ms. (396 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40001 steps (1437 resets) in 100 ms. (396 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40001 steps (1427 resets) in 102 ms. (388 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1411 resets) in 100 ms. (396 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (1443 resets) in 98 ms. (404 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (1422 resets) in 98 ms. (404 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1439 resets) in 102 ms. (388 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40001 steps (1412 resets) in 199 ms. (200 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1415 resets) in 126 ms. (314 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40001 steps (1438 resets) in 100 ms. (396 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1411 resets) in 104 ms. (380 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1432 resets) in 100 ms. (396 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1446 resets) in 100 ms. (396 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1430 resets) in 99 ms. (400 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1441 resets) in 102 ms. (388 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1445 resets) in 98 ms. (404 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1433 resets) in 96 ms. (412 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40001 steps (1424 resets) in 98 ms. (404 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1410 resets) in 101 ms. (392 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1424 resets) in 99 ms. (400 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1420 resets) in 99 ms. (400 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1405 resets) in 98 ms. (404 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1448 resets) in 101 ms. (392 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1443 resets) in 101 ms. (392 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1414 resets) in 103 ms. (384 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1415 resets) in 104 ms. (380 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1416 resets) in 118 ms. (336 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (1430 resets) in 97 ms. (408 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (1432 resets) in 100 ms. (396 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1430 resets) in 99 ms. (400 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (1438 resets) in 101 ms. (392 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (1424 resets) in 98 ms. (404 steps per ms) remains 111/111 properties
// Phase 1: matrix 275 rows 158 cols
[2024-06-02 21:03:28] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 21:03:28] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 45/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 275/431 variables, 156/160 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 2/433 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/433 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 165 constraints, problems are : Problem set: 0 solved, 111 unsolved in 3438 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 158/158 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 45/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 21:03:32] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:03:32] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:03:32] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:03:32] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:03:32] [INFO ] Deduced a trap composed of 96 places in 67 ms of which 2 ms to minimize.
[2024-06-02 21:03:32] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:03:32] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:03:32] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:03:32] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 2 ms to minimize.
[2024-06-02 21:03:32] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:03:32] [INFO ] Deduced a trap composed of 92 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:03:32] [INFO ] Deduced a trap composed of 102 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:03:33] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 2 ms to minimize.
[2024-06-02 21:03:33] [INFO ] Deduced a trap composed of 93 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:03:33] [INFO ] Deduced a trap composed of 105 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:03:33] [INFO ] Deduced a trap composed of 102 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 21:03:33] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:03:34] [INFO ] Deduced a trap composed of 96 places in 64 ms of which 2 ms to minimize.
[2024-06-02 21:03:34] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 21:03:34] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 2 ms to minimize.
[2024-06-02 21:03:34] [INFO ] Deduced a trap composed of 107 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 21:03:35] [INFO ] Deduced a trap composed of 96 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:03:35] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 21:03:35] [INFO ] Deduced a trap composed of 93 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 21:03:36] [INFO ] Deduced a trap composed of 93 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 275/431 variables, 156/185 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 111/299 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 21:03:38] [INFO ] Deduced a trap composed of 105 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 14 (OVERLAPS) 2/433 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/433 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 16 (OVERLAPS) 0/433 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 302 constraints, problems are : Problem set: 0 solved, 111 unsolved in 16190 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 158/158 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 26/26 constraints]
After SMT, in 19655ms problems are : Problem set: 0 solved, 111 unsolved
Parikh walk visited 60 properties in 9888 ms.
Support contains 51 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 275/275 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 158 transition count 254
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 137 transition count 254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 42 place count 137 transition count 253
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 136 transition count 253
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 51 place count 129 transition count 246
Iterating global reduction 2 with 7 rules applied. Total rules applied 58 place count 129 transition count 246
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 78 place count 129 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 129 transition count 225
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 128 transition count 225
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 127 transition count 224
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 127 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 2 rules applied. Total rules applied 84 place count 127 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 85 place count 126 transition count 222
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 99 place count 119 transition count 215
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 117 place count 110 transition count 246
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 121 place count 110 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 134 place count 110 transition count 229
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 140 place count 110 transition count 223
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 146 place count 104 transition count 223
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 147 place count 104 transition count 223
Applied a total of 147 rules in 54 ms. Remains 104 /158 variables (removed 54) and now considering 223/275 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 104/158 places, 223/275 transitions.
RANDOM walk for 4000000 steps (452420 resets) in 20023 ms. (199 steps per ms) remains 49/51 properties
BEST_FIRST walk for 400003 steps (14388 resets) in 669 ms. (597 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (14266 resets) in 659 ms. (606 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (14320 resets) in 651 ms. (613 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (14305 resets) in 654 ms. (610 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (14304 resets) in 653 ms. (611 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (14305 resets) in 655 ms. (609 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (14328 resets) in 651 ms. (613 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400001 steps (14296 resets) in 650 ms. (614 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (14322 resets) in 646 ms. (618 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (14322 resets) in 647 ms. (617 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (14277 resets) in 637 ms. (626 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (14272 resets) in 646 ms. (618 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (14253 resets) in 640 ms. (624 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (14289 resets) in 643 ms. (621 steps per ms) remains 48/49 properties
BEST_FIRST walk for 400003 steps (14365 resets) in 627 ms. (636 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (14326 resets) in 639 ms. (625 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (14211 resets) in 637 ms. (626 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (14355 resets) in 641 ms. (623 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (14281 resets) in 636 ms. (627 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (14264 resets) in 669 ms. (597 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400001 steps (14338 resets) in 644 ms. (620 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14314 resets) in 639 ms. (625 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (14303 resets) in 637 ms. (626 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14321 resets) in 641 ms. (623 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (14302 resets) in 633 ms. (630 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14306 resets) in 641 ms. (623 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14262 resets) in 633 ms. (630 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (14242 resets) in 650 ms. (614 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400001 steps (14327 resets) in 646 ms. (618 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14335 resets) in 652 ms. (612 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14360 resets) in 640 ms. (624 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14315 resets) in 638 ms. (625 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400001 steps (14293 resets) in 637 ms. (626 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (14323 resets) in 635 ms. (628 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14300 resets) in 656 ms. (608 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14284 resets) in 642 ms. (622 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (14292 resets) in 643 ms. (621 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (14272 resets) in 658 ms. (606 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14278 resets) in 652 ms. (612 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (14271 resets) in 647 ms. (617 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14257 resets) in 655 ms. (609 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (14276 resets) in 658 ms. (606 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14287 resets) in 647 ms. (617 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (14279 resets) in 650 ms. (614 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14309 resets) in 646 ms. (618 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (14313 resets) in 648 ms. (616 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14242 resets) in 657 ms. (607 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (14330 resets) in 656 ms. (608 steps per ms) remains 48/48 properties
Finished probabilistic random walk after 22453 steps, run visited all 48 properties in 170 ms. (steps per millisecond=132 )
Probabilistic random walk after 22453 steps, saw 6967 distinct states, run finished after 175 ms. (steps per millisecond=128 ) properties seen :48
Able to resolve query StableMarking after proving 197 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 65358 ms.
ITS solved all properties within timeout

BK_STOP 1717362251695

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="FireWire-PT-16"
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 FireWire-PT-16, 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 r564-tall-171734907800183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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