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.r048-tajo-171620399600505.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 itstools
Input is BusinessProcesses-PT-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399600505
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 11 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K 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-08-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716334239225

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:30:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:30:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:30:40] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-21 23:30:40] [INFO ] Transformed 393 places.
[2024-05-21 23:30:40] [INFO ] Transformed 344 transitions.
[2024-05-21 23:30:40] [INFO ] Found NUPN structural information;
[2024-05-21 23:30:40] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 13 places in 8 ms
Reduce places removed 13 places and 13 transitions.
Support contains 116 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 375 transition count 331
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 45 place count 335 transition count 291
Iterating global reduction 1 with 40 rules applied. Total rules applied 85 place count 335 transition count 291
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 101 place count 319 transition count 275
Iterating global reduction 1 with 16 rules applied. Total rules applied 117 place count 319 transition count 275
Applied a total of 117 rules in 111 ms. Remains 319 /380 variables (removed 61) and now considering 275/331 (removed 56) transitions.
// Phase 1: matrix 275 rows 319 cols
[2024-05-21 23:30:41] [INFO ] Computed 53 invariants in 19 ms
[2024-05-21 23:30:41] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-21 23:30:41] [INFO ] Invariant cache hit.
[2024-05-21 23:30:41] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-05-21 23:30:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 4/319 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 24 ms to minimize.
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 69 places in 240 ms of which 2 ms to minimize.
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 1 ms to minimize.
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 1 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 4 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 65 places in 545 ms of which 1 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 3 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 6 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 3 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:30:55] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:30:55] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:30:55] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:30:55] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:30:55] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:30:55] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:30:55] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:57] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:30:57] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:30:57] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:57] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:30:57] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:30:57] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:30:57] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:30:57] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:30:57] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:30:58] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:30:58] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:30:58] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:30:58] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:30:58] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:30:58] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:30:58] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:30:58] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:30:58] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:30:58] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:30:58] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:30:58] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:30:59] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:30:59] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:30:59] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:30:59] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:30:59] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 4 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:31:04] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:31:04] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:31:04] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:31:04] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:31:04] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:04] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:31:04] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:04] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:31:04] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 20/233 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:07] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:31:07] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:31:07] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:31:07] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/319 variables, 20/253 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 20/273 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/594 variables, and 276 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/319 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 223/223 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 4/319 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 223/276 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:13] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:31:13] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 3 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 20/296 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 20/316 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 3 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/319 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/594 variables, and 476 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/319 constraints, PredecessorRefiner: 0/274 constraints, Known Traps: 423/423 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Starting structural reductions in LTL mode, iteration 1 : 319/380 places, 275/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60980 ms. Remains : 319/380 places, 275/331 transitions.
Support contains 116 out of 319 places after structural reductions.
[2024-05-21 23:31:42] [INFO ] Flatten gal took : 51 ms
[2024-05-21 23:31:42] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:31:42] [INFO ] Input system was already deterministic with 275 transitions.
Support contains 106 out of 319 places (down from 116) after GAL structural reductions.
RANDOM walk for 40000 steps (343 resets) in 2882 ms. (13 steps per ms) remains 13/70 properties
BEST_FIRST walk for 40004 steps (60 resets) in 198 ms. (201 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (62 resets) in 168 ms. (236 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40003 steps (60 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (57 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (62 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (52 resets) in 99 ms. (400 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (61 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (58 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (61 resets) in 99 ms. (400 steps per ms) remains 2/8 properties
[2024-05-21 23:31:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 112/117 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 150/267 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 40/307 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 267/574 variables, 307/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 17/591 variables, 9/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/594 variables, 3/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/594 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/594 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/594 variables, and 372 constraints, problems are : Problem set: 0 solved, 2 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 112/117 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 65 places in 33 ms of which 1 ms to minimize.
Problem AtomicPropp36 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 150/267 variables, 34/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 9/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/307 variables, 14/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 1/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 267/574 variables, 307/371 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 1/372 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 2/374 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 0/374 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 17/591 variables, 9/383 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 0/383 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/594 variables, 3/386 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/594 variables, 0/386 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/594 variables, 0/386 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 594/594 variables, and 386 constraints, problems are : Problem set: 1 solved, 1 unsolved in 746 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 951ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 131 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=65 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-21 23:31:44] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:31:44] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:31:44] [INFO ] Input system was already deterministic with 275 transitions.
Computed a total of 113 stabilizing places and 107 stable transitions
Graph (complete) has 649 edges and 319 vertex of which 315 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (trivial) has 186 edges and 319 vertex of which 7 / 319 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 641 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 308 transition count 211
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 254 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 253 transition count 210
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 112 place count 253 transition count 154
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 123 rules applied. Total rules applied 235 place count 186 transition count 154
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 275 place count 146 transition count 114
Iterating global reduction 3 with 40 rules applied. Total rules applied 315 place count 146 transition count 114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 315 place count 146 transition count 112
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 320 place count 143 transition count 112
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 448 place count 78 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 449 place count 77 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 450 place count 76 transition count 48
Applied a total of 450 rules in 57 ms. Remains 76 /319 variables (removed 243) and now considering 48/275 (removed 227) transitions.
// Phase 1: matrix 48 rows 76 cols
[2024-05-21 23:31:44] [INFO ] Computed 35 invariants in 2 ms
[2024-05-21 23:31:44] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 23:31:44] [INFO ] Invariant cache hit.
[2024-05-21 23:31:44] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 18, 20, 21, 22, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 152 ms to find 38 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 38/319 places, 48/275 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 38 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 31 transition count 41
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 25 transition count 35
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 25 transition count 35
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 25 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 23 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 23 transition count 32
Applied a total of 31 rules in 7 ms. Remains 23 /38 variables (removed 15) and now considering 32/48 (removed 16) transitions.
// Phase 1: matrix 32 rows 23 cols
[2024-05-21 23:31:44] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 23:31:44] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 23:31:44] [INFO ] Invariant cache hit.
[2024-05-21 23:31:44] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 23/319 places, 32/275 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 268 ms. Remains : 23/319 places, 32/275 transitions.
[2024-05-21 23:31:44] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:31:44] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:31:44] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-21 23:31:44] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:31:44] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:31:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality16535471378667534171.gal : 1 ms
[2024-05-21 23:31:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality11076832890912899602.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16535471378667534171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11076832890912899602.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,43,0.014693,3348,2,62,5,460,6,0,123,431,0


Converting to forward existential form...Done !
original formula: AG(EF((p55==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p55==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t14, t21, t23, t24, t31, Intersection with reachable at each step enabled. (destroyed/re...188
(forward)formula 0,1,0.020884,3696,1,0,49,2018,84,32,722,1746,76
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 41 place count 278 transition count 237
Iterating global reduction 1 with 38 rules applied. Total rules applied 79 place count 278 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 278 transition count 236
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 96 place count 262 transition count 220
Iterating global reduction 2 with 16 rules applied. Total rules applied 112 place count 262 transition count 220
Applied a total of 112 rules in 25 ms. Remains 262 /319 variables (removed 57) and now considering 220/275 (removed 55) transitions.
// Phase 1: matrix 220 rows 262 cols
[2024-05-21 23:31:44] [INFO ] Computed 50 invariants in 3 ms
[2024-05-21 23:31:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 23:31:45] [INFO ] Invariant cache hit.
[2024-05-21 23:31:45] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-21 23:31:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:46] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 4 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:50] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:52] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:54] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 220/482 variables, 262/347 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 3 ms to minimize.
[2024-05-21 23:31:57] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:31:57] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:31:57] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:31:57] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:31:58] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 9/356 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/482 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 356 constraints, problems are : Problem set: 0 solved, 219 unsolved in 17903 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 44/94 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/482 variables, 262/356 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 219/575 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:32:09] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:32:09] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 14/589 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:32:14] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:32:14] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 3/592 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/482 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 595 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 64/64 constraints]
After SMT, in 47958ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 47960ms
Starting structural reductions in LTL mode, iteration 1 : 262/319 places, 220/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48241 ms. Remains : 262/319 places, 220/275 transitions.
[2024-05-21 23:32:33] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:32:33] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:32:33] [INFO ] Input system was already deterministic with 220 transitions.
[2024-05-21 23:32:33] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:32:33] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:32:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality6671685377028307674.gal : 6 ms
[2024-05-21 23:32:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality9547461666777833780.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6671685377028307674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9547461666777833780.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.58451e+17,12.5699,299168,2,51252,5,593137,6,0,1268,1.93878e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:33:03] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:33:03] [INFO ] Applying decomposition
[2024-05-21 23:33:03] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8748695184435174854.txt' '-o' '/tmp/graph8748695184435174854.bin' '-w' '/tmp/graph8748695184435174854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8748695184435174854.bin' '-l' '-1' '-v' '-w' '/tmp/graph8748695184435174854.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:33:03] [INFO ] Decomposing Gal with order
[2024-05-21 23:33:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:33:03] [INFO ] Removed a total of 86 redundant transitions.
[2024-05-21 23:33:03] [INFO ] Flatten gal took : 41 ms
[2024-05-21 23:33:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-21 23:33:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality13103659843958719024.gal : 4 ms
[2024-05-21 23:33:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality14776560584963051732.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13103659843958719024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14776560584963051732.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.58451e+17,1.26591,39764,3609,26,64624,319,575,117677,42,685,0


Converting to forward existential form...Done !
original formula: E(EG((AX(EX(TRUE)) + (i6.u18.p58==1))) U ((i11.i0.u63.p239==1) + (EX(AX(AF((i13.u46.p164==1)))) * (((i0.u86.p373==0)||(i11.i1.u65.p244==1...281
=> equivalent forward existential formula: ([(FwdU(Init,EG((!(EX(!(EX(TRUE)))) + (i6.u18.p58==1)))) * (i11.i0.u63.p239==1))] != FALSE + ([((FwdU(Init,EG((!...536
Reverse transition relation is NOT exact ! Due to transitions t109, t192, t196, t199, t205, t206, t210, t215, t217, t218, i0.u28.t124, i0.u66.t50, i1.u26.t...846
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 42 place count 277 transition count 236
Iterating global reduction 1 with 39 rules applied. Total rules applied 81 place count 277 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 277 transition count 235
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 96 place count 263 transition count 221
Iterating global reduction 2 with 14 rules applied. Total rules applied 110 place count 263 transition count 221
Applied a total of 110 rules in 40 ms. Remains 263 /319 variables (removed 56) and now considering 221/275 (removed 54) transitions.
// Phase 1: matrix 221 rows 263 cols
[2024-05-21 23:33:33] [INFO ] Computed 50 invariants in 2 ms
[2024-05-21 23:33:33] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-21 23:33:33] [INFO ] Invariant cache hit.
[2024-05-21 23:33:34] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-21 23:33:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/484 variables, 263/337 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 8/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/484 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 345 constraints, problems are : Problem set: 0 solved, 220 unsolved in 13270 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 32/82 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/484 variables, 263/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 220/565 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 7/572 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 0/484 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 484/484 variables, and 573 constraints, problems are : Problem set: 0 solved, 220 unsolved in 23906 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 40/40 constraints]
After SMT, in 37214ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 37217ms
Starting structural reductions in LTL mode, iteration 1 : 263/319 places, 221/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37705 ms. Remains : 263/319 places, 221/275 transitions.
[2024-05-21 23:34:11] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:34:11] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:34:11] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-21 23:34:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:34:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:34:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality12969573249324585160.gal : 2 ms
[2024-05-21 23:34:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality4267393553033835603.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12969573249324585160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4267393553033835603.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.25741e+17,10.1324,238736,2,47457,5,497388,6,0,1273,1.55485e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:34:41] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:34:41] [INFO ] Applying decomposition
[2024-05-21 23:34:41] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3884060949126951212.txt' '-o' '/tmp/graph3884060949126951212.bin' '-w' '/tmp/graph3884060949126951212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3884060949126951212.bin' '-l' '-1' '-v' '-w' '/tmp/graph3884060949126951212.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:34:41] [INFO ] Decomposing Gal with order
[2024-05-21 23:34:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:34:41] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-21 23:34:41] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:34:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-21 23:34:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality3980318061619220456.gal : 5 ms
[2024-05-21 23:34:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality8492133508188996724.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3980318061619220456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8492133508188996724.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.25741e+17,1.80939,61600,7224,24,88254,355,520,228918,38,761,0


Converting to forward existential form...Done !
original formula: EF((A((i0.u39.p142==1) U (((i16.u54.p197==0)||(i7.u11.p33==1))&&((i16.u47.p166==0)||(i17.u49.p172==1)))) * AG(EX(((i19.i1.u83.p350==0)||(...179
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((E(!((((i16.u54.p197==0)||(i7.u11.p33==1))&&((i16.u47.p166==0)||(i17.u49.p172==1)))) U (!...428
Reverse transition relation is NOT exact ! Due to transitions t108, t160, t193, t197, t201, t204, t206, t208, t211, t216, t218, t219, u12.t158, i0.u39.t101...808
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 37 place count 282 transition count 241
Iterating global reduction 1 with 34 rules applied. Total rules applied 71 place count 282 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 282 transition count 240
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 84 place count 270 transition count 228
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 270 transition count 228
Applied a total of 96 rules in 54 ms. Remains 270 /319 variables (removed 49) and now considering 228/275 (removed 47) transitions.
// Phase 1: matrix 228 rows 270 cols
[2024-05-21 23:35:11] [INFO ] Computed 50 invariants in 3 ms
[2024-05-21 23:35:11] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 23:35:11] [INFO ] Invariant cache hit.
[2024-05-21 23:35:12] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-05-21 23:35:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 228/498 variables, 270/351 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 6/357 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (OVERLAPS) 0/498 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 357 constraints, problems are : Problem set: 0 solved, 227 unsolved in 16835 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 37/87 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 228/498 variables, 270/358 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 227/585 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 7/592 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 4/596 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:35:46] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:35:46] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:35:46] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:35:46] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 4/600 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:35:53] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 601 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 54/54 constraints]
After SMT, in 46896ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 46900ms
Starting structural reductions in LTL mode, iteration 1 : 270/319 places, 228/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47275 ms. Remains : 270/319 places, 228/275 transitions.
[2024-05-21 23:35:58] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:35:58] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:35:58] [INFO ] Input system was already deterministic with 228 transitions.
[2024-05-21 23:35:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:35:58] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:35:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality9414278295321023746.gal : 1 ms
[2024-05-21 23:35:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality5597972846147447635.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9414278295321023746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5597972846147447635.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.70282e+17,11.9043,266316,2,52853,5,524864,6,0,1308,1.68665e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:36:29] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:36:29] [INFO ] Applying decomposition
[2024-05-21 23:36:29] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2956350520192673250.txt' '-o' '/tmp/graph2956350520192673250.bin' '-w' '/tmp/graph2956350520192673250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2956350520192673250.bin' '-l' '-1' '-v' '-w' '/tmp/graph2956350520192673250.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:36:29] [INFO ] Decomposing Gal with order
[2024-05-21 23:36:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:36:29] [INFO ] Removed a total of 84 redundant transitions.
[2024-05-21 23:36:29] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:36:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2024-05-21 23:36:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality11025653959285499846.gal : 6 ms
[2024-05-21 23:36:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality17016543383035839821.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11025653959285499846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17016543383035839821.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.70282e+17,0.707644,31948,4383,34,50559,397,592,99259,44,1219,0


Converting to forward existential form...Done !
original formula: (EX((((!(E(AG((i12.i0.u72.p261==0)) U EF(((u34.p108==0)||(i19.u81.p299==1))))) * !(E(EF((i5.i1.u86.p325==1)) U (i19.u78.p387==1)))) + ((i...446
=> equivalent forward existential formula: ((([((EY(Init) * !(E(!(E(TRUE U !((i12.i0.u72.p261==0)))) U E(TRUE U ((u34.p108==0)||(i19.u81.p299==1)))))) * !(...626
Reverse transition relation is NOT exact ! Due to transitions t114, t167, t200, t204, t208, t211, t218, t223, t225, i0.i0.u41.t107, i0.i1.u37.t117, i0.i2.u...961
(forward)formula 0,1,17.7458,623732,1,0,1.09445e+06,397,3701,2.48543e+06,180,1219,1540753
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (trivial) has 177 edges and 319 vertex of which 7 / 319 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 641 edges and 313 vertex of which 310 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 309 transition count 216
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 260 transition count 216
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 100 place count 260 transition count 161
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 221 place count 194 transition count 161
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 256 place count 159 transition count 126
Iterating global reduction 2 with 35 rules applied. Total rules applied 291 place count 159 transition count 126
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 291 place count 159 transition count 124
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 295 place count 157 transition count 124
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 418 place count 95 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 419 place count 94 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 420 place count 93 transition count 62
Applied a total of 420 rules in 64 ms. Remains 93 /319 variables (removed 226) and now considering 62/275 (removed 213) transitions.
// Phase 1: matrix 62 rows 93 cols
[2024-05-21 23:36:47] [INFO ] Computed 38 invariants in 1 ms
[2024-05-21 23:36:47] [INFO ] Implicit Places using invariants in 58 ms returned [11, 75]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 91/319 places, 62/275 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 131 ms. Remains : 91/319 places, 62/275 transitions.
[2024-05-21 23:36:47] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:36:47] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:36:47] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-21 23:36:47] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:36:47] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:36:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality8090761635915631619.gal : 1 ms
[2024-05-21 23:36:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality7582315732584031834.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8090761635915631619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7582315732584031834.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1436,0.034914,4768,2,999,5,3678,6,0,420,3268,0


Converting to forward existential form...Done !
original formula: AF((A(((p105==0)||(p280==1)) U EG(((((p22==1)||(p390==0))||(p130==1)) * EF((p16==1))))) + ((!(E((p330==1) U (p228==0))) * (p207==0)) * (p...165
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!(EG(((((p22==1)||(p390==0))||(p130==1)) * E(TRUE U (p16==1))))) U (!(((p105==0)||(p280==1)))...367
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t10, t21, t27, t30, t32, t35, t36, t45, t49, t50, t60, Intersection with reachab...227
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.791774,28152,1,0,300,135608,169,194,2914,123430,330
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 40 place count 279 transition count 238
Iterating global reduction 1 with 37 rules applied. Total rules applied 77 place count 279 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 279 transition count 237
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 93 place count 264 transition count 222
Iterating global reduction 2 with 15 rules applied. Total rules applied 108 place count 264 transition count 222
Applied a total of 108 rules in 22 ms. Remains 264 /319 variables (removed 55) and now considering 222/275 (removed 53) transitions.
// Phase 1: matrix 222 rows 264 cols
[2024-05-21 23:36:48] [INFO ] Computed 50 invariants in 3 ms
[2024-05-21 23:36:48] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 23:36:48] [INFO ] Invariant cache hit.
[2024-05-21 23:36:48] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-21 23:36:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 222/486 variables, 264/342 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 7/349 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/486 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 349 constraints, problems are : Problem set: 0 solved, 221 unsolved in 16710 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 35/85 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/486 variables, 264/349 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 221/570 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 4 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 8/578 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 7/586 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:37:25] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 587 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 52/52 constraints]
After SMT, in 46767ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 46772ms
Starting structural reductions in LTL mode, iteration 1 : 264/319 places, 222/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47096 ms. Remains : 264/319 places, 222/275 transitions.
[2024-05-21 23:37:35] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:37:35] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:37:35] [INFO ] Input system was already deterministic with 222 transitions.
[2024-05-21 23:37:35] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:37:35] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:37:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality4145590670737821198.gal : 2 ms
[2024-05-21 23:37:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality1188197675709930589.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4145590670737821198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1188197675709930589.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.29917e+17,9.83583,228968,2,44889,5,478099,6,0,1278,1.4463e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:38:05] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:38:05] [INFO ] Applying decomposition
[2024-05-21 23:38:05] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7665461537192766578.txt' '-o' '/tmp/graph7665461537192766578.bin' '-w' '/tmp/graph7665461537192766578.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7665461537192766578.bin' '-l' '-1' '-v' '-w' '/tmp/graph7665461537192766578.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:38:05] [INFO ] Decomposing Gal with order
[2024-05-21 23:38:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:38:05] [INFO ] Removed a total of 84 redundant transitions.
[2024-05-21 23:38:05] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:38:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2024-05-21 23:38:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality659511687628465106.gal : 4 ms
[2024-05-21 23:38:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality14940396929768796675.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality659511687628465106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14940396929768796675.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.29917e+17,3.9331,99964,5619,27,131425,312,574,368783,40,760,0


Converting to forward existential form...Done !
original formula: EF((EF((!(A((i15.i0.u52.p170==1) U (i18.i1.u76.p337==0))) * (((i9.i0.u74.p282==0)&&(i18.i1.u76.p353==1)) + AG(((i1.u89.p369==0)||(i8.i0.u...363
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * E(TRUE U (!(!((E(!((i18.i1.u76.p337==0)) U (!((i15.i0.u52.p170==1)) * !((i18.i1.u76.p...854
Reverse transition relation is NOT exact ! Due to transitions t111, t161, t194, t198, t201, t205, t209, t212, t217, t219, i0.u35.t114, i1.u27.t130, i1.u29....870
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,22.3625,547492,1,0,956678,312,4129,1.86151e+06,192,846,1933219
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 275 transition count 234
Iterating global reduction 1 with 41 rules applied. Total rules applied 85 place count 275 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 275 transition count 233
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 102 place count 259 transition count 217
Iterating global reduction 2 with 16 rules applied. Total rules applied 118 place count 259 transition count 217
Applied a total of 118 rules in 12 ms. Remains 259 /319 variables (removed 60) and now considering 217/275 (removed 58) transitions.
// Phase 1: matrix 217 rows 259 cols
[2024-05-21 23:38:27] [INFO ] Computed 50 invariants in 2 ms
[2024-05-21 23:38:28] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-21 23:38:28] [INFO ] Invariant cache hit.
[2024-05-21 23:38:28] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-21 23:38:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 3 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:38:30] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:38:31] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:38:31] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:38:31] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:38:31] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:38:31] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:38:31] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:38:32] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:38:32] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 23:38:32] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:38:32] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/476 variables, 259/334 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 8/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 0/476 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 342 constraints, problems are : Problem set: 0 solved, 216 unsolved in 15164 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 33/83 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/476 variables, 259/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 216/558 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 5/563 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/476 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 565 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 40/40 constraints]
After SMT, in 45217ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 45221ms
Starting structural reductions in LTL mode, iteration 1 : 259/319 places, 217/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45638 ms. Remains : 259/319 places, 217/275 transitions.
[2024-05-21 23:39:13] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:39:13] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:39:13] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-21 23:39:13] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:39:13] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:39:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality11572980790369546971.gal : 3 ms
[2024-05-21 23:39:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality8242016310267614627.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11572980790369546971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8242016310267614627.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.17415e+17,8.55187,218588,2,43181,5,453369,6,0,1253,1.41302e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:39:43] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:39:43] [INFO ] Applying decomposition
[2024-05-21 23:39:43] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12893030642476131621.txt' '-o' '/tmp/graph12893030642476131621.bin' '-w' '/tmp/graph12893030642476131621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12893030642476131621.bin' '-l' '-1' '-v' '-w' '/tmp/graph12893030642476131621.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:39:43] [INFO ] Decomposing Gal with order
[2024-05-21 23:39:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:39:43] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-21 23:39:43] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:39:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2024-05-21 23:39:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality16915251750689985316.gal : 3 ms
[2024-05-21 23:39:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality13007610553122484918.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16915251750689985316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13007610553122484918.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.17415e+17,9.18715,178628,5965,26,205105,284,543,717350,36,674,0


Converting to forward existential form...Done !
original formula: EG(EX(AF(((i14.u52.p174==0)||(i14.u52.p177==1)))))
=> equivalent forward existential formula: [FwdG(Init,EX(!(EG(!(((i14.u52.p174==0)||(i14.u52.p177==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t106, t189, t193, t196, t200, t202, t204, t207, t212, t214, t215, i0.i0.u73.t31, i0.i0.u74.t2...826
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (complete) has 649 edges and 319 vertex of which 315 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 314 transition count 234
Reduce places removed 39 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 43 rules applied. Total rules applied 83 place count 275 transition count 230
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 87 place count 271 transition count 230
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 87 place count 271 transition count 170
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 218 place count 200 transition count 170
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 252 place count 166 transition count 136
Iterating global reduction 3 with 34 rules applied. Total rules applied 286 place count 166 transition count 136
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 288 place count 166 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 289 place count 165 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 289 place count 165 transition count 133
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 291 place count 164 transition count 133
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 413 place count 102 transition count 73
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 414 place count 102 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 415 place count 101 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 416 place count 100 transition count 71
Applied a total of 416 rules in 64 ms. Remains 100 /319 variables (removed 219) and now considering 71/275 (removed 204) transitions.
// Phase 1: matrix 71 rows 100 cols
[2024-05-21 23:40:13] [INFO ] Computed 36 invariants in 1 ms
[2024-05-21 23:40:13] [INFO ] Implicit Places using invariants in 104 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 99/319 places, 71/275 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 174 ms. Remains : 99/319 places, 71/275 transitions.
[2024-05-21 23:40:13] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:40:13] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:40:13] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-21 23:40:13] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:40:13] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:40:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality6810117845201649117.gal : 2 ms
[2024-05-21 23:40:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality11156840359303225109.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6810117845201649117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11156840359303225109.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,23552,0.134018,6932,2,2032,5,12636,6,0,467,13253,0


Converting to forward existential form...Done !
original formula: A((p37==1) U (EG(((AG(((p238==0)||(p83==1))) * ((p208==1)||(p151==1))) * AF((p274==1)))) + E((((!(((p375==0)||(p392==1))) + AF(((p286==0)...270
=> equivalent forward existential formula: [((Init * !(EG(!((EG(((!(E(TRUE U !(((p238==0)||(p83==1))))) * ((p208==1)||(p151==1))) * !(EG(!((p274==1)))))) +...949
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t16, t18, t32, t33, t34, t39, t46, t48, t50, t59, t63, Intersection with reachab...227
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.43381,74872,1,0,493,433432,200,253,3210,364284,554
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 40 place count 279 transition count 238
Iterating global reduction 1 with 37 rules applied. Total rules applied 77 place count 279 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 279 transition count 237
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 94 place count 263 transition count 221
Iterating global reduction 2 with 16 rules applied. Total rules applied 110 place count 263 transition count 221
Applied a total of 110 rules in 22 ms. Remains 263 /319 variables (removed 56) and now considering 221/275 (removed 54) transitions.
// Phase 1: matrix 221 rows 263 cols
[2024-05-21 23:40:16] [INFO ] Computed 50 invariants in 2 ms
[2024-05-21 23:40:16] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 23:40:16] [INFO ] Invariant cache hit.
[2024-05-21 23:40:16] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-21 23:40:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:20] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:20] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:40:20] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:40:20] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:40:20] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:40:20] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:20] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:40:21] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:21] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:21] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 15 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/484 variables, 263/344 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 3 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/484 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 351 constraints, problems are : Problem set: 0 solved, 220 unsolved in 15345 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 38/88 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 221/484 variables, 263/353 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 220/573 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 8/581 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 5/588 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 3/591 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/484 variables, and 591 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 58/58 constraints]
After SMT, in 45417ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 45426ms
Starting structural reductions in LTL mode, iteration 1 : 263/319 places, 221/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45819 ms. Remains : 263/319 places, 221/275 transitions.
[2024-05-21 23:41:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:41:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:41:02] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-21 23:41:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:41:02] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:41:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality14456548102918356922.gal : 3 ms
[2024-05-21 23:41:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality14409271592484793088.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14456548102918356922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14409271592484793088.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.49559e+17,15.9219,367416,2,57567,5,720516,6,0,1273,2.47726e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:41:32] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:41:32] [INFO ] Applying decomposition
[2024-05-21 23:41:32] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9379653557313381580.txt' '-o' '/tmp/graph9379653557313381580.bin' '-w' '/tmp/graph9379653557313381580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9379653557313381580.bin' '-l' '-1' '-v' '-w' '/tmp/graph9379653557313381580.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:41:32] [INFO ] Decomposing Gal with order
[2024-05-21 23:41:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:41:32] [INFO ] Removed a total of 85 redundant transitions.
[2024-05-21 23:41:32] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:41:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-05-21 23:41:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality14319051388294949668.gal : 4 ms
[2024-05-21 23:41:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality6239147979018219755.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14319051388294949668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6239147979018219755.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.49559e+17,2.63632,65084,6477,31,88966,330,573,240832,44,729,0


Converting to forward existential form...Done !
original formula: EX(EF((EF(EG(((i18.u68.p263==0)||(i1.u29.p104==1)))) * E(((i12.u42.p155==0)||(i11.i0.u38.p144==1)) U (A(((i19.u71.p265==0)||(i2.u20.p70==...201
=> equivalent forward existential formula: ([((FwdU((FwdU(EY(Init),TRUE) * E(TRUE U EG(((i18.u68.p263==0)||(i1.u29.p104==1))))),((i12.u42.p155==0)||(i11.i0...465
Reverse transition relation is NOT exact ! Due to transitions t109, t160, t193, t197, t200, t204, t206, t207, t208, t211, t216, t218, t219, i0.i0.u34.t112,...855
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 41 place count 278 transition count 237
Iterating global reduction 1 with 38 rules applied. Total rules applied 79 place count 278 transition count 237
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 93 place count 264 transition count 223
Iterating global reduction 1 with 14 rules applied. Total rules applied 107 place count 264 transition count 223
Applied a total of 107 rules in 13 ms. Remains 264 /319 variables (removed 55) and now considering 223/275 (removed 52) transitions.
// Phase 1: matrix 223 rows 264 cols
[2024-05-21 23:42:02] [INFO ] Computed 50 invariants in 3 ms
[2024-05-21 23:42:02] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 23:42:02] [INFO ] Invariant cache hit.
[2024-05-21 23:42:02] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-05-21 23:42:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:42:06] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:42:06] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:42:06] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:42:06] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:42:06] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:42:06] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 23:42:07] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:42:07] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:42:07] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:42:07] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:42:07] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:42:07] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/487 variables, 264/340 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 7/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 0/487 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 347 constraints, problems are : Problem set: 0 solved, 222 unsolved in 13483 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 33/83 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 23:42:17] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/487 variables, 264/348 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 222/570 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 3/573 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 2/575 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (OVERLAPS) 0/487 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 575 constraints, problems are : Problem set: 0 solved, 222 unsolved in 25482 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 39/39 constraints]
After SMT, in 39002ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 39005ms
Starting structural reductions in LTL mode, iteration 1 : 264/319 places, 223/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39327 ms. Remains : 264/319 places, 223/275 transitions.
[2024-05-21 23:42:41] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:42:41] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:42:41] [INFO ] Input system was already deterministic with 223 transitions.
[2024-05-21 23:42:41] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:42:41] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:42:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality17371639755680646296.gal : 1 ms
[2024-05-21 23:42:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality15736954398248788997.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17371639755680646296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15736954398248788997.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.71015e+17,11.6391,294944,2,52655,5,578708,6,0,1279,1.88288e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:43:11] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:43:11] [INFO ] Applying decomposition
[2024-05-21 23:43:11] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4728862684381534235.txt' '-o' '/tmp/graph4728862684381534235.bin' '-w' '/tmp/graph4728862684381534235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4728862684381534235.bin' '-l' '-1' '-v' '-w' '/tmp/graph4728862684381534235.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:43:11] [INFO ] Decomposing Gal with order
[2024-05-21 23:43:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:43:12] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-21 23:43:12] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:43:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-05-21 23:43:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality12258227167323605651.gal : 3 ms
[2024-05-21 23:43:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality14772655133660489800.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12258227167323605651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14772655133660489800.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.71015e+17,1.29041,36596,6296,29,54949,379,566,116239,43,1125,0


Converting to forward existential form...Done !
original formula: E(EX((u80.p315==0)) U !(EF(((AX(((i13.u61.p221==0)||(i18.i1.u76.p292==1))) * ((i0.i1.u38.p138==1) + AX(((i0.i1.u39.p141==0)||(i20.i1.u19....262
=> equivalent forward existential formula: [(FwdU(Init,EX((u80.p315==0))) * !(E(TRUE U ((!(EX(!(((i13.u61.p221==0)||(i18.i1.u76.p292==1))))) * ((i0.i1.u38....326
Reverse transition relation is NOT exact ! Due to transitions t111, t162, t195, t199, t203, t208, t209, t210, t218, t220, t221, u80.t15, u80.t16, i0.i0.u40...863
(forward)formula 0,0,15.8482,423092,1,0,772010,379,3473,1.31139e+06,183,1125,1582134
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (trivial) has 185 edges and 319 vertex of which 7 / 319 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 641 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 308 transition count 211
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 254 transition count 211
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 110 place count 254 transition count 156
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 230 place count 189 transition count 156
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 270 place count 149 transition count 116
Iterating global reduction 2 with 40 rules applied. Total rules applied 310 place count 149 transition count 116
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 310 place count 149 transition count 114
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 315 place count 146 transition count 114
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 445 place count 80 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 446 place count 79 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 447 place count 78 transition count 49
Applied a total of 447 rules in 17 ms. Remains 78 /319 variables (removed 241) and now considering 49/275 (removed 226) transitions.
// Phase 1: matrix 49 rows 78 cols
[2024-05-21 23:43:27] [INFO ] Computed 36 invariants in 1 ms
[2024-05-21 23:43:28] [INFO ] Implicit Places using invariants in 74 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 77/319 places, 49/275 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 95 ms. Remains : 77/319 places, 49/275 transitions.
[2024-05-21 23:43:28] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:43:28] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:43:28] [INFO ] Input system was already deterministic with 49 transitions.
[2024-05-21 23:43:28] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:43:28] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:43:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality8907022183207221130.gal : 1 ms
[2024-05-21 23:43:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality2035590243213630375.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8907022183207221130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2035590243213630375.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,68,0.021409,3896,2,255,5,1650,6,0,354,1484,0


Converting to forward existential form...Done !
original formula: AG(EF(EG((p97!=0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG((p97!=0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t48, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
(forward)formula 0,0,0.059991,5272,1,0,55,6241,122,44,2309,3839,109
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 40 place count 279 transition count 238
Iterating global reduction 1 with 37 rules applied. Total rules applied 77 place count 279 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 279 transition count 237
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 94 place count 263 transition count 221
Iterating global reduction 2 with 16 rules applied. Total rules applied 110 place count 263 transition count 221
Applied a total of 110 rules in 23 ms. Remains 263 /319 variables (removed 56) and now considering 221/275 (removed 54) transitions.
// Phase 1: matrix 221 rows 263 cols
[2024-05-21 23:43:28] [INFO ] Computed 50 invariants in 2 ms
[2024-05-21 23:43:28] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 23:43:28] [INFO ] Invariant cache hit.
[2024-05-21 23:43:28] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-21 23:43:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/484 variables, 263/339 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 7/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/484 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 346 constraints, problems are : Problem set: 0 solved, 220 unsolved in 13204 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 33/83 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/484 variables, 263/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 220/566 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:43:44] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:43:44] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:43:45] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:43:46] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:43:46] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 5/571 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:43:56] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/484 variables, and 574 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 41/41 constraints]
After SMT, in 43247ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 43249ms
Starting structural reductions in LTL mode, iteration 1 : 263/319 places, 221/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43600 ms. Remains : 263/319 places, 221/275 transitions.
[2024-05-21 23:44:11] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:44:11] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:44:11] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-21 23:44:11] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:44:11] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:44:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality7240722138280678295.gal : 2 ms
[2024-05-21 23:44:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality51638677866348146.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7240722138280678295.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality51638677866348146.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22503e+17,11.0289,293688,2,55859,5,582217,6,0,1273,1.91708e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:44:41] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:44:41] [INFO ] Applying decomposition
[2024-05-21 23:44:41] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11218548002187187090.txt' '-o' '/tmp/graph11218548002187187090.bin' '-w' '/tmp/graph11218548002187187090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11218548002187187090.bin' '-l' '-1' '-v' '-w' '/tmp/graph11218548002187187090.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:44:41] [INFO ] Decomposing Gal with order
[2024-05-21 23:44:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:44:41] [INFO ] Removed a total of 85 redundant transitions.
[2024-05-21 23:44:41] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:44:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-21 23:44:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality4514824650069263818.gal : 3 ms
[2024-05-21 23:44:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality5121257039477932530.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4514824650069263818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5121257039477932530.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22503e+17,3.22847,81508,5435,27,110494,332,568,311099,40,813,0


Converting to forward existential form...Done !
original formula: AF(AG((A((i8.i1.u77.p353==1) U EX(((i19.i0.u19.p57==0)||(i6.i1.u73.p273==1)))) * ((AF((i8.i1.u77.p311==1)) + EF((i0.u2.p5==1))) + ((i0.u3...187
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!((E(!(EX(((i19.i0.u19.p57==0)||(i6.i1.u73.p273==1)))) U (!((i8.i1.u77.p353==1)) * !(...377
Reverse transition relation is NOT exact ! Due to transitions t109, t160, t192, t197, t201, t207, t208, t211, t216, t218, t219, i0.u36.t112, i1.i0.u32.t120...863
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 275
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 275 transition count 234
Iterating global reduction 1 with 41 rules applied. Total rules applied 85 place count 275 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 275 transition count 233
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 102 place count 259 transition count 217
Iterating global reduction 2 with 16 rules applied. Total rules applied 118 place count 259 transition count 217
Applied a total of 118 rules in 9 ms. Remains 259 /319 variables (removed 60) and now considering 217/275 (removed 58) transitions.
// Phase 1: matrix 217 rows 259 cols
[2024-05-21 23:45:12] [INFO ] Computed 50 invariants in 4 ms
[2024-05-21 23:45:12] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-21 23:45:12] [INFO ] Invariant cache hit.
[2024-05-21 23:45:12] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-21 23:45:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/476 variables, 259/334 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 8/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 0/476 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 342 constraints, problems are : Problem set: 0 solved, 216 unsolved in 16081 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 33/83 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/476 variables, 259/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 216/558 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 5/563 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-21 23:45:48] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/476 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 565 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 40/40 constraints]
After SMT, in 46130ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 46133ms
Starting structural reductions in LTL mode, iteration 1 : 259/319 places, 217/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46518 ms. Remains : 259/319 places, 217/275 transitions.
[2024-05-21 23:45:58] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:45:58] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:45:58] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-21 23:45:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:45:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:45:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality2992482199022078150.gal : 2 ms
[2024-05-21 23:45:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality1628897984793698489.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2992482199022078150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1628897984793698489.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.17415e+17,9.44997,218624,2,43181,5,453369,6,0,1253,1.41302e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:46:28] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:46:28] [INFO ] Applying decomposition
[2024-05-21 23:46:28] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph213303631921099251.txt' '-o' '/tmp/graph213303631921099251.bin' '-w' '/tmp/graph213303631921099251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph213303631921099251.bin' '-l' '-1' '-v' '-w' '/tmp/graph213303631921099251.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:46:28] [INFO ] Decomposing Gal with order
[2024-05-21 23:46:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:46:28] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-21 23:46:28] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:46:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2024-05-21 23:46:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality15134010811733259440.gal : 4 ms
[2024-05-21 23:46:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality2655871488600973895.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15134010811733259440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2655871488600973895.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.17415e+17,1.53083,42392,4925,24,54644,341,517,150114,38,721,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(EX((i5.i1.u62.p232==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U EX((i5.i1.u62.p232==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t106, t156, t189, t193, t196, t200, t202, t204, t207, t212, t214, t215, i0.i0.u35.t109, i0.i1...816
(forward)formula 0,0,18.2736,567040,1,0,843544,402,3753,1.76867e+06,192,1019,1363244
FORMULA BusinessProcesses-PT-08-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (trivial) has 186 edges and 319 vertex of which 7 / 319 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 641 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 308 transition count 210
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 253 transition count 210
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 112 place count 253 transition count 154
Deduced a syphon composed of 56 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 235 place count 186 transition count 154
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 274 place count 147 transition count 115
Iterating global reduction 2 with 39 rules applied. Total rules applied 313 place count 147 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 313 place count 147 transition count 113
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 318 place count 144 transition count 113
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 448 place count 78 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 449 place count 77 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 450 place count 76 transition count 48
Applied a total of 450 rules in 42 ms. Remains 76 /319 variables (removed 243) and now considering 48/275 (removed 227) transitions.
// Phase 1: matrix 48 rows 76 cols
[2024-05-21 23:46:47] [INFO ] Computed 35 invariants in 1 ms
[2024-05-21 23:46:47] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 23:46:47] [INFO ] Invariant cache hit.
[2024-05-21 23:46:47] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 20, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 197 ms to find 38 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 38/319 places, 48/275 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 38 transition count 42
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 32 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 26 transition count 36
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 26 transition count 36
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 26 transition count 33
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 23 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 23 transition count 32
Applied a total of 31 rules in 5 ms. Remains 23 /38 variables (removed 15) and now considering 32/48 (removed 16) transitions.
// Phase 1: matrix 32 rows 23 cols
[2024-05-21 23:46:47] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 23:46:47] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 23:46:47] [INFO ] Invariant cache hit.
[2024-05-21 23:46:47] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 23/319 places, 32/275 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 315 ms. Remains : 23/319 places, 32/275 transitions.
[2024-05-21 23:46:47] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:46:47] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:46:47] [INFO ] Input system was already deterministic with 32 transitions.
RANDOM walk for 53 steps (17 resets) in 10 ms. (4 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-08-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 23:46:47] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:46:47] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:46:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14537982412174330992.gal : 1 ms
[2024-05-21 23:46:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4692644444984574881.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14537982412174330992.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4692644444984574881.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (trivial) has 187 edges and 319 vertex of which 7 / 319 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 641 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 308 transition count 210
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 253 transition count 210
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 112 place count 253 transition count 154
Deduced a syphon composed of 56 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 235 place count 186 transition count 154
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 275 place count 146 transition count 114
Iterating global reduction 2 with 40 rules applied. Total rules applied 315 place count 146 transition count 114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 315 place count 146 transition count 112
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 320 place count 143 transition count 112
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 446 place count 79 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 447 place count 78 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 448 place count 77 transition count 49
Applied a total of 448 rules in 29 ms. Remains 77 /319 variables (removed 242) and now considering 49/275 (removed 226) transitions.
// Phase 1: matrix 49 rows 77 cols
[2024-05-21 23:46:47] [INFO ] Computed 35 invariants in 1 ms
[2024-05-21 23:46:47] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 23:46:47] [INFO ] Invariant cache hit.
[2024-05-21 23:46:47] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 172 ms to find 32 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 45/319 places, 49/275 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 45 transition count 42
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 38 transition count 42
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 33 transition count 37
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 33 transition count 37
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 33 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 32 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 32 transition count 35
Applied a total of 27 rules in 5 ms. Remains 32 /45 variables (removed 13) and now considering 35/49 (removed 14) transitions.
// Phase 1: matrix 35 rows 32 cols
[2024-05-21 23:46:47] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 23:46:47] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 23:46:47] [INFO ] Invariant cache hit.
[2024-05-21 23:46:47] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 32/319 places, 35/275 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 274 ms. Remains : 32/319 places, 35/275 transitions.
[2024-05-21 23:46:47] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:46:47] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:46:47] [INFO ] Input system was already deterministic with 35 transitions.
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-08-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 23:46:47] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:46:47] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:46:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2596350535591164165.gal : 4 ms
[2024-05-21 23:46:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11693459546444152448.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2596350535591164165.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11693459546444152448.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 275/275 transitions.
Graph (trivial) has 177 edges and 319 vertex of which 7 / 319 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 641 edges and 313 vertex of which 309 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 308 transition count 216
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 259 transition count 216
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 100 place count 259 transition count 159
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 125 rules applied. Total rules applied 225 place count 191 transition count 159
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 260 place count 156 transition count 124
Iterating global reduction 2 with 35 rules applied. Total rules applied 295 place count 156 transition count 124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 295 place count 156 transition count 122
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 300 place count 153 transition count 122
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 428 place count 88 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 429 place count 87 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 430 place count 86 transition count 58
Applied a total of 430 rules in 25 ms. Remains 86 /319 variables (removed 233) and now considering 58/275 (removed 217) transitions.
// Phase 1: matrix 58 rows 86 cols
[2024-05-21 23:46:47] [INFO ] Computed 35 invariants in 1 ms
[2024-05-21 23:46:47] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 23:46:47] [INFO ] Invariant cache hit.
[2024-05-21 23:46:47] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [21, 23, 25, 26, 27, 28, 30, 32, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 156 ms to find 23 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 63/319 places, 58/275 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 63 transition count 53
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 58 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 57 transition count 52
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 18 place count 51 transition count 46
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 51 transition count 46
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 27 place count 51 transition count 43
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 30 place count 48 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 32 place count 47 transition count 42
Applied a total of 32 rules in 5 ms. Remains 47 /63 variables (removed 16) and now considering 42/58 (removed 16) transitions.
// Phase 1: matrix 42 rows 47 cols
[2024-05-21 23:46:47] [INFO ] Computed 15 invariants in 1 ms
[2024-05-21 23:46:48] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 23:46:48] [INFO ] Invariant cache hit.
[2024-05-21 23:46:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 23:46:48] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [2, 3, 4, 5, 6, 10, 14, 15, 16, 17]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 97 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 37/319 places, 42/275 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 37 transition count 41
Applied a total of 1 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 41/42 (removed 1) transitions.
// Phase 1: matrix 41 rows 37 cols
[2024-05-21 23:46:48] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 23:46:48] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 23:46:48] [INFO ] Invariant cache hit.
[2024-05-21 23:46:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:46:48] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 37/319 places, 41/275 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 367 ms. Remains : 37/319 places, 41/275 transitions.
[2024-05-21 23:46:48] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:46:48] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:46:48] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-21 23:46:48] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:46:48] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:46:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality5912271853138054721.gal : 1 ms
[2024-05-21 23:46:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality16685834874409526632.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5912271853138054721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16685834874409526632.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1220,0.023999,3940,2,216,5,1913,6,0,186,2076,0


Converting to forward existential form...Done !
original formula: AF(AG((((p210==0)||(p358==1))||(((p120==0)||(p321==1))&&((p65==0)||(p85==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p210==0)||(p358==1))||(((p120==0)||(p321==1))&&((p65==0)||(p85==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t10, t21, t23, t28, t30, t34, t38, t39, Intersection with reachable at e...220
(forward)formula 0,0,0.138426,8428,1,0,169,25985,109,124,1148,30788,182
FORMULA BusinessProcesses-PT-08-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2024-05-21 23:46:48] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:46:48] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:46:48] [INFO ] Applying decomposition
[2024-05-21 23:46:48] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6394837561202955149.txt' '-o' '/tmp/graph6394837561202955149.bin' '-w' '/tmp/graph6394837561202955149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6394837561202955149.bin' '-l' '-1' '-v' '-w' '/tmp/graph6394837561202955149.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:46:48] [INFO ] Decomposing Gal with order
[2024-05-21 23:46:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:46:48] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-21 23:46:48] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:46:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 23:46:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality17761492696426295312.gal : 4 ms
[2024-05-21 23:46:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality11839078403899834997.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17761492696426295312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11839078403899834997.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.20739e+17,2.36032,66272,7421,52,97840,925,758,225530,65,3819,0


Converting to forward existential form...Done !
original formula: E(EG((AX(EX(TRUE)) + (i2.u21.p58==1))) U ((i8.i1.u79.p239==1) + (EX(AX(AF((i10.u56.p164==1)))) * (((i0.u116.p373==0)||(i8.i2.u80.p244==1)...285
=> equivalent forward existential formula: ([(FwdU(Init,EG((!(EX(!(EX(TRUE)))) + (i2.u21.p58==1)))) * (i8.i1.u79.p239==1))] != FALSE + ([((FwdU(Init,EG((!(...540
Reverse transition relation is NOT exact ! Due to transitions t213, t251, i0.u34.t166, i0.u36.t162, i1.u32.t170, i2.u11.t216, i2.u21.t195, i3.i0.u15.t207, ...1425
ITS-tools command line returned an error code 139
[2024-05-21 23:53:45] [INFO ] Applying decomposition
[2024-05-21 23:53:45] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:53:45] [INFO ] Decomposing Gal with order
[2024-05-21 23:53:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:53:45] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-21 23:53:45] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:53:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 13 ms.
[2024-05-21 23:53:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality3237387526080909609.gal : 6 ms
[2024-05-21 23:53:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality898310931904172449.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3237387526080909609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality898310931904172449.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.20739e+17,278.705,5476504,52903,1528,3.2275e+06,3875,1071,6.59515e+07,429,38175,0


Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
[2024-05-22 00:04:18] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:04:18] [INFO ] Input system was already deterministic with 275 transitions.
[2024-05-22 00:04:18] [INFO ] Transformed 319 places.
[2024-05-22 00:04:18] [INFO ] Transformed 275 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 00:04:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality10548836191592265852.gal : 2 ms
[2024-05-22 00:04:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality12052311123273121895.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10548836191592265852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12052311123273121895.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2692106 ms.

BK_STOP 1716336932869

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-08, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399600505"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-08.tgz
mv BusinessProcesses-PT-08 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;