Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399700513.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BusinessProcesses-PT-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399700513
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 104K 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 BusinessProcesses-PT-09-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717225426073

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:03:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:03:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:03:47] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-01 07:03:47] [INFO ] Transformed 403 places.
[2024-06-01 07:03:47] [INFO ] Transformed 374 transitions.
[2024-06-01 07:03:47] [INFO ] Found NUPN structural information;
[2024-06-01 07:03:47] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
FORMULA BusinessProcesses-PT-09-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 83 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 42 place count 361 transition count 333
Iterating global reduction 1 with 41 rules applied. Total rules applied 83 place count 361 transition count 333
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 96 place count 348 transition count 320
Iterating global reduction 1 with 13 rules applied. Total rules applied 109 place count 348 transition count 320
Applied a total of 109 rules in 79 ms. Remains 348 /403 variables (removed 55) and now considering 320/374 (removed 54) transitions.
// Phase 1: matrix 320 rows 348 cols
[2024-06-01 07:03:47] [INFO ] Computed 64 invariants in 24 ms
[2024-06-01 07:03:48] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-06-01 07:03:48] [INFO ] Invariant cache hit.
[2024-06-01 07:03:48] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2024-06-01 07:03:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/347 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 1/348 variables, 35/63 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-01 07:03:53] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 22 ms to minimize.
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 3 ms to minimize.
[2024-06-01 07:03:54] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:03:55] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:03:55] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:03:55] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:03:55] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:03:55] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:03:55] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:03:55] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:03:55] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-01 07:03:55] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:03:56] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:03:56] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:03:56] [INFO ] Deduced a trap composed of 94 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:03:56] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:03:56] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:03:56] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:03:56] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:03:56] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:03:56] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:03:56] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:03:56] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 5 ms to minimize.
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-01 07:03:57] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 83 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 3 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 9 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-01 07:04:01] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 3 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 20/184 constraints. Problems are: Problem set: 3 solved, 316 unsolved
[2024-06-01 07:04:11] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:04:11] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:04:11] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:04:11] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:04:11] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:04:14] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 20/204 constraints. Problems are: Problem set: 3 solved, 316 unsolved
[2024-06-01 07:04:14] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:04:14] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:04:15] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 4 ms to minimize.
[2024-06-01 07:04:15] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:04:15] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:04:15] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:04:15] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:04:15] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:04:15] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 2 ms to minimize.
Problem TDEAD252 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD297 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 20/224 constraints. Problems are: Problem set: 11 solved, 308 unsolved
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
SMT process timed out in 30145ms, After SMT, problems are : Problem set: 11 solved, 308 unsolved
Search for dead transitions found 11 dead transitions in 30161ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 348/403 places, 309/374 transitions.
Applied a total of 0 rules in 13 ms. Remains 348 /348 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30883 ms. Remains : 348/403 places, 309/374 transitions.
Support contains 83 out of 348 places after structural reductions.
[2024-06-01 07:04:18] [INFO ] Flatten gal took : 61 ms
[2024-06-01 07:04:18] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:04:19] [INFO ] Input system was already deterministic with 309 transitions.
RANDOM walk for 40000 steps (416 resets) in 2653 ms. (15 steps per ms) remains 3/47 properties
BEST_FIRST walk for 40002 steps (80 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (86 resets) in 86 ms. (459 steps per ms) remains 1/3 properties
// Phase 1: matrix 309 rows 348 cols
[2024-06-01 07:04:19] [INFO ] Computed 65 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 72/76 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 176/252 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/343 variables, 28/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/345 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 307/652 variables, 345/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/652 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/657 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/657 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/657 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 657/657 variables, and 413 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 72/76 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 176/252 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:04:20] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 76 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:04:21] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:04:22] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 91/343 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/345 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 307/652 variables, 345/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/652 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/652 variables, 5/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/652 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/657 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/657 variables, 6/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/657 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/657 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 657/657 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4824 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 61/61 constraints]
After SMT, in 5080ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 4 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 309/309 transitions.
Graph (trivial) has 168 edges and 348 vertex of which 7 / 348 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 757 edges and 342 vertex of which 341 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 341 transition count 258
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 299 transition count 258
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 86 place count 299 transition count 193
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 226 place count 224 transition count 193
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 243 place count 207 transition count 176
Iterating global reduction 2 with 17 rules applied. Total rules applied 260 place count 207 transition count 176
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 260 place count 207 transition count 174
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 205 transition count 174
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 420 place count 125 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 422 place count 124 transition count 101
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 424 place count 124 transition count 99
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 426 place count 122 transition count 99
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 427 place count 122 transition count 99
Applied a total of 427 rules in 99 ms. Remains 122 /348 variables (removed 226) and now considering 99/309 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 122/348 places, 99/309 transitions.
RANDOM walk for 39514 steps (2286 resets) in 600 ms. (65 steps per ms) remains 0/1 properties
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:04:25] [INFO ] Input system was already deterministic with 309 transitions.
Computed a total of 211 stabilizing places and 202 stable transitions
Graph (complete) has 765 edges and 348 vertex of which 347 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Graph (trivial) has 171 edges and 348 vertex of which 7 / 348 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 758 edges and 342 vertex of which 341 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 340 transition count 257
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 297 transition count 257
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 88 place count 297 transition count 190
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 232 place count 220 transition count 190
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 250 place count 202 transition count 172
Iterating global reduction 2 with 18 rules applied. Total rules applied 268 place count 202 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 268 place count 202 transition count 170
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 272 place count 200 transition count 170
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 426 place count 121 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 427 place count 120 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 428 place count 119 transition count 94
Applied a total of 428 rules in 40 ms. Remains 119 /348 variables (removed 229) and now considering 94/309 (removed 215) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 119/348 places, 94/309 transitions.
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:04:25] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 328 transition count 289
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 328 transition count 289
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 319 transition count 280
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 319 transition count 280
Applied a total of 58 rules in 17 ms. Remains 319 /348 variables (removed 29) and now considering 280/309 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 319/348 places, 280/309 transitions.
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:04:25] [INFO ] Input system was already deterministic with 280 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 327 transition count 288
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 327 transition count 288
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 317 transition count 278
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 317 transition count 278
Applied a total of 62 rules in 15 ms. Remains 317 /348 variables (removed 31) and now considering 278/309 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 317/348 places, 278/309 transitions.
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:04:25] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 330 transition count 291
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 330 transition count 291
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 321 transition count 282
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 321 transition count 282
Applied a total of 54 rules in 17 ms. Remains 321 /348 variables (removed 27) and now considering 282/309 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 321/348 places, 282/309 transitions.
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:04:25] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Graph (trivial) has 169 edges and 348 vertex of which 7 / 348 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 758 edges and 342 vertex of which 341 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 340 transition count 259
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 299 transition count 259
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 84 place count 299 transition count 190
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 232 place count 220 transition count 190
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 250 place count 202 transition count 172
Iterating global reduction 2 with 18 rules applied. Total rules applied 268 place count 202 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 268 place count 202 transition count 170
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 272 place count 200 transition count 170
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 420 place count 124 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 421 place count 123 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 422 place count 122 transition count 97
Applied a total of 422 rules in 35 ms. Remains 122 /348 variables (removed 226) and now considering 97/309 (removed 212) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 122/348 places, 97/309 transitions.
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:04:25] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Graph (trivial) has 164 edges and 348 vertex of which 7 / 348 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 758 edges and 342 vertex of which 341 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 340 transition count 259
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 299 transition count 259
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 84 place count 299 transition count 194
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 223 place count 225 transition count 194
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 239 place count 209 transition count 178
Iterating global reduction 2 with 16 rules applied. Total rules applied 255 place count 209 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 255 place count 209 transition count 177
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 257 place count 208 transition count 177
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 407 place count 131 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 408 place count 130 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 409 place count 129 transition count 103
Applied a total of 409 rules in 34 ms. Remains 129 /348 variables (removed 219) and now considering 103/309 (removed 206) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 129/348 places, 103/309 transitions.
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:04:25] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 329 transition count 290
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 329 transition count 290
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 321 transition count 282
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 321 transition count 282
Applied a total of 54 rules in 11 ms. Remains 321 /348 variables (removed 27) and now considering 282/309 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 321/348 places, 282/309 transitions.
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:04:25] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 330 transition count 291
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 330 transition count 291
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 322 transition count 283
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 322 transition count 283
Applied a total of 52 rules in 12 ms. Remains 322 /348 variables (removed 26) and now considering 283/309 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 322/348 places, 283/309 transitions.
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:04:25] [INFO ] Input system was already deterministic with 283 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 333 transition count 294
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 333 transition count 294
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 326 transition count 287
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 326 transition count 287
Applied a total of 44 rules in 12 ms. Remains 326 /348 variables (removed 22) and now considering 287/309 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 326/348 places, 287/309 transitions.
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:04:25] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Graph (trivial) has 170 edges and 348 vertex of which 7 / 348 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 758 edges and 342 vertex of which 341 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 340 transition count 257
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 297 transition count 257
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 88 place count 297 transition count 190
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 232 place count 220 transition count 190
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 250 place count 202 transition count 172
Iterating global reduction 2 with 18 rules applied. Total rules applied 268 place count 202 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 268 place count 202 transition count 170
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 272 place count 200 transition count 170
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 422 place count 123 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 423 place count 122 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 424 place count 121 transition count 96
Applied a total of 424 rules in 28 ms. Remains 121 /348 variables (removed 227) and now considering 96/309 (removed 213) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 121/348 places, 96/309 transitions.
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:04:25] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:04:25] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 327 transition count 288
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 327 transition count 288
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 317 transition count 278
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 317 transition count 278
Applied a total of 62 rules in 13 ms. Remains 317 /348 variables (removed 31) and now considering 278/309 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 317/348 places, 278/309 transitions.
[2024-06-01 07:04:26] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:04:26] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:04:26] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 331 transition count 292
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 331 transition count 292
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 323 transition count 284
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 323 transition count 284
Applied a total of 50 rules in 11 ms. Remains 323 /348 variables (removed 25) and now considering 284/309 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 323/348 places, 284/309 transitions.
[2024-06-01 07:04:26] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:04:26] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:04:26] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 327 transition count 288
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 327 transition count 288
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 317 transition count 278
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 317 transition count 278
Applied a total of 62 rules in 10 ms. Remains 317 /348 variables (removed 31) and now considering 278/309 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 317/348 places, 278/309 transitions.
[2024-06-01 07:04:26] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:04:26] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:04:26] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 309/309 transitions.
Graph (trivial) has 171 edges and 348 vertex of which 7 / 348 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 758 edges and 342 vertex of which 341 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 340 transition count 258
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 298 transition count 258
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 86 place count 298 transition count 190
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 231 place count 221 transition count 190
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 249 place count 203 transition count 172
Iterating global reduction 2 with 18 rules applied. Total rules applied 267 place count 203 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 267 place count 203 transition count 170
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 271 place count 201 transition count 170
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 425 place count 122 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 426 place count 121 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 427 place count 120 transition count 94
Applied a total of 427 rules in 26 ms. Remains 120 /348 variables (removed 228) and now considering 94/309 (removed 215) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 120/348 places, 94/309 transitions.
[2024-06-01 07:04:26] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:04:26] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:04:26] [INFO ] Input system was already deterministic with 94 transitions.
[2024-06-01 07:04:26] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:04:26] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:04:26] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 07:04:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 348 places, 309 transitions and 973 arcs took 4 ms.
Total runtime 38857 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BusinessProcesses-PT-09-CTLCardinality-2024-00
Could not compute solution for formula : BusinessProcesses-PT-09-CTLCardinality-2024-01
Could not compute solution for formula : BusinessProcesses-PT-09-CTLCardinality-2024-02
Could not compute solution for formula : BusinessProcesses-PT-09-CTLCardinality-2024-03
Could not compute solution for formula : BusinessProcesses-PT-09-CTLCardinality-2024-05
Could not compute solution for formula : BusinessProcesses-PT-09-CTLCardinality-2024-06
Could not compute solution for formula : BusinessProcesses-PT-09-CTLCardinality-2024-08
Could not compute solution for formula : BusinessProcesses-PT-09-CTLCardinality-2024-09
Could not compute solution for formula : BusinessProcesses-PT-09-CTLCardinality-2024-10
Could not compute solution for formula : BusinessProcesses-PT-09-CTLCardinality-2024-11
Could not compute solution for formula : BusinessProcesses-PT-09-CTLCardinality-2023-12
Could not compute solution for formula : BusinessProcesses-PT-09-CTLCardinality-2023-13
Could not compute solution for formula : BusinessProcesses-PT-09-CTLCardinality-2023-14
Could not compute solution for formula : BusinessProcesses-PT-09-CTLCardinality-2023-15

BK_STOP 1717225466617

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-09-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1219/ctl_0_
ctl formula name BusinessProcesses-PT-09-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1219/ctl_1_
ctl formula name BusinessProcesses-PT-09-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1219/ctl_2_
ctl formula name BusinessProcesses-PT-09-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1219/ctl_3_
ctl formula name BusinessProcesses-PT-09-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1219/ctl_4_
ctl formula name BusinessProcesses-PT-09-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1219/ctl_5_
ctl formula name BusinessProcesses-PT-09-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1219/ctl_6_
ctl formula name BusinessProcesses-PT-09-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1219/ctl_7_
ctl formula name BusinessProcesses-PT-09-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1219/ctl_8_
ctl formula name BusinessProcesses-PT-09-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1219/ctl_9_
ctl formula name BusinessProcesses-PT-09-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1219/ctl_10_
ctl formula name BusinessProcesses-PT-09-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1219/ctl_11_
ctl formula name BusinessProcesses-PT-09-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1219/ctl_12_
ctl formula name BusinessProcesses-PT-09-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1219/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="BusinessProcesses-PT-09"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-09, 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 r472-tajo-171620399700513"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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