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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K 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 97K 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 1717361690160

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:54:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 20:54:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:54:51] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 20:54:51] [INFO ] Transformed 127 places.
[2024-06-02 20:54:51] [INFO ] Transformed 397 transitions.
[2024-06-02 20:54:51] [INFO ] Found NUPN structural information;
[2024-06-02 20:54:51] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 169 ms.
Structural test allowed to assert that 10 places are NOT stable. Took 7 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
RANDOM walk for 40000 steps (2211 resets) in 1989 ms. (20 steps per ms) remains 61/117 properties
BEST_FIRST walk for 4002 steps (59 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (45 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (72 resets) in 72 ms. (54 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (62 resets) in 54 ms. (72 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (48 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (70 resets) in 28 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (69 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (63 resets) in 39 ms. (100 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (52 resets) in 21 ms. (181 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4001 steps (65 resets) in 22 ms. (173 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (57 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (59 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (47 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (59 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (63 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (50 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (59 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (45 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (57 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (62 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (67 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (56 resets) in 27 ms. (142 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (52 resets) in 14 ms. (266 steps per ms) remains 57/60 properties
BEST_FIRST walk for 4003 steps (56 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (52 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (63 resets) in 16 ms. (235 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4004 steps (47 resets) in 12 ms. (308 steps per ms) remains 53/56 properties
BEST_FIRST walk for 4003 steps (66 resets) in 12 ms. (307 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (53 resets) in 13 ms. (285 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (57 resets) in 13 ms. (285 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (65 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (60 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (58 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (71 resets) in 39 ms. (100 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (58 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (67 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (83 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (62 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (49 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (55 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (67 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (53 resets) in 13 ms. (285 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (53 resets) in 22 ms. (174 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (57 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (61 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (51 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (72 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (62 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (57 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (56 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (58 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (53 resets) in 13 ms. (285 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (39 resets) in 12 ms. (307 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (69 resets) in 11 ms. (333 steps per ms) remains 53/53 properties
[2024-06-02 20:54:52] [INFO ] Flow matrix only has 312 transitions (discarded 32 similar events)
// Phase 1: matrix 312 rows 127 cols
[2024-06-02 20:54:52] [INFO ] Computed 8 invariants in 14 ms
[2024-06-02 20:54:52] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 68/121 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 68/127 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 4/125 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 311/436 variables, 125/258 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 44/302 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 2/438 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (OVERLAPS) 1/439 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 16 (OVERLAPS) 0/439 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 307 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2307 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 68/121 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 68/127 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-02 20:54:55] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 13 ms to minimize.
[2024-06-02 20:54:55] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 2 ms to minimize.
[2024-06-02 20:54:55] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 4/125 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 311/436 variables, 125/261 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 44/305 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 53/358 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-02 20:54:56] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:54:56] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (OVERLAPS) 2/438 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/438 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 17 (OVERLAPS) 1/439 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/439 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 365 constraints, problems are : Problem set: 0 solved, 53 unsolved in 5010 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 5/5 constraints]
After SMT, in 7405ms problems are : Problem set: 0 solved, 53 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 344/344 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 127 transition count 341
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 125 transition count 337
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 125 transition count 337
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 125 transition count 335
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 123 transition count 339
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 123 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 25 place count 123 transition count 327
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 122 transition count 326
Applied a total of 26 rules in 69 ms. Remains 122 /127 variables (removed 5) and now considering 326/344 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 122/127 places, 326/344 transitions.
RANDOM walk for 4000000 steps (231990 resets) in 19846 ms. (201 steps per ms) remains 31/53 properties
BEST_FIRST walk for 400004 steps (5529 resets) in 488 ms. (818 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (5588 resets) in 479 ms. (833 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (5669 resets) in 467 ms. (854 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5653 resets) in 487 ms. (819 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5626 resets) in 481 ms. (829 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5643 resets) in 472 ms. (845 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (5664 resets) in 468 ms. (852 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5544 resets) in 469 ms. (851 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5659 resets) in 470 ms. (849 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5686 resets) in 476 ms. (838 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (5594 resets) in 475 ms. (840 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5623 resets) in 465 ms. (858 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (5643 resets) in 470 ms. (849 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5530 resets) in 471 ms. (847 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (5681 resets) in 457 ms. (873 steps per ms) remains 25/31 properties
BEST_FIRST walk for 400003 steps (5619 resets) in 448 ms. (890 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5668 resets) in 439 ms. (909 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (5685 resets) in 525 ms. (760 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (5576 resets) in 480 ms. (831 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (5600 resets) in 455 ms. (877 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5763 resets) in 456 ms. (875 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (5693 resets) in 437 ms. (913 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5728 resets) in 437 ms. (913 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5581 resets) in 437 ms. (913 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (5614 resets) in 441 ms. (904 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (5725 resets) in 442 ms. (902 steps per ms) remains 25/25 properties
[2024-06-02 20:55:09] [INFO ] Flow matrix only has 300 transitions (discarded 26 similar events)
// Phase 1: matrix 300 rows 122 cols
[2024-06-02 20:55:09] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:55:09] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 58/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 228/311 variables, 83/87 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 64/375 variables, 16/103 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 33/137 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 43/419 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 16 (OVERLAPS) 3/422 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 19 (OVERLAPS) 0/422 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 175 constraints, problems are : Problem set: 0 solved, 25 unsolved in 957 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 58/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 20:55:10] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:55:10] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 228/311 variables, 83/89 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 64/375 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 33/141 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 23/164 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 1/376 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/376 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/376 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 15 (OVERLAPS) 43/419 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 12/199 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 19 (OVERLAPS) 3/422 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/422 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/422 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 20:55:11] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-06-02 20:55:11] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 2 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/422 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/422 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 24 (OVERLAPS) 0/422 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 204 constraints, problems are : Problem set: 0 solved, 25 unsolved in 2453 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 4/4 constraints]
After SMT, in 3434ms problems are : Problem set: 0 solved, 25 unsolved
Fused 25 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 871 ms.
Support contains 25 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 326/326 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 323
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 120 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 120 transition count 321
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 119 transition count 323
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 119 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 119 transition count 320
Applied a total of 9 rules in 35 ms. Remains 119 /122 variables (removed 3) and now considering 320/326 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 119/122 places, 320/326 transitions.
RANDOM walk for 4000000 steps (231934 resets) in 17212 ms. (232 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (5787 resets) in 468 ms. (852 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5706 resets) in 468 ms. (852 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (5768 resets) in 442 ms. (902 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5697 resets) in 424 ms. (941 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5522 resets) in 429 ms. (930 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5728 resets) in 436 ms. (915 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5606 resets) in 452 ms. (883 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (5620 resets) in 440 ms. (907 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (5628 resets) in 438 ms. (911 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5570 resets) in 438 ms. (911 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (5613 resets) in 429 ms. (930 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400001 steps (5651 resets) in 433 ms. (921 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5823 resets) in 441 ms. (904 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5671 resets) in 448 ms. (890 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5535 resets) in 449 ms. (888 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5651 resets) in 439 ms. (909 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5833 resets) in 461 ms. (865 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (5734 resets) in 433 ms. (921 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (5562 resets) in 428 ms. (932 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400003 steps (5554 resets) in 438 ms. (911 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (5683 resets) in 451 ms. (884 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5616 resets) in 441 ms. (904 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5683 resets) in 449 ms. (888 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (5780 resets) in 453 ms. (881 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5533 resets) in 434 ms. (919 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 6124353 steps, run timeout after 24001 ms. (steps per millisecond=255 ) properties seen :22 out of 24
Probabilistic random walk after 6124353 steps, saw 1192297 distinct states, run finished after 24006 ms. (steps per millisecond=255 ) properties seen :22
[2024-06-02 20:55:45] [INFO ] Flow matrix only has 292 transitions (discarded 28 similar events)
// Phase 1: matrix 292 rows 119 cols
[2024-06-02 20:55:45] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:55:45] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/112 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 40/152 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 169/321 variables, 48/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 23/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/322 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 83/405 variables, 38/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/405 variables, 21/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/405 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 6/411 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/411 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/411 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/411 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/112 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 40/152 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 169/321 variables, 48/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 23/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/322 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/322 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/322 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 83/405 variables, 38/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/405 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/405 variables, 21/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/405 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 6/411 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/411 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/411 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/411 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 454ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 320/320 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 116 transition count 313
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 116 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 116 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 114 transition count 307
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 106 transition count 287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 105 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 105 transition count 285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 104 transition count 283
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 104 transition count 283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 103 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 103 transition count 281
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 103 transition count 283
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 37 place count 102 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 102 transition count 279
Applied a total of 39 rules in 65 ms. Remains 102 /119 variables (removed 17) and now considering 279/320 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 102/119 places, 279/320 transitions.
RANDOM walk for 3103528 steps (179696 resets) in 10388 ms. (298 steps per ms) remains 0/2 properties
Able to resolve query StableMarking after proving 118 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 58649 ms.
ITS solved all properties within timeout

BK_STOP 1717361750033

--------------------
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-08"
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-08, 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-171734907700143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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