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.r047-tajo-171620398300465.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 greatspnxred
Input is BusinessProcesses-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398300465
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.3K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K 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 63K 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-03-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716302559687

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:42:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 14:42:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:42:41] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-21 14:42:41] [INFO ] Transformed 274 places.
[2024-05-21 14:42:41] [INFO ] Transformed 237 transitions.
[2024-05-21 14:42:41] [INFO ] Found NUPN structural information;
[2024-05-21 14:42:41] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 92 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 31 place count 242 transition count 207
Iterating global reduction 1 with 29 rules applied. Total rules applied 60 place count 242 transition count 207
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 237 transition count 202
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 237 transition count 202
Applied a total of 70 rules in 123 ms. Remains 237 /273 variables (removed 36) and now considering 202/236 (removed 34) transitions.
// Phase 1: matrix 202 rows 237 cols
[2024-05-21 14:42:41] [INFO ] Computed 41 invariants in 19 ms
[2024-05-21 14:42:42] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-21 14:42:42] [INFO ] Invariant cache hit.
[2024-05-21 14:42:42] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 14:42:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:42:45] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 23 ms to minimize.
[2024-05-21 14:42:45] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-21 14:42:45] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-21 14:42:45] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-05-21 14:42:45] [INFO ] Deduced a trap composed of 16 places in 403 ms of which 23 ms to minimize.
[2024-05-21 14:42:45] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-05-21 14:42:45] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 3 ms to minimize.
[2024-05-21 14:42:46] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 8 ms to minimize.
[2024-05-21 14:42:46] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-21 14:42:46] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-21 14:42:46] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-21 14:42:46] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-21 14:42:46] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:42:46] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:42:46] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:42:46] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:42:46] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-21 14:42:46] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:42:46] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:42:46] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:42:47] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-21 14:42:47] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:42:47] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:42:47] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:42:47] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:42:47] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-05-21 14:42:47] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-21 14:42:48] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-21 14:42:48] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-21 14:42:48] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-21 14:42:48] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:42:48] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:42:48] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-21 14:42:48] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-21 14:42:48] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 4 ms to minimize.
[2024-05-21 14:42:48] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:42:48] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-05-21 14:42:48] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 0 ms to minimize.
[2024-05-21 14:42:48] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-21 14:42:48] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:42:49] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:42:49] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:42:49] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 8 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:42:50] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:42:51] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:42:51] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:42:51] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:42:51] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:42:51] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:42:51] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:42:51] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:42:51] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:42:51] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:42:51] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:42:52] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:42:52] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:42:52] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:42:52] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:42:52] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:42:52] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-21 14:42:52] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:42:52] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-21 14:42:52] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-21 14:42:52] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:42:52] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:42:53] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-21 14:42:53] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
[2024-05-21 14:42:53] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-21 14:42:53] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:42:53] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:42:54] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:42:54] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:42:54] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:42:54] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:42:54] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:42:54] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 202/439 variables, 237/370 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:42:57] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-21 14:42:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-21 14:42:57] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:42:57] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:42:57] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:42:57] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:42:57] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:42:58] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:42:58] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:42:58] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-21 14:42:58] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:42:58] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-21 14:42:58] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:42:58] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:42:58] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-21 14:42:58] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-21 14:42:58] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 17/387 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:42:59] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-21 14:42:59] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
[2024-05-21 14:42:59] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-21 14:42:59] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:43:00] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-21 14:43:00] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:43:00] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 7/394 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:43:01] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:43:05] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/439 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 16 (OVERLAPS) 0/439 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 396 constraints, problems are : Problem set: 0 solved, 201 unsolved in 27453 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 118/118 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 118/159 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:43:11] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:43:11] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:43:11] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/439 variables, 237/399 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 201/600 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:43:13] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:43:14] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 2 ms to minimize.
[2024-05-21 14:43:14] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:43:14] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:43:14] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:43:14] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:43:14] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:43:14] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:43:15] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-21 14:43:15] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-21 14:43:16] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-21 14:43:16] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 2 ms to minimize.
[2024-05-21 14:43:16] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:43:16] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:43:16] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:43:16] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:43:16] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-21 14:43:16] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:43:17] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-21 14:43:17] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/620 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:43:20] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:43:20] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 2 ms to minimize.
[2024-05-21 14:43:20] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-21 14:43:21] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:43:28] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:43:29] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:43:29] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-21 14:43:29] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-05-21 14:43:29] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 5/629 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 14:43:36] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-21 14:43:36] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
[2024-05-21 14:43:36] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:43:36] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-21 14:43:36] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:43:39] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 14:43:39] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:43:39] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 637 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 158/158 constraints]
After SMT, in 57555ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 57570ms
Starting structural reductions in LTL mode, iteration 1 : 237/273 places, 202/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58462 ms. Remains : 237/273 places, 202/236 transitions.
Support contains 92 out of 237 places after structural reductions.
[2024-05-21 14:43:40] [INFO ] Flatten gal took : 81 ms
[2024-05-21 14:43:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 14:43:40] [INFO ] Flatten gal took : 21 ms
[2024-05-21 14:43:40] [INFO ] Input system was already deterministic with 202 transitions.
Support contains 89 out of 237 places (down from 92) after GAL structural reductions.
RANDOM walk for 40000 steps (480 resets) in 3557 ms. (11 steps per ms) remains 20/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 40 ms. (97 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 47 ms. (83 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (11 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (11 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (9 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
[2024-05-21 14:43:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 172/213 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 4/217 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 183/400 variables, 217/258 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 7 (OVERLAPS) 33/433 variables, 16/274 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-21 14:43:42] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-21 14:43:42] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-05-21 14:43:42] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2024-05-21 14:43:42] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-21 14:43:43] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-21 14:43:43] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-21 14:43:43] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2024-05-21 14:43:43] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 8/282 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-21 14:43:43] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-21 14:43:43] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 2/284 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 6/439 variables, 4/288 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 0/439 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 288 constraints, problems are : Problem set: 1 solved, 19 unsolved in 2371 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 1 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 176/213 variables, 40/40 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 5/45 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-21 14:43:44] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-21 14:43:44] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-21 14:43:44] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-21 14:43:44] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:43:44] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 3 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-21 14:43:45] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 20/65 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-21 14:43:46] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-05-21 14:43:46] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-21 14:43:46] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-21 14:43:46] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 4/69 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-21 14:43:46] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/70 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-21 14:43:47] [INFO ] Deduced a trap composed of 22 places in 508 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 1/71 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 4/217 variables, 1/72 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 183/400 variables, 217/289 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 11/300 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-21 14:43:47] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-21 14:43:47] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-21 14:43:47] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-21 14:43:47] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-21 14:43:47] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 5/305 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-21 14:43:48] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 1/306 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-21 14:43:48] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 1/307 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 16 (OVERLAPS) 33/433 variables, 16/323 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 7/330 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Problem AtomicPropp45 is UNSAT
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 5/335 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-05-21 14:43:49] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-21 14:43:49] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-21 14:43:49] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
Problem AtomicPropp6 is UNSAT
[2024-05-21 14:43:49] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-21 14:43:49] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-05-21 14:43:49] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
[2024-05-21 14:43:49] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
SMT process timed out in 7394ms, After SMT, problems are : Problem set: 3 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 202/202 transitions.
Graph (trivial) has 111 edges and 237 vertex of which 7 / 237 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 471 edges and 231 vertex of which 230 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 230 transition count 163
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 202 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 200 transition count 161
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 62 place count 200 transition count 131
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 65 rules applied. Total rules applied 127 place count 165 transition count 131
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 144 place count 148 transition count 114
Iterating global reduction 3 with 17 rules applied. Total rules applied 161 place count 148 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 161 place count 148 transition count 113
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 147 transition count 113
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 265 place count 95 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 266 place count 94 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 267 place count 93 transition count 62
Applied a total of 267 rules in 85 ms. Remains 93 /237 variables (removed 144) and now considering 62/202 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 93/237 places, 62/202 transitions.
RANDOM walk for 3060 steps (78 resets) in 107 ms. (28 steps per ms) remains 0/16 properties
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
[2024-05-21 14:43:49] [INFO ] Flatten gal took : 14 ms
[2024-05-21 14:43:49] [INFO ] Flatten gal took : 26 ms
[2024-05-21 14:43:49] [INFO ] Input system was already deterministic with 202 transitions.
Computed a total of 230 stabilizing places and 192 stable transitions
Graph (complete) has 480 edges and 237 vertex of which 236 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 209 transition count 174
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 209 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 209 transition count 173
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 202 transition count 166
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 202 transition count 166
Applied a total of 71 rules in 20 ms. Remains 202 /237 variables (removed 35) and now considering 166/202 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 202/237 places, 166/202 transitions.
[2024-05-21 14:43:49] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:43:49] [INFO ] Flatten gal took : 23 ms
[2024-05-21 14:43:49] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 213 transition count 178
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 213 transition count 178
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 208 transition count 173
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 208 transition count 173
Applied a total of 58 rules in 20 ms. Remains 208 /237 variables (removed 29) and now considering 173/202 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 208/237 places, 173/202 transitions.
[2024-05-21 14:43:49] [INFO ] Flatten gal took : 12 ms
[2024-05-21 14:43:49] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:43:49] [INFO ] Input system was already deterministic with 173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 212 transition count 177
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 212 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 212 transition count 176
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 206 transition count 170
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 206 transition count 170
Applied a total of 63 rules in 18 ms. Remains 206 /237 variables (removed 31) and now considering 170/202 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 206/237 places, 170/202 transitions.
[2024-05-21 14:43:49] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:43:49] [INFO ] Flatten gal took : 10 ms
[2024-05-21 14:43:49] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 209 transition count 174
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 209 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 209 transition count 173
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 202 transition count 166
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 202 transition count 166
Applied a total of 71 rules in 16 ms. Remains 202 /237 variables (removed 35) and now considering 166/202 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 202/237 places, 166/202 transitions.
[2024-05-21 14:43:49] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:43:49] [INFO ] Flatten gal took : 10 ms
[2024-05-21 14:43:50] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 209 transition count 174
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 209 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 209 transition count 173
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 202 transition count 166
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 202 transition count 166
Applied a total of 71 rules in 18 ms. Remains 202 /237 variables (removed 35) and now considering 166/202 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 202/237 places, 166/202 transitions.
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 10 ms
[2024-05-21 14:43:50] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 211 transition count 176
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 211 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 211 transition count 175
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 204 transition count 168
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 204 transition count 168
Applied a total of 67 rules in 20 ms. Remains 204 /237 variables (removed 33) and now considering 168/202 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 204/237 places, 168/202 transitions.
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:43:50] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Graph (trivial) has 137 edges and 237 vertex of which 7 / 237 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 472 edges and 231 vertex of which 230 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 229 transition count 156
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 193 transition count 156
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 74 place count 193 transition count 114
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 168 place count 141 transition count 114
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 194 place count 115 transition count 88
Iterating global reduction 2 with 26 rules applied. Total rules applied 220 place count 115 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 220 place count 115 transition count 87
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 222 place count 114 transition count 87
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 326 place count 61 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 327 place count 60 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 328 place count 59 transition count 35
Applied a total of 328 rules in 27 ms. Remains 59 /237 variables (removed 178) and now considering 35/202 (removed 167) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 59/237 places, 35/202 transitions.
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:43:50] [INFO ] Input system was already deterministic with 35 transitions.
RANDOM walk for 70 steps (20 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 212 transition count 177
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 212 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 212 transition count 176
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 206 transition count 170
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 206 transition count 170
Applied a total of 63 rules in 13 ms. Remains 206 /237 variables (removed 31) and now considering 170/202 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 206/237 places, 170/202 transitions.
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:43:50] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 213 transition count 178
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 213 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 213 transition count 177
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 207 transition count 171
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 207 transition count 171
Applied a total of 61 rules in 11 ms. Remains 207 /237 variables (removed 30) and now considering 171/202 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 207/237 places, 171/202 transitions.
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:43:50] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Graph (trivial) has 135 edges and 237 vertex of which 7 / 237 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 472 edges and 231 vertex of which 230 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 229 transition count 157
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 194 transition count 157
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 72 place count 194 transition count 116
Deduced a syphon composed of 41 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 164 place count 143 transition count 116
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 189 place count 118 transition count 91
Iterating global reduction 2 with 25 rules applied. Total rules applied 214 place count 118 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 214 place count 118 transition count 90
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 216 place count 117 transition count 90
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 322 place count 63 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 323 place count 62 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 324 place count 61 transition count 37
Applied a total of 324 rules in 21 ms. Remains 61 /237 variables (removed 176) and now considering 37/202 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 61/237 places, 37/202 transitions.
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:43:50] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 213 transition count 178
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 213 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 213 transition count 177
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 206 transition count 170
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 206 transition count 170
Applied a total of 63 rules in 12 ms. Remains 206 /237 variables (removed 31) and now considering 170/202 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 206/237 places, 170/202 transitions.
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:43:50] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 212 transition count 177
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 212 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 212 transition count 176
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 205 transition count 169
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 205 transition count 169
Applied a total of 65 rules in 14 ms. Remains 205 /237 variables (removed 32) and now considering 169/202 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 205/237 places, 169/202 transitions.
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:43:50] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 212 transition count 177
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 212 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 212 transition count 176
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 205 transition count 169
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 205 transition count 169
Applied a total of 65 rules in 11 ms. Remains 205 /237 variables (removed 32) and now considering 169/202 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 205/237 places, 169/202 transitions.
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:43:50] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Graph (trivial) has 133 edges and 237 vertex of which 7 / 237 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 472 edges and 231 vertex of which 230 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 229 transition count 159
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 196 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 194 transition count 157
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 72 place count 194 transition count 118
Deduced a syphon composed of 39 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 85 rules applied. Total rules applied 157 place count 148 transition count 118
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 183 place count 122 transition count 92
Iterating global reduction 3 with 26 rules applied. Total rules applied 209 place count 122 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 209 place count 122 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 211 place count 121 transition count 91
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 315 place count 68 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 316 place count 67 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 66 transition count 39
Applied a total of 317 rules in 25 ms. Remains 66 /237 variables (removed 171) and now considering 39/202 (removed 163) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 66/237 places, 39/202 transitions.
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:43:50] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:43:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:43:50] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-21 14:43:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 202 transitions and 560 arcs took 2 ms.
Total runtime 69234 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-03

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 237
TRANSITIONS: 202
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.003s]


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


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1204
MODEL NAME: /home/mcc/execution/416/model
237 places, 202 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BusinessProcesses-PT-03-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-03"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-03, 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 r047-tajo-171620398300465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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