About the Execution of LTSMin+red for FireWire-PT-19
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 726.976 | 94615.00 | 210566.00 | 194.20 | 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/mcc2024-input.r564-tall-171734907800198.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-19, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907800198
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 221K 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 1717362505182
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-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:08:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 21:08:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:08:26] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-06-02 21:08:26] [INFO ] Transformed 602 places.
[2024-06-02 21:08:26] [INFO ] Transformed 944 transitions.
[2024-06-02 21:08:26] [INFO ] Found NUPN structural information;
[2024-06-02 21:08:26] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 199 ms.
Graph (trivial) has 494 edges and 602 vertex of which 19 / 602 are part of one of the 3 SCC in 5 ms
Free SCC test removed 16 places
Structural test allowed to assert that 139 places are NOT stable. Took 25 ms.
Ensure Unique test removed 17 transitions
Reduce redundant transitions removed 17 transitions.
RANDOM walk for 40000 steps (402 resets) in 2454 ms. (16 steps per ms) remains 309/463 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 309/309 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 309/309 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 309/309 properties
BEST_FIRST walk for 401 steps (8 resets) in 14 ms. (26 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 309/309 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 309/309 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 309/309 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 309/309 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 309/309 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 309/309 properties
[2024-06-02 21:08:27] [INFO ] Flow matrix only has 925 transitions (discarded 2 similar events)
// Phase 1: matrix 925 rows 586 cols
[2024-06-02 21:08:27] [INFO ] Computed 13 invariants in 24 ms
[2024-06-02 21:08:27] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 309/309 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 309/1511 variables, and 309 constraints, problems are : Problem set: 0 solved, 309 unsolved in 5058 ms.
Refiners :[Domain max(s): 309/586 constraints, Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/586 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 309/309 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 196/505 variables, 10/319 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 196/515 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 21:08:34] [INFO ] Deduced a trap composed of 172 places in 254 ms of which 33 ms to minimize.
[2024-06-02 21:08:35] [INFO ] Deduced a trap composed of 172 places in 230 ms of which 4 ms to minimize.
[2024-06-02 21:08:35] [INFO ] Deduced a trap composed of 167 places in 207 ms of which 4 ms to minimize.
[2024-06-02 21:08:35] [INFO ] Deduced a trap composed of 159 places in 170 ms of which 4 ms to minimize.
[2024-06-02 21:08:35] [INFO ] Deduced a trap composed of 99 places in 171 ms of which 4 ms to minimize.
[2024-06-02 21:08:36] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 3 ms to minimize.
[2024-06-02 21:08:36] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 3 ms to minimize.
[2024-06-02 21:08:36] [INFO ] Deduced a trap composed of 112 places in 185 ms of which 4 ms to minimize.
[2024-06-02 21:08:36] [INFO ] Deduced a trap composed of 100 places in 164 ms of which 3 ms to minimize.
[2024-06-02 21:08:36] [INFO ] Deduced a trap composed of 88 places in 202 ms of which 3 ms to minimize.
[2024-06-02 21:08:37] [INFO ] Deduced a trap composed of 120 places in 171 ms of which 3 ms to minimize.
[2024-06-02 21:08:37] [INFO ] Deduced a trap composed of 116 places in 163 ms of which 3 ms to minimize.
[2024-06-02 21:08:37] [INFO ] Deduced a trap composed of 103 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:08:37] [INFO ] Deduced a trap composed of 115 places in 186 ms of which 3 ms to minimize.
[2024-06-02 21:08:37] [INFO ] Deduced a trap composed of 104 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:08:37] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/1511 variables, and 531 constraints, problems are : Problem set: 0 solved, 309 unsolved in 5025 ms.
Refiners :[Domain max(s): 505/586 constraints, Positive P Invariants (semi-flows): 10/13 constraints, State Equation: 0/586 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/309 constraints, Known Traps: 16/16 constraints]
After SMT, in 10244ms problems are : Problem set: 0 solved, 309 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 309 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 927/927 transitions.
Graph (complete) has 1585 edges and 586 vertex of which 577 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 577 transition count 819
Reduce places removed 102 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 105 rules applied. Total rules applied 214 place count 475 transition count 816
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 216 place count 473 transition count 816
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 216 place count 473 transition count 807
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 234 place count 464 transition count 807
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 250 place count 448 transition count 791
Iterating global reduction 3 with 16 rules applied. Total rules applied 266 place count 448 transition count 791
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 269 place count 448 transition count 788
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 269 place count 448 transition count 787
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 271 place count 447 transition count 787
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 273 place count 445 transition count 727
Iterating global reduction 4 with 2 rules applied. Total rules applied 275 place count 445 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 276 place count 445 transition count 726
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 338 place count 414 transition count 695
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 360 place count 403 transition count 711
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 362 place count 403 transition count 709
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 364 place count 403 transition count 707
Free-agglomeration rule applied 23 times.
Iterating global reduction 6 with 23 rules applied. Total rules applied 387 place count 403 transition count 684
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 412 place count 380 transition count 682
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 446 place count 380 transition count 648
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 447 place count 380 transition count 647
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 33 rules applied. Total rules applied 480 place count 379 transition count 615
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 483 place count 379 transition count 615
Applied a total of 483 rules in 187 ms. Remains 379 /586 variables (removed 207) and now considering 615/927 (removed 312) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 379/586 places, 615/927 transitions.
RANDOM walk for 4000000 steps (230012 resets) in 45368 ms. (88 steps per ms) remains 115/309 properties
BEST_FIRST walk for 40004 steps (412 resets) in 131 ms. (303 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (423 resets) in 139 ms. (285 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (417 resets) in 132 ms. (300 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40002 steps (425 resets) in 150 ms. (264 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (407 resets) in 154 ms. (258 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (416 resets) in 139 ms. (285 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (419 resets) in 150 ms. (264 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (418 resets) in 103 ms. (384 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (419 resets) in 73 ms. (540 steps per ms) remains 111/115 properties
BEST_FIRST walk for 40004 steps (424 resets) in 68 ms. (579 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (417 resets) in 73 ms. (540 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (421 resets) in 71 ms. (555 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (420 resets) in 73 ms. (540 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (413 resets) in 73 ms. (540 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (419 resets) in 70 ms. (563 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (415 resets) in 75 ms. (526 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (426 resets) in 71 ms. (555 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (406 resets) in 71 ms. (555 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (418 resets) in 70 ms. (563 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (405 resets) in 69 ms. (571 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40004 steps (391 resets) in 72 ms. (548 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (408 resets) in 75 ms. (526 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (418 resets) in 70 ms. (563 steps per ms) remains 110/111 properties
BEST_FIRST walk for 40003 steps (407 resets) in 72 ms. (547 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40003 steps (407 resets) in 70 ms. (563 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40004 steps (439 resets) in 70 ms. (563 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40004 steps (420 resets) in 72 ms. (548 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40004 steps (410 resets) in 71 ms. (555 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40003 steps (424 resets) in 70 ms. (563 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40004 steps (421 resets) in 71 ms. (555 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40003 steps (420 resets) in 71 ms. (555 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40003 steps (412 resets) in 76 ms. (519 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40003 steps (419 resets) in 71 ms. (555 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40004 steps (424 resets) in 71 ms. (555 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40004 steps (417 resets) in 70 ms. (563 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40003 steps (402 resets) in 69 ms. (571 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40004 steps (424 resets) in 73 ms. (540 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40002 steps (415 resets) in 69 ms. (571 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40004 steps (413 resets) in 72 ms. (548 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40003 steps (419 resets) in 69 ms. (571 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40003 steps (412 resets) in 69 ms. (571 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40003 steps (409 resets) in 74 ms. (533 steps per ms) remains 107/110 properties
BEST_FIRST walk for 40003 steps (413 resets) in 69 ms. (571 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40001 steps (413 resets) in 70 ms. (563 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (407 resets) in 68 ms. (579 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (407 resets) in 69 ms. (571 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (425 resets) in 72 ms. (548 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (408 resets) in 69 ms. (571 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (417 resets) in 69 ms. (571 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (387 resets) in 73 ms. (540 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (406 resets) in 69 ms. (571 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (405 resets) in 75 ms. (526 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (394 resets) in 70 ms. (563 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (432 resets) in 68 ms. (579 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (411 resets) in 71 ms. (555 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (422 resets) in 69 ms. (571 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (416 resets) in 71 ms. (555 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (402 resets) in 76 ms. (519 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (428 resets) in 70 ms. (563 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (414 resets) in 71 ms. (555 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (408 resets) in 70 ms. (563 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (412 resets) in 71 ms. (555 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (417 resets) in 74 ms. (533 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (412 resets) in 74 ms. (533 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (414 resets) in 72 ms. (547 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (413 resets) in 70 ms. (563 steps per ms) remains 105/107 properties
BEST_FIRST walk for 40002 steps (418 resets) in 71 ms. (555 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (413 resets) in 76 ms. (519 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (410 resets) in 70 ms. (563 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (427 resets) in 67 ms. (588 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (413 resets) in 70 ms. (563 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40001 steps (430 resets) in 70 ms. (563 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (412 resets) in 73 ms. (540 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40002 steps (424 resets) in 71 ms. (555 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (414 resets) in 72 ms. (547 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (410 resets) in 71 ms. (555 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (436 resets) in 68 ms. (579 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (425 resets) in 72 ms. (547 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (429 resets) in 73 ms. (540 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (425 resets) in 68 ms. (579 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (418 resets) in 69 ms. (571 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40002 steps (410 resets) in 68 ms. (579 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40002 steps (432 resets) in 71 ms. (555 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (421 resets) in 68 ms. (579 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (427 resets) in 71 ms. (555 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (426 resets) in 108 ms. (367 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (409 resets) in 81 ms. (487 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (411 resets) in 68 ms. (579 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (421 resets) in 73 ms. (540 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (427 resets) in 71 ms. (555 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (423 resets) in 69 ms. (571 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (422 resets) in 68 ms. (579 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (425 resets) in 67 ms. (588 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (416 resets) in 70 ms. (563 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40002 steps (421 resets) in 68 ms. (579 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40002 steps (429 resets) in 68 ms. (579 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (414 resets) in 69 ms. (571 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (431 resets) in 68 ms. (579 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (414 resets) in 71 ms. (555 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (414 resets) in 69 ms. (571 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (415 resets) in 72 ms. (548 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (416 resets) in 72 ms. (548 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (425 resets) in 68 ms. (579 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (421 resets) in 73 ms. (540 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (416 resets) in 68 ms. (579 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (404 resets) in 113 ms. (350 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (400 resets) in 98 ms. (404 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (415 resets) in 88 ms. (449 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (413 resets) in 80 ms. (493 steps per ms) remains 105/105 properties
[2024-06-02 21:08:52] [INFO ] Flow matrix only has 583 transitions (discarded 32 similar events)
// Phase 1: matrix 583 rows 379 cols
[2024-06-02 21:08:52] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:08:52] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 232/337 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 36/373 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 583/956 variables, 373/383 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/956 variables, 41/424 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/956 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 6/962 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/962 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 962/962 variables, and 430 constraints, problems are : Problem set: 0 solved, 105 unsolved in 7833 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 379/379 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 232/337 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 21:09:00] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:09:00] [INFO ] Deduced a trap composed of 94 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:09:00] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 2 ms to minimize.
[2024-06-02 21:09:00] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:09:01] [INFO ] Deduced a trap composed of 98 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:09:01] [INFO ] Deduced a trap composed of 96 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:09:01] [INFO ] Deduced a trap composed of 98 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:09:01] [INFO ] Deduced a trap composed of 100 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:09:01] [INFO ] Deduced a trap composed of 98 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:09:01] [INFO ] Deduced a trap composed of 96 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:09:02] [INFO ] Deduced a trap composed of 99 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:09:02] [INFO ] Deduced a trap composed of 99 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:09:02] [INFO ] Deduced a trap composed of 99 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 21:09:02] [INFO ] Deduced a trap composed of 84 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 36/373 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 21:09:04] [INFO ] Deduced a trap composed of 80 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 21:09:05] [INFO ] Deduced a trap composed of 95 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 583/956 variables, 373/399 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/956 variables, 41/440 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/956 variables, 105/545 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 21:09:08] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 3 ms to minimize.
[2024-06-02 21:09:08] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:09:08] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 5 ms to minimize.
[2024-06-02 21:09:09] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:09:09] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:09:09] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 3 ms to minimize.
[2024-06-02 21:09:10] [INFO ] Deduced a trap composed of 99 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:09:10] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/956 variables, 8/553 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 21:09:13] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 2 ms to minimize.
[2024-06-02 21:09:14] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 9 ms to minimize.
[2024-06-02 21:09:14] [INFO ] Deduced a trap composed of 99 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/956 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/956 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (OVERLAPS) 6/962 variables, 6/562 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 17 (OVERLAPS) 0/962 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 962/962 variables, and 562 constraints, problems are : Problem set: 0 solved, 105 unsolved in 31618 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 379/379 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 27/27 constraints]
After SMT, in 39485ms problems are : Problem set: 0 solved, 105 unsolved
Fused 105 Parikh solutions to 103 different solutions.
Parikh walk visited 2 properties in 12191 ms.
Support contains 103 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 615/615 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 379 transition count 558
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 322 transition count 558
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 322 transition count 556
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 320 transition count 556
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 130 place count 308 transition count 544
Iterating global reduction 2 with 12 rules applied. Total rules applied 142 place count 308 transition count 544
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 142 place count 308 transition count 540
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 150 place count 304 transition count 540
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 154 place count 300 transition count 536
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 300 transition count 536
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 164 place count 300 transition count 530
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 167 place count 297 transition count 530
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 221 place count 270 transition count 503
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 265 place count 248 transition count 519
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 275 place count 248 transition count 509
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 301 place count 248 transition count 483
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 308 place count 248 transition count 476
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 315 place count 241 transition count 476
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 318 place count 241 transition count 615
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 321 place count 238 transition count 615
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 322 place count 238 transition count 615
Applied a total of 322 rules in 96 ms. Remains 238 /379 variables (removed 141) and now considering 615/615 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 238/379 places, 615/615 transitions.
RANDOM walk for 4000000 steps (97199 resets) in 20479 ms. (195 steps per ms) remains 6/103 properties
BEST_FIRST walk for 4000002 steps (23263 resets) in 3363 ms. (1189 steps per ms) remains 4/6 properties
BEST_FIRST walk for 4000004 steps (23288 resets) in 3130 ms. (1277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (23340 resets) in 3131 ms. (1277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (23294 resets) in 3159 ms. (1265 steps per ms) remains 2/4 properties
[2024-06-02 21:09:53] [INFO ] Flow matrix only has 572 transitions (discarded 43 similar events)
// Phase 1: matrix 572 rows 238 cols
[2024-06-02 21:09:53] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:09:53] [INFO ] State equation strengthened by 85 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) 59/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 171/232 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 572/804 variables, 232/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/804 variables, 85/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/804 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/810 variables, 6/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/810 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/810 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 333 constraints, problems are : Problem set: 0 solved, 2 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 238/238 constraints, ReadFeed: 85/85 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) 59/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 171/232 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:09:53] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-06-02 21:09:53] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 572/804 variables, 232/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/804 variables, 85/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/804 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/804 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/810 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:09:53] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/810 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/810 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/810 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 338 constraints, problems are : Problem set: 0 solved, 2 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 238/238 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 784ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 615/615 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 238 transition count 599
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 222 transition count 599
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 32 place count 222 transition count 597
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 36 place count 220 transition count 597
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 47 place count 209 transition count 586
Iterating global reduction 2 with 11 rules applied. Total rules applied 58 place count 209 transition count 586
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 58 place count 209 transition count 582
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 205 transition count 582
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 200 transition count 568
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 200 transition count 568
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 108 place count 184 transition count 552
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 111 place count 181 transition count 531
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 181 transition count 531
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 136 place count 170 transition count 531
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 144 place count 170 transition count 523
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 149 place count 170 transition count 518
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 154 place count 165 transition count 518
Applied a total of 154 rules in 54 ms. Remains 165 /238 variables (removed 73) and now considering 518/615 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 165/238 places, 518/615 transitions.
RANDOM walk for 3078233 steps (75264 resets) in 14426 ms. (213 steps per ms) remains 0/2 properties
Able to resolve query StableMarking after proving 465 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 93485 ms.
ITS solved all properties within timeout
BK_STOP 1717362599797
--------------------
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-19"
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-19, 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-171734907800198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-19.tgz
mv FireWire-PT-19 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 '
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 ;