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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.7K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 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 47K 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-01-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716302124540

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-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:35:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 14:35:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:35:26] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2024-05-21 14:35:26] [INFO ] Transformed 200 places.
[2024-05-21 14:35:26] [INFO ] Transformed 178 transitions.
[2024-05-21 14:35:26] [INFO ] Found NUPN structural information;
[2024-05-21 14:35:26] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 91 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 177
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 186 transition count 166
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 186 transition count 166
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 183 transition count 163
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 183 transition count 163
Applied a total of 30 rules in 60 ms. Remains 183 /199 variables (removed 16) and now considering 163/177 (removed 14) transitions.
// Phase 1: matrix 163 rows 183 cols
[2024-05-21 14:35:26] [INFO ] Computed 28 invariants in 15 ms
[2024-05-21 14:35:26] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-21 14:35:26] [INFO ] Invariant cache hit.
[2024-05-21 14:35:26] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-21 14:35:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-21 14:35:28] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 13 ms to minimize.
[2024-05-21 14:35:28] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 1 ms to minimize.
[2024-05-21 14:35:28] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:35:28] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:35:28] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-05-21 14:35:28] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 4 ms to minimize.
[2024-05-21 14:35:28] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:35:28] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-05-21 14:35:28] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 2 ms to minimize.
[2024-05-21 14:35:29] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 1 ms to minimize.
[2024-05-21 14:35:29] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:35:29] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 26 ms to minimize.
[2024-05-21 14:35:29] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 1 ms to minimize.
[2024-05-21 14:35:29] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-21 14:35:29] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 10 ms to minimize.
[2024-05-21 14:35:29] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-05-21 14:35:29] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-21 14:35:29] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2024-05-21 14:35:30] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-21 14:35:30] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD145 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 20/48 constraints. Problems are: Problem set: 2 solved, 160 unsolved
[2024-05-21 14:35:30] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:35:30] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:35:30] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:35:30] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:35:30] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 2 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 2 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:35:31] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 20/68 constraints. Problems are: Problem set: 2 solved, 160 unsolved
[2024-05-21 14:35:32] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:35:32] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:35:32] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:35:32] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-21 14:35:32] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:35:32] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:35:32] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:35:32] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-05-21 14:35:32] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 2 ms to minimize.
[2024-05-21 14:35:32] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:35:32] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-05-21 14:35:32] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:35:33] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:35:33] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:35:33] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:35:33] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:35:33] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 16 ms to minimize.
[2024-05-21 14:35:33] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 2 ms to minimize.
[2024-05-21 14:35:33] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:35:33] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 20/88 constraints. Problems are: Problem set: 2 solved, 160 unsolved
[2024-05-21 14:35:33] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:35:33] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:35:33] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:35:33] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-21 14:35:34] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:35:34] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:35:34] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 14:35:34] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:35:34] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2024-05-21 14:35:34] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:35:34] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:35:34] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:35:34] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:35:34] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 2 ms to minimize.
[2024-05-21 14:35:34] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-05-21 14:35:34] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:35:34] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 2 ms to minimize.
[2024-05-21 14:35:34] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-05-21 14:35:35] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-21 14:35:35] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
Problem TDEAD141 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 20/108 constraints. Problems are: Problem set: 3 solved, 159 unsolved
[2024-05-21 14:35:35] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-21 14:35:36] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2024-05-21 14:35:36] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-21 14:35:36] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:35:36] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 2 ms to minimize.
[2024-05-21 14:35:36] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-05-21 14:35:36] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-21 14:35:36] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 2 ms to minimize.
[2024-05-21 14:35:36] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-05-21 14:35:36] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:35:36] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:35:36] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-05-21 14:35:36] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-21 14:35:37] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:35:37] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:35:37] [INFO ] Deduced a trap composed of 12 places in 15 ms of which 1 ms to minimize.
[2024-05-21 14:35:37] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-21 14:35:37] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-21 14:35:37] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-05-21 14:35:37] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 5 ms to minimize.
Problem TDEAD143 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 20/128 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:35:37] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-21 14:35:37] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-21 14:35:37] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:35:38] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-21 14:35:38] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:35:38] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:35:38] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:35:38] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:35:38] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 2 ms to minimize.
[2024-05-21 14:35:38] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-05-21 14:35:38] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-21 14:35:38] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 2 ms to minimize.
[2024-05-21 14:35:38] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:35:38] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:35:38] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-21 14:35:38] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-21 14:35:38] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-21 14:35:39] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-21 14:35:39] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:35:39] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 20/148 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:35:39] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-21 14:35:39] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:35:39] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:35:39] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:35:40] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 5/153 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:35:40] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-05-21 14:35:41] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-21 14:35:41] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:35:41] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-21 14:35:41] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-21 14:35:41] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 2 ms to minimize.
[2024-05-21 14:35:41] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 7/160 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:35:42] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:35:42] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-21 14:35:42] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:35:42] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:35:42] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:35:42] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:35:42] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-21 14:35:43] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:35:43] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:35:43] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 10/170 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:35:43] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:35:43] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-05-21 14:35:43] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:35:43] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-05-21 14:35:43] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:35:44] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 2 ms to minimize.
[2024-05-21 14:35:44] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 9 ms to minimize.
[2024-05-21 14:35:44] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:35:44] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-21 14:35:44] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:35:44] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 2 ms to minimize.
[2024-05-21 14:35:44] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-21 14:35:44] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-21 14:35:44] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-21 14:35:44] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-05-21 14:35:45] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-21 14:35:45] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-21 14:35:45] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:35:45] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-05-21 14:35:45] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 20/190 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:35:46] [INFO ] Deduced a trap composed of 53 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:35:46] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:35:46] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 0 ms to minimize.
[2024-05-21 14:35:46] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:35:46] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:35:46] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:35:46] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 2 ms to minimize.
[2024-05-21 14:35:46] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:35:46] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 9/199 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:35:47] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:35:47] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:35:47] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-05-21 14:35:47] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:35:47] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:35:47] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:35:47] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:35:47] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 2 ms to minimize.
[2024-05-21 14:35:47] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:35:47] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:35:47] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:35:47] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:35:47] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:35:47] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:35:48] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
[2024-05-21 14:35:48] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:35:48] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2024-05-21 14:35:48] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 2 ms to minimize.
[2024-05-21 14:35:48] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:35:48] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 20/219 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:35:48] [INFO ] Deduced a trap composed of 55 places in 31 ms of which 1 ms to minimize.
[2024-05-21 14:35:48] [INFO ] Deduced a trap composed of 46 places in 28 ms of which 0 ms to minimize.
[2024-05-21 14:35:48] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:35:49] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 2 ms to minimize.
[2024-05-21 14:35:49] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 2 ms to minimize.
[2024-05-21 14:35:49] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-21 14:35:49] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/183 variables, 7/226 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:35:50] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/183 variables, 1/227 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:35:51] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/183 variables, 1/228 constraints. Problems are: Problem set: 4 solved, 158 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/183 variables, 0/228 constraints. Problems are: Problem set: 4 solved, 158 unsolved
At refinement iteration 19 (OVERLAPS) 163/346 variables, 183/411 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:35:53] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:35:53] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-21 14:35:53] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-21 14:35:53] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:35:53] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
[2024-05-21 14:35:54] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:35:54] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:35:54] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:35:54] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:35:54] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:35:54] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:35:54] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:35:54] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:35:54] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:35:54] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-21 14:35:54] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-05-21 14:35:54] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-21 14:35:55] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:35:55] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-21 14:35:55] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/346 variables, 20/431 constraints. Problems are: Problem set: 4 solved, 158 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/346 variables, 0/431 constraints. Problems are: Problem set: 4 solved, 158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/346 variables, and 431 constraints, problems are : Problem set: 4 solved, 158 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 220/220 constraints]
Escalating to Integer solving :Problem set: 4 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 10/10 constraints. Problems are: Problem set: 4 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 18/28 constraints. Problems are: Problem set: 4 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 220/248 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:35:58] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-21 14:35:58] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-05-21 14:35:58] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:35:58] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:35:58] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-21 14:35:58] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 2 ms to minimize.
[2024-05-21 14:35:58] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:35:58] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:35:58] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:35:58] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:35:59] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:35:59] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 12/260 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:36:00] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-21 14:36:00] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:36:00] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:36:01] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 4/264 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:36:02] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 2 ms to minimize.
[2024-05-21 14:36:03] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 2/266 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:36:03] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:36:04] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2024-05-21 14:36:04] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-21 14:36:04] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-21 14:36:04] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
[2024-05-21 14:36:04] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:36:04] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-21 14:36:05] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 8/274 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:36:07] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 2 ms to minimize.
[2024-05-21 14:36:07] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:36:07] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 3 ms to minimize.
[2024-05-21 14:36:07] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 4/278 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:36:09] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:36:10] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-21 14:36:10] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-21 14:36:10] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-21 14:36:10] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 14 ms to minimize.
[2024-05-21 14:36:10] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 5 ms to minimize.
[2024-05-21 14:36:11] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:36:11] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-21 14:36:11] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:36:11] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:36:11] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-05-21 14:36:11] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-05-21 14:36:11] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-05-21 14:36:11] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 2 ms to minimize.
[2024-05-21 14:36:11] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-05-21 14:36:12] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-05-21 14:36:12] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2024-05-21 14:36:12] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 2 ms to minimize.
[2024-05-21 14:36:12] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-05-21 14:36:12] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 20/298 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:36:13] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-05-21 14:36:14] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 2 ms to minimize.
[2024-05-21 14:36:14] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:36:14] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 4/302 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:36:17] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:36:17] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 2/304 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:36:20] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 1/305 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 14:36:24] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-21 14:36:24] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-05-21 14:36:24] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 2 ms to minimize.
[2024-05-21 14:36:24] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2024-05-21 14:36:25] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/346 variables, and 310 constraints, problems are : Problem set: 4 solved, 158 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/183 constraints, PredecessorRefiner: 0/162 constraints, Known Traps: 282/282 constraints]
After SMT, in 60122ms problems are : Problem set: 4 solved, 158 unsolved
Search for dead transitions found 4 dead transitions in 60140ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 183/199 places, 159/177 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 182 transition count 159
Applied a total of 1 rules in 18 ms. Remains 182 /183 variables (removed 1) and now considering 159/159 (removed 0) transitions.
// Phase 1: matrix 159 rows 182 cols
[2024-05-21 14:36:26] [INFO ] Computed 29 invariants in 6 ms
[2024-05-21 14:36:27] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 14:36:27] [INFO ] Invariant cache hit.
[2024-05-21 14:36:27] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 182/199 places, 159/177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60887 ms. Remains : 182/199 places, 159/177 transitions.
Support contains 91 out of 182 places after structural reductions.
[2024-05-21 14:36:27] [INFO ] Flatten gal took : 53 ms
[2024-05-21 14:36:27] [INFO ] Flatten gal took : 24 ms
[2024-05-21 14:36:27] [INFO ] Input system was already deterministic with 159 transitions.
Support contains 88 out of 182 places (down from 91) after GAL structural reductions.
RANDOM walk for 40000 steps (451 resets) in 1814 ms. (22 steps per ms) remains 11/76 properties
BEST_FIRST walk for 40002 steps (86 resets) in 84 ms. (470 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40002 steps (95 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (99 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (102 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (115 resets) in 90 ms. (439 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (89 resets) in 53 ms. (740 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (100 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (95 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (103 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
[2024-05-21 14:36:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 2 (OVERLAPS) 82/99 variables, 6/7 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 51/150 variables, 12/20 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp60 is UNSAT
At refinement iteration 7 (OVERLAPS) 26/176 variables, 9/29 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 155/331 variables, 176/205 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-21 14:36:28] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2024-05-21 14:36:29] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:36:29] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:36:29] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-21 14:36:29] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-21 14:36:29] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-21 14:36:29] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 1 ms to minimize.
[2024-05-21 14:36:29] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-05-21 14:36:29] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-21 14:36:29] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
[2024-05-21 14:36:29] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:36:29] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 12/217 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 0/217 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 9/340 variables, 5/222 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/222 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/341 variables, 1/223 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/223 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/341 variables, 0/223 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 223 constraints, problems are : Problem set: 3 solved, 4 unsolved in 1299 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 182/182 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/11 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 2 (OVERLAPS) 80/91 variables, 5/6 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/7 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-21 14:36:30] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:36:30] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
Problem AtomicPropp21 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 59/150 variables, 13/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 3/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-05-21 14:36:30] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-21 14:36:30] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 14:36:30] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 3/28 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/28 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Problem AtomicPropp62 is UNSAT
After SMT solving in domain Int declared 176/341 variables, and 37 constraints, problems are : Problem set: 7 solved, 0 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/182 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 8/17 constraints]
After SMT, in 1835ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
[2024-05-21 14:36:30] [INFO ] Flatten gal took : 15 ms
[2024-05-21 14:36:30] [INFO ] Flatten gal took : 12 ms
[2024-05-21 14:36:30] [INFO ] Input system was already deterministic with 159 transitions.
Computed a total of 151 stabilizing places and 128 stable transitions
Graph (complete) has 351 edges and 182 vertex of which 181 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 159/159 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 181 transition count 159
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 160 transition count 138
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 160 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 160 transition count 137
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 57 place count 147 transition count 124
Iterating global reduction 2 with 13 rules applied. Total rules applied 70 place count 147 transition count 124
Applied a total of 70 rules in 22 ms. Remains 147 /182 variables (removed 35) and now considering 124/159 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 147/182 places, 124/159 transitions.
[2024-05-21 14:36:30] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:36:30] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:36:30] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 159/159 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 181 transition count 159
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 159 transition count 137
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 159 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 159 transition count 136
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 60 place count 145 transition count 122
Iterating global reduction 2 with 14 rules applied. Total rules applied 74 place count 145 transition count 122
Applied a total of 74 rules in 11 ms. Remains 145 /182 variables (removed 37) and now considering 122/159 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 145/182 places, 122/159 transitions.
[2024-05-21 14:36:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:36:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:36:30] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 159/159 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 181 transition count 159
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 158 transition count 136
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 158 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 158 transition count 135
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 63 place count 143 transition count 120
Iterating global reduction 2 with 15 rules applied. Total rules applied 78 place count 143 transition count 120
Applied a total of 78 rules in 10 ms. Remains 143 /182 variables (removed 39) and now considering 120/159 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 143/182 places, 120/159 transitions.
[2024-05-21 14:36:30] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:36:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:36:30] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 159/159 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 181 transition count 159
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 161 transition count 139
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 161 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 161 transition count 138
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 56 place count 147 transition count 124
Iterating global reduction 2 with 14 rules applied. Total rules applied 70 place count 147 transition count 124
Applied a total of 70 rules in 10 ms. Remains 147 /182 variables (removed 35) and now considering 124/159 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 147/182 places, 124/159 transitions.
[2024-05-21 14:36:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:36:30] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:36:30] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 159/159 transitions.
Graph (complete) has 351 edges and 182 vertex of which 181 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 179 transition count 132
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 154 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 152 transition count 130
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 55 place count 152 transition count 94
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 133 place count 110 transition count 94
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 155 place count 88 transition count 72
Iterating global reduction 3 with 22 rules applied. Total rules applied 177 place count 88 transition count 72
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 179 place count 88 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 180 place count 87 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 180 place count 87 transition count 68
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 184 place count 85 transition count 68
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 248 place count 52 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 52 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 250 place count 51 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 251 place count 50 transition count 35
Applied a total of 251 rules in 41 ms. Remains 50 /182 variables (removed 132) and now considering 35/159 (removed 124) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 50/182 places, 35/159 transitions.
[2024-05-21 14:36:30] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:36:30] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:36:30] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 159/159 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 181 transition count 159
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 161 transition count 139
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 161 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 161 transition count 138
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 55 place count 148 transition count 125
Iterating global reduction 2 with 13 rules applied. Total rules applied 68 place count 148 transition count 125
Applied a total of 68 rules in 10 ms. Remains 148 /182 variables (removed 34) and now considering 125/159 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 148/182 places, 125/159 transitions.
[2024-05-21 14:36:30] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:36:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:36:30] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 159/159 transitions.
Graph (complete) has 351 edges and 182 vertex of which 181 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 179 transition count 133
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 155 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 153 transition count 131
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 53 place count 153 transition count 96
Deduced a syphon composed of 35 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 129 place count 112 transition count 96
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 150 place count 91 transition count 75
Iterating global reduction 3 with 21 rules applied. Total rules applied 171 place count 91 transition count 75
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 173 place count 91 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 174 place count 90 transition count 73
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 174 place count 90 transition count 71
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 178 place count 88 transition count 71
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 238 place count 57 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 239 place count 57 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 240 place count 56 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 55 transition count 40
Applied a total of 241 rules in 31 ms. Remains 55 /182 variables (removed 127) and now considering 40/159 (removed 119) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 55/182 places, 40/159 transitions.
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:36:31] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 159/159 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 181 transition count 159
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 161 transition count 139
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 161 transition count 139
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 54 place count 148 transition count 126
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 148 transition count 126
Applied a total of 67 rules in 9 ms. Remains 148 /182 variables (removed 34) and now considering 126/159 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 148/182 places, 126/159 transitions.
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:36:31] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 159/159 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 162 transition count 139
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 162 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 162 transition count 138
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 54 place count 149 transition count 125
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 149 transition count 125
Applied a total of 67 rules in 9 ms. Remains 149 /182 variables (removed 33) and now considering 125/159 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 149/182 places, 125/159 transitions.
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:36:31] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 159/159 transitions.
Graph (trivial) has 107 edges and 182 vertex of which 7 / 182 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 344 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 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 34 rules applied. Total rules applied 36 place count 173 transition count 116
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 139 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 138 transition count 115
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 72 place count 138 transition count 87
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 134 place count 104 transition count 87
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 153 place count 85 transition count 68
Iterating global reduction 3 with 19 rules applied. Total rules applied 172 place count 85 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 172 place count 85 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 84 transition count 67
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 240 place count 50 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 49 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 242 place count 48 transition count 34
Applied a total of 242 rules in 37 ms. Remains 48 /182 variables (removed 134) and now considering 34/159 (removed 125) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 48/182 places, 34/159 transitions.
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:36:31] [INFO ] Input system was already deterministic with 34 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 159/159 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 181 transition count 159
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 162 transition count 140
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 162 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 162 transition count 139
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 53 place count 149 transition count 126
Iterating global reduction 2 with 13 rules applied. Total rules applied 66 place count 149 transition count 126
Applied a total of 66 rules in 9 ms. Remains 149 /182 variables (removed 33) and now considering 126/159 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 149/182 places, 126/159 transitions.
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:36:31] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 159/159 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 181 transition count 159
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 158 transition count 136
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 158 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 158 transition count 135
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 63 place count 143 transition count 120
Iterating global reduction 2 with 15 rules applied. Total rules applied 78 place count 143 transition count 120
Applied a total of 78 rules in 9 ms. Remains 143 /182 variables (removed 39) and now considering 120/159 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 143/182 places, 120/159 transitions.
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:36:31] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 159/159 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 181 transition count 159
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 159 transition count 137
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 159 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 159 transition count 136
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 61 place count 144 transition count 121
Iterating global reduction 2 with 15 rules applied. Total rules applied 76 place count 144 transition count 121
Applied a total of 76 rules in 10 ms. Remains 144 /182 variables (removed 38) and now considering 121/159 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 144/182 places, 121/159 transitions.
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:36:31] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 159/159 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 181 transition count 159
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 159 transition count 137
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 159 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 159 transition count 136
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 60 place count 145 transition count 122
Iterating global reduction 2 with 14 rules applied. Total rules applied 74 place count 145 transition count 122
Applied a total of 74 rules in 9 ms. Remains 145 /182 variables (removed 37) and now considering 122/159 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 145/182 places, 122/159 transitions.
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:36:31] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:36:31] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:36:31] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-21 14:36:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 182 places, 159 transitions and 429 arcs took 2 ms.
Total runtime 65377 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-01

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 1480
MODEL NAME: /home/mcc/execution/416/model
182 places, 159 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-01-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-01-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-01-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-01-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-01-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-01-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-01-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-01-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-01-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-01-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-01-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-01-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-01-CTLFireability-2024-11 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-01-CTLFireability-2023-12 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716304298772

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

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