Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398300482.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398300482
=====================================================================

--------------------
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 1716303443372

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:57:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 14:57:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:57:24] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-21 14:57:24] [INFO ] Transformed 368 places.
[2024-05-21 14:57:24] [INFO ] Transformed 319 transitions.
[2024-05-21 14:57:24] [INFO ] Found NUPN structural information;
[2024-05-21 14:57:24] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 1 places in 11 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 61 ms. Remains 316 /367 variables (removed 51) and now considering 269/318 (removed 49) transitions.
// Phase 1: matrix 269 rows 316 cols
[2024-05-21 14:57:25] [INFO ] Computed 55 invariants in 20 ms
[2024-05-21 14:57:25] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-21 14:57:25] [INFO ] Invariant cache hit.
[2024-05-21 14:57:25] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-21 14:57:25] [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-05-21 14:57:28] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 26 ms to minimize.
[2024-05-21 14:57:28] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 3 ms to minimize.
[2024-05-21 14:57:28] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-21 14:57:29] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 3 ms to minimize.
[2024-05-21 14:57:29] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 2 ms to minimize.
[2024-05-21 14:57:29] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-21 14:57:29] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-21 14:57:29] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-21 14:57:29] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-21 14:57:29] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-21 14:57:29] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-21 14:57:29] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-21 14:57:29] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-21 14:57:29] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-21 14:57:30] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-21 14:57:30] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-21 14:57:30] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-21 14:57:30] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-21 14:57:30] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 3 ms to minimize.
[2024-05-21 14:57:30] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 14:57:31] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-21 14:57:31] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-21 14:57:31] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-21 14:57:31] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:57:31] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
[2024-05-21 14:57:31] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:57:31] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:57:31] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:57:31] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:57:31] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:57:31] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:57:31] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
[2024-05-21 14:57:31] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 14:57:31] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 2 ms to minimize.
[2024-05-21 14:57:32] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:57:32] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:57:32] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 3 ms to minimize.
[2024-05-21 14:57:32] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 3 ms to minimize.
[2024-05-21 14:57:32] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-21 14:57:32] [INFO ] Deduced a trap composed of 15 places in 98 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-05-21 14:57:34] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:57:34] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 2 ms to minimize.
[2024-05-21 14:57:34] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-21 14:57:35] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 3 ms to minimize.
[2024-05-21 14:57:35] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-21 14:57:35] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 3 ms to minimize.
[2024-05-21 14:57:35] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-21 14:57:35] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-21 14:57:35] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-21 14:57:35] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-21 14:57:35] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 3 ms to minimize.
[2024-05-21 14:57:35] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 3 ms to minimize.
[2024-05-21 14:57:36] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-21 14:57:36] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-21 14:57:36] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-21 14:57:36] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-21 14:57:36] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 5 ms to minimize.
[2024-05-21 14:57:36] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 14:57:36] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-21 14:57:36] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 14:57:37] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 4 ms to minimize.
[2024-05-21 14:57:37] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-21 14:57:37] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-05-21 14:57:37] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 2 ms to minimize.
[2024-05-21 14:57:37] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:57:37] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:57:37] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:57:38] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 2 ms to minimize.
[2024-05-21 14:57:38] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-21 14:57:38] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-21 14:57:38] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-21 14:57:38] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-21 14:57:38] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-21 14:57:38] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-21 14:57:38] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-21 14:57:39] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-21 14:57:39] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-21 14:57:39] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:57:39] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-21 14:57:39] [INFO ] Deduced a trap composed of 28 places in 62 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-05-21 14:57:40] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-21 14:57:40] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-21 14:57:40] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:57:40] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-21 14:57:41] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-21 14:57:41] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-05-21 14:57:41] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 14:57:41] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:57:41] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-21 14:57:41] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:57:41] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 2 ms to minimize.
[2024-05-21 14:57:41] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:57:42] [INFO ] Deduced a trap composed of 30 places in 35 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-05-21 14:57:44] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-05-21 14:57:44] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-05-21 14:57:44] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:57:44] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-05-21 14:57:44] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-21 14:57:44] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-21 14:57:44] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 2 ms to minimize.
[2024-05-21 14:57:45] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:57:45] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:57:45] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 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-05-21 14:57:49] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-05-21 14:57:50] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-21 14:57:50] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:57:50] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-21 14:57:50] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-21 14:57:50] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-05-21 14:57:50] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-21 14:57:51] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 14:57:51] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-21 14:57:51] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:57:51] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-21 14:57:51] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-21 14:57:51] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
[2024-05-21 14:57:51] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 3 ms to minimize.
[2024-05-21 14:57:51] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-21 14:57:52] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-21 14:57:52] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:57:52] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-05-21 14:57:52] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:57:52] [INFO ] Deduced a trap composed of 25 places in 83 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-05-21 14:57:54] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:57:54] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-21 14:57:54] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 3 ms to minimize.
[2024-05-21 14:57:54] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2024-05-21 14:57:54] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-21 14:57:54] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:57:55] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/585 variables, and 501 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 130/130 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, 130/185 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 14:57:57] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-21 14:57:57] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 3 ms to minimize.
[2024-05-21 14:57:57] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-21 14:57:57] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-21 14:57:57] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
[2024-05-21 14:57:58] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-21 14:57:58] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-21 14:57:58] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 3 ms to minimize.
[2024-05-21 14:57:58] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-21 14:57:58] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-21 14:57:58] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2024-05-21 14:57:58] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
[2024-05-21 14:57:58] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 3 ms to minimize.
[2024-05-21 14:57:58] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:57:59] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:57:59] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:57:59] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:57:59] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:57:59] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:57:59] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 14:58:00] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 1 ms to minimize.
[2024-05-21 14:58:00] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 3 ms to minimize.
[2024-05-21 14:58:00] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-21 14:58:00] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:58:00] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 2 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 2 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-21 14:58:01] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:58:02] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:58:02] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:58:02] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 14:58:03] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
[2024-05-21 14:58:03] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:58:03] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 2 ms to minimize.
[2024-05-21 14:58:03] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 3 ms to minimize.
[2024-05-21 14:58:03] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2024-05-21 14:58:03] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 2 ms to minimize.
[2024-05-21 14:58:04] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-21 14:58:04] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 14:58:05] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:58:05] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 14:58:07] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:58:07] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:58:07] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 269/585 variables, 316/554 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 268/822 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 14:58:11] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-21 14:58:12] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-21 14:58:12] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-21 14:58:12] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-21 14:58:12] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-21 14:58:12] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:58:12] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:58:13] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-21 14:58:13] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-21 14:58:13] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-21 14:58:14] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-21 14:58:14] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-05-21 14:58:15] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-05-21 14:58:15] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-21 14:58:16] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-21 14:58:16] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 3 ms to minimize.
[2024-05-21 14:58:16] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-21 14:58:17] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-21 14:58:17] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:58:18] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 20/842 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 14:58:24] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:58:25] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 3 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 30017 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 60133ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in LTL mode, iteration 1 : 316/367 places, 269/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60725 ms. Remains : 316/367 places, 269/318 transitions.
Support contains 115 out of 316 places after structural reductions.
[2024-05-21 14:58:25] [INFO ] Flatten gal took : 56 ms
[2024-05-21 14:58:25] [INFO ] Flatten gal took : 23 ms
[2024-05-21 14:58:25] [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 (377 resets) in 2144 ms. (18 steps per ms) remains 9/76 properties
BEST_FIRST walk for 40004 steps (71 resets) in 134 ms. (296 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (55 resets) in 120 ms. (330 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (68 resets) in 266 ms. (149 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (70 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (56 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (53 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (51 resets) in 122 ms. (325 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (65 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (62 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
[2024-05-21 14:58:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 86/101 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 191/292 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 253/545 variables, 292/347 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 14:58:27] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:58:27] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-21 14:58:27] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-21 14:58:27] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-21 14:58:27] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 5/352 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 14:58:27] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 9 (OVERLAPS) 37/582 variables, 22/375 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-21 14:58:27] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:58:27] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-21 14:58:27] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-21 14:58:27] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-21 14:58:27] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-21 14:58:27] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 6/381 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 0/381 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp41 is UNSAT
At refinement iteration 12 (OVERLAPS) 3/585 variables, 2/383 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/585 variables, 0/383 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/585 variables, 0/383 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 383 constraints, problems are : Problem set: 3 solved, 4 unsolved in 972 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/47 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 243/290 variables, 52/55 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 8/63 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-21 14:58:28] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:58:28] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:58:28] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-21 14:58:28] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-21 14:58:28] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 5/68 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 251/541 variables, 290/358 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 2/360 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-21 14:58:28] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 1/361 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 0/361 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 41/582 variables, 24/385 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 2/387 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 4/391 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-21 14:58:28] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-21 14:58:28] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
[2024-05-21 14:58:28] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-21 14:58:28] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-21 14:58:29] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:58:29] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:58:29] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:58:29] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-05-21 14:58:29] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-21 14:58:29] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
[2024-05-21 14:58:29] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:58:29] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 12/403 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-21 14:58:29] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 1/404 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/404 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 17 (OVERLAPS) 3/585 variables, 2/406 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/585 variables, 0/406 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/585 variables, 0/406 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 406 constraints, problems are : Problem set: 4 solved, 3 unsolved in 1927 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 31/31 constraints]
After SMT, in 2915ms problems are : Problem set: 4 solved, 3 unsolved
Parikh walk visited 0 properties in 860 ms.
Support contains 5 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.1 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 315 transition count 221
Reduce places removed 46 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 269 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 267 transition count 219
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 98 place count 267 transition count 158
Deduced a syphon composed of 61 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 233 place count 193 transition count 158
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 266 place count 160 transition count 125
Iterating global reduction 3 with 33 rules applied. Total rules applied 299 place count 160 transition count 125
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 301 place count 160 transition count 123
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 303 place count 159 transition count 122
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 303 place count 159 transition count 119
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 5 with 7 rules applied. Total rules applied 310 place count 155 transition count 119
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 5 with 136 rules applied. Total rules applied 446 place count 86 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 447 place count 85 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 448 place count 84 transition count 51
Applied a total of 448 rules in 54 ms. Remains 84 /316 variables (removed 232) and now considering 51/269 (removed 218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 84/316 places, 51/269 transitions.
RANDOM walk for 30076 steps (6 resets) in 336 ms. (89 steps per ms) remains 0/3 properties
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-05-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 14:58:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 13 ms
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 13 ms
[2024-05-21 14:58:31] [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.7 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 34 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 35 ms. Remains : 275/316 places, 227/269 transitions.
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 13 ms
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 13 ms
[2024-05-21 14:58:31] [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 29 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 30 ms. Remains : 267/316 places, 219/269 transitions.
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 14 ms
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:58:31] [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 22 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 22 ms. Remains : 275/316 places, 227/269 transitions.
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:58:31] [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 23 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 23 ms. Remains : 277/316 places, 229/269 transitions.
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:58:31] [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 20 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 20 ms. Remains : 273/316 places, 225/269 transitions.
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:58:31] [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 3 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.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 1 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 1 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 38 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 38 ms. Remains : 80/316 places, 48/269 transitions.
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:58:31] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 1803 steps (528 resets) in 43 ms. (40 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 37 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 37 ms. Remains : 270/316 places, 222/269 transitions.
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 12 ms
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:58:31] [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 27 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 27 ms. Remains : 268/316 places, 220/269 transitions.
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:58:31] [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 21 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 21 ms. Remains : 272/316 places, 224/269 transitions.
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:58:31] [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 18 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 18 ms. Remains : 276/316 places, 228/269 transitions.
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:58:31] [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 18 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 18 ms. Remains : 269/316 places, 221/269 transitions.
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:58:31] [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 18 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 19 ms. Remains : 267/316 places, 219/269 transitions.
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:58:31] [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 19 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 19 ms. Remains : 269/316 places, 221/269 transitions.
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:58:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:58:31] [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 18 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 18 ms. Remains : 268/316 places, 220/269 transitions.
[2024-05-21 14:58:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 14:58:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 14:58:32] [INFO ] Input system was already deterministic with 220 transitions.
[2024-05-21 14:58:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:58:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:58:32] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-21 14:58:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 316 places, 269 transitions and 752 arcs took 2 ms.
Total runtime 67476 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-05

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 316
TRANSITIONS: 269
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.000s]


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


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

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

Process ID: 1289
MODEL NAME: /home/mcc/execution/417/model
316 places, 269 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

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

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

MEDDLY ERROR: Insufficient memory

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-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 r047-tajo-171620398300482"
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 ;