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.r154-tall-174876825600378.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 Peterson-PT-3, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825600378
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 189K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 237K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 284K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 143K 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 1748844133098

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 06:02:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 06:02:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:02:14] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2025-06-02 06:02:14] [INFO ] Transformed 244 places.
[2025-06-02 06:02:14] [INFO ] Transformed 332 transitions.
[2025-06-02 06:02:14] [INFO ] Found NUPN structural information;
[2025-06-02 06:02:14] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 180 ms.
RANDOM walk for 40000 steps (8 resets) in 1707 ms. (23 steps per ms) remains 78/244 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
[2025-06-02 06:02:15] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2025-06-02 06:02:15] [INFO ] Computed 15 invariants in 13 ms
[2025-06-02 06:02:15] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 148/226 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 148/232 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 2/228 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 4/232 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 308/540 variables, 232/476 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 57/533 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 12/552 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 18 (OVERLAPS) 0/552 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 560 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4925 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 148/226 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 148/232 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2025-06-02 06:02:21] [INFO ] Deduced a trap composed of 97 places in 189 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 2/228 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 4/232 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2025-06-02 06:02:22] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2025-06-02 06:02:22] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2025-06-02 06:02:22] [INFO ] Deduced a trap composed of 121 places in 68 ms of which 1 ms to minimize.
[2025-06-02 06:02:22] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 2 ms to minimize.
[2025-06-02 06:02:23] [INFO ] Deduced a trap composed of 98 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:02:23] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:02:23] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 7/252 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (OVERLAPS) 308/540 variables, 232/484 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 57/541 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 78/619 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 78 unsolved
SMT process timed out in 10017ms, After SMT, problems are : Problem set: 0 solved, 78 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 78 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 244 transition count 278
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 190 transition count 278
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 108 place count 190 transition count 242
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 180 place count 154 transition count 242
Applied a total of 180 rules in 40 ms. Remains 154 /244 variables (removed 90) and now considering 242/332 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 154/244 places, 242/332 transitions.
RANDOM walk for 4000000 steps (8 resets) in 28471 ms. (140 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 613 ms. (651 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 607 ms. (657 steps per ms) remains 71/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 579 ms. (689 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (8 resets) in 579 ms. (689 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (8 resets) in 582 ms. (686 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (8 resets) in 576 ms. (693 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (8 resets) in 579 ms. (689 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (8 resets) in 581 ms. (687 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (8 resets) in 561 ms. (711 steps per ms) remains 67/71 properties
BEST_FIRST walk for 400004 steps (8 resets) in 534 ms. (747 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 539 ms. (740 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 531 ms. (751 steps per ms) remains 63/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 544 ms. (733 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 536 ms. (744 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 515 ms. (775 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 521 ms. (766 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 522 ms. (764 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 517 ms. (772 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 546 ms. (731 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 539 ms. (740 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 543 ms. (735 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 545 ms. (732 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 529 ms. (754 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 536 ms. (744 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 535 ms. (746 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 532 ms. (750 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 528 ms. (756 steps per ms) remains 59/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 523 ms. (763 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 516 ms. (773 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 519 ms. (769 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 526 ms. (759 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 525 ms. (760 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 521 ms. (766 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 522 ms. (764 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 527 ms. (757 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 520 ms. (767 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 523 ms. (763 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 522 ms. (764 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 520 ms. (767 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 529 ms. (754 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 525 ms. (760 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 530 ms. (753 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 532 ms. (750 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 625 ms. (638 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 560 ms. (713 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 526 ms. (759 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 521 ms. (766 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 532 ms. (750 steps per ms) remains 58/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 537 ms. (743 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 522 ms. (764 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 514 ms. (776 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 522 ms. (764 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 521 ms. (766 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 512 ms. (779 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 524 ms. (761 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 522 ms. (764 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 520 ms. (767 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 524 ms. (761 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 517 ms. (772 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 515 ms. (775 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 520 ms. (767 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 520 ms. (767 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 522 ms. (764 steps per ms) remains 58/58 properties
[2025-06-02 06:02:43] [INFO ] Flow matrix only has 218 transitions (discarded 24 similar events)
// Phase 1: matrix 218 rows 154 cols
[2025-06-02 06:02:43] [INFO ] Computed 15 invariants in 3 ms
[2025-06-02 06:02:43] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 76/134 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 76/138 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 4/138 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 4/142 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 218/360 variables, 142/296 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 57/353 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (OVERLAPS) 12/372 variables, 12/365 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 12/377 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/372 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/372 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 18 (OVERLAPS) 0/372 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 380 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2170 ms.
Refiners :[Domain max(s): 154/154 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 154/154 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 76/134 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 76/138 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 4/138 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 4/142 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 4 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 218/360 variables, 142/302 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 57/359 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 58/417 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 16 (OVERLAPS) 12/372 variables, 12/429 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/372 variables, 12/441 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/372 variables, 3/444 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2025-06-02 06:02:47] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:02:47] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2025-06-02 06:02:47] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 2 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/372 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:02:50] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:02:50] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/372 variables, 13/477 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2025-06-02 06:02:51] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:02:51] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/372 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2025-06-02 06:02:52] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/372 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2025-06-02 06:02:53] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:02:53] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/372 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2025-06-02 06:02:53] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/372 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/372 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 26 (OVERLAPS) 0/372 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 483 constraints, problems are : Problem set: 0 solved, 58 unsolved in 11758 ms.
Refiners :[Domain max(s): 154/154 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 154/154 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 45/45 constraints]
After SMT, in 13948ms problems are : Problem set: 0 solved, 58 unsolved
Parikh walk visited 11 properties in 1928 ms.
Support contains 47 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 242/242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 154 transition count 227
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 139 transition count 227
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 30 place count 139 transition count 221
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 42 place count 133 transition count 221
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 129 transition count 217
Applied a total of 50 rules in 17 ms. Remains 129 /154 variables (removed 25) and now considering 217/242 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 129/154 places, 217/242 transitions.
RANDOM walk for 4000000 steps (8 resets) in 20154 ms. (198 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 474 ms. (842 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 471 ms. (847 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 470 ms. (849 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 476 ms. (838 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 475 ms. (840 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 473 ms. (843 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 477 ms. (836 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 487 ms. (819 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 476 ms. (838 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 483 ms. (826 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 471 ms. (847 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 469 ms. (851 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 481 ms. (829 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 493 ms. (809 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 489 ms. (816 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 492 ms. (811 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 492 ms. (811 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 494 ms. (808 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 491 ms. (813 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 493 ms. (809 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 478 ms. (835 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 487 ms. (819 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 481 ms. (829 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 482 ms. (828 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 483 ms. (826 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 488 ms. (818 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 480 ms. (831 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 478 ms. (835 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 477 ms. (836 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 482 ms. (828 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 483 ms. (826 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 497 ms. (803 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 479 ms. (833 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 481 ms. (829 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 480 ms. (831 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 479 ms. (833 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 476 ms. (838 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 478 ms. (835 steps per ms) remains 46/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 476 ms. (838 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 471 ms. (847 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 467 ms. (854 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 477 ms. (836 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 477 ms. (836 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 477 ms. (836 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 479 ms. (833 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 478 ms. (835 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 479 ms. (833 steps per ms) remains 46/46 properties
Finished probabilistic random walk after 381975 steps, run visited all 46 properties in 1874 ms. (steps per millisecond=203 )
Probabilistic random walk after 381975 steps, saw 76568 distinct states, run finished after 1889 ms. (steps per millisecond=202 ) properties seen :46
Able to resolve query StableMarking after proving 244 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 58538 ms.
ITS solved all properties within timeout

BK_STOP 1748844192931

--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, 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 r154-tall-174876825600378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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