About the Execution of GreatSPN+red for DoubleExponent-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10400.247 | 3600000.00 | 8726599.00 | 7168.50 | ?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.r135-tall-171631131300554.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 greatspnxred
Input is DoubleExponent-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131300554
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 169K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2024-00
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2024-01
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2024-02
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2024-03
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2024-04
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2024-05
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2024-06
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2024-07
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2024-08
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2024-09
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2024-10
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2024-11
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2023-12
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2023-13
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2023-14
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716377314144
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:28:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 11:28:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:28:35] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-22 11:28:35] [INFO ] Transformed 534 places.
[2024-05-22 11:28:35] [INFO ] Transformed 498 transitions.
[2024-05-22 11:28:35] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Support contains 130 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 498
Applied a total of 4 rules in 74 ms. Remains 530 /534 variables (removed 4) and now considering 498/498 (removed 0) transitions.
// Phase 1: matrix 498 rows 530 cols
[2024-05-22 11:28:35] [INFO ] Computed 51 invariants in 86 ms
[2024-05-22 11:28:36] [INFO ] Implicit Places using invariants in 517 ms returned [437]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 558 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/534 places, 498/498 transitions.
Applied a total of 0 rules in 29 ms. Remains 529 /529 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 678 ms. Remains : 529/534 places, 498/498 transitions.
Support contains 130 out of 529 places after structural reductions.
[2024-05-22 11:28:36] [INFO ] Flatten gal took : 76 ms
[2024-05-22 11:28:36] [INFO ] Flatten gal took : 40 ms
[2024-05-22 11:28:36] [INFO ] Input system was already deterministic with 498 transitions.
Support contains 122 out of 529 places (down from 130) after GAL structural reductions.
RANDOM walk for 40000 steps (1341 resets) in 1711 ms. (23 steps per ms) remains 70/76 properties
BEST_FIRST walk for 4000 steps (106 resets) in 293 ms. (13 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (108 resets) in 94 ms. (42 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (120 resets) in 44 ms. (88 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (115 resets) in 57 ms. (68 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (114 resets) in 51 ms. (76 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (112 resets) in 56 ms. (70 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (109 resets) in 72 ms. (54 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (113 resets) in 41 ms. (95 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (103 resets) in 30 ms. (129 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (110 resets) in 27 ms. (142 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (111 resets) in 29 ms. (133 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (109 resets) in 29 ms. (133 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (109 resets) in 44 ms. (88 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (119 resets) in 75 ms. (52 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (113 resets) in 38 ms. (102 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (113 resets) in 32 ms. (121 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (110 resets) in 59 ms. (66 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (111 resets) in 45 ms. (86 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (110 resets) in 45 ms. (86 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (116 resets) in 69 ms. (57 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (105 resets) in 34 ms. (114 steps per ms) remains 66/70 properties
BEST_FIRST walk for 4002 steps (111 resets) in 38 ms. (102 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (110 resets) in 65 ms. (60 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (99 resets) in 45 ms. (86 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (111 resets) in 47 ms. (83 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (112 resets) in 39 ms. (100 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (110 resets) in 76 ms. (51 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (114 resets) in 43 ms. (90 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (111 resets) in 49 ms. (80 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (107 resets) in 63 ms. (62 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (109 resets) in 31 ms. (125 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (109 resets) in 40 ms. (97 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (116 resets) in 37 ms. (105 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (113 resets) in 31 ms. (125 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (107 resets) in 32 ms. (121 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (148 resets) in 50 ms. (78 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (116 resets) in 27 ms. (142 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (111 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (113 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (109 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (107 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (111 resets) in 27 ms. (142 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (113 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (116 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (114 resets) in 49 ms. (80 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (115 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (114 resets) in 47 ms. (83 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (117 resets) in 48 ms. (81 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (114 resets) in 27 ms. (142 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (108 resets) in 35 ms. (111 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (112 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (118 resets) in 39 ms. (100 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (112 resets) in 34 ms. (114 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (110 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (118 resets) in 40 ms. (97 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (108 resets) in 35 ms. (111 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (114 resets) in 31 ms. (125 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (113 resets) in 33 ms. (117 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (112 resets) in 31 ms. (125 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (109 resets) in 52 ms. (75 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (102 resets) in 30 ms. (129 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (108 resets) in 32 ms. (121 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (105 resets) in 44 ms. (88 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (108 resets) in 30 ms. (129 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (114 resets) in 35 ms. (111 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (108 resets) in 60 ms. (65 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (148 resets) in 32 ms. (121 steps per ms) remains 66/66 properties
// Phase 1: matrix 498 rows 529 cols
[2024-05-22 11:28:38] [INFO ] Computed 50 invariants in 36 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 15/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 335/460 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 13/473 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 487/960 variables, 473/523 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/960 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 66 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 66/1026 variables, 55/578 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1026 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1027/1027 variables, and 579 constraints, problems are : Problem set: 0 solved, 66 unsolved in 5039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 529/529 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 15/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 335/460 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 13/473 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 487/960 variables, 473/523 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/960 variables, 36/559 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/960 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 66/1026 variables, 55/614 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1027 variables, and 644 constraints, problems are : Problem set: 0 solved, 66 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 528/529 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 10186ms problems are : Problem set: 0 solved, 66 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 110 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 498/498 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 529 transition count 462
Reduce places removed 36 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 56 rules applied. Total rules applied 92 place count 493 transition count 442
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 112 place count 473 transition count 442
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 112 place count 473 transition count 424
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 148 place count 455 transition count 424
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 256 place count 401 transition count 370
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 39 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 268 place count 395 transition count 370
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 270 place count 395 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 272 place count 393 transition count 368
Free-agglomeration rule (complex) applied 41 times.
Iterating global reduction 4 with 41 rules applied. Total rules applied 313 place count 393 transition count 327
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 4 with 41 rules applied. Total rules applied 354 place count 352 transition count 327
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 378 place count 352 transition count 327
Applied a total of 378 rules in 273 ms. Remains 352 /529 variables (removed 177) and now considering 327/498 (removed 171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 352/529 places, 327/498 transitions.
RANDOM walk for 40000 steps (3193 resets) in 1098 ms. (36 steps per ms) remains 65/66 properties
BEST_FIRST walk for 4001 steps (234 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (228 resets) in 67 ms. (58 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (229 resets) in 43 ms. (90 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (214 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (225 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (223 resets) in 39 ms. (100 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (236 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (235 resets) in 54 ms. (72 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (224 resets) in 42 ms. (93 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (233 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (233 resets) in 48 ms. (81 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (231 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (219 resets) in 27 ms. (142 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (232 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (215 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (208 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (222 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (239 resets) in 46 ms. (85 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (214 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (226 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (231 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (232 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (228 resets) in 22 ms. (173 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (228 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (211 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (231 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (223 resets) in 22 ms. (173 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (232 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (229 resets) in 23 ms. (166 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (227 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (220 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (232 resets) in 22 ms. (173 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (233 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (332 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (225 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (239 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (230 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (228 resets) in 22 ms. (173 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (226 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (216 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (226 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (225 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (236 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (225 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (226 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (227 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (223 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (238 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (237 resets) in 22 ms. (173 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (233 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
Interrupted probabilistic random walk after 178074 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :9 out of 65
Probabilistic random walk after 178074 steps, saw 89076 distinct states, run finished after 3005 ms. (steps per millisecond=59 ) properties seen :9
// Phase 1: matrix 327 rows 352 cols
[2024-05-22 11:28:53] [INFO ] Computed 50 invariants in 30 ms
[2024-05-22 11:28:53] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 3/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 211/311 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 13/324 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 327/651 variables, 324/374 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 17/391 constraints. Problems are: Problem set: 0 solved, 56 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 10 (OVERLAPS) 28/679 variables, 28/419 constraints. Problems are: Problem set: 9 solved, 47 unsolved
[2024-05-22 11:28:57] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 10 ms to minimize.
[2024-05-22 11:28:57] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:28:57] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/679 variables, 3/422 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/679 variables, 0/422 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 13 (OVERLAPS) 0/679 variables, 0/422 constraints. Problems are: Problem set: 9 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 679/679 variables, and 422 constraints, problems are : Problem set: 9 solved, 47 unsolved in 8306 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 352/352 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 9 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 203/276 variables, 36/36 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/36 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 4/280 variables, 2/38 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/38 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 41/321 variables, 12/50 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/50 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 326/647 variables, 321/371 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/647 variables, 17/388 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/647 variables, 29/417 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/647 variables, 0/417 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 32/679 variables, 31/448 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/679 variables, 18/466 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/679 variables, 3/469 constraints. Problems are: Problem set: 9 solved, 47 unsolved
[2024-05-22 11:29:08] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:29:09] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:29:09] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:29:09] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:29:09] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:29:09] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/679 variables, 6/475 constraints. Problems are: Problem set: 9 solved, 47 unsolved
[2024-05-22 11:29:15] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:29:15] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-22 11:29:15] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:29:15] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:29:15] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 0 ms to minimize.
[2024-05-22 11:29:15] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:29:15] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2024-05-22 11:29:15] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:29:16] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-05-22 11:29:16] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:29:16] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/679 variables, 11/486 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/679 variables, 0/486 constraints. Problems are: Problem set: 9 solved, 47 unsolved
At refinement iteration 17 (OVERLAPS) 0/679 variables, 0/486 constraints. Problems are: Problem set: 9 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 679/679 variables, and 486 constraints, problems are : Problem set: 9 solved, 47 unsolved in 24912 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 352/352 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 47/56 constraints, Known Traps: 20/20 constraints]
After SMT, in 33284ms problems are : Problem set: 9 solved, 47 unsolved
Parikh walk visited 0 properties in 32478 ms.
Support contains 73 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 327/327 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 352 transition count 319
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 344 transition count 318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 343 transition count 318
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 18 place count 343 transition count 315
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 340 transition count 315
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 52 place count 326 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 58 place count 323 transition count 301
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 68 place count 323 transition count 291
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 78 place count 313 transition count 291
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 90 place count 313 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 312 transition count 290
Applied a total of 91 rules in 67 ms. Remains 312 /352 variables (removed 40) and now considering 290/327 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 312/352 places, 290/327 transitions.
RANDOM walk for 40000 steps (4291 resets) in 311 ms. (128 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (284 resets) in 41 ms. (95 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (306 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (298 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (305 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (311 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (304 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (305 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (301 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (300 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (291 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (329 resets) in 45 ms. (87 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (295 resets) in 46 ms. (85 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (299 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (293 resets) in 32 ms. (121 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (287 resets) in 47 ms. (83 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (306 resets) in 39 ms. (100 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (308 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (295 resets) in 22 ms. (173 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (308 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (306 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (312 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (299 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (297 resets) in 32 ms. (121 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (273 resets) in 40 ms. (97 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (283 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (327 resets) in 32 ms. (121 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (300 resets) in 34 ms. (114 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (303 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (284 resets) in 28 ms. (137 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (272 resets) in 35 ms. (111 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (298 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (299 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (301 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (306 resets) in 37 ms. (105 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (300 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (296 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (281 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (284 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (322 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (292 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (298 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (317 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (312 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (315 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (292 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (299 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (318 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
Interrupted probabilistic random walk after 171693 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 47
Probabilistic random walk after 171693 steps, saw 85867 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :0
// Phase 1: matrix 290 rows 312 cols
[2024-05-22 11:30:02] [INFO ] Computed 50 invariants in 20 ms
[2024-05-22 11:30:02] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 182/255 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 25/280 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 2/282 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 289/571 variables, 282/330 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 25/355 constraints. Problems are: Problem set: 0 solved, 47 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 30/601 variables, 29/384 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/601 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/601 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (OVERLAPS) 1/602 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/602 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 15 (OVERLAPS) 0/602 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 387 constraints, problems are : Problem set: 0 solved, 47 unsolved in 7072 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 312/312 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 182/255 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 25/280 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 2/282 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 289/571 variables, 282/330 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 25/355 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 26/381 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 30/601 variables, 29/410 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/601 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/601 variables, 21/433 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 15 (OVERLAPS) 1/602 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/602 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 11:30:23] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-22 11:30:23] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/602 variables, 2/436 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/602 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 19 (OVERLAPS) 0/602 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 436 constraints, problems are : Problem set: 0 solved, 47 unsolved in 20707 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 312/312 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 2/2 constraints]
After SMT, in 27818ms problems are : Problem set: 0 solved, 47 unsolved
Parikh walk visited 0 properties in 30000 ms.
Support contains 73 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 290/290 transitions.
Applied a total of 0 rules in 23 ms. Remains 312 /312 variables (removed 0) and now considering 290/290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 312/312 places, 290/290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 290/290 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 290/290 (removed 0) transitions.
[2024-05-22 11:31:00] [INFO ] Invariant cache hit.
[2024-05-22 11:31:00] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-22 11:31:00] [INFO ] Invariant cache hit.
[2024-05-22 11:31:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 11:31:02] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned [21, 28, 50, 57, 137, 172, 198, 204, 249, 277, 303, 309]
[2024-05-22 11:31:02] [INFO ] Actually due to overlaps returned [249, 172, 137, 198, 204, 277]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 1662 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 306/312 places, 290/290 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 288
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 304 transition count 288
Applied a total of 4 rules in 21 ms. Remains 304 /306 variables (removed 2) and now considering 288/290 (removed 2) transitions.
// Phase 1: matrix 288 rows 304 cols
[2024-05-22 11:31:02] [INFO ] Computed 44 invariants in 16 ms
[2024-05-22 11:31:02] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-22 11:31:02] [INFO ] Invariant cache hit.
[2024-05-22 11:31:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 11:31:03] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned [21, 28, 50, 57, 295, 301]
[2024-05-22 11:31:03] [INFO ] Actually due to overlaps returned [301, 295]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1298 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 302/312 places, 288/290 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 301 transition count 287
Applied a total of 2 rules in 20 ms. Remains 301 /302 variables (removed 1) and now considering 287/288 (removed 1) transitions.
// Phase 1: matrix 287 rows 301 cols
[2024-05-22 11:31:03] [INFO ] Computed 42 invariants in 20 ms
[2024-05-22 11:31:03] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-22 11:31:03] [INFO ] Invariant cache hit.
[2024-05-22 11:31:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 11:31:05] [INFO ] Implicit Places using invariants and state equation in 1752 ms returned [21, 28, 50, 57]
[2024-05-22 11:31:05] [INFO ] Actually due to overlaps returned [28, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1895 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 299/312 places, 287/290 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 298 transition count 286
Applied a total of 2 rules in 19 ms. Remains 298 /299 variables (removed 1) and now considering 286/287 (removed 1) transitions.
// Phase 1: matrix 286 rows 298 cols
[2024-05-22 11:31:05] [INFO ] Computed 40 invariants in 21 ms
[2024-05-22 11:31:05] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-22 11:31:05] [INFO ] Invariant cache hit.
[2024-05-22 11:31:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-22 11:31:06] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned [47, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1235 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 296/312 places, 286/290 transitions.
Applied a total of 0 rules in 9 ms. Remains 296 /296 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 6170 ms. Remains : 296/312 places, 286/290 transitions.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-010-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 11:31:06] [INFO ] Flatten gal took : 23 ms
[2024-05-22 11:31:06] [INFO ] Flatten gal took : 23 ms
[2024-05-22 11:31:06] [INFO ] Input system was already deterministic with 498 transitions.
Support contains 86 out of 529 places (down from 87) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 898 edges and 529 vertex of which 527 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Applied a total of 0 rules in 9 ms. Remains 529 /529 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 529/529 places, 498/498 transitions.
[2024-05-22 11:31:06] [INFO ] Flatten gal took : 19 ms
[2024-05-22 11:31:06] [INFO ] Flatten gal took : 20 ms
[2024-05-22 11:31:07] [INFO ] Input system was already deterministic with 498 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Applied a total of 0 rules in 8 ms. Remains 529 /529 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 529/529 places, 498/498 transitions.
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 19 ms
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 18 ms
[2024-05-22 11:31:07] [INFO ] Input system was already deterministic with 498 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 528 transition count 377
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 241 place count 408 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 407 transition count 376
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 242 place count 407 transition count 356
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 282 place count 387 transition count 356
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 424 place count 316 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 425 place count 315 transition count 284
Applied a total of 425 rules in 41 ms. Remains 315 /529 variables (removed 214) and now considering 284/498 (removed 214) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 315/529 places, 284/498 transitions.
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 13 ms
[2024-05-22 11:31:07] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Applied a total of 0 rules in 8 ms. Remains 529 /529 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 529/529 places, 498/498 transitions.
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 15 ms
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 16 ms
[2024-05-22 11:31:07] [INFO ] Input system was already deterministic with 498 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 528 transition count 382
Reduce places removed 115 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 118 rules applied. Total rules applied 233 place count 413 transition count 379
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 236 place count 410 transition count 379
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 236 place count 410 transition count 358
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 278 place count 389 transition count 358
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 416 place count 320 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 417 place count 319 transition count 288
Applied a total of 417 rules in 43 ms. Remains 319 /529 variables (removed 210) and now considering 288/498 (removed 210) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 319/529 places, 288/498 transitions.
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:31:07] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Applied a total of 0 rules in 8 ms. Remains 529 /529 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 529/529 places, 498/498 transitions.
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 14 ms
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 14 ms
[2024-05-22 11:31:07] [INFO ] Input system was already deterministic with 498 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Applied a total of 0 rules in 8 ms. Remains 529 /529 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 529/529 places, 498/498 transitions.
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 13 ms
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 13 ms
[2024-05-22 11:31:07] [INFO ] Input system was already deterministic with 498 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Applied a total of 0 rules in 8 ms. Remains 529 /529 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 529/529 places, 498/498 transitions.
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 18 ms
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 15 ms
[2024-05-22 11:31:07] [INFO ] Input system was already deterministic with 498 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 528 transition count 382
Reduce places removed 115 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 116 rules applied. Total rules applied 231 place count 413 transition count 381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 412 transition count 381
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 232 place count 412 transition count 362
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 270 place count 393 transition count 362
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 406 place count 325 transition count 294
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 407 place count 325 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 408 place count 324 transition count 293
Applied a total of 408 rules in 39 ms. Remains 324 /529 variables (removed 205) and now considering 293/498 (removed 205) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 324/529 places, 293/498 transitions.
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:31:07] [INFO ] Input system was already deterministic with 293 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 528 transition count 376
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 407 transition count 376
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 242 place count 407 transition count 356
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 282 place count 387 transition count 356
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 424 place count 316 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 425 place count 315 transition count 284
Applied a total of 425 rules in 27 ms. Remains 315 /529 variables (removed 214) and now considering 284/498 (removed 214) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 315/529 places, 284/498 transitions.
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:31:07] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Applied a total of 0 rules in 23 ms. Remains 529 /529 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 529/529 places, 498/498 transitions.
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 14 ms
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 13 ms
[2024-05-22 11:31:07] [INFO ] Input system was already deterministic with 498 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 528 transition count 380
Reduce places removed 117 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 119 rules applied. Total rules applied 236 place count 411 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 238 place count 409 transition count 378
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 238 place count 409 transition count 357
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 280 place count 388 transition count 357
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 420 place count 318 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 421 place count 317 transition count 286
Applied a total of 421 rules in 28 ms. Remains 317 /529 variables (removed 212) and now considering 286/498 (removed 212) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 317/529 places, 286/498 transitions.
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:31:07] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Applied a total of 0 rules in 8 ms. Remains 529 /529 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 529/529 places, 498/498 transitions.
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 12 ms
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 12 ms
[2024-05-22 11:31:07] [INFO ] Input system was already deterministic with 498 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Applied a total of 0 rules in 7 ms. Remains 529 /529 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 529/529 places, 498/498 transitions.
[2024-05-22 11:31:07] [INFO ] Flatten gal took : 12 ms
[2024-05-22 11:31:08] [INFO ] Flatten gal took : 19 ms
[2024-05-22 11:31:08] [INFO ] Input system was already deterministic with 498 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 498/498 transitions.
Applied a total of 0 rules in 8 ms. Remains 529 /529 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 529/529 places, 498/498 transitions.
[2024-05-22 11:31:08] [INFO ] Flatten gal took : 12 ms
[2024-05-22 11:31:08] [INFO ] Flatten gal took : 13 ms
[2024-05-22 11:31:08] [INFO ] Input system was already deterministic with 498 transitions.
[2024-05-22 11:31:08] [INFO ] Flatten gal took : 13 ms
[2024-05-22 11:31:08] [INFO ] Flatten gal took : 13 ms
[2024-05-22 11:31:08] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-22 11:31:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 529 places, 498 transitions and 1397 arcs took 4 ms.
Total runtime 152800 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DoubleExponent-PT-010
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 529
TRANSITIONS: 498
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.000s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 669
MODEL NAME: /home/mcc/execution/411/model
529 places, 498 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
BK_TIME_CONFINEMENT_REACHED
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory
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="DoubleExponent-PT-010"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 greatspnxred"
echo " Input is DoubleExponent-PT-010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131300554"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;