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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K 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.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717225071131

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:57:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:57:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:57:52] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-06-01 06:57:52] [INFO ] Transformed 288 places.
[2024-06-01 06:57:52] [INFO ] Transformed 283 transitions.
[2024-06-01 06:57:52] [INFO ] Found NUPN structural information;
[2024-06-01 06:57:52] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 2 transitions.
Support contains 95 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 281
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 30 place count 256 transition count 254
Iterating global reduction 1 with 27 rules applied. Total rules applied 57 place count 256 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 256 transition count 253
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 250 transition count 247
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 250 transition count 247
Applied a total of 70 rules in 52 ms. Remains 250 /286 variables (removed 36) and now considering 247/281 (removed 34) transitions.
// Phase 1: matrix 247 rows 250 cols
[2024-06-01 06:57:52] [INFO ] Computed 41 invariants in 20 ms
[2024-06-01 06:57:53] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-06-01 06:57:53] [INFO ] Invariant cache hit.
[2024-06-01 06:57:53] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2024-06-01 06:57:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 17 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 6 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 2 ms to minimize.
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 20/81 constraints. Problems are: Problem set: 19 solved, 227 unsolved
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 7 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 20/101 constraints. Problems are: Problem set: 25 solved, 221 unsolved
[2024-06-01 06:58:02] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 1 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
Problem TDEAD187 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 20/121 constraints. Problems are: Problem set: 32 solved, 214 unsolved
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 20/141 constraints. Problems are: Problem set: 32 solved, 214 unsolved
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 20/161 constraints. Problems are: Problem set: 34 solved, 212 unsolved
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 1 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 3 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
Problem TDEAD174 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 20/181 constraints. Problems are: Problem set: 38 solved, 208 unsolved
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 3 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 3 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 20/201 constraints. Problems are: Problem set: 38 solved, 208 unsolved
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
Problem TDEAD194 is UNSAT
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 9/210 constraints. Problems are: Problem set: 40 solved, 206 unsolved
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 3 ms to minimize.
SMT process timed out in 30147ms, After SMT, problems are : Problem set: 40 solved, 206 unsolved
Search for dead transitions found 40 dead transitions in 30173ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in LTL mode, iteration 1 : 250/286 places, 207/281 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 248 transition count 207
Applied a total of 2 rules in 6 ms. Remains 248 /250 variables (removed 2) and now considering 207/207 (removed 0) transitions.
// Phase 1: matrix 207 rows 248 cols
[2024-06-01 06:58:23] [INFO ] Computed 50 invariants in 5 ms
[2024-06-01 06:58:23] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 06:58:23] [INFO ] Invariant cache hit.
[2024-06-01 06:58:23] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 248/286 places, 207/281 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31067 ms. Remains : 248/286 places, 207/281 transitions.
Support contains 95 out of 248 places after structural reductions.
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 37 ms
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 16 ms
[2024-06-01 06:58:24] [INFO ] Input system was already deterministic with 207 transitions.
RANDOM walk for 40000 steps (441 resets) in 1752 ms. (22 steps per ms) remains 14/63 properties
BEST_FIRST walk for 40003 steps (86 resets) in 295 ms. (135 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (94 resets) in 180 ms. (221 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (105 resets) in 287 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (94 resets) in 177 ms. (224 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (82 resets) in 133 ms. (298 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (91 resets) in 143 ms. (277 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (86 resets) in 448 ms. (89 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (92 resets) in 203 ms. (196 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40002 steps (100 resets) in 47 ms. (833 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (93 resets) in 46 ms. (851 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (101 resets) in 54 ms. (727 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (101 resets) in 47 ms. (833 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (88 resets) in 52 ms. (754 steps per ms) remains 13/13 properties
[2024-06-01 06:58:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 2 (OVERLAPS) 136/174 variables, 18/20 constraints. Problems are: Problem set: 4 solved, 9 unsolved
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 8/28 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/28 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 5 (OVERLAPS) 64/238 variables, 30/58 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/58 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 200/438 variables, 238/296 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/296 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/449 variables, 6/302 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/302 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/455 variables, 4/306 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 0/306 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/455 variables, 0/306 constraints. Problems are: Problem set: 12 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 306 constraints, problems are : Problem set: 12 solved, 1 unsolved in 565 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 12 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/73 variables, 3/3 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/161 variables, 15/18 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 8/26 constraints. Problems are: Problem set: 12 solved, 1 unsolved
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 15/41 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/41 constraints. Problems are: Problem set: 12 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Int declared 238/455 variables, and 73 constraints, problems are : Problem set: 13 solved, 0 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/248 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 23/23 constraints]
After SMT, in 1281ms problems are : Problem set: 13 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-04-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:58:26] [INFO ] Flatten gal took : 12 ms
[2024-06-01 06:58:26] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:58:26] [INFO ] Input system was already deterministic with 207 transitions.
Support contains 56 out of 248 places (down from 59) after GAL structural reductions.
Computed a total of 223 stabilizing places and 183 stable transitions
Graph (complete) has 502 edges and 248 vertex of which 247 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 207
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 222 transition count 184
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 222 transition count 184
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 214 transition count 176
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 214 transition count 176
Applied a total of 65 rules in 15 ms. Remains 214 /248 variables (removed 34) and now considering 176/207 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 214/248 places, 176/207 transitions.
[2024-06-01 06:58:26] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:58:26] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:58:26] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Graph (trivial) has 121 edges and 248 vertex of which 6 / 248 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 495 edges and 243 vertex of which 242 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
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 238 transition count 169
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 208 transition count 169
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 62 place count 208 transition count 123
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 160 place count 156 transition count 123
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 178 place count 138 transition count 105
Iterating global reduction 2 with 18 rules applied. Total rules applied 196 place count 138 transition count 105
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 196 place count 138 transition count 101
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 204 place count 134 transition count 101
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 97 rules applied. Total rules applied 301 place count 80 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 302 place count 79 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 303 place count 78 transition count 57
Applied a total of 303 rules in 41 ms. Remains 78 /248 variables (removed 170) and now considering 57/207 (removed 150) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 78/248 places, 57/207 transitions.
[2024-06-01 06:58:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:58:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:58:26] [INFO ] Input system was already deterministic with 57 transitions.
RANDOM walk for 39 steps (4 resets) in 7 ms. (4 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-04-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Graph (trivial) has 121 edges and 248 vertex of which 6 / 248 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 495 edges and 243 vertex of which 242 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
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 238 transition count 169
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 208 transition count 169
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 62 place count 208 transition count 122
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 162 place count 155 transition count 122
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 180 place count 137 transition count 104
Iterating global reduction 2 with 18 rules applied. Total rules applied 198 place count 137 transition count 104
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 198 place count 137 transition count 101
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 204 place count 134 transition count 101
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 97 rules applied. Total rules applied 301 place count 80 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 302 place count 79 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 303 place count 78 transition count 57
Applied a total of 303 rules in 24 ms. Remains 78 /248 variables (removed 170) and now considering 57/207 (removed 150) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 78/248 places, 57/207 transitions.
[2024-06-01 06:58:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:58:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:58:26] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 207
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 222 transition count 184
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 222 transition count 184
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 215 transition count 177
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 215 transition count 177
Applied a total of 63 rules in 12 ms. Remains 215 /248 variables (removed 33) and now considering 177/207 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 215/248 places, 177/207 transitions.
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:27] [INFO ] Input system was already deterministic with 177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 207
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 223 transition count 185
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 223 transition count 185
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 216 transition count 178
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 216 transition count 178
Applied a total of 61 rules in 12 ms. Remains 216 /248 variables (removed 32) and now considering 178/207 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 216/248 places, 178/207 transitions.
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:58:27] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 247 transition count 207
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 225 transition count 185
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 225 transition count 185
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 217 transition count 177
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 217 transition count 177
Applied a total of 61 rules in 12 ms. Remains 217 /248 variables (removed 31) and now considering 177/207 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 217/248 places, 177/207 transitions.
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:58:27] [INFO ] Input system was already deterministic with 177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 207
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 224 transition count 186
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 224 transition count 186
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 217 transition count 179
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 217 transition count 179
Applied a total of 59 rules in 13 ms. Remains 217 /248 variables (removed 31) and now considering 179/207 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 217/248 places, 179/207 transitions.
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:27] [INFO ] Input system was already deterministic with 179 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Graph (trivial) has 121 edges and 248 vertex of which 6 / 248 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 495 edges and 243 vertex of which 242 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
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 238 transition count 169
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 208 transition count 169
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 62 place count 208 transition count 122
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 162 place count 155 transition count 122
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 180 place count 137 transition count 104
Iterating global reduction 2 with 18 rules applied. Total rules applied 198 place count 137 transition count 104
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 198 place count 137 transition count 100
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 206 place count 133 transition count 100
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 301 place count 80 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 302 place count 79 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 303 place count 78 transition count 57
Applied a total of 303 rules in 25 ms. Remains 78 /248 variables (removed 170) and now considering 57/207 (removed 150) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 78/248 places, 57/207 transitions.
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:58:27] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Graph (complete) has 502 edges and 248 vertex of which 247 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
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 243 transition count 185
Reduce places removed 20 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 23 rules applied. Total rules applied 44 place count 223 transition count 182
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 47 place count 220 transition count 182
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 47 place count 220 transition count 126
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 165 place count 158 transition count 126
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 185 place count 138 transition count 106
Iterating global reduction 3 with 20 rules applied. Total rules applied 205 place count 138 transition count 106
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 205 place count 138 transition count 102
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 213 place count 134 transition count 102
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 89 rules applied. Total rules applied 302 place count 84 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 303 place count 84 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 304 place count 83 transition count 61
Applied a total of 304 rules in 28 ms. Remains 83 /248 variables (removed 165) and now considering 61/207 (removed 146) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 83/248 places, 61/207 transitions.
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:58:27] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 207
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 224 transition count 186
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 224 transition count 186
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 217 transition count 179
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 217 transition count 179
Applied a total of 59 rules in 11 ms. Remains 217 /248 variables (removed 31) and now considering 179/207 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 217/248 places, 179/207 transitions.
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:58:27] [INFO ] Input system was already deterministic with 179 transitions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 207
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 223 transition count 185
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 223 transition count 185
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 215 transition count 177
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 215 transition count 177
Applied a total of 63 rules in 9 ms. Remains 215 /248 variables (removed 33) and now considering 177/207 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 215/248 places, 177/207 transitions.
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:27] [INFO ] Input system was already deterministic with 177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 207
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 227 transition count 189
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 227 transition count 189
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 223 transition count 185
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 223 transition count 185
Applied a total of 47 rules in 10 ms. Remains 223 /248 variables (removed 25) and now considering 185/207 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 223/248 places, 185/207 transitions.
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:27] [INFO ] Input system was already deterministic with 185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 207
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 225 transition count 187
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 225 transition count 187
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 218 transition count 180
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 218 transition count 180
Applied a total of 57 rules in 10 ms. Remains 218 /248 variables (removed 30) and now considering 180/207 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 218/248 places, 180/207 transitions.
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:27] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 207
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 222 transition count 184
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 222 transition count 184
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 214 transition count 176
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 214 transition count 176
Applied a total of 65 rules in 12 ms. Remains 214 /248 variables (removed 34) and now considering 176/207 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 214/248 places, 176/207 transitions.
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:27] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 207/207 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 207
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 224 transition count 186
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 224 transition count 186
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 216 transition count 178
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 216 transition count 178
Applied a total of 61 rules in 18 ms. Remains 216 /248 variables (removed 32) and now considering 178/207 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 216/248 places, 178/207 transitions.
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:27] [INFO ] Input system was already deterministic with 178 transitions.
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:58:27] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:58:27] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 06:58:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 248 places, 207 transitions and 597 arcs took 2 ms.
Total runtime 35021 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-04-CTLFireability-2024-00
Could not compute solution for formula : BusinessProcesses-PT-04-CTLFireability-2024-03
Could not compute solution for formula : BusinessProcesses-PT-04-CTLFireability-2024-04
Could not compute solution for formula : BusinessProcesses-PT-04-CTLFireability-2024-05
Could not compute solution for formula : BusinessProcesses-PT-04-CTLFireability-2024-06
Could not compute solution for formula : BusinessProcesses-PT-04-CTLFireability-2024-07
Could not compute solution for formula : BusinessProcesses-PT-04-CTLFireability-2024-08
Could not compute solution for formula : BusinessProcesses-PT-04-CTLFireability-2024-09
Could not compute solution for formula : BusinessProcesses-PT-04-CTLFireability-2024-10
Could not compute solution for formula : BusinessProcesses-PT-04-CTLFireability-2024-11
Could not compute solution for formula : BusinessProcesses-PT-04-CTLFireability-2023-12
Could not compute solution for formula : BusinessProcesses-PT-04-CTLFireability-2023-13
Could not compute solution for formula : BusinessProcesses-PT-04-CTLFireability-2023-14
Could not compute solution for formula : BusinessProcesses-PT-04-CTLFireability-2023-15

BK_STOP 1717225107903

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-04-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1133/ctl_0_
ctl formula name BusinessProcesses-PT-04-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1133/ctl_1_
ctl formula name BusinessProcesses-PT-04-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1133/ctl_2_
ctl formula name BusinessProcesses-PT-04-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1133/ctl_3_
ctl formula name BusinessProcesses-PT-04-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1133/ctl_4_
ctl formula name BusinessProcesses-PT-04-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1133/ctl_5_
ctl formula name BusinessProcesses-PT-04-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1133/ctl_6_
ctl formula name BusinessProcesses-PT-04-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1133/ctl_7_
ctl formula name BusinessProcesses-PT-04-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1133/ctl_8_
ctl formula name BusinessProcesses-PT-04-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1133/ctl_9_
ctl formula name BusinessProcesses-PT-04-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1133/ctl_10_
ctl formula name BusinessProcesses-PT-04-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1133/ctl_11_
ctl formula name BusinessProcesses-PT-04-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1133/ctl_12_
ctl formula name BusinessProcesses-PT-04-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1133/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-04"
export BK_EXAMINATION="CTLFireability"
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-04, examination is CTLFireability"
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-171620399600474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-04.tgz
mv BusinessProcesses-PT-04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;