fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r091-tall-171624188200673
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for DES-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12834.483 1844616.00 6708098.00 1080.10 ?T?????????????? 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.r091-tall-171624188200673.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-10b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188200673
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 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 8.0K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 08:09 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 79K 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-10b-CTLCardinality-2024-00
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-01
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-02
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-03
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-04
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-05
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-06
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-07
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-08
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-09
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-10
FORMULA_NAME DES-PT-10b-CTLCardinality-2024-11
FORMULA_NAME DES-PT-10b-CTLCardinality-2023-12
FORMULA_NAME DES-PT-10b-CTLCardinality-2023-13
FORMULA_NAME DES-PT-10b-CTLCardinality-2023-14
FORMULA_NAME DES-PT-10b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716315563102

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-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 18:19:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 18:19:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:19:24] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-21 18:19:24] [INFO ] Transformed 320 places.
[2024-05-21 18:19:24] [INFO ] Transformed 271 transitions.
[2024-05-21 18:19:24] [INFO ] Found NUPN structural information;
[2024-05-21 18:19:24] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 124 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 318 transition count 271
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 309 transition count 262
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 309 transition count 262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 306 transition count 259
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 306 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 306 transition count 258
Applied a total of 27 rules in 83 ms. Remains 306 /320 variables (removed 14) and now considering 258/271 (removed 13) transitions.
// Phase 1: matrix 258 rows 306 cols
[2024-05-21 18:19:24] [INFO ] Computed 63 invariants in 27 ms
[2024-05-21 18:19:24] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-21 18:19:24] [INFO ] Invariant cache hit.
[2024-05-21 18:19:25] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-21 18:19:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 2/306 variables, 34/49 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 258/564 variables, 306/369 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 18:19:30] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 30 ms to minimize.
[2024-05-21 18:19:30] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-05-21 18:19:30] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 13 ms to minimize.
[2024-05-21 18:19:30] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-05-21 18:19:30] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-05-21 18:19:31] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-21 18:19:31] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-21 18:19:31] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-21 18:19:31] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:19:31] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-21 18:19:31] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:19:31] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:19:31] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:19:31] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:19:31] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:19:31] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-21 18:19:32] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 18:19:32] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:19:32] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:19:32] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 20/389 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 18:19:34] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:19:36] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-05-21 18:19:36] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 18:19:38] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:19:38] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:19:38] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-21 18:19:38] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-21 18:19:38] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-21 18:19:38] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:19:38] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:19:38] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:19:38] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 18:19:38] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:19:38] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:19:38] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 5 ms to minimize.
[2024-05-21 18:19:39] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-21 18:19:39] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:19:39] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 2 ms to minimize.
[2024-05-21 18:19:39] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-21 18:19:39] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
[2024-05-21 18:19:39] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-21 18:19:40] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-21 18:19:40] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 18:19:40] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:19:40] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-21 18:19:41] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-21 18:19:41] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-21 18:19:41] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-21 18:19:41] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:19:41] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-21 18:19:42] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-21 18:19:42] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:19:42] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 2 ms to minimize.
[2024-05-21 18:19:43] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 11/423 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 18:19:46] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:19:46] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 18:19:48] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:19:48] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 18:19:48] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-21 18:19:48] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 429 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 2/306 variables, 34/49 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 60/123 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 18:19:57] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 18:19:57] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:19:57] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:19:57] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:19:57] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-21 18:19:58] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:19:58] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:19:58] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:19:58] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:19:58] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:19:58] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:19:58] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:19:58] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:19:58] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:19:58] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 15/138 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 18:19:59] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:19:59] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:19:59] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:19:59] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-21 18:20:00] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 18:20:01] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:20:01] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:20:01] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:20:01] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:20:01] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-21 18:20:02] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 18:20:02] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:20:02] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
[2024-05-21 18:20:02] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-05-21 18:20:02] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 10/153 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 18:20:03] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-21 18:20:03] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:20:03] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-21 18:20:04] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 18:20:05] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2024-05-21 18:20:06] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 18:20:08] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-21 18:20:08] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 12 (OVERLAPS) 258/564 variables, 306/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 257/724 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 18:20:15] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-21 18:20:15] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-21 18:20:16] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-21 18:20:16] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-21 18:20:20] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-21 18:20:21] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:20:22] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/564 variables, and 731 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 105/105 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Starting structural reductions in LTL mode, iteration 1 : 306/320 places, 258/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60957 ms. Remains : 306/320 places, 258/271 transitions.
Support contains 124 out of 306 places after structural reductions.
[2024-05-21 18:20:25] [INFO ] Flatten gal took : 46 ms
[2024-05-21 18:20:25] [INFO ] Flatten gal took : 39 ms
[2024-05-21 18:20:25] [INFO ] Input system was already deterministic with 258 transitions.
Support contains 117 out of 306 places (down from 124) after GAL structural reductions.
RANDOM walk for 40000 steps (336 resets) in 1755 ms. (22 steps per ms) remains 10/80 properties
BEST_FIRST walk for 40003 steps (46 resets) in 272 ms. (146 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (51 resets) in 192 ms. (207 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (46 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (46 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (54 resets) in 125 ms. (317 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (48 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (47 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (55 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (43 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
[2024-05-21 18:20:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 134/155 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 47/202 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 94/296 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 3/299 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 253/552 variables, 299/362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 9/561 variables, 5/367 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 3/564 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/564 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/564 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 369 constraints, problems are : Problem set: 0 solved, 9 unsolved in 976 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 134/155 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 47/202 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp47 is UNSAT
At refinement iteration 6 (OVERLAPS) 94/296 variables, 27/62 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 3/299 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 253/552 variables, 299/362 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 8/370 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 0/370 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 9/561 variables, 5/375 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 0/375 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 3/564 variables, 2/377 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-21 18:20:29] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-21 18:20:29] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/564 variables, 2/379 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-21 18:20:29] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-21 18:20:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/564 variables, 2/381 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-21 18:20:29] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/564 variables, 1/382 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/564 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/564 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 382 constraints, problems are : Problem set: 1 solved, 8 unsolved in 2505 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 5/5 constraints]
After SMT, in 3507ms problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 8446 ms.
Support contains 17 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 303 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 303 transition count 236
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 284 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 283 transition count 235
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 42 place count 283 transition count 228
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 56 place count 276 transition count 228
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 68 place count 264 transition count 216
Iterating global reduction 3 with 12 rules applied. Total rules applied 80 place count 264 transition count 216
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 85 place count 264 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 263 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 86 place count 263 transition count 209
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 90 place count 261 transition count 209
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 96 place count 255 transition count 203
Iterating global reduction 5 with 6 rules applied. Total rules applied 102 place count 255 transition count 203
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 5 with 7 rules applied. Total rules applied 109 place count 255 transition count 196
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 111 place count 254 transition count 195
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 111 place count 254 transition count 194
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 113 place count 253 transition count 194
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 7 with 144 rules applied. Total rules applied 257 place count 181 transition count 122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 265 place count 177 transition count 137
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 267 place count 177 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 269 place count 175 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 270 place count 174 transition count 134
Applied a total of 270 rules in 99 ms. Remains 174 /306 variables (removed 132) and now considering 134/258 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 174/306 places, 134/258 transitions.
RANDOM walk for 40000 steps (1459 resets) in 590 ms. (67 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (238 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (238 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (230 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (231 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (217 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (237 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
// Phase 1: matrix 134 rows 174 cols
[2024-05-21 18:20:39] [INFO ] Computed 63 invariants in 7 ms
[2024-05-21 18:20:39] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 70/81 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 6/87 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 69/156 variables, 26/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3/159 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 6/165 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 131/296 variables, 165/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 24/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/296 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 12/308 variables, 9/258 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/308 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/308 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/308 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 261 constraints, problems are : Problem set: 0 solved, 6 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 174/174 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 70/81 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 18:20:39] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 6/87 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 69/156 variables, 26/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 18:20:40] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:20:40] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-21 18:20:40] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:20:40] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:20:40] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:20:40] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/159 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 6/165 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/165 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 131/296 variables, 165/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/296 variables, 24/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/296 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 18:20:40] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/296 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/296 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 12/308 variables, 9/271 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/308 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/308 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 18:20:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/308 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/308 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/308 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 276 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1235 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 174/174 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 1592ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 2274 ms.
Support contains 7 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 134/134 transitions.
Graph (complete) has 516 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 132
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 10 place count 169 transition count 128
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 167 transition count 125
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 167 transition count 125
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 167 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 166 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 165 transition count 107
Applied a total of 33 rules in 41 ms. Remains 165 /174 variables (removed 9) and now considering 107/134 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 165/174 places, 107/134 transitions.
RANDOM walk for 40000 steps (1744 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (345 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (353 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (367 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (393 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 139900 steps, run visited all 4 properties in 721 ms. (steps per millisecond=194 )
Probabilistic random walk after 139900 steps, saw 38811 distinct states, run finished after 727 ms. (steps per millisecond=192 ) properties seen :4
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-21 18:20:44] [INFO ] Flatten gal took : 15 ms
[2024-05-21 18:20:44] [INFO ] Flatten gal took : 15 ms
[2024-05-21 18:20:44] [INFO ] Input system was already deterministic with 258 transitions.
Computed a total of 102 stabilizing places and 94 stable transitions
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 258
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 286 transition count 239
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 286 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 286 transition count 235
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 278 transition count 227
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 278 transition count 227
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 66 place count 278 transition count 220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 277 transition count 219
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 277 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 277 transition count 218
Applied a total of 69 rules in 55 ms. Remains 277 /306 variables (removed 29) and now considering 218/258 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 277/306 places, 218/258 transitions.
[2024-05-21 18:20:44] [INFO ] Flatten gal took : 13 ms
[2024-05-21 18:20:44] [INFO ] Flatten gal took : 11 ms
[2024-05-21 18:20:44] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 296 transition count 233
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 277 transition count 233
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 39 place count 277 transition count 224
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 57 place count 268 transition count 224
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 70 place count 255 transition count 211
Iterating global reduction 2 with 13 rules applied. Total rules applied 83 place count 255 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 87 place count 255 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 254 transition count 207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 88 place count 254 transition count 206
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 90 place count 253 transition count 206
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 98 place count 245 transition count 198
Iterating global reduction 4 with 8 rules applied. Total rules applied 106 place count 245 transition count 198
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 4 with 9 rules applied. Total rules applied 115 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 117 place count 244 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 117 place count 244 transition count 186
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 121 place count 242 transition count 186
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 6 with 140 rules applied. Total rules applied 261 place count 172 transition count 116
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 172 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 264 place count 170 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 265 place count 169 transition count 114
Applied a total of 265 rules in 62 ms. Remains 169 /306 variables (removed 137) and now considering 114/258 (removed 144) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 169/306 places, 114/258 transitions.
[2024-05-21 18:20:44] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:20:44] [INFO ] Flatten gal took : 18 ms
[2024-05-21 18:20:44] [INFO ] Input system was already deterministic with 114 transitions.
RANDOM walk for 10 steps (0 resets) in 9 ms. (1 steps per ms) remains 0/1 properties
FORMULA DES-PT-10b-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 296 transition count 234
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 278 transition count 234
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 37 place count 278 transition count 226
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 53 place count 270 transition count 226
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 66 place count 257 transition count 213
Iterating global reduction 2 with 13 rules applied. Total rules applied 79 place count 257 transition count 213
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 84 place count 257 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 256 transition count 208
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 85 place count 256 transition count 206
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 89 place count 254 transition count 206
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 96 place count 247 transition count 199
Iterating global reduction 4 with 7 rules applied. Total rules applied 103 place count 247 transition count 199
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 4 with 8 rules applied. Total rules applied 111 place count 247 transition count 191
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 113 place count 246 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 113 place count 246 transition count 188
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 117 place count 244 transition count 188
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 6 with 130 rules applied. Total rules applied 247 place count 179 transition count 123
Applied a total of 247 rules in 77 ms. Remains 179 /306 variables (removed 127) and now considering 123/258 (removed 135) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 179/306 places, 123/258 transitions.
[2024-05-21 18:20:44] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:20:44] [INFO ] Flatten gal took : 25 ms
[2024-05-21 18:20:44] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Discarding 9 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 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 296 transition count 234
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 278 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 277 transition count 233
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 39 place count 277 transition count 224
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 57 place count 268 transition count 224
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 71 place count 254 transition count 210
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 254 transition count 210
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 90 place count 254 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 253 transition count 205
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 91 place count 253 transition count 203
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 95 place count 251 transition count 203
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 103 place count 243 transition count 195
Iterating global reduction 5 with 8 rules applied. Total rules applied 111 place count 243 transition count 195
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 5 with 9 rules applied. Total rules applied 120 place count 243 transition count 186
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 122 place count 242 transition count 185
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 122 place count 242 transition count 183
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 126 place count 240 transition count 183
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 7 with 142 rules applied. Total rules applied 268 place count 169 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 270 place count 167 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 271 place count 166 transition count 110
Applied a total of 271 rules in 50 ms. Remains 166 /306 variables (removed 140) and now considering 110/258 (removed 148) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 166/306 places, 110/258 transitions.
[2024-05-21 18:20:44] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:20:44] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:20:45] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 296 transition count 233
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 277 transition count 233
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 39 place count 277 transition count 226
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 53 place count 270 transition count 226
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 67 place count 256 transition count 212
Iterating global reduction 2 with 14 rules applied. Total rules applied 81 place count 256 transition count 212
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 86 place count 256 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 255 transition count 207
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 87 place count 255 transition count 205
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 91 place count 253 transition count 205
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 99 place count 245 transition count 197
Iterating global reduction 4 with 8 rules applied. Total rules applied 107 place count 245 transition count 197
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 4 with 9 rules applied. Total rules applied 116 place count 245 transition count 188
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 118 place count 244 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 118 place count 244 transition count 185
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 122 place count 242 transition count 185
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 260 place count 173 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 262 place count 171 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 263 place count 170 transition count 114
Applied a total of 263 rules in 60 ms. Remains 170 /306 variables (removed 136) and now considering 114/258 (removed 144) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 170/306 places, 114/258 transitions.
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 21 ms
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:20:45] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 258
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 290 transition count 243
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 290 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 290 transition count 239
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 41 place count 284 transition count 233
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 284 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 53 place count 284 transition count 227
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 283 transition count 226
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 283 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 283 transition count 225
Applied a total of 56 rules in 21 ms. Remains 283 /306 variables (removed 23) and now considering 225/258 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 283/306 places, 225/258 transitions.
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:20:45] [INFO ] Input system was already deterministic with 225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 258
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 286 transition count 239
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 286 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 286 transition count 235
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 52 place count 277 transition count 226
Iterating global reduction 2 with 9 rules applied. Total rules applied 61 place count 277 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 68 place count 277 transition count 219
Applied a total of 68 rules in 32 ms. Remains 277 /306 variables (removed 29) and now considering 219/258 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 277/306 places, 219/258 transitions.
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 19 ms
[2024-05-21 18:20:45] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 296 transition count 234
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 278 transition count 234
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 278 transition count 224
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 57 place count 268 transition count 224
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 70 place count 255 transition count 211
Iterating global reduction 2 with 13 rules applied. Total rules applied 83 place count 255 transition count 211
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 88 place count 255 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 254 transition count 206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 89 place count 254 transition count 204
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 93 place count 252 transition count 204
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 100 place count 245 transition count 197
Iterating global reduction 4 with 7 rules applied. Total rules applied 107 place count 245 transition count 197
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 4 with 8 rules applied. Total rules applied 115 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 117 place count 244 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 117 place count 244 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 119 place count 243 transition count 187
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 6 with 140 rules applied. Total rules applied 259 place count 173 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 171 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 262 place count 170 transition count 115
Applied a total of 262 rules in 58 ms. Remains 170 /306 variables (removed 136) and now considering 115/258 (removed 143) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 170/306 places, 115/258 transitions.
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:20:45] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 258
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 287 transition count 240
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 287 transition count 240
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 287 transition count 236
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 50 place count 278 transition count 227
Iterating global reduction 2 with 9 rules applied. Total rules applied 59 place count 278 transition count 227
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 66 place count 278 transition count 220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 277 transition count 219
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 277 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 277 transition count 218
Applied a total of 69 rules in 21 ms. Remains 277 /306 variables (removed 29) and now considering 218/258 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 277/306 places, 218/258 transitions.
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:20:45] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 258
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 286 transition count 239
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 286 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 286 transition count 235
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 278 transition count 227
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 278 transition count 227
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 65 place count 278 transition count 221
Applied a total of 65 rules in 15 ms. Remains 278 /306 variables (removed 28) and now considering 221/258 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 278/306 places, 221/258 transitions.
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:20:45] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 258
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 286 transition count 239
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 286 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 286 transition count 235
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 52 place count 277 transition count 226
Iterating global reduction 2 with 9 rules applied. Total rules applied 61 place count 277 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 68 place count 277 transition count 219
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 276 transition count 218
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 276 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 276 transition count 217
Applied a total of 71 rules in 41 ms. Remains 276 /306 variables (removed 30) and now considering 217/258 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 276/306 places, 217/258 transitions.
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 17 ms
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:20:45] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 290 transition count 242
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 290 transition count 242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 290 transition count 240
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 283 transition count 233
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 283 transition count 233
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 55 place count 283 transition count 226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 282 transition count 225
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 282 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 282 transition count 224
Applied a total of 58 rules in 18 ms. Remains 282 /306 variables (removed 24) and now considering 224/258 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 282/306 places, 224/258 transitions.
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:20:45] [INFO ] Input system was already deterministic with 224 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 296 transition count 233
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 277 transition count 233
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 39 place count 277 transition count 224
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 57 place count 268 transition count 224
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 70 place count 255 transition count 211
Iterating global reduction 2 with 13 rules applied. Total rules applied 83 place count 255 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 87 place count 255 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 254 transition count 207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 88 place count 254 transition count 206
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 90 place count 253 transition count 206
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 98 place count 245 transition count 198
Iterating global reduction 4 with 8 rules applied. Total rules applied 106 place count 245 transition count 198
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 4 with 9 rules applied. Total rules applied 115 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 117 place count 244 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 117 place count 244 transition count 186
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 121 place count 242 transition count 186
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 6 with 134 rules applied. Total rules applied 255 place count 175 transition count 119
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 256 place count 175 transition count 119
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 258 place count 173 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 259 place count 172 transition count 117
Applied a total of 259 rules in 61 ms. Remains 172 /306 variables (removed 134) and now considering 117/258 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 172/306 places, 117/258 transitions.
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 11 ms
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:20:45] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 296 transition count 235
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 279 transition count 235
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 279 transition count 225
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 269 transition count 225
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 69 place count 255 transition count 211
Iterating global reduction 2 with 14 rules applied. Total rules applied 83 place count 255 transition count 211
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 88 place count 255 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 254 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 89 place count 254 transition count 205
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 91 place count 253 transition count 205
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 99 place count 245 transition count 197
Iterating global reduction 4 with 8 rules applied. Total rules applied 107 place count 245 transition count 197
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 4 with 9 rules applied. Total rules applied 116 place count 245 transition count 188
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 118 place count 244 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 118 place count 244 transition count 185
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 122 place count 242 transition count 185
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 264 place count 171 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 266 place count 169 transition count 112
Applied a total of 266 rules in 48 ms. Remains 169 /306 variables (removed 137) and now considering 112/258 (removed 146) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 169/306 places, 112/258 transitions.
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:20:45] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 289 transition count 241
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 289 transition count 241
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 289 transition count 238
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 280 transition count 229
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 280 transition count 229
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 63 place count 280 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 279 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 279 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 279 transition count 219
Applied a total of 66 rules in 14 ms. Remains 279 /306 variables (removed 27) and now considering 219/258 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 279/306 places, 219/258 transitions.
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:20:45] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 258
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 288 transition count 241
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 288 transition count 241
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 288 transition count 238
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 46 place count 280 transition count 230
Iterating global reduction 2 with 8 rules applied. Total rules applied 54 place count 280 transition count 230
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 61 place count 280 transition count 223
Applied a total of 61 rules in 13 ms. Remains 280 /306 variables (removed 26) and now considering 223/258 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 280/306 places, 223/258 transitions.
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 20 ms
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:20:45] [INFO ] Input system was already deterministic with 223 transitions.
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:20:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:20:46] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 18:20:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 258 transitions and 793 arcs took 2 ms.
Total runtime 81800 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-10b

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/407/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: 971
MODEL NAME: /home/mcc/execution/407/model
306 places, 258 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-10b-CTLCardinality-2024-00 CANNOT_COMPUTE
FORMULA DES-PT-10b-CTLCardinality-2024-02 CANNOT_COMPUTE
FORMULA DES-PT-10b-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA DES-PT-10b-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA DES-PT-10b-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA DES-PT-10b-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA DES-PT-10b-CTLCardinality-2024-07 CANNOT_COMPUTE
FORMULA DES-PT-10b-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA DES-PT-10b-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA DES-PT-10b-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA DES-PT-10b-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA DES-PT-10b-CTLCardinality-2023-12 CANNOT_COMPUTE
FORMULA DES-PT-10b-CTLCardinality-2023-13 CANNOT_COMPUTE
FORMULA DES-PT-10b-CTLCardinality-2023-14 CANNOT_COMPUTE
FORMULA DES-PT-10b-CTLCardinality-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716317407718

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
Error in allocating array of size 2097152 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

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

Error in allocating array of size 4194304 at unique_table.cc, line 313
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

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

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

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

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