About the Execution of 2024-gold for FireWire-PT-17
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15687.130 | 173105.00 | 453422.00 | 578.40 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r098-smll-174860112300233.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is FireWire-PT-17, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-smll-174860112300233
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 153K 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 1748684055248
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 09:34:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 09:34:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 09:34:18] [INFO ] Load time of PNML (sax parser for PT used): 445 ms
[2025-05-31 09:34:18] [INFO ] Transformed 428 places.
[2025-05-31 09:34:18] [INFO ] Transformed 656 transitions.
[2025-05-31 09:34:18] [INFO ] Found NUPN structural information;
[2025-05-31 09:34:18] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 689 ms.
Graph (trivial) has 356 edges and 428 vertex of which 19 / 428 are part of one of the 3 SCC in 8 ms
Free SCC test removed 16 places
Structural test allowed to assert that 99 places are NOT stable. Took 67 ms.
Ensure Unique test removed 17 transitions
Reduce redundant transitions removed 17 transitions.
RANDOM walk for 40000 steps (576 resets) in 4608 ms. (8 steps per ms) remains 221/329 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 221/221 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 221/221 properties
BEST_FIRST walk for 402 steps (8 resets) in 19 ms. (20 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 221/221 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 221/221 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 221/221 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 221/221 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 221/221 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 221/221 properties
[2025-05-31 09:34:20] [INFO ] Flow matrix only has 637 transitions (discarded 2 similar events)
// Phase 1: matrix 637 rows 412 cols
[2025-05-31 09:34:20] [INFO ] Computed 9 invariants in 25 ms
[2025-05-31 09:34:20] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 221/1049 variables, and 221 constraints, problems are : Problem set: 0 solved, 221 unsolved in 5082 ms.
Refiners :[Domain max(s): 221/412 constraints, Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 137/358 variables, 7/228 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 137/365 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2025-05-31 09:34:28] [INFO ] Deduced a trap composed of 123 places in 491 ms of which 69 ms to minimize.
[2025-05-31 09:34:29] [INFO ] Deduced a trap composed of 95 places in 380 ms of which 7 ms to minimize.
[2025-05-31 09:34:29] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 5 ms to minimize.
[2025-05-31 09:34:29] [INFO ] Deduced a trap composed of 179 places in 219 ms of which 4 ms to minimize.
[2025-05-31 09:34:29] [INFO ] Deduced a trap composed of 110 places in 96 ms of which 2 ms to minimize.
[2025-05-31 09:34:30] [INFO ] Deduced a trap composed of 106 places in 82 ms of which 2 ms to minimize.
[2025-05-31 09:34:30] [INFO ] Deduced a trap composed of 104 places in 75 ms of which 2 ms to minimize.
[2025-05-31 09:34:30] [INFO ] Deduced a trap composed of 102 places in 74 ms of which 2 ms to minimize.
[2025-05-31 09:34:30] [INFO ] Deduced a trap composed of 108 places in 82 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1049 variables, and 374 constraints, problems are : Problem set: 0 solved, 221 unsolved in 5022 ms.
Refiners :[Domain max(s): 358/412 constraints, Positive P Invariants (semi-flows): 7/9 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/221 constraints, Known Traps: 9/9 constraints]
After SMT, in 10301ms problems are : Problem set: 0 solved, 221 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 221 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 639/639 transitions.
Graph (complete) has 1083 edges and 412 vertex of which 406 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 406 transition count 562
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 75 rules applied. Total rules applied 153 place count 334 transition count 559
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 155 place count 332 transition count 559
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 155 place count 332 transition count 553
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 167 place count 326 transition count 553
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 179 place count 314 transition count 541
Iterating global reduction 3 with 12 rules applied. Total rules applied 191 place count 314 transition count 541
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 193 place count 314 transition count 539
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 193 place count 314 transition count 538
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 313 transition count 538
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 197 place count 311 transition count 498
Iterating global reduction 4 with 2 rules applied. Total rules applied 199 place count 311 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 200 place count 311 transition count 497
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 244 place count 289 transition count 475
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 258 place count 282 transition count 480
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 270 place count 282 transition count 468
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 283 place count 270 transition count 467
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 284 place count 270 transition count 466
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 286 place count 270 transition count 466
Applied a total of 286 rules in 219 ms. Remains 270 /412 variables (removed 142) and now considering 466/639 (removed 173) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 270/412 places, 466/639 transitions.
RANDOM walk for 4000000 steps (277325 resets) in 48869 ms. (81 steps per ms) remains 65/221 properties
BEST_FIRST walk for 400004 steps (6512 resets) in 901 ms. (443 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (6507 resets) in 791 ms. (505 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (6464 resets) in 789 ms. (506 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (6454 resets) in 855 ms. (467 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (6483 resets) in 784 ms. (509 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400002 steps (6478 resets) in 788 ms. (506 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (6461 resets) in 792 ms. (504 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (6439 resets) in 832 ms. (480 steps per ms) remains 62/65 properties
BEST_FIRST walk for 400003 steps (6431 resets) in 772 ms. (517 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (6465 resets) in 763 ms. (523 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (6425 resets) in 765 ms. (522 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (6435 resets) in 761 ms. (524 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (6473 resets) in 767 ms. (520 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400001 steps (6546 resets) in 763 ms. (523 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (6456 resets) in 763 ms. (523 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (6459 resets) in 765 ms. (522 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (6507 resets) in 765 ms. (522 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (6432 resets) in 805 ms. (496 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (6464 resets) in 759 ms. (526 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (6474 resets) in 753 ms. (530 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (6428 resets) in 760 ms. (525 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (6408 resets) in 772 ms. (517 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (6448 resets) in 768 ms. (520 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (6411 resets) in 759 ms. (526 steps per ms) remains 61/62 properties
BEST_FIRST walk for 400003 steps (6494 resets) in 758 ms. (527 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (6494 resets) in 752 ms. (531 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (6462 resets) in 751 ms. (531 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (6498 resets) in 758 ms. (527 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (6469 resets) in 755 ms. (529 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (6486 resets) in 755 ms. (529 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (6522 resets) in 757 ms. (527 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (6522 resets) in 810 ms. (493 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6473 resets) in 755 ms. (529 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (6424 resets) in 762 ms. (524 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6450 resets) in 755 ms. (529 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6426 resets) in 758 ms. (527 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6416 resets) in 757 ms. (527 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6449 resets) in 759 ms. (526 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6452 resets) in 762 ms. (524 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6514 resets) in 764 ms. (522 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (6477 resets) in 758 ms. (527 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6468 resets) in 756 ms. (528 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (6531 resets) in 753 ms. (530 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (6436 resets) in 757 ms. (527 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400001 steps (6449 resets) in 754 ms. (529 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6438 resets) in 763 ms. (523 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (6423 resets) in 782 ms. (510 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (6454 resets) in 764 ms. (522 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6397 resets) in 757 ms. (527 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (6425 resets) in 759 ms. (526 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6536 resets) in 756 ms. (528 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6428 resets) in 746 ms. (535 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (6551 resets) in 755 ms. (529 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6414 resets) in 757 ms. (527 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6439 resets) in 763 ms. (523 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6423 resets) in 798 ms. (500 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (6430 resets) in 765 ms. (522 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6415 resets) in 759 ms. (526 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (6482 resets) in 758 ms. (527 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400002 steps (6531 resets) in 757 ms. (527 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (6420 resets) in 783 ms. (510 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (6444 resets) in 750 ms. (532 steps per ms) remains 56/61 properties
// Phase 1: matrix 466 rows 270 cols
[2025-05-31 09:34:56] [INFO ] Computed 7 invariants in 6 ms
[2025-05-31 09:34:56] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 186/242 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 24/266 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 466/732 variables, 266/273 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 28/301 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 4/736 variables, 4/305 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 0/736 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 736/736 variables, and 305 constraints, problems are : Problem set: 0 solved, 56 unsolved in 4796 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 270/270 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 186/242 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2025-05-31 09:35:01] [INFO ] Deduced a trap composed of 98 places in 220 ms of which 4 ms to minimize.
[2025-05-31 09:35:01] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 3 ms to minimize.
[2025-05-31 09:35:02] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2025-05-31 09:35:02] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 3 ms to minimize.
[2025-05-31 09:35:02] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 4 ms to minimize.
[2025-05-31 09:35:02] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2025-05-31 09:35:02] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2025-05-31 09:35:02] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2025-05-31 09:35:03] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 24/266 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2025-05-31 09:35:04] [INFO ] Deduced a trap composed of 48 places in 293 ms of which 4 ms to minimize.
[2025-05-31 09:35:04] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 3 ms to minimize.
[2025-05-31 09:35:05] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2025-05-31 09:35:05] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 3 ms to minimize.
[2025-05-31 09:35:05] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 466/732 variables, 266/287 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/732 variables, 28/315 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/732 variables, 56/371 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2025-05-31 09:35:07] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2025-05-31 09:35:07] [INFO ] Deduced a trap composed of 51 places in 255 ms of which 4 ms to minimize.
[2025-05-31 09:35:07] [INFO ] Deduced a trap composed of 81 places in 298 ms of which 5 ms to minimize.
[2025-05-31 09:35:08] [INFO ] Deduced a trap composed of 103 places in 231 ms of which 5 ms to minimize.
[2025-05-31 09:35:09] [INFO ] Deduced a trap composed of 45 places in 282 ms of which 5 ms to minimize.
[2025-05-31 09:35:09] [INFO ] Deduced a trap composed of 100 places in 268 ms of which 5 ms to minimize.
[2025-05-31 09:35:10] [INFO ] Deduced a trap composed of 158 places in 296 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/732 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2025-05-31 09:35:11] [INFO ] Deduced a trap composed of 173 places in 277 ms of which 5 ms to minimize.
[2025-05-31 09:35:11] [INFO ] Deduced a trap composed of 104 places in 290 ms of which 5 ms to minimize.
[2025-05-31 09:35:11] [INFO ] Deduced a trap composed of 74 places in 294 ms of which 5 ms to minimize.
[2025-05-31 09:35:12] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2025-05-31 09:35:13] [INFO ] Deduced a trap composed of 142 places in 309 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/732 variables, 5/383 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/732 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 13 (OVERLAPS) 4/736 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2025-05-31 09:35:19] [INFO ] Deduced a trap composed of 176 places in 295 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/736 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/736 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 16 (OVERLAPS) 0/736 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 736/736 variables, and 388 constraints, problems are : Problem set: 0 solved, 56 unsolved in 27971 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 270/270 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 27/27 constraints]
After SMT, in 32808ms problems are : Problem set: 0 solved, 56 unsolved
Parikh walk visited 6 properties in 15572 ms.
Support contains 50 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 466/466 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 270 transition count 421
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 225 transition count 421
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 90 place count 225 transition count 418
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 96 place count 222 transition count 418
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 105 place count 213 transition count 409
Iterating global reduction 2 with 9 rules applied. Total rules applied 114 place count 213 transition count 409
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 114 place count 213 transition count 407
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 118 place count 211 transition count 407
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 209 transition count 405
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 209 transition count 405
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 126 place count 209 transition count 401
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 128 place count 207 transition count 401
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 178 place count 182 transition count 376
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 179 place count 182 transition count 375
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 217 place count 163 transition count 442
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 225 place count 163 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 6 with 76 rules applied. Total rules applied 301 place count 163 transition count 358
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 308 place count 163 transition count 351
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 315 place count 156 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 317 place count 156 transition count 349
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 320 place count 156 transition count 439
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 323 place count 153 transition count 439
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 325 place count 153 transition count 439
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 326 place count 153 transition count 439
Applied a total of 326 rules in 158 ms. Remains 153 /270 variables (removed 117) and now considering 439/466 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 153/270 places, 439/466 transitions.
RANDOM walk for 4000000 steps (176520 resets) in 23208 ms. (172 steps per ms) remains 12/50 properties
BEST_FIRST walk for 4000002 steps (49050 resets) in 4933 ms. (810 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (49138 resets) in 5280 ms. (757 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (49207 resets) in 4958 ms. (806 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (49170 resets) in 4965 ms. (805 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (49040 resets) in 4952 ms. (807 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (49218 resets) in 4925 ms. (812 steps per ms) remains 10/12 properties
BEST_FIRST walk for 4000002 steps (49289 resets) in 4628 ms. (864 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (49265 resets) in 4613 ms. (866 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (49300 resets) in 4644 ms. (861 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000002 steps (49151 resets) in 4635 ms. (862 steps per ms) remains 10/10 properties
[2025-05-31 09:36:05] [INFO ] Flow matrix only has 412 transitions (discarded 27 similar events)
// Phase 1: matrix 412 rows 153 cols
[2025-05-31 09:36:05] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:36:05] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 104/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 35/149 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 412/561 variables, 149/156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 62/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 4/565 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/565 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 222 constraints, problems are : Problem set: 0 solved, 10 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 104/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 35/149 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-31 09:36:06] [INFO ] Deduced a trap composed of 54 places in 205 ms of which 3 ms to minimize.
[2025-05-31 09:36:06] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2025-05-31 09:36:06] [INFO ] Deduced a trap composed of 87 places in 208 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 412/561 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 62/221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 10/231 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-31 09:36:06] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 4 ms to minimize.
[2025-05-31 09:36:07] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 3 ms to minimize.
[2025-05-31 09:36:07] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 4/565 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/565 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 238 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2769 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints]
After SMT, in 3334ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 7938 ms.
Support contains 10 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 439/439 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 153 transition count 433
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 147 transition count 433
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 144 transition count 430
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 144 transition count 430
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 134 transition count 420
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 131 transition count 411
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 131 transition count 411
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 128 transition count 413
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 128 transition count 409
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 124 transition count 409
Applied a total of 58 rules in 38 ms. Remains 124 /153 variables (removed 29) and now considering 409/439 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 124/153 places, 409/439 transitions.
RANDOM walk for 4000000 steps (176755 resets) in 16126 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000002 steps (49211 resets) in 4825 ms. (828 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000002 steps (49120 resets) in 4822 ms. (829 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (49106 resets) in 4843 ms. (825 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (49082 resets) in 4827 ms. (828 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (49206 resets) in 4836 ms. (826 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (49164 resets) in 4810 ms. (831 steps per ms) remains 8/10 properties
BEST_FIRST walk for 4000004 steps (49311 resets) in 4358 ms. (917 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (49286 resets) in 4368 ms. (915 steps per ms) remains 8/8 properties
[2025-05-31 09:36:31] [INFO ] Flow matrix only has 381 transitions (discarded 28 similar events)
// Phase 1: matrix 381 rows 124 cols
[2025-05-31 09:36:31] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:36:31] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 85/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 27/120 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 381/501 variables, 120/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 62/189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 4/505 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/505 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 193 constraints, problems are : Problem set: 0 solved, 8 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 85/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 27/120 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-31 09:36:32] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 2 ms to minimize.
[2025-05-31 09:36:32] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 3 ms to minimize.
[2025-05-31 09:36:33] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 2 ms to minimize.
[2025-05-31 09:36:33] [INFO ] Deduced a trap composed of 47 places in 194 ms of which 2 ms to minimize.
[2025-05-31 09:36:33] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 381/501 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 62/194 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 8/202 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 4/505 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/505 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 206 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints]
After SMT, in 2482ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 2596 ms.
Support contains 8 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 409/409 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 122 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 122 transition count 404
Applied a total of 4 rules in 17 ms. Remains 122 /124 variables (removed 2) and now considering 404/409 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 122/124 places, 404/409 transitions.
RANDOM walk for 4000000 steps (176694 resets) in 14315 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (49148 resets) in 4363 ms. (916 steps per ms) remains 6/8 properties
BEST_FIRST walk for 4000003 steps (49192 resets) in 3876 ms. (1031 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000002 steps (49201 resets) in 3874 ms. (1032 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (49136 resets) in 3868 ms. (1033 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (49227 resets) in 3835 ms. (1042 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (49210 resets) in 3756 ms. (1064 steps per ms) remains 4/6 properties
[2025-05-31 09:36:47] [INFO ] Flow matrix only has 376 transitions (discarded 28 similar events)
// Phase 1: matrix 376 rows 122 cols
[2025-05-31 09:36:47] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:36:47] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 70/118 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 376/494 variables, 118/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 62/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/498 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/498 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 191 constraints, problems are : Problem set: 0 solved, 4 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 70/118 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-05-31 09:36:47] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 376/494 variables, 118/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 62/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-05-31 09:36:48] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 2 ms to minimize.
[2025-05-31 09:36:48] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 2 ms to minimize.
[2025-05-31 09:36:48] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/498 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/498 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 199 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1171 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 1479ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 637 ms.
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 404/404 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 122 transition count 403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 121 transition count 403
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 119 transition count 401
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 118 transition count 394
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 118 transition count 394
Applied a total of 8 rules in 14 ms. Remains 118 /122 variables (removed 4) and now considering 394/404 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 118/122 places, 394/404 transitions.
RANDOM walk for 4000000 steps (176443 resets) in 10322 ms. (387 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000002 steps (49265 resets) in 3327 ms. (1201 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000002 steps (49190 resets) in 3333 ms. (1199 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (49118 resets) in 3326 ms. (1202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000000 steps (49294 resets) in 3310 ms. (1208 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 2106223 steps, run visited all 4 properties in 12434 ms. (steps per millisecond=169 )
Probabilistic random walk after 2106223 steps, saw 629141 distinct states, run finished after 12447 ms. (steps per millisecond=169 ) properties seen :4
Able to resolve query StableMarking after proving 331 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 170506 ms.
ITS solved all properties within timeout
BK_STOP 1748684228353
--------------------
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-17"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is FireWire-PT-17, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-smll-174860112300233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-17.tgz
mv FireWire-PT-17 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;