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-171620399700545.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-13, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399700545
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 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 148K 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-13-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716335383287

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:49:44] [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:49:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:49:45] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-05-21 23:49:45] [INFO ] Transformed 593 places.
[2024-05-21 23:49:45] [INFO ] Transformed 536 transitions.
[2024-05-21 23:49:45] [INFO ] Found NUPN structural information;
[2024-05-21 23:49:45] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 326 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 86 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 66 place count 519 transition count 467
Iterating global reduction 1 with 61 rules applied. Total rules applied 127 place count 519 transition count 467
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 156 place count 490 transition count 438
Iterating global reduction 1 with 29 rules applied. Total rules applied 185 place count 490 transition count 438
Applied a total of 185 rules in 249 ms. Remains 490 /585 variables (removed 95) and now considering 438/528 (removed 90) transitions.
// Phase 1: matrix 438 rows 490 cols
[2024-05-21 23:49:45] [INFO ] Computed 90 invariants in 30 ms
[2024-05-21 23:49:46] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-21 23:49:46] [INFO ] Invariant cache hit.
[2024-05-21 23:49:49] [INFO ] Implicit Places using invariants and state equation in 3222 ms returned []
Implicit Place search using SMT with State Equation took 3777 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2024-05-21 23:49:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/490 variables, 54/84 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-21 23:49:59] [INFO ] Deduced a trap composed of 100 places in 198 ms of which 31 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 3 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 112 places in 185 ms of which 3 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 102 places in 185 ms of which 4 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 115 places in 174 ms of which 3 ms to minimize.
[2024-05-21 23:50:00] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 103 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:50:01] [INFO ] Deduced a trap composed of 114 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 111 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-21 23:50:02] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 116 places in 153 ms of which 4 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:50:03] [INFO ] Deduced a trap composed of 115 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 112 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 111 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 111 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 114 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:50:04] [INFO ] Deduced a trap composed of 108 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-21 23:50:05] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 113 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:50:06] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 4 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 108 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 110 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 118 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:50:07] [INFO ] Deduced a trap composed of 116 places in 127 ms of which 7 ms to minimize.
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 111 places in 186 ms of which 3 ms to minimize.
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 103 places in 167 ms of which 3 ms to minimize.
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 104 places in 173 ms of which 2 ms to minimize.
[2024-05-21 23:50:08] [INFO ] Deduced a trap composed of 101 places in 218 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 110 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 109 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 112 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 91 places in 192 ms of which 3 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 96 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 115 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 109 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 107 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 5 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 107 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 105 places in 90 ms of which 4 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 120 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 2 ms to minimize.
SMT process timed out in 30207ms, After SMT, problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 30253ms
Starting structural reductions in LTL mode, iteration 1 : 490/585 places, 438/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34341 ms. Remains : 490/585 places, 438/528 transitions.
Support contains 86 out of 490 places after structural reductions.
[2024-05-21 23:50:19] [INFO ] Flatten gal took : 83 ms
[2024-05-21 23:50:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BusinessProcesses-PT-13-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:50:20] [INFO ] Flatten gal took : 33 ms
[2024-05-21 23:50:20] [INFO ] Input system was already deterministic with 438 transitions.
Support contains 68 out of 490 places (down from 86) after GAL structural reductions.
RANDOM walk for 40000 steps (283 resets) in 2004 ms. (19 steps per ms) remains 20/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
[2024-05-21 23:50:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 274/306 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 83/389 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 91/480 variables, 36/90 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 431/911 variables, 480/570 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/911 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 11/922 variables, 6/576 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/922 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 6/928 variables, 4/580 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/928 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 0/928 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 928/928 variables, and 580 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2103 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 274/306 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 106 places in 187 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 99 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 100 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 106 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 99 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 101 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 109 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 94 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 112 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 104 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 107 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 100 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 112 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 98 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 83/389 variables, 21/80 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
SMT process timed out in 7220ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 215 edges and 490 vertex of which 7 / 490 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1079 edges and 484 vertex of which 483 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output 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 483 transition count 375
Reduce places removed 54 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 57 rules applied. Total rules applied 113 place count 429 transition count 372
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 426 transition count 372
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 116 place count 426 transition count 293
Deduced a syphon composed of 79 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 169 rules applied. Total rules applied 285 place count 336 transition count 293
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 304 place count 317 transition count 274
Iterating global reduction 3 with 19 rules applied. Total rules applied 323 place count 317 transition count 274
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 323 place count 317 transition count 270
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 332 place count 312 transition count 270
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 542 place count 206 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 544 place count 205 transition count 170
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 546 place count 205 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 548 place count 203 transition count 168
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 549 place count 203 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 550 place count 202 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 551 place count 201 transition count 167
Applied a total of 551 rules in 210 ms. Remains 201 /490 variables (removed 289) and now considering 167/438 (removed 271) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 201/490 places, 167/438 transitions.
RANDOM walk for 40000 steps (1098 resets) in 891 ms. (44 steps per ms) remains 2/20 properties
BEST_FIRST walk for 40003 steps (347 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (450 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
// Phase 1: matrix 167 rows 201 cols
[2024-05-21 23:50:28] [INFO ] Computed 75 invariants in 5 ms
[2024-05-21 23:50:28] [INFO ] State equation strengthened by 5 read => feed constraints.
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) 83/88 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/116 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/120 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 50/170 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/173 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 163/336 variables, 173/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 31/367 variables, 27/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/367 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/368 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/368 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/368 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 281 constraints, problems are : Problem set: 0 solved, 2 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 201/201 constraints, ReadFeed: 5/5 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) 83/88 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/116 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/120 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 50/170 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/173 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 163/336 variables, 173/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 31/367 variables, 27/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 201/201 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 541ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 5 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 167/167 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 201 transition count 160
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 194 transition count 160
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 14 place count 194 transition count 150
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 40 place count 178 transition count 150
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 175 transition count 147
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 175 transition count 147
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 71 place count 162 transition count 135
Applied a total of 71 rules in 45 ms. Remains 162 /201 variables (removed 39) and now considering 135/167 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 162/201 places, 135/167 transitions.
RANDOM walk for 40000 steps (1502 resets) in 666 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (469 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (679 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
Probably explored full state space saw : 17117 states, properties seen :1
Probabilistic random walk after 68909 steps, saw 17117 distinct states, run finished after 219 ms. (steps per millisecond=314 ) properties seen :1
Explored full state space saw : 17117 states, properties seen :0
Exhaustive walk after 68909 steps, saw 17117 distinct states, run finished after 207 ms. (steps per millisecond=332 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2024-05-21 23:50:30] [INFO ] Flatten gal took : 39 ms
[2024-05-21 23:50:30] [INFO ] Flatten gal took : 34 ms
[2024-05-21 23:50:30] [INFO ] Input system was already deterministic with 438 transitions.
Computed a total of 141 stabilizing places and 134 stable transitions
Graph (complete) has 1087 edges and 490 vertex of which 489 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 243 edges and 490 vertex of which 7 / 490 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1080 edges and 484 vertex of which 483 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 482 transition count 364
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 417 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 416 transition count 363
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 134 place count 416 transition count 272
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 333 place count 308 transition count 272
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 360 place count 281 transition count 245
Iterating global reduction 3 with 27 rules applied. Total rules applied 387 place count 281 transition count 245
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 387 place count 281 transition count 241
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 396 place count 276 transition count 241
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 608 place count 169 transition count 136
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 3 with 2 rules applied. Total rules applied 610 place count 168 transition count 135
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 616 place count 168 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 617 place count 167 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 618 place count 166 transition count 134
Applied a total of 618 rules in 127 ms. Remains 166 /490 variables (removed 324) and now considering 134/438 (removed 304) transitions.
// Phase 1: matrix 134 rows 166 cols
[2024-05-21 23:50:30] [INFO ] Computed 69 invariants in 5 ms
[2024-05-21 23:50:30] [INFO ] Implicit Places using invariants in 182 ms returned [6, 25, 26, 51, 52, 53, 54]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 185 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 159/490 places, 134/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 318 ms. Remains : 159/490 places, 134/438 transitions.
[2024-05-21 23:50:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:50:30] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:50:31] [INFO ] Input system was already deterministic with 134 transitions.
[2024-05-21 23:50:31] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:50:31] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:50:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality9766958303270669257.gal : 5 ms
[2024-05-21 23:50:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality3520495193870963586.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/CTLCardinality9766958303270669257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3520495193870963586.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,42964,0.282319,15860,2,4911,5,52516,6,0,767,31277,0


Converting to forward existential form...Done !
original formula: AF(((p293==0) * (!(E(!(AF(((p421==0)||(p172==1)))) U ((p191==0)||(p14==1)))) + EF(((p463==0)&&(p187==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(((p293==0) * (!(E(!(!(EG(!(((p421==0)||(p172==1)))))) U ((p191==0)||(p14==1)))) + E(TRUE U ((p463==...183
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t25, t30, t31, t32, t33, t34, t47, t48, t49, t50, t51, t72, t85, t86, t87, t120, t121...269
(forward)formula 0,1,1.74263,72204,1,0,218,281583,269,115,5826,179027,296
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 459 transition count 407
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 459 transition count 407
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 448 transition count 396
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 448 transition count 396
Applied a total of 84 rules in 19 ms. Remains 448 /490 variables (removed 42) and now considering 396/438 (removed 42) transitions.
// Phase 1: matrix 396 rows 448 cols
[2024-05-21 23:50:32] [INFO ] Computed 90 invariants in 9 ms
[2024-05-21 23:50:33] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-21 23:50:33] [INFO ] Invariant cache hit.
[2024-05-21 23:50:33] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-05-21 23:50:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/448 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 88 places in 1238 ms of which 4 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 109 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 2 ms to minimize.
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 20/110 constraints. Problems are: Problem set: 3 solved, 392 unsolved
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 75 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
Problem TDEAD309 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD336 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 20/130 constraints. Problems are: Problem set: 6 solved, 389 unsolved
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 4 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/150 constraints. Problems are: Problem set: 6 solved, 389 unsolved
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 20/170 constraints. Problems are: Problem set: 23 solved, 372 unsolved
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 4 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 3 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 3 ms to minimize.
Problem TDEAD307 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 20/190 constraints. Problems are: Problem set: 24 solved, 371 unsolved
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 20/210 constraints. Problems are: Problem set: 24 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/844 variables, and 210 constraints, problems are : Problem set: 24 solved, 371 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 24 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 36/36 constraints. Problems are: Problem set: 24 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 24 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/448 variables, 52/88 constraints. Problems are: Problem set: 24 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 2/90 constraints. Problems are: Problem set: 24 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 120/210 constraints. Problems are: Problem set: 24 solved, 371 unsolved
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 2 ms to minimize.
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 20/230 constraints. Problems are: Problem set: 28 solved, 367 unsolved
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 73 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 4 ms to minimize.
[2024-05-21 23:51:14] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:51:14] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:51:14] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:51:14] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:51:15] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:51:15] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
Problem TDEAD298 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD313 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/250 constraints. Problems are: Problem set: 31 solved, 364 unsolved
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 3 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 106 places in 214 ms of which 6 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 106 places in 203 ms of which 5 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 109 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 20/270 constraints. Problems are: Problem set: 31 solved, 364 unsolved
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 84 places in 164 ms of which 4 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 20/290 constraints. Problems are: Problem set: 31 solved, 364 unsolved
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 3 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 80 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:51:29] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 75 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 3 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD344 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 20/310 constraints. Problems are: Problem set: 33 solved, 362 unsolved
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 4 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 3 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 2 ms to minimize.
SMT process timed out in 60251ms, After SMT, problems are : Problem set: 33 solved, 362 unsolved
Search for dead transitions found 33 dead transitions in 60259ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 448/490 places, 363/438 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 446 transition count 363
Applied a total of 2 rules in 9 ms. Remains 446 /448 variables (removed 2) and now considering 363/363 (removed 0) transitions.
// Phase 1: matrix 363 rows 446 cols
[2024-05-21 23:51:33] [INFO ] Computed 94 invariants in 5 ms
[2024-05-21 23:51:34] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-21 23:51:34] [INFO ] Invariant cache hit.
[2024-05-21 23:51:34] [INFO ] Implicit Places using invariants and state equation in 449 ms returned [400]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 686 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 445/490 places, 363/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 445 /445 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61741 ms. Remains : 445/490 places, 363/438 transitions.
[2024-05-21 23:51:34] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:51:34] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:51:34] [INFO ] Input system was already deterministic with 363 transitions.
[2024-05-21 23:51:34] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:51:34] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:51:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality9764625687728999720.gal : 5 ms
[2024-05-21 23:51:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality11871588041417045397.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/CTLCardinality9764625687728999720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11871588041417045397.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.
Detected timeout of ITS tools.
[2024-05-21 23:52:04] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:52:04] [INFO ] Applying decomposition
[2024-05-21 23:52:04] [INFO ] Flatten gal took : 42 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/graph16050916589944889181.txt' '-o' '/tmp/graph16050916589944889181.bin' '-w' '/tmp/graph16050916589944889181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16050916589944889181.bin' '-l' '-1' '-v' '-w' '/tmp/graph16050916589944889181.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:52:05] [INFO ] Decomposing Gal with order
[2024-05-21 23:52:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:52:05] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-21 23:52:05] [INFO ] Flatten gal took : 99 ms
[2024-05-21 23:52:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 17 ms.
[2024-05-21 23:52:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality6519296044367029282.gal : 9 ms
[2024-05-21 23:52:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality9386741754171422675.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/CTLCardinality6519296044367029282.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9386741754171422675.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,1.34315e+25,29.7157,627252,10533,40,814622,599,960,1.32661e+06,65,1249,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 236 edges and 490 vertex of which 7 / 490 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1080 edges and 484 vertex of which 483 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 482 transition count 367
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 420 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 419 transition count 366
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 128 place count 419 transition count 275
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 327 place count 311 transition count 275
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 349 place count 289 transition count 253
Iterating global reduction 3 with 22 rules applied. Total rules applied 371 place count 289 transition count 253
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 371 place count 289 transition count 249
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 380 place count 284 transition count 249
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 590 place count 178 transition count 145
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 3 with 2 rules applied. Total rules applied 592 place count 177 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 593 place count 176 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 594 place count 175 transition count 143
Applied a total of 594 rules in 74 ms. Remains 175 /490 variables (removed 315) and now considering 143/438 (removed 295) transitions.
// Phase 1: matrix 143 rows 175 cols
[2024-05-21 23:52:35] [INFO ] Computed 69 invariants in 4 ms
[2024-05-21 23:52:35] [INFO ] Implicit Places using invariants in 245 ms returned [2, 3, 4, 7, 18, 19, 23, 24, 25, 26, 27, 28, 52, 53, 54, 55, 128]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 246 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 158/490 places, 143/438 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 325 ms. Remains : 158/490 places, 143/438 transitions.
[2024-05-21 23:52:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:52:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:52:35] [INFO ] Input system was already deterministic with 143 transitions.
[2024-05-21 23:52:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:52:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:52:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality15873462839368992492.gal : 1 ms
[2024-05-21 23:52:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality9294520431257982983.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/CTLCardinality15873462839368992492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9294520431257982983.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,538086,0.529578,17220,2,5392,5,53941,6,0,775,48227,0


Converting to forward existential form...Done !
original formula: E(E((((p403==0) + !(A(((p271==0)||(p197==1)) U (p590==1)))) + ((E(((p438==1)||(p324==1)) U (p54==1)) * (p362!=0)) * (p29==0))) U ((p65==0...182
=> equivalent forward existential formula: [(FwdU(Init,E((((p403==0) + !(!((E(!((p590==1)) U (!(((p271==0)||(p197==1))) * !((p590==1)))) + EG(!((p590==1)))...275
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t6, t10, t14, t37, t38, t39, t40, t41, t42, t59, t60, t61, t62, t63, t84, t98, t103, ...285
(forward)formula 0,1,16.5254,420568,1,0,513,2.20478e+06,293,346,5641,2.47276e+06,701
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 459 transition count 407
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 459 transition count 407
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 447 transition count 395
Iterating global reduction 0 with 12 rules applied. Total rules applied 86 place count 447 transition count 395
Applied a total of 86 rules in 44 ms. Remains 447 /490 variables (removed 43) and now considering 395/438 (removed 43) transitions.
// Phase 1: matrix 395 rows 447 cols
[2024-05-21 23:52:52] [INFO ] Computed 90 invariants in 3 ms
[2024-05-21 23:52:53] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-21 23:52:53] [INFO ] Invariant cache hit.
[2024-05-21 23:52:53] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2024-05-21 23:52:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 1/447 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-21 23:53:10] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:53:11] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:53:11] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:53:11] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:53:11] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:53:11] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:53:11] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:53:11] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:53:12] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:53:12] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:53:12] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:53:12] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:53:12] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:53:12] [INFO ] Deduced a trap composed of 82 places in 187 ms of which 2 ms to minimize.
[2024-05-21 23:53:12] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:53:13] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:53:13] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:53:13] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:53:13] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:53:13] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-21 23:53:13] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:53:14] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:53:14] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:53:14] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:53:14] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:53:14] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:53:14] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:53:14] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:53:15] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:53:15] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 4 ms to minimize.
[2024-05-21 23:53:15] [INFO ] Deduced a trap composed of 85 places in 165 ms of which 2 ms to minimize.
[2024-05-21 23:53:15] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:53:15] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 4 ms to minimize.
[2024-05-21 23:53:15] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 5 ms to minimize.
[2024-05-21 23:53:16] [INFO ] Deduced a trap composed of 89 places in 153 ms of which 4 ms to minimize.
[2024-05-21 23:53:16] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:53:16] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:53:16] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 4 ms to minimize.
[2024-05-21 23:53:16] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 4 ms to minimize.
[2024-05-21 23:53:17] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 4 ms to minimize.
Problem TDEAD296 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 20/130 constraints. Problems are: Problem set: 26 solved, 368 unsolved
[2024-05-21 23:53:17] [INFO ] Deduced a trap composed of 78 places in 157 ms of which 5 ms to minimize.
[2024-05-21 23:53:17] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:53:17] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 5 ms to minimize.
[2024-05-21 23:53:18] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:53:18] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 5 ms to minimize.
[2024-05-21 23:53:18] [INFO ] Deduced a trap composed of 88 places in 163 ms of which 6 ms to minimize.
[2024-05-21 23:53:18] [INFO ] Deduced a trap composed of 80 places in 161 ms of which 4 ms to minimize.
[2024-05-21 23:53:18] [INFO ] Deduced a trap composed of 79 places in 186 ms of which 2 ms to minimize.
[2024-05-21 23:53:19] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 4 ms to minimize.
[2024-05-21 23:53:19] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:53:19] [INFO ] Deduced a trap composed of 102 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:53:19] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:53:19] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:53:19] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 3 ms to minimize.
Problem TDEAD298 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 20/150 constraints. Problems are: Problem set: 28 solved, 366 unsolved
[2024-05-21 23:53:23] [INFO ] Deduced a trap composed of 83 places in 181 ms of which 3 ms to minimize.
[2024-05-21 23:53:23] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
SMT process timed out in 30202ms, After SMT, problems are : Problem set: 28 solved, 366 unsolved
Search for dead transitions found 28 dead transitions in 30207ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 447/490 places, 367/438 transitions.
Applied a total of 0 rules in 5 ms. Remains 447 /447 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31315 ms. Remains : 447/490 places, 367/438 transitions.
[2024-05-21 23:53:24] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:53:24] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:53:24] [INFO ] Input system was already deterministic with 367 transitions.
[2024-05-21 23:53:24] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:53:24] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:53:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality9411133268570039984.gal : 4 ms
[2024-05-21 23:53:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality3739897113151961454.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/CTLCardinality9411133268570039984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3739897113151961454.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.
Detected timeout of ITS tools.
[2024-05-21 23:53:54] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:53:54] [INFO ] Applying decomposition
[2024-05-21 23:53:54] [INFO ] Flatten gal took : 21 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/graph12503736828038098754.txt' '-o' '/tmp/graph12503736828038098754.bin' '-w' '/tmp/graph12503736828038098754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12503736828038098754.bin' '-l' '-1' '-v' '-w' '/tmp/graph12503736828038098754.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:53:54] [INFO ] Decomposing Gal with order
[2024-05-21 23:53:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:53:54] [INFO ] Removed a total of 143 redundant transitions.
[2024-05-21 23:53:54] [INFO ] Flatten gal took : 43 ms
[2024-05-21 23:53:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 10 ms.
[2024-05-21 23:53:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality6742423346766766618.gal : 5 ms
[2024-05-21 23:53:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality15559348751404207345.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/CTLCardinality6742423346766766618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15559348751404207345.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,1.43046e+25,21.7919,496924,13470,45,791256,591,969,1.18082e+06,74,1310,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 245 edges and 490 vertex of which 7 / 490 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1080 edges and 484 vertex of which 483 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 483 transition count 364
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 417 transition count 364
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 134 place count 417 transition count 270
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 339 place count 306 transition count 270
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 367 place count 278 transition count 242
Iterating global reduction 2 with 28 rules applied. Total rules applied 395 place count 278 transition count 242
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 395 place count 278 transition count 237
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 407 place count 271 transition count 237
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 623 place count 162 transition count 130
Applied a total of 623 rules in 60 ms. Remains 162 /490 variables (removed 328) and now considering 130/438 (removed 308) transitions.
// Phase 1: matrix 130 rows 162 cols
[2024-05-21 23:54:24] [INFO ] Computed 69 invariants in 2 ms
[2024-05-21 23:54:24] [INFO ] Implicit Places using invariants in 112 ms returned [1, 2, 6, 7, 8, 16, 17, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 114 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 144/490 places, 130/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 180 ms. Remains : 144/490 places, 130/438 transitions.
[2024-05-21 23:54:24] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:54:24] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:54:24] [INFO ] Input system was already deterministic with 130 transitions.
[2024-05-21 23:54:24] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:54:24] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:54:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality1479899622011049674.gal : 2 ms
[2024-05-21 23:54:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality6657646982298013253.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/CTLCardinality1479899622011049674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6657646982298013253.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,19726,0.650293,28008,2,11499,5,107922,6,0,707,54713,0


Converting to forward existential form...Done !
original formula: AG(EF(((p422==0)||(p42==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p422==0)||(p42==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t21, t28, t29, t30, t31, t32, t47, t48, t49, t50, t51, t82, t83, t84, t117, t118, t11...258
(forward)formula 0,1,4.85894,144776,1,0,168,554564,244,86,5440,257362,236
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 459 transition count 407
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 459 transition count 407
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 448 transition count 396
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 448 transition count 396
Applied a total of 84 rules in 33 ms. Remains 448 /490 variables (removed 42) and now considering 396/438 (removed 42) transitions.
// Phase 1: matrix 396 rows 448 cols
[2024-05-21 23:54:29] [INFO ] Computed 90 invariants in 5 ms
[2024-05-21 23:54:29] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 23:54:29] [INFO ] Invariant cache hit.
[2024-05-21 23:54:30] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-05-21 23:54:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/448 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 4 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:54:38] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:54:39] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-21 23:54:40] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:54:41] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 1 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 20/130 constraints. Problems are: Problem set: 9 solved, 386 unsolved
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 1 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
Problem TDEAD302 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/150 constraints. Problems are: Problem set: 25 solved, 370 unsolved
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 88 places in 195 ms of which 5 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 20/170 constraints. Problems are: Problem set: 29 solved, 366 unsolved
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 4 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 4 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:54:53] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:54:53] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:54:53] [INFO ] Deduced a trap composed of 112 places in 189 ms of which 3 ms to minimize.
[2024-05-21 23:54:53] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:54:53] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:54:54] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 3 ms to minimize.
[2024-05-21 23:54:54] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 3 ms to minimize.
[2024-05-21 23:54:54] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:54:54] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 5 ms to minimize.
[2024-05-21 23:54:54] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 6 ms to minimize.
[2024-05-21 23:54:55] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 4 ms to minimize.
[2024-05-21 23:54:55] [INFO ] Deduced a trap composed of 119 places in 161 ms of which 4 ms to minimize.
[2024-05-21 23:54:55] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:54:55] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 3 ms to minimize.
[2024-05-21 23:54:55] [INFO ] Deduced a trap composed of 119 places in 151 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 20/190 constraints. Problems are: Problem set: 29 solved, 366 unsolved
[2024-05-21 23:54:56] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:54:56] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:54:56] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:54:57] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:54:58] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:54:59] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
Problem TDEAD344 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 20/210 constraints. Problems are: Problem set: 30 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/844 variables, and 210 constraints, problems are : Problem set: 30 solved, 365 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 30 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 36/36 constraints. Problems are: Problem set: 30 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 30 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/448 variables, 52/88 constraints. Problems are: Problem set: 30 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 2/90 constraints. Problems are: Problem set: 30 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 120/210 constraints. Problems are: Problem set: 30 solved, 365 unsolved
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 5 ms to minimize.
[2024-05-21 23:55:03] [INFO ] Deduced a trap composed of 85 places in 157 ms of which 4 ms to minimize.
[2024-05-21 23:55:04] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 2 ms to minimize.
[2024-05-21 23:55:04] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 3 ms to minimize.
[2024-05-21 23:55:04] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:55:04] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 4 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 4 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 4 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 5 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:55:06] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 4 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 4 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 77 places in 198 ms of which 5 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 4 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 20/230 constraints. Problems are: Problem set: 30 solved, 365 unsolved
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 100 places in 148 ms of which 5 ms to minimize.
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 4 ms to minimize.
[2024-05-21 23:55:08] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 7 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 84 places in 160 ms of which 4 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:55:09] [INFO ] Deduced a trap composed of 80 places in 170 ms of which 4 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 82 places in 170 ms of which 5 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 82 places in 173 ms of which 4 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 84 places in 180 ms of which 4 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 5 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 4 ms to minimize.
[2024-05-21 23:55:10] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 5 ms to minimize.
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 5 ms to minimize.
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 4 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 88 places in 170 ms of which 3 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/250 constraints. Problems are: Problem set: 30 solved, 365 unsolved
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 4 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 4 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 4 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 4 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 4 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 4 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 5 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 91 places in 163 ms of which 4 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 5 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 84 places in 163 ms of which 3 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 20/270 constraints. Problems are: Problem set: 30 solved, 365 unsolved
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 5 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 120 places in 172 ms of which 4 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 5 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 4 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 4 ms to minimize.
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 4 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 86 places in 161 ms of which 6 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 83 places in 169 ms of which 3 ms to minimize.
Problem TDEAD348 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 20/290 constraints. Problems are: Problem set: 31 solved, 364 unsolved
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 90 places in 209 ms of which 5 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 5 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:55:27] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:55:27] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 5 ms to minimize.
[2024-05-21 23:55:27] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:55:27] [INFO ] Deduced a trap composed of 88 places in 167 ms of which 4 ms to minimize.
[2024-05-21 23:55:28] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:55:28] [INFO ] Deduced a trap composed of 82 places in 170 ms of which 5 ms to minimize.
[2024-05-21 23:55:28] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 5 ms to minimize.
[2024-05-21 23:55:28] [INFO ] Deduced a trap composed of 75 places in 168 ms of which 6 ms to minimize.
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 5 ms to minimize.
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 4 ms to minimize.
Problem TDEAD303 is UNSAT
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 5 ms to minimize.
Problem TDEAD304 is UNSAT
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 5 ms to minimize.
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 20/310 constraints. Problems are: Problem set: 36 solved, 359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/844 variables, and 310 constraints, problems are : Problem set: 36 solved, 359 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 0/395 constraints, Known Traps: 220/220 constraints]
After SMT, in 60168ms problems are : Problem set: 36 solved, 359 unsolved
Search for dead transitions found 36 dead transitions in 60174ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 448/490 places, 360/438 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 445 transition count 360
Applied a total of 3 rules in 9 ms. Remains 445 /448 variables (removed 3) and now considering 360/360 (removed 0) transitions.
// Phase 1: matrix 360 rows 445 cols
[2024-05-21 23:55:30] [INFO ] Computed 96 invariants in 2 ms
[2024-05-21 23:55:30] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-21 23:55:30] [INFO ] Invariant cache hit.
[2024-05-21 23:55:31] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 445/490 places, 360/438 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61517 ms. Remains : 445/490 places, 360/438 transitions.
[2024-05-21 23:55:31] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:55:31] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:55:31] [INFO ] Input system was already deterministic with 360 transitions.
[2024-05-21 23:55:31] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:55:31] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:55:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality15963895985196083281.gal : 2 ms
[2024-05-21 23:55:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality17562553072914835349.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/CTLCardinality15963895985196083281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17562553072914835349.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.
Detected timeout of ITS tools.
[2024-05-21 23:56:01] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:56:01] [INFO ] Applying decomposition
[2024-05-21 23:56:01] [INFO ] Flatten gal took : 19 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/graph13423421596069049515.txt' '-o' '/tmp/graph13423421596069049515.bin' '-w' '/tmp/graph13423421596069049515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13423421596069049515.bin' '-l' '-1' '-v' '-w' '/tmp/graph13423421596069049515.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:56:01] [INFO ] Decomposing Gal with order
[2024-05-21 23:56:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:56:01] [INFO ] Removed a total of 105 redundant transitions.
[2024-05-21 23:56:01] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:56:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-21 23:56:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality7499781879414379717.gal : 5 ms
[2024-05-21 23:56:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality2658637885874759257.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/CTLCardinality7499781879414379717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2658637885874759257.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,1.41029e+25,1.32905,43320,4248,37,67728,454,942,211489,60,1114,0


Converting to forward existential form...Done !
original formula: EX(AG(AX((i16.u130.p482==0))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EX(!((i16.u130.p482==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t160, t254, t263, t333, t335, t343, t344, t350, t354, i0.i0.u72.t163, i0.i0.u76.t154, i0....1208
(forward)formula 0,0,16.8955,367248,1,0,669419,454,6147,1.2463e+06,274,1114,1339985
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 244 edges and 490 vertex of which 7 / 490 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1080 edges and 484 vertex of which 483 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 482 transition count 363
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 416 transition count 363
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 134 place count 416 transition count 271
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 334 place count 308 transition count 271
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 362 place count 280 transition count 243
Iterating global reduction 2 with 28 rules applied. Total rules applied 390 place count 280 transition count 243
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 390 place count 280 transition count 238
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 402 place count 273 transition count 238
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 604 place count 171 transition count 138
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 2 with 2 rules applied. Total rules applied 606 place count 170 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 607 place count 169 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 608 place count 168 transition count 136
Applied a total of 608 rules in 59 ms. Remains 168 /490 variables (removed 322) and now considering 136/438 (removed 302) transitions.
// Phase 1: matrix 136 rows 168 cols
[2024-05-21 23:56:18] [INFO ] Computed 69 invariants in 3 ms
[2024-05-21 23:56:18] [INFO ] Implicit Places using invariants in 141 ms returned [53, 54, 55, 123]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 158 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 164/490 places, 136/438 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 234 ms. Remains : 164/490 places, 136/438 transitions.
[2024-05-21 23:56:18] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:56:18] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:56:18] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-21 23:56:18] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:56:18] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:56:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality5169696703717162866.gal : 2 ms
[2024-05-21 23:56:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality6731108306135154348.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/CTLCardinality5169696703717162866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6731108306135154348.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,31402,0.314672,17548,2,8282,5,53154,6,0,791,44825,0


Converting to forward existential form...Done !
original formula: EF((((EF((p10==1)) * (p253==0)) * ((p96==1)&&(p255==0))) * ((p363==0)||(p33==0))))
=> equivalent forward existential formula: [(FwdU((((FwdU(Init,TRUE) * ((p363==0)||(p33==0))) * ((p96==1)&&(p255==0))) * (p253==0)),TRUE) * (p10==1))] != F...159
(forward)formula 0,0,0.609493,23640,1,0,11,86572,12,3,1600,48873,6
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 462 transition count 410
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 462 transition count 410
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 66 place count 452 transition count 400
Iterating global reduction 0 with 10 rules applied. Total rules applied 76 place count 452 transition count 400
Applied a total of 76 rules in 17 ms. Remains 452 /490 variables (removed 38) and now considering 400/438 (removed 38) transitions.
// Phase 1: matrix 400 rows 452 cols
[2024-05-21 23:56:19] [INFO ] Computed 90 invariants in 7 ms
[2024-05-21 23:56:19] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-21 23:56:19] [INFO ] Invariant cache hit.
[2024-05-21 23:56:20] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
Running 399 sub problems to find dead transitions.
[2024-05-21 23:56:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 1/452 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-21 23:56:27] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:56:28] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 87 places in 167 ms of which 2 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:56:29] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 20/110 constraints. Problems are: Problem set: 21 solved, 378 unsolved
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 89 places in 179 ms of which 3 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 86 places in 170 ms of which 3 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 2 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 78 places in 186 ms of which 2 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 6 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 101 places in 203 ms of which 6 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 93 places in 168 ms of which 2 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 88 places in 167 ms of which 4 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
Problem TDEAD307 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 20/130 constraints. Problems are: Problem set: 24 solved, 375 unsolved
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:56:37] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 3 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD342 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 20/150 constraints. Problems are: Problem set: 30 solved, 369 unsolved
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:56:40] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 95 places in 204 ms of which 5 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 79 places in 223 ms of which 4 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 104 places in 151 ms of which 6 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 4 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 5 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 5 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 20/170 constraints. Problems are: Problem set: 30 solved, 369 unsolved
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 4 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 5 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 4 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 4 ms to minimize.
[2024-05-21 23:56:44] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 4 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 6 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:56:45] [INFO ] Deduced a trap composed of 83 places in 166 ms of which 4 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 5 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 83 places in 168 ms of which 4 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 5 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 4 ms to minimize.
[2024-05-21 23:56:46] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 3 ms to minimize.
Problem TDEAD328 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD337 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 20/190 constraints. Problems are: Problem set: 33 solved, 366 unsolved
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 6 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 4 ms to minimize.
[2024-05-21 23:56:47] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 4 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:56:48] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:56:49] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 6 ms to minimize.
SMT process timed out in 30117ms, After SMT, problems are : Problem set: 33 solved, 366 unsolved
Search for dead transitions found 33 dead transitions in 30122ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 452/490 places, 367/438 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 451 transition count 367
Applied a total of 1 rules in 6 ms. Remains 451 /452 variables (removed 1) and now considering 367/367 (removed 0) transitions.
// Phase 1: matrix 367 rows 451 cols
[2024-05-21 23:56:50] [INFO ] Computed 95 invariants in 6 ms
[2024-05-21 23:56:50] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 23:56:50] [INFO ] Invariant cache hit.
[2024-05-21 23:56:51] [INFO ] Implicit Places using invariants and state equation in 458 ms returned [404, 405]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 664 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 449/490 places, 367/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 449 /449 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31707 ms. Remains : 449/490 places, 367/438 transitions.
[2024-05-21 23:56:51] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:56:51] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:56:51] [INFO ] Input system was already deterministic with 367 transitions.
[2024-05-21 23:56:51] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:56:51] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:56:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality1172037935184842367.gal : 5 ms
[2024-05-21 23:56:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality2384244206090835300.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/CTLCardinality1172037935184842367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2384244206090835300.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.
Detected timeout of ITS tools.
[2024-05-21 23:57:21] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:57:21] [INFO ] Applying decomposition
[2024-05-21 23:57:21] [INFO ] Flatten gal took : 7 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/graph13676745562124297590.txt' '-o' '/tmp/graph13676745562124297590.bin' '-w' '/tmp/graph13676745562124297590.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13676745562124297590.bin' '-l' '-1' '-v' '-w' '/tmp/graph13676745562124297590.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:57:21] [INFO ] Decomposing Gal with order
[2024-05-21 23:57:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:57:21] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-21 23:57:21] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:57:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-21 23:57:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality17699876619716774902.gal : 4 ms
[2024-05-21 23:57:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality16909135425450325821.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/CTLCardinality17699876619716774902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16909135425450325821.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,1.42522e+25,1.57999,56608,3226,35,85771,520,1001,176458,56,1294,0


Converting to forward existential form...Done !
original formula: E((EX(AG((i14.u94.p293==0))) * (i0.i1.u67.p208==0)) U AX(((!(AG(((i12.u68.p210==0)&&(i18.u123.p525==0)))) * !(((((i10.i1.u79.p247==0)||(i...299
=> equivalent forward existential formula: [(FwdU(Init,(EX(!(E(TRUE U !((i14.u94.p293==0))))) * (i0.i1.u67.p208==0))) * !(EX(!(((!(!(E(TRUE U !(((i12.u68.p...381
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t164, t236, t258, t340, t341, t342, t350, t357, t362, i0.t168, i0.i0.u70.t171, i0.i1...1275
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
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
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,0,15.6815,367864,1,0,653544,520,6875,1.60232e+06,284,1294,1049783
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-10 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 : 490/490 places, 438/438 transitions.
Graph (trivial) has 242 edges and 490 vertex of which 7 / 490 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1080 edges and 484 vertex of which 483 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 482 transition count 365
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 418 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 417 transition count 364
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 132 place count 417 transition count 272
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 201 rules applied. Total rules applied 333 place count 308 transition count 272
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 360 place count 281 transition count 245
Iterating global reduction 3 with 27 rules applied. Total rules applied 387 place count 281 transition count 245
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 387 place count 281 transition count 240
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 399 place count 274 transition count 240
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 611 place count 167 transition count 135
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 3 with 2 rules applied. Total rules applied 613 place count 166 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 614 place count 165 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 615 place count 164 transition count 133
Applied a total of 615 rules in 30 ms. Remains 164 /490 variables (removed 326) and now considering 133/438 (removed 305) transitions.
// Phase 1: matrix 133 rows 164 cols
[2024-05-21 23:57:37] [INFO ] Computed 68 invariants in 1 ms
[2024-05-21 23:57:37] [INFO ] Implicit Places using invariants in 87 ms returned [0, 1, 2, 3, 4, 5, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 88 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 146/490 places, 133/438 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 121 ms. Remains : 146/490 places, 133/438 transitions.
[2024-05-21 23:57:37] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:57:37] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:57:37] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-21 23:57:37] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:57:37] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:57:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality15248594526655772936.gal : 1 ms
[2024-05-21 23:57:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality17294747398345525113.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/CTLCardinality15248594526655772936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17294747398345525113.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,57000,0.65334,20660,2,8339,5,76076,6,0,717,41523,0


Converting to forward existential form...Done !
original formula: EF((EG((AF(((p362==0)&&(p548==1))) * EG((p415==1)))) * (p486==0)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (p486==0)),(!(EG(!(((p362==0)&&(p548==1))))) * EG((p415==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t30, t31, t32, t33, t34, t35, t50, t51, t52, t53, t54, t86, t92, t93, t94, t106, t112...275
(forward)formula 0,0,7.04394,205448,1,0,362,1.15713e+06,262,186,5381,740365,458
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 236 edges and 490 vertex of which 7 / 490 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1080 edges and 484 vertex of which 483 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 482 transition count 367
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 420 transition count 367
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 126 place count 420 transition count 278
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 316 place count 319 transition count 278
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 343 place count 292 transition count 251
Iterating global reduction 2 with 27 rules applied. Total rules applied 370 place count 292 transition count 251
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 370 place count 292 transition count 247
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 380 place count 286 transition count 247
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 596 place count 177 transition count 140
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 2 with 2 rules applied. Total rules applied 598 place count 176 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 599 place count 175 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 600 place count 174 transition count 138
Applied a total of 600 rules in 36 ms. Remains 174 /490 variables (removed 316) and now considering 138/438 (removed 300) transitions.
// Phase 1: matrix 138 rows 174 cols
[2024-05-21 23:57:44] [INFO ] Computed 73 invariants in 3 ms
[2024-05-21 23:57:44] [INFO ] Implicit Places using invariants in 183 ms returned [0, 1, 2, 3, 4, 17, 18, 25, 26, 27, 31, 32, 35, 58, 59, 60, 61, 62, 133, 135, 138, 140]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 184 ms to find 22 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 152/490 places, 138/438 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 224 ms. Remains : 152/490 places, 138/438 transitions.
[2024-05-21 23:57:44] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:57:44] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:57:44] [INFO ] Input system was already deterministic with 138 transitions.
[2024-05-21 23:57:44] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:57:44] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:57:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality17004647492765587229.gal : 6 ms
[2024-05-21 23:57:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality8217315438439529235.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/CTLCardinality17004647492765587229.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8217315438439529235.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,34992,0.67008,26324,2,8824,5,106527,6,0,744,54563,0


Converting to forward existential form...Done !
original formula: AF((EF((((p68==0)&&(p358==1))&&(p63==0))) * (AF(EG(((p146==0)||(p554==1)))) + !(E(EF((p386==1)) U ((p135==0)||(p107==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (((p68==0)&&(p358==1))&&(p63==0))) * (!(EG(!(EG(((p146==0)||(p554==1)))))) + !(E(E(TRUE U...206
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t11, t40, t44, t46, t47, t48, t49, t64, t65, t66, t67, t68, t98, t99, t100, t130, t13...264
Using saturation style SCC detection
(forward)formula 0,1,10.1515,276340,1,0,332,1.61623e+06,282,184,5557,895178,440
FORMULA BusinessProcesses-PT-13-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 245 edges and 490 vertex of which 7 / 490 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1080 edges and 484 vertex of which 483 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 482 transition count 364
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 417 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 416 transition count 363
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 134 place count 416 transition count 270
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 336 place count 307 transition count 270
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 366 place count 277 transition count 240
Iterating global reduction 3 with 30 rules applied. Total rules applied 396 place count 277 transition count 240
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 396 place count 277 transition count 235
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 408 place count 270 transition count 235
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 616 place count 165 transition count 132
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 3 with 2 rules applied. Total rules applied 618 place count 164 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 619 place count 163 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 620 place count 162 transition count 130
Applied a total of 620 rules in 27 ms. Remains 162 /490 variables (removed 328) and now considering 130/438 (removed 308) transitions.
// Phase 1: matrix 130 rows 162 cols
[2024-05-21 23:57:54] [INFO ] Computed 69 invariants in 2 ms
[2024-05-21 23:57:54] [INFO ] Implicit Places using invariants in 156 ms returned [0, 1, 2, 3, 4, 5, 14, 15, 21, 22, 23, 24, 25, 26, 49, 50, 51, 123]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 157 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 144/490 places, 130/438 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 188 ms. Remains : 144/490 places, 130/438 transitions.
[2024-05-21 23:57:54] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:57:54] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:57:54] [INFO ] Input system was already deterministic with 130 transitions.
[2024-05-21 23:57:54] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:57:54] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:57:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality1723973996632051947.gal : 1 ms
[2024-05-21 23:57:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality3670662728049232237.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/CTLCardinality1723973996632051947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3670662728049232237.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,49530,0.498226,19920,2,4950,5,77451,6,0,705,37241,0


Converting to forward existential form...Done !
original formula: EF(((EG((p575==0)) * (p223==1)) * ((p106==0)||(p75==1))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * ((p106==0)||(p75==1))) * (p223==1)),(p575==0))] != FALSE
Hit Full ! (commute/partial/dont) 125/0/5
(forward)formula 0,1,1.52112,43044,1,0,15,176473,21,6,4053,60891,10
FORMULA BusinessProcesses-PT-13-CTLCardinality-2023-13 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 : 490/490 places, 438/438 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 459 transition count 407
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 459 transition count 407
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 447 transition count 395
Iterating global reduction 0 with 12 rules applied. Total rules applied 86 place count 447 transition count 395
Applied a total of 86 rules in 16 ms. Remains 447 /490 variables (removed 43) and now considering 395/438 (removed 43) transitions.
// Phase 1: matrix 395 rows 447 cols
[2024-05-21 23:57:56] [INFO ] Computed 90 invariants in 20 ms
[2024-05-21 23:57:56] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-21 23:57:56] [INFO ] Invariant cache hit.
[2024-05-21 23:57:57] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2024-05-21 23:57:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 1/447 variables, 53/89 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:58:04] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 4 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 4 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:58:05] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:58:06] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 1 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 3 ms to minimize.
Problem TDEAD301 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 20/110 constraints. Problems are: Problem set: 16 solved, 378 unsolved
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:58:07] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 84 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:58:08] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:58:09] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 20/130 constraints. Problems are: Problem set: 24 solved, 370 unsolved
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:58:10] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:58:11] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:58:12] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 20/150 constraints. Problems are: Problem set: 24 solved, 370 unsolved
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:58:17] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 20/170 constraints. Problems are: Problem set: 24 solved, 370 unsolved
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:58:18] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 15 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:58:20] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 3 ms to minimize.
Problem TDEAD310 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 20/190 constraints. Problems are: Problem set: 33 solved, 361 unsolved
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:58:21] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:58:23] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:58:23] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:58:23] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:58:23] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:58:23] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:58:23] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:58:23] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:58:24] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 5 ms to minimize.
[2024-05-21 23:58:24] [INFO ] Deduced a trap composed of 82 places in 208 ms of which 7 ms to minimize.
[2024-05-21 23:58:24] [INFO ] Deduced a trap composed of 78 places in 196 ms of which 5 ms to minimize.
[2024-05-21 23:58:24] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/210 constraints. Problems are: Problem set: 33 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/842 variables, and 210 constraints, problems are : Problem set: 33 solved, 361 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 33 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 36/36 constraints. Problems are: Problem set: 33 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/36 constraints. Problems are: Problem set: 33 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/447 variables, 53/89 constraints. Problems are: Problem set: 33 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 1/90 constraints. Problems are: Problem set: 33 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 120/210 constraints. Problems are: Problem set: 33 solved, 361 unsolved
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 83 places in 172 ms of which 4 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 2 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 81 places in 192 ms of which 4 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 4 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 80 places in 158 ms of which 5 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 5 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 99 places in 167 ms of which 3 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 99 places in 162 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 20/230 constraints. Problems are: Problem set: 33 solved, 361 unsolved
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:58:34] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:58:34] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:58:34] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:58:34] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:58:34] [INFO ] Deduced a trap composed of 80 places in 171 ms of which 2 ms to minimize.
[2024-05-21 23:58:34] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:58:34] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:58:35] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:58:35] [INFO ] Deduced a trap composed of 80 places in 153 ms of which 4 ms to minimize.
[2024-05-21 23:58:35] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 4 ms to minimize.
[2024-05-21 23:58:35] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:58:35] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 3 ms to minimize.
[2024-05-21 23:58:35] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:58:36] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:58:36] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:58:36] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:58:36] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:58:36] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
Problem TDEAD306 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 20/250 constraints. Problems are: Problem set: 34 solved, 360 unsolved
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 85 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 79 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 76 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:58:39] [INFO ] Deduced a trap composed of 72 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:58:39] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:58:39] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:58:39] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:58:39] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:58:40] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:58:40] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:58:40] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:58:40] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 20/270 constraints. Problems are: Problem set: 34 solved, 360 unsolved
[2024-05-21 23:58:41] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:58:41] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:58:41] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:58:41] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:58:43] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:58:43] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:58:43] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:58:43] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:58:43] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:58:43] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:58:43] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 20/290 constraints. Problems are: Problem set: 34 solved, 360 unsolved
[2024-05-21 23:58:44] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:58:44] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:58:44] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:58:45] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 2 ms to minimize.
[2024-05-21 23:58:45] [INFO ] Deduced a trap composed of 80 places in 196 ms of which 2 ms to minimize.
[2024-05-21 23:58:45] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 1 ms to minimize.
[2024-05-21 23:58:45] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:58:45] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:58:46] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:58:46] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 1 ms to minimize.
[2024-05-21 23:58:46] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:58:46] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:58:46] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:58:47] [INFO ] Deduced a trap composed of 128 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:58:48] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:58:48] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:58:48] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:58:48] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:58:48] [INFO ] Deduced a trap composed of 72 places in 168 ms of which 3 ms to minimize.
[2024-05-21 23:58:48] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/310 constraints. Problems are: Problem set: 34 solved, 360 unsolved
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:58:51] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:58:52] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:58:53] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
Problem TDEAD296 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 20/330 constraints. Problems are: Problem set: 35 solved, 359 unsolved
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 2 ms to minimize.
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:58:55] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:58:55] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:58:55] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:58:55] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:58:55] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:58:55] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:58:55] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:58:55] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:58:55] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:58:56] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:58:56] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:58:56] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:58:56] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:58:56] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:58:56] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:58:56] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 20/350 constraints. Problems are: Problem set: 35 solved, 359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/842 variables, and 350 constraints, problems are : Problem set: 35 solved, 359 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 0/394 constraints, Known Traps: 260/260 constraints]
After SMT, in 60147ms problems are : Problem set: 35 solved, 359 unsolved
Search for dead transitions found 35 dead transitions in 60156ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in LTL mode, iteration 1 : 447/490 places, 360/438 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 445 transition count 360
Applied a total of 2 rules in 11 ms. Remains 445 /447 variables (removed 2) and now considering 360/360 (removed 0) transitions.
// Phase 1: matrix 360 rows 445 cols
[2024-05-21 23:58:57] [INFO ] Computed 96 invariants in 4 ms
[2024-05-21 23:58:57] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-21 23:58:57] [INFO ] Invariant cache hit.
[2024-05-21 23:58:58] [INFO ] Implicit Places using invariants and state equation in 641 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 895 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 444/490 places, 360/438 transitions.
Applied a total of 0 rules in 5 ms. Remains 444 /444 variables (removed 0) and now considering 360/360 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61767 ms. Remains : 444/490 places, 360/438 transitions.
[2024-05-21 23:58:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:58:58] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:58:58] [INFO ] Input system was already deterministic with 360 transitions.
[2024-05-21 23:58:58] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:58:58] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:58:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality6087466618647539606.gal : 2 ms
[2024-05-21 23:58:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality9858900829214670553.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/CTLCardinality6087466618647539606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9858900829214670553.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.
Detected timeout of ITS tools.
[2024-05-21 23:59:28] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:59:28] [INFO ] Applying decomposition
[2024-05-21 23:59:28] [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/graph9390523769862924848.txt' '-o' '/tmp/graph9390523769862924848.bin' '-w' '/tmp/graph9390523769862924848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9390523769862924848.bin' '-l' '-1' '-v' '-w' '/tmp/graph9390523769862924848.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:59:28] [INFO ] Decomposing Gal with order
[2024-05-21 23:59:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:59:28] [INFO ] Removed a total of 109 redundant transitions.
[2024-05-21 23:59:28] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:59:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 9 ms.
[2024-05-21 23:59:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality1221237255432661811.gal : 7 ms
[2024-05-21 23:59:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality9334049925598795729.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/CTLCardinality1221237255432661811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9334049925598795729.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,1.34315e+25,4.91503,138328,13597,37,265962,550,901,506139,62,1239,0


Converting to forward existential form...Done !
original formula: EF(EX((EF((i9.i1.u104.p342==0)) * (EG((i18.u155.p585==1)) + A((((i6.i0.u124.p450==0)||(i19.i2.u61.p161==1))&&(i16.i0.u131.p496==0)) U (i1...177
=> equivalent forward existential formula: ([FwdG((EY(FwdU(Init,TRUE)) * E(TRUE U (i9.i1.u104.p342==0))),(i18.u155.p585==1))] != FALSE + [(((EY(FwdU(Init,T...375
Reverse transition relation is NOT exact ! Due to transitions t7, t163, t231, t253, t262, t335, t342, t344, t355, i0.t159, i0.u66.t174, i0.u72.t162, i1.u46...1227
Detected timeout of ITS tools.
[2024-05-21 23:59:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:59:58] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:59:58] [INFO ] Applying decomposition
[2024-05-21 23:59:58] [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/graph7630289473753915603.txt' '-o' '/tmp/graph7630289473753915603.bin' '-w' '/tmp/graph7630289473753915603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7630289473753915603.bin' '-l' '-1' '-v' '-w' '/tmp/graph7630289473753915603.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:59:58] [INFO ] Decomposing Gal with order
[2024-05-21 23:59:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:59:58] [INFO ] Removed a total of 270 redundant transitions.
[2024-05-21 23:59:58] [INFO ] Flatten gal took : 44 ms
[2024-05-21 23:59:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:59:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality2942363695301981209.gal : 18 ms
[2024-05-21 23:59:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality16741206615861463582.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/CTLCardinality2942363695301981209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16741206615861463582.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 3 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,1.86508e+25,26.5585,633556,33958,48,1.04588e+06,571,1196,2.29448e+06,69,1848,0


Converting to forward existential form...Done !
original formula: (EG(AF(AG(E(((i13.i0.u43.p115==0)||(i4.u40.p106==1)) U ((i16.u145.p463==0)||(i14.i1.u64.p177==1)))))) * AF(EG(A(EX((i5.u109.p329==1)) U A...181
=> equivalent forward existential formula: ([(Init * !(EG(!(EG(!(!(E(TRUE U !(E(((i13.i0.u43.p115==0)||(i4.u40.p106==1)) U ((i16.u145.p463==0)||(i14.i1.u64...377
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t10, t190, t291, t297, i0.i0.u133.t89, i0.i1.u79.t193, i0.i1.u83.t184, i0.i2.u81.t187...1629
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
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 7
Fast SCC detection found an SCC at level 8
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
Fast SCC detection found an SCC at level 17
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 7
Fast SCC detection found an SCC at level 8
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
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
[2024-05-22 00:23:23] [INFO ] Applying decomposition
[2024-05-22 00:23:23] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:23:23] [INFO ] Decomposing Gal with order
[2024-05-22 00:23:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:23:23] [INFO ] Removed a total of 131 redundant transitions.
[2024-05-22 00:23:23] [INFO ] Flatten gal took : 36 ms
[2024-05-22 00:23:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 46 ms.
[2024-05-22 00:23:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality5652852509360111919.gal : 8 ms
[2024-05-22 00:23:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality4573616530987187337.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/CTLCardinality5652852509360111919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4573616530987187337.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 3 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 00:29:35] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:29:35] [INFO ] Input system was already deterministic with 438 transitions.
[2024-05-22 00:29:35] [INFO ] Transformed 490 places.
[2024-05-22 00:29:35] [INFO ] Transformed 438 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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:30:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality8543919242637191410.gal : 2 ms
[2024-05-22 00:30:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality13376827881824037335.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/CTLCardinality8543919242637191410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13376827881824037335.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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3083338 ms.

BK_STOP 1716338468344

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-13"
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-13, 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-171620399700545"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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