About the Execution of 2024-gold for FireWire-PT-09
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15685.740 | 78290.00 | 205075.00 | 379.90 | 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.r098-smll-174860112200193.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 FireWire-PT-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-smll-174860112200193
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 100K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1748679428770
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 08:17:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 08:17:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:17:11] [INFO ] Load time of PNML (sax parser for PT used): 452 ms
[2025-05-31 08:17:11] [INFO ] Transformed 130 places.
[2025-05-31 08:17:11] [INFO ] Transformed 408 transitions.
[2025-05-31 08:17:11] [INFO ] Found NUPN structural information;
[2025-05-31 08:17:11] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 707 ms.
Structural test allowed to assert that 10 places are NOT stable. Took 16 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
RANDOM walk for 40000 steps (2141 resets) in 4300 ms. (9 steps per ms) remains 51/120 properties
BEST_FIRST walk for 4004 steps (64 resets) in 39 ms. (100 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (60 resets) in 56 ms. (70 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (54 resets) in 68 ms. (58 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (70 resets) in 31 ms. (125 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (53 resets) in 43 ms. (90 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4001 steps (56 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (57 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (66 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (59 resets) in 29 ms. (133 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (48 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (55 resets) in 28 ms. (138 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4003 steps (55 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (48 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (45 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (56 resets) in 39 ms. (100 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (54 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (66 resets) in 21 ms. (182 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (53 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (52 resets) in 28 ms. (138 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (56 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (64 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (65 resets) in 14 ms. (266 steps per ms) remains 46/48 properties
BEST_FIRST walk for 4004 steps (37 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (51 resets) in 16 ms. (235 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (52 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (58 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (41 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (67 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (39 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (56 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (53 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (51 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (43 resets) in 29 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (64 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (59 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (51 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (54 resets) in 25 ms. (154 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (50 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (50 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (53 resets) in 28 ms. (137 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (48 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (49 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (47 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (58 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (55 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (60 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (63 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (64 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (47 resets) in 35 ms. (111 steps per ms) remains 45/45 properties
[2025-05-31 08:17:13] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
// Phase 1: matrix 320 rows 130 cols
[2025-05-31 08:17:14] [INFO ] Computed 8 invariants in 24 ms
[2025-05-31 08:17:14] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 67/112 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 67/117 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 16/128 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 16/136 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 319/447 variables, 128/264 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 44/308 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 2/449 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (OVERLAPS) 1/450 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 16 (OVERLAPS) 0/450 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 313 constraints, problems are : Problem set: 0 solved, 45 unsolved in 3545 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 67/112 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 67/117 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2025-05-31 08:17:18] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 19 ms to minimize.
[2025-05-31 08:17:18] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 3 ms to minimize.
[2025-05-31 08:17:18] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 16/128 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 16/139 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 319/447 variables, 128/267 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 44/311 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 45/356 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2025-05-31 08:17:19] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2025-05-31 08:17:20] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (OVERLAPS) 2/449 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/449 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 17 (OVERLAPS) 1/450 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 363 constraints, problems are : Problem set: 0 solved, 45 unsolved in 5012 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 5/5 constraints]
After SMT, in 8717ms problems are : Problem set: 0 solved, 45 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 352/352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 349
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 128 transition count 345
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 128 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 128 transition count 343
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 125 transition count 349
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 21 place count 125 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 30 place count 125 transition count 334
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 124 transition count 333
Applied a total of 31 rules in 120 ms. Remains 124 /130 variables (removed 6) and now considering 333/352 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 124/130 places, 333/352 transitions.
RANDOM walk for 4000000 steps (232199 resets) in 25546 ms. (156 steps per ms) remains 28/45 properties
BEST_FIRST walk for 400004 steps (5652 resets) in 573 ms. (696 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (5717 resets) in 563 ms. (709 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (5580 resets) in 618 ms. (646 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400003 steps (5498 resets) in 536 ms. (744 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5641 resets) in 542 ms. (736 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5560 resets) in 603 ms. (662 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5410 resets) in 594 ms. (672 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5703 resets) in 563 ms. (709 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5510 resets) in 566 ms. (705 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5715 resets) in 540 ms. (739 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5697 resets) in 579 ms. (689 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5572 resets) in 556 ms. (718 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (5839 resets) in 600 ms. (665 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5709 resets) in 549 ms. (727 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5663 resets) in 576 ms. (693 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5640 resets) in 549 ms. (727 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5599 resets) in 541 ms. (738 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5587 resets) in 525 ms. (760 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5778 resets) in 525 ms. (760 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5854 resets) in 546 ms. (731 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5654 resets) in 542 ms. (736 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5596 resets) in 554 ms. (720 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5684 resets) in 555 ms. (719 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5704 resets) in 545 ms. (732 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5745 resets) in 544 ms. (733 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5526 resets) in 576 ms. (693 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400000 steps (5803 resets) in 530 ms. (753 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5615 resets) in 539 ms. (740 steps per ms) remains 27/27 properties
[2025-05-31 08:17:35] [INFO ] Flow matrix only has 305 transitions (discarded 28 similar events)
// Phase 1: matrix 305 rows 124 cols
[2025-05-31 08:17:35] [INFO ] Computed 8 invariants in 5 ms
[2025-05-31 08:17:35] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 35/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 162/224 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 110/334 variables, 13/78 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 23/101 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/335 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 90/425 variables, 44/147 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 22/171 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 4/429 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/429 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (OVERLAPS) 0/429 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 177 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1544 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 35/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-05-31 08:17:37] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2025-05-31 08:17:37] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2025-05-31 08:17:37] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2025-05-31 08:17:37] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 162/224 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 110/334 variables, 13/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 23/107 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 25/132 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 1/335 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 90/425 variables, 44/178 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/425 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 22/202 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (OVERLAPS) 4/429 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/429 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/429 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 22 (OVERLAPS) 0/429 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 208 constraints, problems are : Problem set: 0 solved, 27 unsolved in 3102 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 4/4 constraints]
After SMT, in 4680ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 2075 ms.
Support contains 27 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 333/333 transitions.
Applied a total of 0 rules in 15 ms. Remains 124 /124 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 124/124 places, 333/333 transitions.
RANDOM walk for 4000000 steps (231439 resets) in 18361 ms. (217 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400003 steps (5605 resets) in 505 ms. (790 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5674 resets) in 513 ms. (778 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5712 resets) in 521 ms. (766 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5686 resets) in 520 ms. (767 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5770 resets) in 519 ms. (769 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5547 resets) in 512 ms. (779 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (5589 resets) in 508 ms. (785 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5481 resets) in 505 ms. (790 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5636 resets) in 509 ms. (784 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5772 resets) in 520 ms. (767 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5664 resets) in 529 ms. (754 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5656 resets) in 517 ms. (772 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (5588 resets) in 505 ms. (790 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5538 resets) in 521 ms. (766 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5436 resets) in 508 ms. (785 steps per ms) remains 24/26 properties
BEST_FIRST walk for 400004 steps (5678 resets) in 494 ms. (808 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5593 resets) in 493 ms. (809 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5582 resets) in 490 ms. (814 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (5655 resets) in 488 ms. (818 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5727 resets) in 495 ms. (806 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5606 resets) in 498 ms. (801 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5623 resets) in 494 ms. (808 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5699 resets) in 523 ms. (763 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5582 resets) in 495 ms. (806 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5567 resets) in 487 ms. (819 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5506 resets) in 511 ms. (781 steps per ms) remains 24/24 properties
[2025-05-31 08:17:50] [INFO ] Flow matrix only has 305 transitions (discarded 28 similar events)
[2025-05-31 08:17:50] [INFO ] Invariant cache hit.
[2025-05-31 08:17:50] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 30/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 156/210 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 120/330 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 3/333 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 92/425 variables, 46/147 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 22/171 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 4/429 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/429 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/429 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 0/429 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 177 constraints, problems are : Problem set: 0 solved, 24 unsolved in 1499 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 30/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 156/210 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 120/330 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 24/120 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-05-31 08:17:52] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 3/333 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-05-31 08:17:53] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-05-31 08:17:53] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/333 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 92/425 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 22/198 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (OVERLAPS) 4/429 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/429 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/429 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (OVERLAPS) 0/429 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 204 constraints, problems are : Problem set: 0 solved, 24 unsolved in 4178 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
After SMT, in 5703ms problems are : Problem set: 0 solved, 24 unsolved
Parikh walk visited 0 properties in 1603 ms.
Support contains 24 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 333/333 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 332
Applied a total of 2 rules in 16 ms. Remains 123 /124 variables (removed 1) and now considering 332/333 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 123/124 places, 332/333 transitions.
RANDOM walk for 4000000 steps (232451 resets) in 17982 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5756 resets) in 609 ms. (655 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (5609 resets) in 529 ms. (754 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5643 resets) in 837 ms. (477 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5521 resets) in 766 ms. (521 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5748 resets) in 517 ms. (772 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5666 resets) in 514 ms. (776 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5481 resets) in 514 ms. (776 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5613 resets) in 524 ms. (761 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5556 resets) in 514 ms. (776 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5677 resets) in 516 ms. (773 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (5576 resets) in 514 ms. (776 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5568 resets) in 516 ms. (773 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5588 resets) in 506 ms. (788 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5698 resets) in 519 ms. (769 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (5667 resets) in 598 ms. (667 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5727 resets) in 518 ms. (770 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (5618 resets) in 513 ms. (778 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5712 resets) in 518 ms. (770 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5487 resets) in 505 ms. (790 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5713 resets) in 514 ms. (776 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5565 resets) in 526 ms. (759 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5612 resets) in 513 ms. (778 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5523 resets) in 516 ms. (773 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5702 resets) in 516 ms. (773 steps per ms) remains 24/24 properties
Finished probabilistic random walk after 3247771 steps, run visited all 24 properties in 20795 ms. (steps per millisecond=156 )
Probabilistic random walk after 3247771 steps, saw 680844 distinct states, run finished after 20821 ms. (steps per millisecond=155 ) properties seen :24
Able to resolve query StableMarking after proving 121 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 75937 ms.
ITS solved all properties within timeout
BK_STOP 1748679507060
--------------------
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-09"
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 FireWire-PT-09, 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 r098-smll-174860112200193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-09.tgz
mv FireWire-PT-09 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 '
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 ;