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

--------------------
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-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717225124939

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-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:58:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:58:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:58:46] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-01 06:58:46] [INFO ] Transformed 368 places.
[2024-06-01 06:58:46] [INFO ] Transformed 319 transitions.
[2024-06-01 06:58:46] [INFO ] Found NUPN structural information;
[2024-06-01 06:58:46] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 1 places in 22 ms
Reduce places removed 1 places and 1 transitions.
Support contains 115 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 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 330 transition count 283
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 330 transition count 283
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 86 place count 316 transition count 269
Iterating global reduction 1 with 14 rules applied. Total rules applied 100 place count 316 transition count 269
Applied a total of 100 rules in 86 ms. Remains 316 /367 variables (removed 51) and now considering 269/318 (removed 49) transitions.
// Phase 1: matrix 269 rows 316 cols
[2024-06-01 06:58:46] [INFO ] Computed 55 invariants in 23 ms
[2024-06-01 06:58:46] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-06-01 06:58:46] [INFO ] Invariant cache hit.
[2024-06-01 06:58:47] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-06-01 06:58:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/316 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 21 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 3 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 4 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 5 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 3 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 3 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 5 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 9 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:58:59] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:58:59] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:59] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:59] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:59] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:58:59] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:59] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:58:59] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:58:59] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:58:59] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:58:59] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 10/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 269/585 variables, 316/474 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:59:10] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 63 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 20/494 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 7/501 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/585 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 133/133 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/316 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 133/188 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:59:19] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 3 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 42 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 14/222 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 06:59:24] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:59:24] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 269/585 variables, 316/540 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 268/808 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:59:30] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:59:30] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:59:30] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:59:33] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:59:33] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 20/828 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 06:59:39] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:59:40] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:59:42] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:59:42] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:59:43] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:59:43] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:59:43] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:59:43] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/585 variables, and 844 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 205/205 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 316/367 places, 269/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60885 ms. Remains : 316/367 places, 269/318 transitions.
Support contains 115 out of 316 places after structural reductions.
[2024-06-01 06:59:47] [INFO ] Flatten gal took : 80 ms
[2024-06-01 06:59:47] [INFO ] Flatten gal took : 27 ms
[2024-06-01 06:59:47] [INFO ] Input system was already deterministic with 269 transitions.
Support contains 113 out of 316 places (down from 115) after GAL structural reductions.
RANDOM walk for 40000 steps (363 resets) in 2101 ms. (19 steps per ms) remains 23/76 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
[2024-06-01 06:59:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 167/212 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 82/294 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 254/548 variables, 294/349 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 7 (OVERLAPS) 34/582 variables, 20/369 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 0/369 constraints. Problems are: Problem set: 2 solved, 21 unsolved
Problem AtomicPropp41 is UNSAT
At refinement iteration 9 (OVERLAPS) 3/585 variables, 2/371 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/371 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/585 variables, 0/371 constraints. Problems are: Problem set: 3 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 371 constraints, problems are : Problem set: 3 solved, 20 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 164/200 variables, 33/33 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-01 06:59:49] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 15/48 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 2/50 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 92/292 variables, 22/72 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 4/76 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 1/77 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/77 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 253/545 variables, 292/369 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 11/380 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 11/391 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 3/394 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 0/394 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 37/582 variables, 22/416 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 9/425 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 2 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 16/441 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/582 variables, 1/442 constraints. Problems are: Problem set: 3 solved, 20 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/585 variables, and 442 constraints, problems are : Problem set: 3 solved, 20 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 314/316 constraints, PredecessorRefiner: 20/23 constraints, Known Traps: 53/53 constraints]
After SMT, in 6060ms problems are : Problem set: 3 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 269/269 transitions.
Graph (complete) has 650 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 315 transition count 233
Reduce places removed 34 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 281 transition count 230
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 278 transition count 230
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 76 place count 278 transition count 180
Deduced a syphon composed of 50 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 186 place count 218 transition count 180
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 207 place count 197 transition count 159
Iterating global reduction 3 with 21 rules applied. Total rules applied 228 place count 197 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 230 place count 197 transition count 157
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 232 place count 196 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 232 place count 196 transition count 155
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 195 transition count 155
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 368 place count 127 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 369 place count 126 transition count 88
Applied a total of 369 rules in 90 ms. Remains 126 /316 variables (removed 190) and now considering 88/269 (removed 181) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 126/316 places, 88/269 transitions.
RANDOM walk for 40000 steps (8 resets) in 852 ms. (46 steps per ms) remains 6/20 properties
BEST_FIRST walk for 40000 steps (8 resets) in 550 ms. (72 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
// Phase 1: matrix 88 rows 126 cols
[2024-06-01 06:59:55] [INFO ] Computed 44 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/115 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/122 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 86/208 variables, 122/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/213 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/214 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/214 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 170 constraints, problems are : Problem set: 0 solved, 2 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/42 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/115 variables, 34/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/122 variables, 4/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 86/208 variables, 122/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/213 variables, 3/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/214 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 1/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/214 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 171 constraints, problems are : Problem set: 1 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 363ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 88/88 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 126 transition count 80
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 118 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 118 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 39 place count 105 transition count 70
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 101 transition count 66
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 101 transition count 66
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 81 place count 83 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 82 transition count 49
Applied a total of 82 rules in 13 ms. Remains 82 /126 variables (removed 44) and now considering 49/88 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 82/126 places, 49/88 transitions.
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 325 steps, run visited all 1 properties in 8 ms. (steps per millisecond=40 )
Probabilistic random walk after 325 steps, saw 121 distinct states, run finished after 11 ms. (steps per millisecond=29 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-05-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:59:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 26 ms
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 27 ms
[2024-06-01 06:59:56] [INFO ] Input system was already deterministic with 269 transitions.
Support contains 94 out of 316 places (down from 99) after GAL structural reductions.
Computed a total of 309 stabilizing places and 259 stable transitions
Graph (complete) has 650 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 287 transition count 240
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 287 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 287 transition count 239
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 71 place count 275 transition count 227
Iterating global reduction 1 with 12 rules applied. Total rules applied 83 place count 275 transition count 227
Applied a total of 83 rules in 12 ms. Remains 275 /316 variables (removed 41) and now considering 227/269 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 275/316 places, 227/269 transitions.
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:59:56] [INFO ] Input system was already deterministic with 227 transitions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 281 transition count 234
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 281 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 281 transition count 233
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 85 place count 267 transition count 219
Iterating global reduction 1 with 14 rules applied. Total rules applied 99 place count 267 transition count 219
Applied a total of 99 rules in 17 ms. Remains 267 /316 variables (removed 49) and now considering 219/269 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 267/316 places, 219/269 transitions.
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:59:56] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 285 transition count 238
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 285 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 285 transition count 237
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 73 place count 275 transition count 227
Iterating global reduction 1 with 10 rules applied. Total rules applied 83 place count 275 transition count 227
Applied a total of 83 rules in 10 ms. Remains 275 /316 variables (removed 41) and now considering 227/269 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 275/316 places, 227/269 transitions.
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:59:56] [INFO ] Input system was already deterministic with 227 transitions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 287 transition count 240
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 287 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 287 transition count 239
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 69 place count 277 transition count 229
Iterating global reduction 1 with 10 rules applied. Total rules applied 79 place count 277 transition count 229
Applied a total of 79 rules in 11 ms. Remains 277 /316 variables (removed 39) and now considering 229/269 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 277/316 places, 229/269 transitions.
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:59:56] [INFO ] Input system was already deterministic with 229 transitions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 285 transition count 238
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 285 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 285 transition count 237
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 75 place count 273 transition count 225
Iterating global reduction 1 with 12 rules applied. Total rules applied 87 place count 273 transition count 225
Applied a total of 87 rules in 10 ms. Remains 273 /316 variables (removed 43) and now considering 225/269 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 273/316 places, 225/269 transitions.
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:59:56] [INFO ] Input system was already deterministic with 225 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Graph (trivial) has 181 edges and 316 vertex of which 7 / 316 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 642 edges and 310 vertex of which 309 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 308 transition count 207
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 256 transition count 207
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 106 place count 256 transition count 152
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 229 place count 188 transition count 152
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 262 place count 155 transition count 119
Iterating global reduction 2 with 33 rules applied. Total rules applied 295 place count 155 transition count 119
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 295 place count 155 transition count 116
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 302 place count 151 transition count 116
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 438 place count 82 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 439 place count 81 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 440 place count 80 transition count 48
Applied a total of 440 rules in 29 ms. Remains 80 /316 variables (removed 236) and now considering 48/269 (removed 221) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 80/316 places, 48/269 transitions.
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:59:56] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 2694 steps (771 resets) in 27 ms. (96 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 283 transition count 236
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 283 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 283 transition count 235
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 80 place count 270 transition count 222
Iterating global reduction 1 with 13 rules applied. Total rules applied 93 place count 270 transition count 222
Applied a total of 93 rules in 8 ms. Remains 270 /316 variables (removed 46) and now considering 222/269 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 270/316 places, 222/269 transitions.
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 14 ms
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 18 ms
[2024-06-01 06:59:56] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 281 transition count 234
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 281 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 281 transition count 233
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 84 place count 268 transition count 220
Iterating global reduction 1 with 13 rules applied. Total rules applied 97 place count 268 transition count 220
Applied a total of 97 rules in 15 ms. Remains 268 /316 variables (removed 48) and now considering 220/269 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 268/316 places, 220/269 transitions.
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 20 ms
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:56] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 285 transition count 238
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 285 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 285 transition count 237
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 76 place count 272 transition count 224
Iterating global reduction 1 with 13 rules applied. Total rules applied 89 place count 272 transition count 224
Applied a total of 89 rules in 40 ms. Remains 272 /316 variables (removed 44) and now considering 224/269 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 272/316 places, 224/269 transitions.
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:59:56] [INFO ] Input system was already deterministic with 224 transitions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 287 transition count 240
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 287 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 287 transition count 239
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 70 place count 276 transition count 228
Iterating global reduction 1 with 11 rules applied. Total rules applied 81 place count 276 transition count 228
Applied a total of 81 rules in 10 ms. Remains 276 /316 variables (removed 40) and now considering 228/269 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 276/316 places, 228/269 transitions.
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 22 ms
[2024-06-01 06:59:56] [INFO ] Input system was already deterministic with 228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 283 transition count 236
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 283 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 283 transition count 235
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 81 place count 269 transition count 221
Iterating global reduction 1 with 14 rules applied. Total rules applied 95 place count 269 transition count 221
Applied a total of 95 rules in 10 ms. Remains 269 /316 variables (removed 47) and now considering 221/269 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 269/316 places, 221/269 transitions.
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:59:56] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 281 transition count 234
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 281 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 281 transition count 233
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 85 place count 267 transition count 219
Iterating global reduction 1 with 14 rules applied. Total rules applied 99 place count 267 transition count 219
Applied a total of 99 rules in 23 ms. Remains 267 /316 variables (removed 49) and now considering 219/269 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 267/316 places, 219/269 transitions.
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 19 ms
[2024-06-01 06:59:56] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 282 transition count 235
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 282 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 282 transition count 234
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 82 place count 269 transition count 221
Iterating global reduction 1 with 13 rules applied. Total rules applied 95 place count 269 transition count 221
Applied a total of 95 rules in 10 ms. Remains 269 /316 variables (removed 47) and now considering 221/269 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 269/316 places, 221/269 transitions.
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:56] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:59:57] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 282 transition count 235
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 282 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 282 transition count 234
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 83 place count 268 transition count 220
Iterating global reduction 1 with 14 rules applied. Total rules applied 97 place count 268 transition count 220
Applied a total of 97 rules in 11 ms. Remains 268 /316 variables (removed 48) and now considering 220/269 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 268/316 places, 220/269 transitions.
[2024-06-01 06:59:57] [INFO ] Flatten gal took : 20 ms
[2024-06-01 06:59:57] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:57] [INFO ] Input system was already deterministic with 220 transitions.
[2024-06-01 06:59:57] [INFO ] Flatten gal took : 21 ms
[2024-06-01 06:59:57] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:57] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 06:59:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 316 places, 269 transitions and 752 arcs took 16 ms.
Total runtime 70987 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-CTLFireability-2024-00
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-2024-01
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-2024-02
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-2024-03
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-2024-04
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-2024-06
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-2024-07
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-2024-09
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-2024-10
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-2024-11
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-2023-12
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-2023-13
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-2023-14

BK_STOP 1717225197480

--------------------
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-05-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1326/ctl_0_
ctl formula name BusinessProcesses-PT-05-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1326/ctl_1_
ctl formula name BusinessProcesses-PT-05-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1326/ctl_2_
ctl formula name BusinessProcesses-PT-05-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1326/ctl_3_
ctl formula name BusinessProcesses-PT-05-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1326/ctl_4_
ctl formula name BusinessProcesses-PT-05-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1326/ctl_5_
ctl formula name BusinessProcesses-PT-05-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1326/ctl_6_
ctl formula name BusinessProcesses-PT-05-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1326/ctl_7_
ctl formula name BusinessProcesses-PT-05-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1326/ctl_8_
ctl formula name BusinessProcesses-PT-05-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1326/ctl_9_
ctl formula name BusinessProcesses-PT-05-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1326/ctl_10_
ctl formula name BusinessProcesses-PT-05-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1326/ctl_11_
ctl formula name BusinessProcesses-PT-05-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1326/ctl_12_
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="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-05, 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-171620399600482"
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 [ "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 ;