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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 11 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:35 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 85K 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-05-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717225117169

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-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:58:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:58:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:58:38] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2024-06-01 06:58:39] [INFO ] Transformed 368 places.
[2024-06-01 06:58:39] [INFO ] Transformed 319 transitions.
[2024-06-01 06:58:39] [INFO ] Found NUPN structural information;
[2024-06-01 06:58:39] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 383 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 37 ms.
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-05-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 44 place count 323 transition count 276
Iterating global reduction 1 with 42 rules applied. Total rules applied 86 place count 323 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 323 transition count 275
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 99 place count 311 transition count 263
Iterating global reduction 2 with 12 rules applied. Total rules applied 111 place count 311 transition count 263
Applied a total of 111 rules in 191 ms. Remains 311 /367 variables (removed 56) and now considering 263/318 (removed 55) transitions.
// Phase 1: matrix 263 rows 311 cols
[2024-06-01 06:58:39] [INFO ] Computed 55 invariants in 29 ms
[2024-06-01 06:58:39] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-06-01 06:58:39] [INFO ] Invariant cache hit.
[2024-06-01 06:58:40] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-01 06:58:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/311 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 32 ms to minimize.
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:58:45] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:58:45] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 3 ms to minimize.
[2024-06-01 06:58:45] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 3 ms to minimize.
[2024-06-01 06:58:45] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:58:45] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:58:45] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 3 ms to minimize.
[2024-06-01 06:58:45] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-06-01 06:58:45] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:58:45] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 2 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 3 ms to minimize.
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 3 ms to minimize.
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 3 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 263/574 variables, 311/444 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 3 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 16/460 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/574 variables, and 462 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/311 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 96/151 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 3 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 3 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:59:18] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 12/171 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 1 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 263/574 variables, 311/487 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 262/749 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 06:59:26] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 3 ms to minimize.
[2024-06-01 06:59:26] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 3 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:59:30] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 20/769 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-06-01 06:59:38] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:59:38] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 4 ms to minimize.
[2024-06-01 06:59:39] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:59:39] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
[2024-06-01 06:59:40] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 2 ms to minimize.
SMT process timed out in 60248ms, After SMT, problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60276ms
Starting structural reductions in LTL mode, iteration 1 : 311/367 places, 263/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61550 ms. Remains : 311/367 places, 263/318 transitions.
Support contains 84 out of 311 places after structural reductions.
[2024-06-01 06:59:41] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 06:59:41] [INFO ] Flatten gal took : 58 ms
FORMULA BusinessProcesses-PT-05-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:59:41] [INFO ] Flatten gal took : 23 ms
[2024-06-01 06:59:41] [INFO ] Input system was already deterministic with 263 transitions.
Support contains 74 out of 311 places (down from 84) after GAL structural reductions.
RANDOM walk for 40000 steps (379 resets) in 2416 ms. (16 steps per ms) remains 7/47 properties
BEST_FIRST walk for 40001 steps (72 resets) in 200 ms. (199 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (64 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (66 resets) in 114 ms. (347 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (62 resets) in 117 ms. (339 steps per ms) remains 3/4 properties
[2024-06-01 06:59:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/85 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 200/285 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 237/522 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 42/564 variables, 18/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:59:42] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:59:42] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:59:42] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:42] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 10/574 variables, 8/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/574 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 370 constraints, problems are : Problem set: 0 solved, 3 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/85 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 200/285 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:59:42] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:42] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:42] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:42] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 237/522 variables, 285/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:59:43] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/522 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/522 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 42/564 variables, 18/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 10/574 variables, 8/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/574 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/574 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 378 constraints, problems are : Problem set: 0 solved, 3 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 1202ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 166 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=83 )
Parikh walk visited 3 properties in 211 ms.
[2024-06-01 06:59:43] [INFO ] Flatten gal took : 16 ms
[2024-06-01 06:59:43] [INFO ] Flatten gal took : 17 ms
[2024-06-01 06:59:43] [INFO ] Input system was already deterministic with 263 transitions.
Computed a total of 305 stabilizing places and 255 stable transitions
Graph (complete) has 646 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Graph (trivial) has 176 edges and 311 vertex of which 6 / 311 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 639 edges and 306 vertex of which 305 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 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 304 transition count 211
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 260 transition count 211
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 90 place count 260 transition count 156
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 212 place count 193 transition count 156
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 244 place count 161 transition count 124
Iterating global reduction 2 with 32 rules applied. Total rules applied 276 place count 161 transition count 124
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 276 place count 161 transition count 120
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 285 place count 156 transition count 120
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 429 place count 83 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 431 place count 82 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 432 place count 81 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 433 place count 80 transition count 47
Applied a total of 433 rules in 64 ms. Remains 80 /311 variables (removed 231) and now considering 47/263 (removed 216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 80/311 places, 47/263 transitions.
[2024-06-01 06:59:43] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:59:43] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:59:43] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 281 transition count 233
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 281 transition count 233
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 270 transition count 222
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 270 transition count 222
Applied a total of 82 rules in 24 ms. Remains 270 /311 variables (removed 41) and now considering 222/263 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 270/311 places, 222/263 transitions.
[2024-06-01 06:59:43] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:59:43] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:59:43] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 280 transition count 232
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 280 transition count 232
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 270 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 270 transition count 222
Applied a total of 82 rules in 22 ms. Remains 270 /311 variables (removed 41) and now considering 222/263 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 270/311 places, 222/263 transitions.
[2024-06-01 06:59:43] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:43] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:59:43] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 283 transition count 235
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 283 transition count 235
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 66 place count 273 transition count 225
Iterating global reduction 0 with 10 rules applied. Total rules applied 76 place count 273 transition count 225
Applied a total of 76 rules in 24 ms. Remains 273 /311 variables (removed 38) and now considering 225/263 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 273/311 places, 225/263 transitions.
[2024-06-01 06:59:43] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:59:43] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:59:43] [INFO ] Input system was already deterministic with 225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 279 transition count 231
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 279 transition count 231
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 268 transition count 220
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 268 transition count 220
Applied a total of 86 rules in 23 ms. Remains 268 /311 variables (removed 43) and now considering 220/263 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 268/311 places, 220/263 transitions.
[2024-06-01 06:59:43] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:59:43] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:59:43] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 286 transition count 238
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 286 transition count 238
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 279 transition count 231
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 279 transition count 231
Applied a total of 64 rules in 22 ms. Remains 279 /311 variables (removed 32) and now considering 231/263 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 279/311 places, 231/263 transitions.
[2024-06-01 06:59:43] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:43] [INFO ] Flatten gal took : 14 ms
[2024-06-01 06:59:44] [INFO ] Input system was already deterministic with 231 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 279 transition count 231
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 279 transition count 231
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 268 transition count 220
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 268 transition count 220
Applied a total of 86 rules in 22 ms. Remains 268 /311 variables (removed 43) and now considering 220/263 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 268/311 places, 220/263 transitions.
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:44] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Graph (trivial) has 174 edges and 311 vertex of which 6 / 311 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 639 edges and 306 vertex of which 305 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 304 transition count 212
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 261 transition count 212
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 88 place count 261 transition count 156
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 125 rules applied. Total rules applied 213 place count 192 transition count 156
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 244 place count 161 transition count 125
Iterating global reduction 2 with 31 rules applied. Total rules applied 275 place count 161 transition count 125
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 275 place count 161 transition count 121
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 284 place count 156 transition count 121
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 424 place count 85 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 426 place count 84 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 427 place count 83 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 428 place count 82 transition count 50
Applied a total of 428 rules in 58 ms. Remains 82 /311 variables (removed 229) and now considering 50/263 (removed 213) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 82/311 places, 50/263 transitions.
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 06:59:44] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Graph (trivial) has 176 edges and 311 vertex of which 6 / 311 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 639 edges and 306 vertex of which 305 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 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 304 transition count 211
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 260 transition count 211
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 90 place count 260 transition count 156
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 212 place count 193 transition count 156
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 244 place count 161 transition count 124
Iterating global reduction 2 with 32 rules applied. Total rules applied 276 place count 161 transition count 124
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 276 place count 161 transition count 120
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 285 place count 156 transition count 120
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 429 place count 83 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 431 place count 82 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 432 place count 81 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 433 place count 80 transition count 47
Applied a total of 433 rules in 44 ms. Remains 80 /311 variables (removed 231) and now considering 47/263 (removed 216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 80/311 places, 47/263 transitions.
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 2 ms
[2024-06-01 06:59:44] [INFO ] Input system was already deterministic with 47 transitions.
RANDOM walk for 8627 steps (2464 resets) in 67 ms. (126 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-05-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 278 transition count 230
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 278 transition count 230
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 77 place count 267 transition count 219
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 267 transition count 219
Applied a total of 88 rules in 25 ms. Remains 267 /311 variables (removed 44) and now considering 219/263 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 267/311 places, 219/263 transitions.
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:59:44] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 280 transition count 232
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 280 transition count 232
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 270 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 270 transition count 222
Applied a total of 82 rules in 14 ms. Remains 270 /311 variables (removed 41) and now considering 222/263 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 270/311 places, 222/263 transitions.
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:59:44] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 283 transition count 235
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 283 transition count 235
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 274 transition count 226
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 274 transition count 226
Applied a total of 74 rules in 19 ms. Remains 274 /311 variables (removed 37) and now considering 226/263 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 274/311 places, 226/263 transitions.
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:44] [INFO ] Input system was already deterministic with 226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 283 transition count 235
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 283 transition count 235
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 274 transition count 226
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 274 transition count 226
Applied a total of 74 rules in 13 ms. Remains 274 /311 variables (removed 37) and now considering 226/263 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 274/311 places, 226/263 transitions.
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:59:44] [INFO ] Input system was already deterministic with 226 transitions.
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:44] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 06:59:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 311 places, 263 transitions and 740 arcs took 2 ms.
Total runtime 65864 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-05-CTLCardinality-2024-00
Could not compute solution for formula : BusinessProcesses-PT-05-CTLCardinality-2024-01
Could not compute solution for formula : BusinessProcesses-PT-05-CTLCardinality-2024-02
Could not compute solution for formula : BusinessProcesses-PT-05-CTLCardinality-2024-03
Could not compute solution for formula : BusinessProcesses-PT-05-CTLCardinality-2024-04
Could not compute solution for formula : BusinessProcesses-PT-05-CTLCardinality-2024-05
Could not compute solution for formula : BusinessProcesses-PT-05-CTLCardinality-2024-06
Could not compute solution for formula : BusinessProcesses-PT-05-CTLCardinality-2024-07
Could not compute solution for formula : BusinessProcesses-PT-05-CTLCardinality-2024-09
Could not compute solution for formula : BusinessProcesses-PT-05-CTLCardinality-2024-10
Could not compute solution for formula : BusinessProcesses-PT-05-CTLCardinality-2023-13
Could not compute solution for formula : BusinessProcesses-PT-05-CTLCardinality-2023-15

BK_STOP 1717225184843

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

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