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-171620399600497.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-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399600497
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 100K 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-07-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717225259486

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-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:01:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:01:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:01:01] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-01 07:01:01] [INFO ] Transformed 386 places.
[2024-06-01 07:01:01] [INFO ] Transformed 360 transitions.
[2024-06-01 07:01:01] [INFO ] Found NUPN structural information;
[2024-06-01 07:01:01] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Support contains 107 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 353 transition count 327
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 353 transition count 327
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 341 transition count 315
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 341 transition count 315
Applied a total of 90 rules in 100 ms. Remains 341 /386 variables (removed 45) and now considering 315/360 (removed 45) transitions.
// Phase 1: matrix 315 rows 341 cols
[2024-06-01 07:01:01] [INFO ] Computed 62 invariants in 39 ms
[2024-06-01 07:01:02] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-06-01 07:01:02] [INFO ] Invariant cache hit.
[2024-06-01 07:01:02] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2024-06-01 07:01:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/339 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (OVERLAPS) 2/341 variables, 33/60 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 6 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 1 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 4 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 94 places in 170 ms of which 5 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 70 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 1 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 5 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 4 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 3 ms to minimize.
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD294 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 20/122 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 75 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:01:18] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 20/142 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 6 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 3 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 20/162 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 66 places in 6352 ms of which 23 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 4 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 4 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 4 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 4 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 4 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 7 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 4 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 4 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 7 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/656 variables, and 182 constraints, problems are : Problem set: 10 solved, 304 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/341 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 10 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 27/27 constraints. Problems are: Problem set: 10 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/339 variables, 0/27 constraints. Problems are: Problem set: 10 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 2/341 variables, 33/60 constraints. Problems are: Problem set: 10 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 2/62 constraints. Problems are: Problem set: 10 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 120/182 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 1 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 69 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 20/202 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 4 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 20/222 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 4 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 69 places in 176 ms of which 6 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 8 ms to minimize.
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 68 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 67 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 20/242 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 20/262 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-06-01 07:01:53] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:01:53] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:01:53] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:01:53] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:01:54] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:01:54] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:01:54] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:01:54] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:01:54] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:01:54] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:01:54] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:01:54] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 20/282 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 20/302 constraints. Problems are: Problem set: 10 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/656 variables, and 302 constraints, problems are : Problem set: 10 solved, 304 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/341 constraints, PredecessorRefiner: 0/314 constraints, Known Traps: 240/240 constraints]
After SMT, in 60274ms problems are : Problem set: 10 solved, 304 unsolved
Search for dead transitions found 10 dead transitions in 60302ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 341/386 places, 305/360 transitions.
Applied a total of 0 rules in 13 ms. Remains 341 /341 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61471 ms. Remains : 341/386 places, 305/360 transitions.
Support contains 107 out of 341 places after structural reductions.
[2024-06-01 07:02:03] [INFO ] Flatten gal took : 92 ms
[2024-06-01 07:02:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:02:03] [INFO ] Flatten gal took : 65 ms
[2024-06-01 07:02:03] [INFO ] Input system was already deterministic with 305 transitions.
Support contains 93 out of 341 places (down from 107) after GAL structural reductions.
RANDOM walk for 40000 steps (432 resets) in 2233 ms. (17 steps per ms) remains 1/66 properties
BEST_FIRST walk for 40003 steps (91 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
// Phase 1: matrix 305 rows 341 cols
[2024-06-01 07:02:04] [INFO ] Computed 62 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 214/242 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:02:04] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2024-06-01 07:02:04] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 97/339 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:02:04] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:02:04] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:02:04] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:02:04] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:04] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/341 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 305/646 variables, 341/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/646 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 214/242 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:02:05] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:02:05] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:02:05] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:02:05] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:02:05] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:02:05] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:02:09] [INFO ] Deduced a trap composed of 68 places in 4256 ms of which 27 ms to minimize.
[2024-06-01 07:02:10] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 5926ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 305/305 transitions.
Graph (trivial) has 171 edges and 341 vertex of which 7 / 341 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 734 edges and 335 vertex of which 333 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 333 transition count 249
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 286 transition count 249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 96 place count 286 transition count 184
Deduced a syphon composed of 65 places in 0 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 235 place count 212 transition count 184
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 256 place count 191 transition count 163
Iterating global reduction 2 with 21 rules applied. Total rules applied 277 place count 191 transition count 163
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 277 place count 191 transition count 160
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 283 place count 188 transition count 160
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 420 place count 118 transition count 93
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 117 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 424 place count 117 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 426 place count 115 transition count 94
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 115 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 428 place count 114 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 429 place count 113 transition count 93
Applied a total of 429 rules in 163 ms. Remains 113 /341 variables (removed 228) and now considering 93/305 (removed 212) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 113/341 places, 93/305 transitions.
RANDOM walk for 15013 steps (1078 resets) in 90 ms. (164 steps per ms) remains 0/1 properties
[2024-06-01 07:02:10] [INFO ] Flatten gal took : 31 ms
[2024-06-01 07:02:10] [INFO ] Flatten gal took : 44 ms
[2024-06-01 07:02:10] [INFO ] Input system was already deterministic with 305 transitions.
Computed a total of 211 stabilizing places and 202 stable transitions
Graph (complete) has 742 edges and 341 vertex of which 339 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 321 transition count 286
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 321 transition count 286
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 314 transition count 279
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 314 transition count 279
Applied a total of 53 rules in 54 ms. Remains 314 /341 variables (removed 27) and now considering 279/305 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 314/341 places, 279/305 transitions.
[2024-06-01 07:02:10] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:02:10] [INFO ] Flatten gal took : 30 ms
[2024-06-01 07:02:10] [INFO ] Input system was already deterministic with 279 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Graph (trivial) has 171 edges and 341 vertex of which 7 / 341 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 735 edges and 335 vertex of which 333 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 332 transition count 249
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 285 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 284 transition count 248
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 98 place count 284 transition count 185
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 233 place count 212 transition count 185
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 253 place count 192 transition count 165
Iterating global reduction 3 with 20 rules applied. Total rules applied 273 place count 192 transition count 165
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 273 place count 192 transition count 162
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 279 place count 189 transition count 162
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 416 place count 119 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 417 place count 118 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 418 place count 117 transition count 94
Applied a total of 418 rules in 114 ms. Remains 117 /341 variables (removed 224) and now considering 94/305 (removed 211) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 114 ms. Remains : 117/341 places, 94/305 transitions.
[2024-06-01 07:02:10] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:02:10] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:02:10] [INFO ] Input system was already deterministic with 94 transitions.
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 312 transition count 277
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 312 transition count 277
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 303 transition count 268
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 303 transition count 268
Applied a total of 75 rules in 49 ms. Remains 303 /341 variables (removed 38) and now considering 268/305 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 303/341 places, 268/305 transitions.
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 36 ms
[2024-06-01 07:02:11] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 314 transition count 279
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 314 transition count 279
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 62 place count 305 transition count 270
Iterating global reduction 1 with 9 rules applied. Total rules applied 71 place count 305 transition count 270
Applied a total of 71 rules in 47 ms. Remains 305 /341 variables (removed 36) and now considering 270/305 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 305/341 places, 270/305 transitions.
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:02:11] [INFO ] Input system was already deterministic with 270 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Graph (trivial) has 172 edges and 341 vertex of which 7 / 341 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 735 edges and 335 vertex of which 333 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 332 transition count 248
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 284 transition count 248
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 98 place count 284 transition count 184
Deduced a syphon composed of 64 places in 13 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 235 place count 211 transition count 184
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 256 place count 190 transition count 163
Iterating global reduction 2 with 21 rules applied. Total rules applied 277 place count 190 transition count 163
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 277 place count 190 transition count 160
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 283 place count 187 transition count 160
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 418 place count 118 transition count 94
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 424 place count 118 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 425 place count 117 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 426 place count 116 transition count 93
Applied a total of 426 rules in 83 ms. Remains 116 /341 variables (removed 225) and now considering 93/305 (removed 212) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 84 ms. Remains : 116/341 places, 93/305 transitions.
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:02:11] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Graph (trivial) has 165 edges and 341 vertex of which 7 / 341 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 735 edges and 335 vertex of which 333 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 332 transition count 252
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 288 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 287 transition count 251
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 92 place count 287 transition count 187
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 229 place count 214 transition count 187
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 247 place count 196 transition count 169
Iterating global reduction 3 with 18 rules applied. Total rules applied 265 place count 196 transition count 169
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 265 place count 196 transition count 167
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 269 place count 194 transition count 167
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 406 place count 124 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 407 place count 123 transition count 99
Applied a total of 407 rules in 71 ms. Remains 123 /341 variables (removed 218) and now considering 99/305 (removed 206) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 123/341 places, 99/305 transitions.
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:02:11] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 313 transition count 278
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 313 transition count 278
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 304 transition count 269
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 304 transition count 269
Applied a total of 73 rules in 28 ms. Remains 304 /341 variables (removed 37) and now considering 269/305 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 304/341 places, 269/305 transitions.
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:02:11] [INFO ] Input system was already deterministic with 269 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 317 transition count 282
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 317 transition count 282
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 310 transition count 275
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 310 transition count 275
Applied a total of 61 rules in 29 ms. Remains 310 /341 variables (removed 31) and now considering 275/305 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 310/341 places, 275/305 transitions.
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:02:11] [INFO ] Input system was already deterministic with 275 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 313 transition count 278
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 313 transition count 278
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 305 transition count 270
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 305 transition count 270
Applied a total of 71 rules in 26 ms. Remains 305 /341 variables (removed 36) and now considering 270/305 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 305/341 places, 270/305 transitions.
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:02:11] [INFO ] Input system was already deterministic with 270 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 313 transition count 278
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 313 transition count 278
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 304 transition count 269
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 304 transition count 269
Applied a total of 73 rules in 44 ms. Remains 304 /341 variables (removed 37) and now considering 269/305 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 304/341 places, 269/305 transitions.
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:02:11] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:02:11] [INFO ] Input system was already deterministic with 269 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 315 transition count 280
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 315 transition count 280
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 308 transition count 273
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 308 transition count 273
Applied a total of 65 rules in 26 ms. Remains 308 /341 variables (removed 33) and now considering 273/305 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 308/341 places, 273/305 transitions.
[2024-06-01 07:02:12] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:02:12] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:02:12] [INFO ] Input system was already deterministic with 273 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Graph (trivial) has 166 edges and 341 vertex of which 7 / 341 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 735 edges and 335 vertex of which 333 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 332 transition count 251
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 287 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 286 transition count 250
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 94 place count 286 transition count 190
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 129 rules applied. Total rules applied 223 place count 217 transition count 190
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 242 place count 198 transition count 171
Iterating global reduction 3 with 19 rules applied. Total rules applied 261 place count 198 transition count 171
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 261 place count 198 transition count 168
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 267 place count 195 transition count 168
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 404 place count 125 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 405 place count 124 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 406 place count 123 transition count 100
Applied a total of 406 rules in 67 ms. Remains 123 /341 variables (removed 218) and now considering 100/305 (removed 205) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 123/341 places, 100/305 transitions.
[2024-06-01 07:02:12] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:02:12] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:02:12] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 312 transition count 277
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 312 transition count 277
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 303 transition count 268
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 303 transition count 268
Applied a total of 75 rules in 37 ms. Remains 303 /341 variables (removed 38) and now considering 268/305 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 303/341 places, 268/305 transitions.
[2024-06-01 07:02:12] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:12] [INFO ] Flatten gal took : 36 ms
[2024-06-01 07:02:12] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 313 transition count 278
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 313 transition count 278
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 304 transition count 269
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 304 transition count 269
Applied a total of 73 rules in 24 ms. Remains 304 /341 variables (removed 37) and now considering 269/305 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 304/341 places, 269/305 transitions.
[2024-06-01 07:02:12] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:12] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:02:12] [INFO ] Input system was already deterministic with 269 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 312 transition count 277
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 312 transition count 277
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 303 transition count 268
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 303 transition count 268
Applied a total of 75 rules in 32 ms. Remains 303 /341 variables (removed 38) and now considering 268/305 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 303/341 places, 268/305 transitions.
[2024-06-01 07:02:12] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:02:12] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:02:12] [INFO ] Input system was already deterministic with 268 transitions.
[2024-06-01 07:02:12] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:02:12] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:02:12] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 07:02:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 341 places, 305 transitions and 960 arcs took 3 ms.
Total runtime 71592 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-07-CTLCardinality-2024-01
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-2024-03
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-2024-04
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-2024-05
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-2024-06
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-2024-07
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-2024-08
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-2024-09
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-2024-10
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-2024-11
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-2023-12
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-2023-13
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-2023-14
Could not compute solution for formula : BusinessProcesses-PT-07-CTLCardinality-2023-15

BK_STOP 1717225333149

--------------------
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
mcc2024
ctl formula name BusinessProcesses-PT-07-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1319/ctl_0_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1319/ctl_1_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1319/ctl_2_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1319/ctl_3_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1319/ctl_4_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1319/ctl_5_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1319/ctl_6_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1319/ctl_7_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1319/ctl_8_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1319/ctl_9_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1319/ctl_10_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1319/ctl_11_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1319/ctl_12_
ctl formula name BusinessProcesses-PT-07-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1319/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-07"
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-07, 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-171620399600497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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