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.r091-tall-171624188200689.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 DES-PT-20b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188200689
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 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 91K 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 DES-PT-20b-CTLCardinality-2024-00
FORMULA_NAME DES-PT-20b-CTLCardinality-2024-01
FORMULA_NAME DES-PT-20b-CTLCardinality-2024-02
FORMULA_NAME DES-PT-20b-CTLCardinality-2024-03
FORMULA_NAME DES-PT-20b-CTLCardinality-2024-04
FORMULA_NAME DES-PT-20b-CTLCardinality-2024-05
FORMULA_NAME DES-PT-20b-CTLCardinality-2024-06
FORMULA_NAME DES-PT-20b-CTLCardinality-2024-07
FORMULA_NAME DES-PT-20b-CTLCardinality-2024-08
FORMULA_NAME DES-PT-20b-CTLCardinality-2024-09
FORMULA_NAME DES-PT-20b-CTLCardinality-2024-10
FORMULA_NAME DES-PT-20b-CTLCardinality-2024-11
FORMULA_NAME DES-PT-20b-CTLCardinality-2023-12
FORMULA_NAME DES-PT-20b-CTLCardinality-2023-13
FORMULA_NAME DES-PT-20b-CTLCardinality-2023-14
FORMULA_NAME DES-PT-20b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716318164118

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 19:02:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 19:02:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:02:45] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-21 19:02:45] [INFO ] Transformed 360 places.
[2024-05-21 19:02:45] [INFO ] Transformed 311 transitions.
[2024-05-21 19:02:45] [INFO ] Found NUPN structural information;
[2024-05-21 19:02:45] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-20b-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 103 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 311/311 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 358 transition count 311
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 342 transition count 295
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 342 transition count 295
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 337 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 337 transition count 290
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 49 place count 337 transition count 285
Applied a total of 49 rules in 84 ms. Remains 337 /360 variables (removed 23) and now considering 285/311 (removed 26) transitions.
// Phase 1: matrix 285 rows 337 cols
[2024-05-21 19:02:45] [INFO ] Computed 63 invariants in 33 ms
[2024-05-21 19:02:45] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-21 19:02:45] [INFO ] Invariant cache hit.
[2024-05-21 19:02:46] [INFO ] Implicit Places using invariants and state equation in 335 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 693 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 336/360 places, 285/311 transitions.
Applied a total of 0 rules in 5 ms. Remains 336 /336 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 797 ms. Remains : 336/360 places, 285/311 transitions.
Support contains 103 out of 336 places after structural reductions.
[2024-05-21 19:02:46] [INFO ] Flatten gal took : 50 ms
[2024-05-21 19:02:46] [INFO ] Flatten gal took : 24 ms
[2024-05-21 19:02:46] [INFO ] Input system was already deterministic with 285 transitions.
Support contains 96 out of 336 places (down from 103) after GAL structural reductions.
RANDOM walk for 40000 steps (335 resets) in 2395 ms. (16 steps per ms) remains 13/53 properties
BEST_FIRST walk for 40003 steps (61 resets) in 518 ms. (77 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (49 resets) in 200 ms. (199 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (52 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (54 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (49 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (46 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (45 resets) in 272 ms. (146 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (52 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (52 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (45 resets) in 100 ms. (396 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (46 resets) in 42 ms. (930 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (51 resets) in 44 ms. (888 steps per ms) remains 13/13 properties
// Phase 1: matrix 285 rows 336 cols
[2024-05-21 19:02:47] [INFO ] Computed 62 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 178/207 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 118/325 variables, 26/62 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 277/602 variables, 325/387 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 13/615 variables, 8/395 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 0/395 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 2/617 variables, 1/396 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/617 variables, 0/396 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 2/619 variables, 1/397 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/619 variables, 0/397 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 2/621 variables, 1/398 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/621 variables, 0/398 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/621 variables, 0/398 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 621/621 variables, and 398 constraints, problems are : Problem set: 1 solved, 12 unsolved in 1950 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 73/98 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 108/206 variables, 28/35 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-21 19:02:50] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 49 ms to minimize.
[2024-05-21 19:02:50] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 2/37 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 6 (OVERLAPS) 119/325 variables, 27/64 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-05-21 19:02:50] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:02:50] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 2/66 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 277/602 variables, 325/391 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 11/402 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-05-21 19:02:51] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:02:51] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:02:51] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-21 19:02:51] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 4/406 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/602 variables, 0/406 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 13/615 variables, 8/414 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-05-21 19:02:52] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/615 variables, 1/415 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-05-21 19:02:53] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:02:53] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-21 19:02:53] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-21 19:02:53] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/615 variables, 4/419 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/615 variables, 0/419 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 2/617 variables, 1/420 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/617 variables, 0/420 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 2/619 variables, 1/421 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/621 variables, and 421 constraints, problems are : Problem set: 2 solved, 11 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 335/336 constraints, PredecessorRefiner: 11/13 constraints, Known Traps: 13/13 constraints]
After SMT, in 7007ms problems are : Problem set: 2 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 336 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 285/285 transitions.
Graph (complete) has 692 edges and 336 vertex of which 331 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 331 transition count 265
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 317 transition count 263
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 315 transition count 263
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 35 place count 315 transition count 256
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 49 place count 308 transition count 256
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 59 place count 298 transition count 246
Iterating global reduction 3 with 10 rules applied. Total rules applied 69 place count 298 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 74 place count 298 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 297 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 75 place count 297 transition count 240
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 77 place count 296 transition count 240
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 80 place count 293 transition count 237
Iterating global reduction 5 with 3 rules applied. Total rules applied 83 place count 293 transition count 237
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 87 place count 293 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 88 place count 292 transition count 233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 88 place count 292 transition count 232
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 90 place count 291 transition count 232
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 7 with 152 rules applied. Total rules applied 242 place count 215 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 244 place count 214 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 245 place count 214 transition count 155
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 247 place count 214 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 248 place count 213 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 249 place count 212 transition count 154
Applied a total of 249 rules in 166 ms. Remains 212 /336 variables (removed 124) and now considering 154/285 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 212/336 places, 154/285 transitions.
RANDOM walk for 40000 steps (1354 resets) in 511 ms. (78 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (296 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (294 resets) in 76 ms. (519 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (306 resets) in 109 ms. (363 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (279 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (255 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (276 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (275 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (266 resets) in 56 ms. (701 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (285 resets) in 108 ms. (366 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (280 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (293 resets) in 67 ms. (588 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 794937 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 11
Probabilistic random walk after 794937 steps, saw 126982 distinct states, run finished after 3004 ms. (steps per millisecond=264 ) properties seen :0
// Phase 1: matrix 154 rows 212 cols
[2024-05-21 19:02:58] [INFO ] Computed 62 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 29/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 101/153 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 24/177 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 19/196 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 6/202 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 151/353 variables, 202/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 12/365 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 1/366 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/366 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 0/366 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 274 constraints, problems are : Problem set: 0 solved, 11 unsolved in 869 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 29/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 101/153 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 24/177 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 19/196 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 6/202 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 151/353 variables, 202/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 19:03:00] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 12/365 variables, 9/277 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/365 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 1/366 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/366 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/366 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 0/366 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 286 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2386 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 3284ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 12236 ms.
Support contains 23 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 154/154 transitions.
Applied a total of 0 rules in 7 ms. Remains 212 /212 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 212/212 places, 154/154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 154/154 transitions.
Applied a total of 0 rules in 7 ms. Remains 212 /212 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2024-05-21 19:03:14] [INFO ] Invariant cache hit.
[2024-05-21 19:03:14] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 19:03:14] [INFO ] Invariant cache hit.
[2024-05-21 19:03:14] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-21 19:03:14] [INFO ] Redundant transitions in 4 ms returned []
Running 151 sub problems to find dead transitions.
[2024-05-21 19:03:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 151 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/212 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 154/366 variables, 212/274 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:03:16] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:03:17] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:03:18] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:03:19] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 19:03:19] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:03:19] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:03:21] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/366 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:03:22] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 13 (OVERLAPS) 0/366 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 282 constraints, problems are : Problem set: 0 solved, 151 unsolved in 10509 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 3/212 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:03:26] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 154/366 variables, 212/283 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 151/434 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:03:39] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/366 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:03:51] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 436 constraints, problems are : Problem set: 0 solved, 151 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 11/11 constraints]
After SMT, in 40608ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 40612ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40980 ms. Remains : 212/212 places, 154/154 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 7 ms. Remains 212 /212 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Running SMT prover for 11 properties.
[2024-05-21 19:03:55] [INFO ] Invariant cache hit.
[2024-05-21 19:03:55] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 19:03:55] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 41 ms returned sat
[2024-05-21 19:03:55] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-21 19:03:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 19:03:55] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-21 19:03:55] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-05-21 19:03:55] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-21 19:03:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-21 19:03:55] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:03:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-21 19:03:56] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:03:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
TRAPS : Iteration 1
[2024-05-21 19:03:56] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:03:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
TRAPS : Iteration 2
[2024-05-21 19:03:56] [INFO ] After 972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2024-05-21 19:03:56] [INFO ] After 1218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Over-approximation ignoring read arcs solved 0 properties in 1370 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2024-05-21 19:03:56] [INFO ] Flatten gal took : 16 ms
[2024-05-21 19:03:56] [INFO ] Flatten gal took : 25 ms
[2024-05-21 19:03:56] [INFO ] Input system was already deterministic with 285 transitions.
Computed a total of 141 stabilizing places and 134 stable transitions
Graph (complete) has 692 edges and 336 vertex of which 328 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.8 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 336/336 places, 285/285 transitions.
Graph (complete) has 692 edges and 336 vertex of which 328 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 327 transition count 264
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 312 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 311 transition count 263
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 33 place count 311 transition count 254
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 51 place count 302 transition count 254
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 63 place count 290 transition count 242
Iterating global reduction 3 with 12 rules applied. Total rules applied 75 place count 290 transition count 242
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 82 place count 290 transition count 235
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 85 place count 288 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 85 place count 288 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 87 place count 287 transition count 233
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 91 place count 283 transition count 229
Iterating global reduction 5 with 4 rules applied. Total rules applied 95 place count 283 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 99 place count 283 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 100 place count 282 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 100 place count 282 transition count 224
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 102 place count 281 transition count 224
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 7 with 142 rules applied. Total rules applied 244 place count 210 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 246 place count 208 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 247 place count 207 transition count 151
Applied a total of 247 rules in 66 ms. Remains 207 /336 variables (removed 129) and now considering 151/285 (removed 134) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 207/336 places, 151/285 transitions.
[2024-05-21 19:03:56] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:03:56] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:03:56] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 285/285 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 335 transition count 285
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 320 transition count 270
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 320 transition count 270
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 36 place count 320 transition count 265
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 313 transition count 258
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 313 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 313 transition count 254
Applied a total of 54 rules in 25 ms. Remains 313 /336 variables (removed 23) and now considering 254/285 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 313/336 places, 254/285 transitions.
[2024-05-21 19:03:56] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:03:56] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:03:57] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 285/285 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 326 transition count 275
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 326 transition count 275
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 326 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 323 transition count 269
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 323 transition count 269
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 323 transition count 266
Applied a total of 32 rules in 25 ms. Remains 323 /336 variables (removed 13) and now considering 266/285 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 323/336 places, 266/285 transitions.
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:03:57] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 285/285 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 335 transition count 285
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 320 transition count 270
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 320 transition count 270
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 36 place count 320 transition count 265
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 313 transition count 258
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 313 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 313 transition count 254
Applied a total of 54 rules in 25 ms. Remains 313 /336 variables (removed 23) and now considering 254/285 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 313/336 places, 254/285 transitions.
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:03:57] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 285/285 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 335 transition count 285
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 321 transition count 271
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 321 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 33 place count 321 transition count 267
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 39 place count 315 transition count 261
Iterating global reduction 2 with 6 rules applied. Total rules applied 45 place count 315 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 315 transition count 258
Applied a total of 48 rules in 17 ms. Remains 315 /336 variables (removed 21) and now considering 258/285 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 315/336 places, 258/285 transitions.
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:03:57] [INFO ] Input system was already deterministic with 258 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 336/336 places, 285/285 transitions.
Graph (complete) has 692 edges and 336 vertex of which 328 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 327 transition count 263
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 311 transition count 263
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 311 transition count 253
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 301 transition count 253
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 65 place count 289 transition count 241
Iterating global reduction 2 with 12 rules applied. Total rules applied 77 place count 289 transition count 241
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 84 place count 289 transition count 234
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 87 place count 287 transition count 233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 87 place count 287 transition count 232
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 286 transition count 232
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 93 place count 282 transition count 228
Iterating global reduction 4 with 4 rules applied. Total rules applied 97 place count 282 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 282 transition count 225
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 100 place count 282 transition count 223
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 104 place count 280 transition count 223
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 244 place count 210 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 246 place count 208 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 247 place count 207 transition count 151
Applied a total of 247 rules in 48 ms. Remains 207 /336 variables (removed 129) and now considering 151/285 (removed 134) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 207/336 places, 151/285 transitions.
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:03:57] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 336/336 places, 285/285 transitions.
Graph (complete) has 692 edges and 336 vertex of which 328 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 327 transition count 264
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 312 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 311 transition count 263
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 33 place count 311 transition count 254
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 51 place count 302 transition count 254
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 63 place count 290 transition count 242
Iterating global reduction 3 with 12 rules applied. Total rules applied 75 place count 290 transition count 242
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 82 place count 290 transition count 235
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 85 place count 288 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 85 place count 288 transition count 233
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 87 place count 287 transition count 233
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 91 place count 283 transition count 229
Iterating global reduction 5 with 4 rules applied. Total rules applied 95 place count 283 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 98 place count 283 transition count 226
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 98 place count 283 transition count 224
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 102 place count 281 transition count 224
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 234 place count 215 transition count 158
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 213 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 212 transition count 156
Applied a total of 237 rules in 48 ms. Remains 212 /336 variables (removed 124) and now considering 156/285 (removed 129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 212/336 places, 156/285 transitions.
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:03:57] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 285/285 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 335 transition count 285
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 320 transition count 270
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 320 transition count 270
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 36 place count 320 transition count 265
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 313 transition count 258
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 313 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 313 transition count 254
Applied a total of 54 rules in 17 ms. Remains 313 /336 variables (removed 23) and now considering 254/285 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 313/336 places, 254/285 transitions.
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:03:57] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 336/336 places, 285/285 transitions.
Graph (complete) has 692 edges and 336 vertex of which 328 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 327 transition count 264
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 312 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 311 transition count 263
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 33 place count 311 transition count 253
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 53 place count 301 transition count 253
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 65 place count 289 transition count 241
Iterating global reduction 3 with 12 rules applied. Total rules applied 77 place count 289 transition count 241
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 84 place count 289 transition count 234
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 87 place count 287 transition count 233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 87 place count 287 transition count 232
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 89 place count 286 transition count 232
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 93 place count 282 transition count 228
Iterating global reduction 5 with 4 rules applied. Total rules applied 97 place count 282 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 100 place count 282 transition count 225
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 100 place count 282 transition count 223
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 104 place count 280 transition count 223
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 246 place count 209 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 207 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 249 place count 206 transition count 150
Applied a total of 249 rules in 39 ms. Remains 206 /336 variables (removed 130) and now considering 150/285 (removed 135) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 206/336 places, 150/285 transitions.
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:03:57] [INFO ] Input system was already deterministic with 150 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 336/336 places, 285/285 transitions.
Graph (complete) has 692 edges and 336 vertex of which 328 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 327 transition count 263
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 311 transition count 263
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 33 place count 311 transition count 254
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 302 transition count 254
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 62 place count 291 transition count 243
Iterating global reduction 2 with 11 rules applied. Total rules applied 73 place count 291 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 291 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 290 transition count 238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 79 place count 290 transition count 237
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 81 place count 289 transition count 237
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 85 place count 285 transition count 233
Iterating global reduction 4 with 4 rules applied. Total rules applied 89 place count 285 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 92 place count 285 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 92 place count 285 transition count 228
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 96 place count 283 transition count 228
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 5 with 138 rules applied. Total rules applied 234 place count 214 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 214 transition count 158
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 236 place count 214 transition count 158
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 212 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 239 place count 211 transition count 156
Applied a total of 239 rules in 43 ms. Remains 211 /336 variables (removed 125) and now considering 156/285 (removed 129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 211/336 places, 156/285 transitions.
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:03:57] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 285/285 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 335 transition count 285
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 322 transition count 272
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 322 transition count 272
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 322 transition count 268
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 36 place count 317 transition count 263
Iterating global reduction 2 with 5 rules applied. Total rules applied 41 place count 317 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 317 transition count 261
Applied a total of 43 rules in 19 ms. Remains 317 /336 variables (removed 19) and now considering 261/285 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 317/336 places, 261/285 transitions.
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:03:57] [INFO ] Input system was already deterministic with 261 transitions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 285/285 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 335 transition count 285
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 320 transition count 270
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 320 transition count 270
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 36 place count 320 transition count 265
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 313 transition count 258
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 313 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 313 transition count 254
Applied a total of 54 rules in 11 ms. Remains 313 /336 variables (removed 23) and now considering 254/285 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 313/336 places, 254/285 transitions.
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:03:57] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 285/285 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 335 transition count 285
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 321 transition count 271
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 321 transition count 271
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 321 transition count 266
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 40 place count 315 transition count 260
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 315 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 315 transition count 257
Applied a total of 49 rules in 12 ms. Remains 315 /336 variables (removed 21) and now considering 257/285 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 315/336 places, 257/285 transitions.
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:03:57] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 285/285 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 335 transition count 285
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 323 transition count 273
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 323 transition count 273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 30 place count 323 transition count 268
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 36 place count 317 transition count 262
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 317 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 45 place count 317 transition count 259
Applied a total of 45 rules in 15 ms. Remains 317 /336 variables (removed 19) and now considering 259/285 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 317/336 places, 259/285 transitions.
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:03:57] [INFO ] Input system was already deterministic with 259 transitions.
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:03:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:03:57] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 19:03:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 336 places, 285 transitions and 921 arcs took 2 ms.
Total runtime 72610 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-20b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 336
TRANSITIONS: 285
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]


----------------------------------------------------------------------
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: 672
MODEL NAME: /home/mcc/execution/410/model
336 places, 285 transitions.

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.
Building monolithic NSF...
FORMULA DES-PT-20b-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-20b-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-20b-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-20b-CTLCardinality-2024-00 CANNOT_COMPUTE
FORMULA DES-PT-20b-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA DES-PT-20b-CTLCardinality-2024-02 CANNOT_COMPUTE
FORMULA DES-PT-20b-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA DES-PT-20b-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA DES-PT-20b-CTLCardinality-2024-07 CANNOT_COMPUTE
FORMULA DES-PT-20b-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA DES-PT-20b-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA DES-PT-20b-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA DES-PT-20b-CTLCardinality-2023-14 CANNOT_COMPUTE
FORMULA DES-PT-20b-CTLCardinality-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716319481095

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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="DES-PT-20b"
export BK_EXAMINATION="CTLCardinality"
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 DES-PT-20b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624188200689"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;