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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 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 177K 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-18-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716337053306

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 00:17:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:17:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:17:34] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-22 00:17:34] [INFO ] Transformed 717 places.
[2024-05-22 00:17:34] [INFO ] Transformed 642 transitions.
[2024-05-22 00:17:34] [INFO ] Found NUPN structural information;
[2024-05-22 00:17:34] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 15 transitions.
Support contains 98 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 96 place count 606 transition count 539
Iterating global reduction 1 with 88 rules applied. Total rules applied 184 place count 606 transition count 539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 185 place count 606 transition count 538
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 222 place count 569 transition count 501
Iterating global reduction 2 with 37 rules applied. Total rules applied 259 place count 569 transition count 501
Applied a total of 259 rules in 140 ms. Remains 569 /702 variables (removed 133) and now considering 501/627 (removed 126) transitions.
// Phase 1: matrix 501 rows 569 cols
[2024-05-22 00:17:35] [INFO ] Computed 106 invariants in 35 ms
[2024-05-22 00:17:35] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-22 00:17:35] [INFO ] Invariant cache hit.
[2024-05-22 00:17:36] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-22 00:17:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/569 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 95 places in 195 ms of which 26 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 119 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 118 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 144 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 112 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 109 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 141 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 116 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 115 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 114 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 113 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 113 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 114 places in 106 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 111 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 136 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 119 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 136 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 138 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 111 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 115 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 6 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 119 places in 158 ms of which 4 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 91 places in 183 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 92 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 120 places in 157 ms of which 4 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 91 places in 177 ms of which 4 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 100 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 99 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 4 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 105 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 109 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 119 places in 152 ms of which 4 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 4 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 118 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 6 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 97 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 91 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 124 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 6 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 98 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 4 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 93 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 146 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 120 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 140 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 113 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 144 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 97 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 122 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 141 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 94 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 115 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 116 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:18:06] [INFO ] Deduced a trap composed of 112 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:18:06] [INFO ] Deduced a trap composed of 115 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:18:06] [INFO ] Deduced a trap composed of 140 places in 164 ms of which 3 ms to minimize.
SMT process timed out in 30218ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 30237ms
Starting structural reductions in LTL mode, iteration 1 : 569/702 places, 501/627 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31569 ms. Remains : 569/702 places, 501/627 transitions.
Support contains 98 out of 569 places after structural reductions.
[2024-05-22 00:18:06] [INFO ] Flatten gal took : 82 ms
[2024-05-22 00:18:06] [INFO ] Flatten gal took : 39 ms
[2024-05-22 00:18:07] [INFO ] Input system was already deterministic with 501 transitions.
Support contains 89 out of 569 places (down from 98) after GAL structural reductions.
RANDOM walk for 40000 steps (209 resets) in 2096 ms. (19 steps per ms) remains 27/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
[2024-05-22 00:18:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 318/366 variables, 46/46 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-22 00:18:08] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:18:08] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:18:08] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:18:08] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:18:08] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:18:08] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:18:08] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:18:08] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 8/54 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-22 00:18:09] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:18:09] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 2/56 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-22 00:18:09] [INFO ] Deduced a trap composed of 99 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:18:09] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:18:09] [INFO ] Deduced a trap composed of 106 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:18:09] [INFO ] Deduced a trap composed of 107 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:18:09] [INFO ] Deduced a trap composed of 117 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:18:10] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:18:10] [INFO ] Deduced a trap composed of 102 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:18:10] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:18:10] [INFO ] Deduced a trap composed of 99 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:18:10] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:18:10] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:18:10] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:18:10] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:18:10] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:18:11] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:18:11] [INFO ] Deduced a trap composed of 99 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:18:11] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:18:11] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:18:11] [INFO ] Deduced a trap composed of 109 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:18:11] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 20/76 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-22 00:18:11] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:18:11] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:18:12] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:18:12] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 4 ms to minimize.
[2024-05-22 00:18:12] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:18:12] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:18:12] [INFO ] Deduced a trap composed of 102 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:18:12] [INFO ] Deduced a trap composed of 114 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:18:12] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:18:12] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:18:12] [INFO ] Deduced a trap composed of 100 places in 87 ms of which 2 ms to minimize.
SMT process timed out in 5028ms, After SMT, problems are : Problem set: 2 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (complete) has 1251 edges and 569 vertex of which 568 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 568 transition count 441
Reduce places removed 59 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 62 rules applied. Total rules applied 122 place count 509 transition count 438
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 506 transition count 438
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 125 place count 506 transition count 333
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 353 place count 383 transition count 333
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 362 place count 374 transition count 324
Iterating global reduction 3 with 9 rules applied. Total rules applied 371 place count 374 transition count 324
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 372 place count 373 transition count 323
Iterating global reduction 3 with 1 rules applied. Total rules applied 373 place count 373 transition count 323
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 271 rules applied. Total rules applied 644 place count 237 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 645 place count 237 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 647 place count 236 transition count 190
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 653 place count 236 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 654 place count 235 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 655 place count 234 transition count 189
Applied a total of 655 rules in 155 ms. Remains 234 /569 variables (removed 335) and now considering 189/501 (removed 312) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 234/569 places, 189/501 transitions.
RANDOM walk for 40000 steps (2062 resets) in 1705 ms. (23 steps per ms) remains 13/25 properties
BEST_FIRST walk for 40003 steps (489 resets) in 201 ms. (198 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (481 resets) in 187 ms. (212 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (477 resets) in 167 ms. (238 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (450 resets) in 172 ms. (231 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (469 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (481 resets) in 174 ms. (228 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (484 resets) in 162 ms. (245 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40003 steps (480 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (507 resets) in 185 ms. (215 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (488 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
// Phase 1: matrix 189 rows 234 cols
[2024-05-22 00:18:14] [INFO ] Computed 86 invariants in 7 ms
[2024-05-22 00:18:14] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 77/97 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 00:18:14] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 24/121 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 44/165 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 00:18:14] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:18:14] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:18:14] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:18:15] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:18:15] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:18:15] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:18:15] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:18:15] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:18:15] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:18:15] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:18:15] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:18:15] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
Problem AtomicPropp44 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 12/67 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-22 00:18:15] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 3 ms to minimize.
[2024-05-22 00:18:15] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 2/69 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/167 variables, 2/71 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 186/353 variables, 167/238 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 4/242 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 0/242 constraints. Problems are: Problem set: 1 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 70/423 variables, 67/309 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 30/339 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 339 constraints, problems are : Problem set: 1 solved, 7 unsolved in 1971 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 234/234 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 77/96 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 24/120 variables, 20/35 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 45/165 variables, 20/55 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 14/69 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 2/167 variables, 2/71 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 186/353 variables, 167/238 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 4/242 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 5/247 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-22 00:18:16] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:18:16] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:18:16] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:18:17] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 4/251 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 70/423 variables, 67/318 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 30/348 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 2/350 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-22 00:18:17] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem AtomicPropp17 is UNSAT
[2024-05-22 00:18:17] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:18:17] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/423 variables, 3/353 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/423 variables, 0/353 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/423 variables, 0/353 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 353 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1352 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 234/234 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 22/22 constraints]
After SMT, in 3365ms problems are : Problem set: 2 solved, 6 unsolved
Finished Parikh walk after 65 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=32 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 352 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-22 00:18:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 00:18:18] [INFO ] Flatten gal took : 33 ms
FORMULA BusinessProcesses-PT-18-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:18:18] [INFO ] Flatten gal took : 29 ms
[2024-05-22 00:18:18] [INFO ] Input system was already deterministic with 501 transitions.
Support contains 64 out of 569 places (down from 78) after GAL structural reductions.
Computed a total of 512 stabilizing places and 454 stable transitions
Graph (complete) has 1251 edges and 569 vertex of which 568 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 543 transition count 475
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 543 transition count 475
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 533 transition count 465
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 64 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
// Phase 1: matrix 463 rows 531 cols
[2024-05-22 00:18:18] [INFO ] Computed 106 invariants in 10 ms
[2024-05-22 00:18:18] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 00:18:18] [INFO ] Invariant cache hit.
[2024-05-22 00:18:19] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-05-22 00:18:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:18:25] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:18:25] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:18:25] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:18:25] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:18:25] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:18:25] [INFO ] Deduced a trap composed of 125 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:18:25] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:18:26] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:18:26] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:18:26] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:18:26] [INFO ] Deduced a trap composed of 72 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:18:26] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:18:26] [INFO ] Deduced a trap composed of 117 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:18:26] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:18:27] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:18:30] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:18:30] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:18:31] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:18:31] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:18:31] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 4 ms to minimize.
[2024-05-22 00:18:31] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:18:31] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:18:31] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:18:31] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:18:32] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:18:32] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:18:32] [INFO ] Deduced a trap composed of 98 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:18:32] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:18:32] [INFO ] Deduced a trap composed of 90 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:18:32] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:18:33] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:18:33] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:18:33] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:18:33] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:18:33] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 3 ms to minimize.
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/146 constraints. Problems are: Problem set: 14 solved, 448 unsolved
[2024-05-22 00:18:33] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 116 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 121 places in 183 ms of which 2 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 123 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:18:34] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:18:35] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 2 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 119 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:18:36] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:18:37] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/166 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:18:37] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:18:37] [INFO ] Deduced a trap composed of 92 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:18:37] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:18:38] [INFO ] Deduced a trap composed of 88 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:18:38] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:18:38] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:18:38] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:18:38] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:18:38] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:18:39] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 4 ms to minimize.
[2024-05-22 00:18:39] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:18:39] [INFO ] Deduced a trap composed of 127 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:18:39] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:18:39] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:18:39] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:18:39] [INFO ] Deduced a trap composed of 121 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:18:40] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:18:40] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:18:40] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:18:40] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/186 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:18:43] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:18:43] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:18:43] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:18:43] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:18:44] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:18:44] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:18:44] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:18:44] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:18:44] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:18:44] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:18:44] [INFO ] Deduced a trap composed of 120 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:18:44] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:18:45] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:18:45] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:18:45] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:18:45] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:18:45] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:18:45] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:18:45] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:18:45] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/206 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:18:46] [INFO ] Deduced a trap composed of 126 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:18:46] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:18:46] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:18:46] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:18:46] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:18:46] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 5 ms to minimize.
[2024-05-22 00:18:47] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:18:47] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:18:47] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:18:47] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:18:47] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:18:47] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:18:47] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:18:48] [INFO ] Deduced a trap composed of 94 places in 172 ms of which 2 ms to minimize.
[2024-05-22 00:18:48] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:18:48] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:18:48] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:18:48] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:18:48] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:18:48] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD418 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 20/226 constraints. Problems are: Problem set: 31 solved, 431 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/994 variables, and 226 constraints, problems are : Problem set: 31 solved, 431 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/531 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 31 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 41/41 constraints. Problems are: Problem set: 31 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/41 constraints. Problems are: Problem set: 31 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/106 constraints. Problems are: Problem set: 31 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 120/226 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 96 places in 157 ms of which 5 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 5 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 75 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 94 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/246 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 84 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 116 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/266 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 119 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/286 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 133 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 124 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 120 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 114 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 110 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/306 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 118 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 20/326 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 115 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 91 places in 169 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 20/346 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 20/366 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 1 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 2 ms to minimize.
SMT process timed out in 60283ms, After SMT, problems are : Problem set: 31 solved, 431 unsolved
Search for dead transitions found 31 dead transitions in 60289ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 531/569 places, 432/501 transitions.
Applied a total of 0 rules in 14 ms. Remains 531 /531 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61112 ms. Remains : 531/569 places, 432/501 transitions.
[2024-05-22 00:19:19] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:19:19] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:19:19] [INFO ] Input system was already deterministic with 432 transitions.
[2024-05-22 00:19:19] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:19:19] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:19:19] [INFO ] Time to serialize gal into /tmp/CTLFireability7112365149400350210.gal : 17 ms
[2024-05-22 00:19:19] [INFO ] Time to serialize properties into /tmp/CTLFireability520882083814897903.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/CTLFireability7112365149400350210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability520882083814897903.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:19:49] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:19:49] [INFO ] Applying decomposition
[2024-05-22 00:19:49] [INFO ] Flatten gal took : 12 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/graph6647081935229489365.txt' '-o' '/tmp/graph6647081935229489365.bin' '-w' '/tmp/graph6647081935229489365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6647081935229489365.bin' '-l' '-1' '-v' '-w' '/tmp/graph6647081935229489365.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:19:49] [INFO ] Decomposing Gal with order
[2024-05-22 00:19:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:19:50] [INFO ] Removed a total of 143 redundant transitions.
[2024-05-22 00:19:50] [INFO ] Flatten gal took : 135 ms
[2024-05-22 00:19:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 42 ms.
[2024-05-22 00:19:50] [INFO ] Time to serialize gal into /tmp/CTLFireability14960791101034157379.gal : 48 ms
[2024-05-22 00:19:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17084236008719809059.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/CTLFireability14960791101034157379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17084236008719809059.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,5.95506e+30,1.23308,29936,3255,47,53707,655,1098,109120,55,1831,0


Converting to forward existential form...Done !
original formula: EX(!(E(AX(FALSE) U E(!(AX((i2.i1.u133.p465==1))) U AG((i7.i0.u149.p559==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(EX(!(FALSE))) U E(!(!(EX(!((i2.i1.u133.p465==1))))) U !(E(TRUE U !((i7.i0.u149.p559==1)))))))...166
Reverse transition relation is NOT exact ! Due to transitions t4, t299, t347, t364, t367, t409, t410, t414, t416, t418, t419, t421, t423, t428, i0.u77.t206...1454
(forward)formula 0,1,5.13967,153740,1,0,305096,655,7371,567291,283,1831,774556
FORMULA BusinessProcesses-PT-18-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 478
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 478
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 538 transition count 470
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 538 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 537 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 537 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 536 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 536 transition count 468
Applied a total of 66 rules in 43 ms. Remains 536 /569 variables (removed 33) and now considering 468/501 (removed 33) transitions.
// Phase 1: matrix 468 rows 536 cols
[2024-05-22 00:19:55] [INFO ] Computed 106 invariants in 12 ms
[2024-05-22 00:19:56] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-22 00:19:56] [INFO ] Invariant cache hit.
[2024-05-22 00:19:56] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-05-22 00:19:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 1/536 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-22 00:20:02] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 9 ms to minimize.
[2024-05-22 00:20:02] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:20:02] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:20:02] [INFO ] Deduced a trap composed of 122 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 99 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 121 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 120 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 122 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 119 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 20/146 constraints. Problems are: Problem set: 11 solved, 456 unsolved
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 20/166 constraints. Problems are: Problem set: 11 solved, 456 unsolved
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 103 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 119 places in 194 ms of which 4 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 101 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 109 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD435 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 20/186 constraints. Problems are: Problem set: 23 solved, 444 unsolved
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 99 places in 165 ms of which 2 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 81 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 4 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 123 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 20/206 constraints. Problems are: Problem set: 23 solved, 444 unsolved
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 123 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:20:23] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:20:23] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:20:23] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:20:23] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:20:23] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:20:23] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:20:23] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:20:23] [INFO ] Deduced a trap composed of 124 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:20:24] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:20:24] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:20:24] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:20:24] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:20:24] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:20:24] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:20:24] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 20/226 constraints. Problems are: Problem set: 23 solved, 444 unsolved
[2024-05-22 00:20:25] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:20:25] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:20:25] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:20:25] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:20:25] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:20:25] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:20:25] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:20:25] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:20:26] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:20:26] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:20:26] [INFO ] Deduced a trap composed of 104 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:20:26] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:20:26] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:20:26] [INFO ] Deduced a trap composed of 124 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:20:26] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 3 ms to minimize.
SMT process timed out in 30160ms, After SMT, problems are : Problem set: 23 solved, 444 unsolved
Search for dead transitions found 23 dead transitions in 30164ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in LTL mode, iteration 1 : 536/569 places, 445/501 transitions.
Applied a total of 0 rules in 8 ms. Remains 536 /536 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31333 ms. Remains : 536/569 places, 445/501 transitions.
[2024-05-22 00:20:26] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:20:26] [INFO ] Flatten gal took : 36 ms
[2024-05-22 00:20:27] [INFO ] Input system was already deterministic with 445 transitions.
[2024-05-22 00:20:27] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:20:27] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:20:27] [INFO ] Time to serialize gal into /tmp/CTLFireability11033732081867139533.gal : 14 ms
[2024-05-22 00:20:27] [INFO ] Time to serialize properties into /tmp/CTLFireability5009155442737536205.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/CTLFireability11033732081867139533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5009155442737536205.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-22 00:20:57] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:20:57] [INFO ] Applying decomposition
[2024-05-22 00:20:57] [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/graph14854873263400836602.txt' '-o' '/tmp/graph14854873263400836602.bin' '-w' '/tmp/graph14854873263400836602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14854873263400836602.bin' '-l' '-1' '-v' '-w' '/tmp/graph14854873263400836602.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:20:57] [INFO ] Decomposing Gal with order
[2024-05-22 00:20:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:20:57] [INFO ] Removed a total of 173 redundant transitions.
[2024-05-22 00:20:57] [INFO ] Flatten gal took : 55 ms
[2024-05-22 00:20:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 21 ms.
[2024-05-22 00:20:57] [INFO ] Time to serialize gal into /tmp/CTLFireability8791054259819420871.gal : 14 ms
[2024-05-22 00:20:57] [INFO ] Time to serialize properties into /tmp/CTLFireability2019430920791137391.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/CTLFireability8791054259819420871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2019430920791137391.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,5.95514e+30,13.3097,333432,7531,45,544529,671,1128,827566,54,1677,0


Converting to forward existential form...Done !
original formula: EF(((A((i19.u171.p645==1) U (i19.u165.p615==1)) * (i3.u156.p579==1)) * ((i19.u146.p679==1) + EX(((i5.i0.u14.p32==0) + AX((((i0.i2.u89.p28...210
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (!((E(!((i19.u165.p615==1)) U (!((i19.u171.p645==1)) * !((i19.u165.p615==1)))) + EG(!((i19...667
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t7, t284, t300, t308, t352, t369, t372, t423, t427, t429, t431, t432, t434, t436, t44...1490
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 544 transition count 476
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 544 transition count 476
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 534 transition count 466
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Applied a total of 74 rules in 85 ms. Remains 532 /569 variables (removed 37) and now considering 464/501 (removed 37) transitions.
// Phase 1: matrix 464 rows 532 cols
[2024-05-22 00:21:27] [INFO ] Computed 106 invariants in 9 ms
[2024-05-22 00:21:27] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-22 00:21:27] [INFO ] Invariant cache hit.
[2024-05-22 00:21:28] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2024-05-22 00:21:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (OVERLAPS) 1/532 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 118 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 4 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 122 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 122 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 106 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 126 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 3 ms to minimize.
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/146 constraints. Problems are: Problem set: 6 solved, 457 unsolved
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 115 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 120 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 119 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/166 constraints. Problems are: Problem set: 6 solved, 457 unsolved
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 2 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 55 places in 149 ms of which 5 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:21:48] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:21:48] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/186 constraints. Problems are: Problem set: 25 solved, 438 unsolved
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 1 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 123 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 2 ms to minimize.
Problem TDEAD407 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 20/206 constraints. Problems are: Problem set: 26 solved, 437 unsolved
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 112 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 111 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 123 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 102 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 99 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 20/226 constraints. Problems are: Problem set: 26 solved, 437 unsolved
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:21:58] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:21:58] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:21:58] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:21:58] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:21:58] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:21:58] [INFO ] Deduced a trap composed of 115 places in 88 ms of which 2 ms to minimize.
SMT process timed out in 30087ms, After SMT, problems are : Problem set: 26 solved, 437 unsolved
Search for dead transitions found 26 dead transitions in 30091ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 532/569 places, 438/501 transitions.
Applied a total of 0 rules in 7 ms. Remains 532 /532 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31012 ms. Remains : 532/569 places, 438/501 transitions.
[2024-05-22 00:21:58] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:21:58] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:21:58] [INFO ] Input system was already deterministic with 438 transitions.
[2024-05-22 00:21:58] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:21:58] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:21:58] [INFO ] Time to serialize gal into /tmp/CTLFireability9789135558805009309.gal : 2 ms
[2024-05-22 00:21:58] [INFO ] Time to serialize properties into /tmp/CTLFireability9981437814264157656.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/CTLFireability9789135558805009309.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9981437814264157656.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-22 00:22:28] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:22:28] [INFO ] Applying decomposition
[2024-05-22 00:22:28] [INFO ] Flatten gal took : 13 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/graph8889683556928845785.txt' '-o' '/tmp/graph8889683556928845785.bin' '-w' '/tmp/graph8889683556928845785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8889683556928845785.bin' '-l' '-1' '-v' '-w' '/tmp/graph8889683556928845785.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:22:28] [INFO ] Decomposing Gal with order
[2024-05-22 00:22:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:22:28] [INFO ] Removed a total of 168 redundant transitions.
[2024-05-22 00:22:28] [INFO ] Flatten gal took : 31 ms
[2024-05-22 00:22:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 25 ms.
[2024-05-22 00:22:28] [INFO ] Time to serialize gal into /tmp/CTLFireability3258416399120656878.gal : 6 ms
[2024-05-22 00:22:28] [INFO ] Time to serialize properties into /tmp/CTLFireability13420643603994671242.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/CTLFireability3258416399120656878.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13420643603994671242.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,5.95545e+30,2.59266,73628,7967,45,123988,493,1079,259803,54,1297,0


Converting to forward existential form...Done !
original formula: EF((EG(AG((i12.u99.p310==1))) * AX(EF((i19.u147.p594==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EG(!(E(TRUE U !((i12.u99.p310==1)))))) * !(EX(!(E(TRUE U (i19.u147.p594==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t292, t300, t312, t348, t365, t368, t415, t416, t420, t422, t424, t425, t427, t429, t...1463
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found 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 a local 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,29.4298,784580,1,0,1.49189e+06,525,7619,2.78909e+06,299,1623,3122555
FORMULA BusinessProcesses-PT-18-CTLFireability-2024-03 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 : 569/569 places, 501/501 transitions.
Graph (trivial) has 283 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1245 edges and 564 vertex of which 563 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 562 transition count 419
Reduce places removed 74 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 488 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 487 transition count 418
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 152 place count 487 transition count 305
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 402 place count 350 transition count 305
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 424 place count 328 transition count 283
Ensure Unique test removed 1 places
Iterating global reduction 3 with 23 rules applied. Total rules applied 447 place count 327 transition count 283
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 448 place count 326 transition count 282
Iterating global reduction 3 with 1 rules applied. Total rules applied 449 place count 326 transition count 282
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 731 place count 184 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 732 place count 183 transition count 141
Applied a total of 732 rules in 110 ms. Remains 183 /569 variables (removed 386) and now considering 141/501 (removed 360) transitions.
// Phase 1: matrix 141 rows 183 cols
[2024-05-22 00:22:58] [INFO ] Computed 79 invariants in 1 ms
[2024-05-22 00:22:58] [INFO ] Implicit Places using invariants in 161 ms returned [0, 1, 2, 3, 4, 7, 8, 9, 13, 14, 15, 16, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 168 ms to find 27 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 156/569 places, 141/501 transitions.
Applied a total of 0 rules in 11 ms. Remains 156 /156 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 290 ms. Remains : 156/569 places, 141/501 transitions.
[2024-05-22 00:22:58] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:58] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:58] [INFO ] Input system was already deterministic with 141 transitions.
[2024-05-22 00:22:58] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:58] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15991229043123182872.gal : 3 ms
[2024-05-22 00:22:58] [INFO ] Time to serialize properties into /tmp/CTLFireability13056024520883576572.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/CTLFireability15991229043123182872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13056024520883576572.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.8439e+06,0.329351,14312,2,2503,5,35920,6,0,763,26244,0


Converting to forward existential form...Done !
original formula: AG(EF(((AG((((p66==1)&&(p378==1))&&(p558==1))) * (p288==0)) * (p371==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(E(TRUE U !((((p66==1)&&(p378==1))&&(p558==1))))) * (p288==0)) * (p371==0)))))...164
Reverse transition relation is NOT exact ! Due to transitions t4, t39, t40, t41, t42, t73, t74, t75, t76, t88, t89, t104, t105, t106, t107, t108, t109, t11...270
(forward)formula 0,0,1.26243,42980,1,0,181,187993,269,98,5615,104751,260
FORMULA BusinessProcesses-PT-18-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 543 transition count 475
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 543 transition count 475
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 533 transition count 465
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 54 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
// Phase 1: matrix 463 rows 531 cols
[2024-05-22 00:23:00] [INFO ] Computed 106 invariants in 8 ms
[2024-05-22 00:23:00] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-22 00:23:00] [INFO ] Invariant cache hit.
[2024-05-22 00:23:01] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-05-22 00:23:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 117 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 2 ms to minimize.
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/146 constraints. Problems are: Problem set: 14 solved, 448 unsolved
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 116 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 121 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 123 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 119 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/166 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 2 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 4 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 123 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 127 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/186 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 99 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 120 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 5 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/206 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 126 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 72 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
SMT process timed out in 30123ms, After SMT, problems are : Problem set: 27 solved, 435 unsolved
Search for dead transitions found 27 dead transitions in 30129ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 531/569 places, 436/501 transitions.
Applied a total of 0 rules in 12 ms. Remains 531 /531 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31036 ms. Remains : 531/569 places, 436/501 transitions.
[2024-05-22 00:23:31] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:23:31] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:23:31] [INFO ] Input system was already deterministic with 436 transitions.
[2024-05-22 00:23:31] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:23:31] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:23:31] [INFO ] Time to serialize gal into /tmp/CTLFireability2223424283267714932.gal : 6 ms
[2024-05-22 00:23:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5242430134678904926.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/CTLFireability2223424283267714932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5242430134678904926.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-22 00:24:01] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:24:01] [INFO ] Applying decomposition
[2024-05-22 00:24: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/graph3892382357486688109.txt' '-o' '/tmp/graph3892382357486688109.bin' '-w' '/tmp/graph3892382357486688109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3892382357486688109.bin' '-l' '-1' '-v' '-w' '/tmp/graph3892382357486688109.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:24:01] [INFO ] Decomposing Gal with order
[2024-05-22 00:24:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:24:01] [INFO ] Removed a total of 164 redundant transitions.
[2024-05-22 00:24:01] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:24:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 10 ms.
[2024-05-22 00:24:01] [INFO ] Time to serialize gal into /tmp/CTLFireability4550228234072431348.gal : 7 ms
[2024-05-22 00:24:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14008936046420284371.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/CTLFireability4550228234072431348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14008936046420284371.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,5.95506e+30,5.83801,139376,9009,49,206477,556,1080,505850,58,1429,0


Converting to forward existential form...Done !
original formula: EX((AF(((EF((i10.i1.u52.p160==1)) * (((i10.i1.u54.p164==0)||(i10.i0.u124.p413==0))||(i10.i1.u45.p602==0))) * (i12.i1.u2.p5==0))) + AG((i6...173
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!(((E(TRUE U (i10.i1.u52.p160==1)) * (((i10.i1.u54.p164==0)||(i10.i0.u124.p413==0))||(i10.i1....266
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t279, t291, t299, t303, t311, t347, t364, t367, t413, t418, t420, t422, t423, t425, t...1458
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 547 transition count 479
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 547 transition count 479
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 538 transition count 470
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 538 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 537 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 537 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 536 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 536 transition count 468
Applied a total of 66 rules in 44 ms. Remains 536 /569 variables (removed 33) and now considering 468/501 (removed 33) transitions.
// Phase 1: matrix 468 rows 536 cols
[2024-05-22 00:24:31] [INFO ] Computed 106 invariants in 10 ms
[2024-05-22 00:24:32] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-22 00:24:32] [INFO ] Invariant cache hit.
[2024-05-22 00:24:32] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-05-22 00:24:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 1/536 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 124 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 2 ms to minimize.
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 20/126 constraints. Problems are: Problem set: 17 solved, 450 unsolved
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 109 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 20/146 constraints. Problems are: Problem set: 17 solved, 450 unsolved
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 102 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 20/166 constraints. Problems are: Problem set: 17 solved, 450 unsolved
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 102 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 4 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 7 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 2 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 20/186 constraints. Problems are: Problem set: 21 solved, 446 unsolved
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 1 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 1 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 1 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 95 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:24:59] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:24:59] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:24:59] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:24:59] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:24:59] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:24:59] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:24:59] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:24:59] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 20/206 constraints. Problems are: Problem set: 21 solved, 446 unsolved
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:25:02] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:25:02] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:25:02] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:25:02] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:25:02] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:25:02] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 30124ms, After SMT, problems are : Problem set: 21 solved, 446 unsolved
Search for dead transitions found 21 dead transitions in 30129ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 536/569 places, 447/501 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 535 transition count 447
Applied a total of 1 rules in 13 ms. Remains 535 /536 variables (removed 1) and now considering 447/447 (removed 0) transitions.
// Phase 1: matrix 447 rows 535 cols
[2024-05-22 00:25:02] [INFO ] Computed 106 invariants in 4 ms
[2024-05-22 00:25:03] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-22 00:25:03] [INFO ] Invariant cache hit.
[2024-05-22 00:25:03] [INFO ] Implicit Places using invariants and state equation in 482 ms returned [467]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 704 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 534/569 places, 447/501 transitions.
Applied a total of 0 rules in 8 ms. Remains 534 /534 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31772 ms. Remains : 534/569 places, 447/501 transitions.
[2024-05-22 00:25:03] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:25:03] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:25:03] [INFO ] Input system was already deterministic with 447 transitions.
[2024-05-22 00:25:03] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:25:03] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:25:03] [INFO ] Time to serialize gal into /tmp/CTLFireability826606538040361660.gal : 3 ms
[2024-05-22 00:25:03] [INFO ] Time to serialize properties into /tmp/CTLFireability12200565640692925558.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/CTLFireability826606538040361660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12200565640692925558.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-22 00:25:33] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:25:33] [INFO ] Applying decomposition
[2024-05-22 00:25:33] [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/graph18330463899604528051.txt' '-o' '/tmp/graph18330463899604528051.bin' '-w' '/tmp/graph18330463899604528051.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18330463899604528051.bin' '-l' '-1' '-v' '-w' '/tmp/graph18330463899604528051.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:25:33] [INFO ] Decomposing Gal with order
[2024-05-22 00:25:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:25:33] [INFO ] Removed a total of 194 redundant transitions.
[2024-05-22 00:25:33] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:25:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 14 ms.
[2024-05-22 00:25:33] [INFO ] Time to serialize gal into /tmp/CTLFireability3327645716342958333.gal : 5 ms
[2024-05-22 00:25:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14948384767927616863.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/CTLFireability3327645716342958333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14948384767927616863.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,6.22053e+30,8.79218,227580,7043,41,371276,541,1099,817678,47,1640,0


Converting to forward existential form...Done !
original formula: A((EG(EF(!(EX((i16.u139.p491==1))))) + !(A(((AG((i17.u146.p612==1)) * EF((i17.u178.p667==1))) * EG((((i1.i1.u85.p261==1)&&(i1.i1.u144.p51...275
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!((E(!(E(TRUE U (i9.i0.u175.p660==1))) U (!((i12.i1.u130.p445==1)) * !(E(TRUE U (i...906
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t7, t284, t296, t308, t312, t316, t352, t369, t372, t424, t425, t429, t431, t433, t43...1495
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 544 transition count 476
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 544 transition count 476
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 535 transition count 467
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 535 transition count 467
Applied a total of 68 rules in 55 ms. Remains 535 /569 variables (removed 34) and now considering 467/501 (removed 34) transitions.
// Phase 1: matrix 467 rows 535 cols
[2024-05-22 00:26:03] [INFO ] Computed 106 invariants in 9 ms
[2024-05-22 00:26:04] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-22 00:26:04] [INFO ] Invariant cache hit.
[2024-05-22 00:26:04] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-05-22 00:26:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/535 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 76 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 94 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 109 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 110 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/146 constraints. Problems are: Problem set: 20 solved, 446 unsolved
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 97 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 94 places in 171 ms of which 2 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 79 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 98 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 101 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 20/166 constraints. Problems are: Problem set: 24 solved, 442 unsolved
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 96 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 124 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 94 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 121 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 113 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 119 places in 104 ms of which 2 ms to minimize.
Problem TDEAD402 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 20/186 constraints. Problems are: Problem set: 25 solved, 441 unsolved
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 103 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 20/206 constraints. Problems are: Problem set: 25 solved, 441 unsolved
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 1 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
SMT process timed out in 30162ms, After SMT, problems are : Problem set: 25 solved, 441 unsolved
Search for dead transitions found 25 dead transitions in 30167ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 535/569 places, 442/501 transitions.
Applied a total of 0 rules in 9 ms. Remains 535 /535 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31095 ms. Remains : 535/569 places, 442/501 transitions.
[2024-05-22 00:26:34] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:26:34] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:26:35] [INFO ] Input system was already deterministic with 442 transitions.
[2024-05-22 00:26:35] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:26:35] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:26:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14974092965253016496.gal : 2 ms
[2024-05-22 00:26:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7331394900441877887.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/CTLFireability14974092965253016496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7331394900441877887.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-22 00:27:05] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:27:05] [INFO ] Applying decomposition
[2024-05-22 00:27:05] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9635245413905591958.txt' '-o' '/tmp/graph9635245413905591958.bin' '-w' '/tmp/graph9635245413905591958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9635245413905591958.bin' '-l' '-1' '-v' '-w' '/tmp/graph9635245413905591958.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:27:05] [INFO ] Decomposing Gal with order
[2024-05-22 00:27:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:27:05] [INFO ] Removed a total of 170 redundant transitions.
[2024-05-22 00:27:05] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:27:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2024-05-22 00:27:05] [INFO ] Time to serialize gal into /tmp/CTLFireability11994867857409207750.gal : 18 ms
[2024-05-22 00:27:05] [INFO ] Time to serialize properties into /tmp/CTLFireability17711842040114611003.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/CTLFireability11994867857409207750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17711842040114611003.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.00913e+31,3.57068,82612,6836,39,144881,613,1113,311098,56,1474,0


Converting to forward existential form...Done !
original formula: AF(E(!(E((i19.u179.p547==1) U (i0.i0.u1.p2==1))) U (EX((i1.u6.p14==1)) * (i1.u74.p228!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!(E((i19.u179.p547==1) U (i0.i0.u1.p2==1))) U (EX((i1.u6.p14==1)) * (i1.u74.p228!=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t298, t306, t314, t350, t367, t370, t418, t423, t425, t427, t428, t430, t433, t437, i0.i0...1467
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 a local SCC at level 1
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 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,19.5442,529036,1,0,1.14241e+06,613,7414,1.44965e+06,270,1474,2848207
FORMULA BusinessProcesses-PT-18-CTLFireability-2024-07 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 : 569/569 places, 501/501 transitions.
Graph (complete) has 1251 edges and 569 vertex of which 568 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 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 67 place count 567 transition count 433
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 501 transition count 431
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 499 transition count 431
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 125 Pre rules applied. Total rules applied 137 place count 499 transition count 306
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 275 rules applied. Total rules applied 412 place count 349 transition count 306
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 433 place count 328 transition count 285
Ensure Unique test removed 1 places
Iterating global reduction 3 with 22 rules applied. Total rules applied 455 place count 327 transition count 285
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 456 place count 326 transition count 284
Iterating global reduction 3 with 1 rules applied. Total rules applied 457 place count 326 transition count 284
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 731 place count 188 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 732 place count 188 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 733 place count 187 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 734 place count 186 transition count 146
Applied a total of 734 rules in 81 ms. Remains 186 /569 variables (removed 383) and now considering 146/501 (removed 355) transitions.
// Phase 1: matrix 146 rows 186 cols
[2024-05-22 00:27:24] [INFO ] Computed 77 invariants in 1 ms
[2024-05-22 00:27:25] [INFO ] Implicit Places using invariants in 113 ms returned [46, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 115 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 177/569 places, 146/501 transitions.
Applied a total of 0 rules in 5 ms. Remains 177 /177 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 201 ms. Remains : 177/569 places, 146/501 transitions.
[2024-05-22 00:27:25] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:27:25] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:27:25] [INFO ] Input system was already deterministic with 146 transitions.
[2024-05-22 00:27:25] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:27:25] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:27:25] [INFO ] Time to serialize gal into /tmp/CTLFireability101721071055853000.gal : 2 ms
[2024-05-22 00:27:25] [INFO ] Time to serialize properties into /tmp/CTLFireability14851442675926149554.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/CTLFireability101721071055853000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14851442675926149554.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.51541e+06,1.02361,34688,2,4379,5,160829,6,0,852,99262,0


Converting to forward existential form...Done !
original formula: AG(EF(((p625==1) * ((EF((((p208==1)&&(p487==1))&&(p688==1))) + (p573==1)) + (((p158==1)&&(p413==1))&&(p690==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p625==1) * ((E(TRUE U (((p208==1)&&(p487==1))&&(p688==1))) + (p573==1)) + (((p1...199
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t52, t53, t54, t55, t56, t81, t82, t83, t84, t85, t92, t106, t117, t118, t119, t120, ...285
(forward)formula 0,0,2.57167,65076,1,0,215,299093,280,105,6212,124419,272
FORMULA BusinessProcesses-PT-18-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 287 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1245 edges and 564 vertex of which 563 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 562 transition count 418
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 487 transition count 418
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 116 Pre rules applied. Total rules applied 152 place count 487 transition count 302
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 408 place count 347 transition count 302
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 431 place count 324 transition count 279
Ensure Unique test removed 1 places
Iterating global reduction 2 with 24 rules applied. Total rules applied 455 place count 323 transition count 279
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 456 place count 322 transition count 278
Iterating global reduction 2 with 1 rules applied. Total rules applied 457 place count 322 transition count 278
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 739 place count 180 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 740 place count 179 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 741 place count 178 transition count 137
Applied a total of 741 rules in 81 ms. Remains 178 /569 variables (removed 391) and now considering 137/501 (removed 364) transitions.
// Phase 1: matrix 137 rows 178 cols
[2024-05-22 00:27:27] [INFO ] Computed 78 invariants in 1 ms
[2024-05-22 00:27:28] [INFO ] Implicit Places using invariants in 169 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 11, 12, 13, 14, 15, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 170 ms to find 28 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/569 places, 137/501 transitions.
Applied a total of 0 rules in 6 ms. Remains 150 /150 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 257 ms. Remains : 150/569 places, 137/501 transitions.
[2024-05-22 00:27:28] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:27:28] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:27:28] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-22 00:27:28] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:27:28] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:27:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15968835156457028973.gal : 1 ms
[2024-05-22 00:27:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality59860729996878204.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15968835156457028973.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality59860729996878204.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality59860729996878204.prop.
RANDOM walk for 40000 steps (5413 resets) in 345 ms. (115 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 57
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :57 after 147
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :147 after 1176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1176 after 8388
BEST_FIRST walk for 40002 steps (1815 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 128 steps, run visited all 1 properties in 7 ms. (steps per millisecond=18 )
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8388 after 58417
Probabilistic random walk after 128 steps, saw 76 distinct states, run finished after 11 ms. (steps per millisecond=11 ) properties seen :1
FORMULA BusinessProcesses-PT-18-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 280 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1245 edges and 564 vertex of which 563 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 562 transition count 421
Reduce places removed 72 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 73 rules applied. Total rules applied 147 place count 490 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 489 transition count 420
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 116 Pre rules applied. Total rules applied 148 place count 489 transition count 304
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 404 place count 349 transition count 304
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 426 place count 327 transition count 282
Ensure Unique test removed 1 places
Iterating global reduction 3 with 23 rules applied. Total rules applied 449 place count 326 transition count 282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 450 place count 325 transition count 281
Iterating global reduction 3 with 1 rules applied. Total rules applied 451 place count 325 transition count 281
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 277 rules applied. Total rules applied 728 place count 186 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 729 place count 185 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 730 place count 184 transition count 142
Applied a total of 730 rules in 51 ms. Remains 184 /569 variables (removed 385) and now considering 142/501 (removed 359) transitions.
// Phase 1: matrix 142 rows 184 cols
[2024-05-22 00:27:28] [INFO ] Computed 79 invariants in 2 ms
[2024-05-22 00:27:28] [INFO ] Implicit Places using invariants in 118 ms returned [153, 162]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 120 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 182/569 places, 142/501 transitions.
Applied a total of 0 rules in 4 ms. Remains 182 /182 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 175 ms. Remains : 182/569 places, 142/501 transitions.
[2024-05-22 00:27:28] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:27:28] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:27:28] [INFO ] Input system was already deterministic with 142 transitions.
[2024-05-22 00:27:28] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:27:28] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:27:28] [INFO ] Time to serialize gal into /tmp/CTLFireability17718619544343399851.gal : 1 ms
[2024-05-22 00:27:28] [INFO ] Time to serialize properties into /tmp/CTLFireability11294409216802959253.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/CTLFireability17718619544343399851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11294409216802959253.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,1.55636e+06,0.864048,37092,2,7956,5,152842,6,0,867,81848,0


Converting to forward existential form...Done !
original formula: E(EF((((p196==1) * EG(((p260==1)||((p99==1)&&(p529==1))))) * !(EG((p211==1))))) U (p5==1))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (((p196==1) * EG(((p260==1)||((p99==1)&&(p529==1))))) * !(EG((p211==1)))))) * (p5==1))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t17, t40, t41, t42, t43, t74, t75, t76, t77, t78, t89, t90, t105, t106, t107, t108, t...290
(forward)formula 0,0,4.70313,145052,1,0,230,743934,283,117,6462,342142,319
FORMULA BusinessProcesses-PT-18-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 543 transition count 475
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 543 transition count 475
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 533 transition count 465
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 38 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
// Phase 1: matrix 463 rows 531 cols
[2024-05-22 00:27:33] [INFO ] Computed 106 invariants in 8 ms
[2024-05-22 00:27:33] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-22 00:27:33] [INFO ] Invariant cache hit.
[2024-05-22 00:27:34] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-05-22 00:27:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 72 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 117 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:27:43] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:27:43] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 6 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/146 constraints. Problems are: Problem set: 14 solved, 448 unsolved
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 116 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 121 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 123 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 5 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 100 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/166 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 123 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 127 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/186 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:27:59] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 120 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/206 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 126 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/994 variables, and 214 constraints, problems are : Problem set: 27 solved, 435 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/531 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 27 solved, 435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 41/41 constraints. Problems are: Problem set: 27 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/41 constraints. Problems are: Problem set: 27 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/106 constraints. Problems are: Problem set: 27 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 108/214 constraints. Problems are: Problem set: 27 solved, 435 unsolved
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 98 places in 163 ms of which 4 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:28:10] [INFO ] Deduced a trap composed of 94 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:28:10] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 4 ms to minimize.
[2024-05-22 00:28:10] [INFO ] Deduced a trap composed of 94 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:28:10] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 3 ms to minimize.
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD418 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/234 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 4 ms to minimize.
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 121 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:28:15] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/254 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:28:16] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:28:16] [INFO ] Deduced a trap composed of 101 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:28:16] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:28:16] [INFO ] Deduced a trap composed of 93 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:28:16] [INFO ] Deduced a trap composed of 88 places in 160 ms of which 2 ms to minimize.
[2024-05-22 00:28:16] [INFO ] Deduced a trap composed of 119 places in 171 ms of which 4 ms to minimize.
[2024-05-22 00:28:17] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:28:17] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:28:17] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:28:17] [INFO ] Deduced a trap composed of 81 places in 179 ms of which 4 ms to minimize.
[2024-05-22 00:28:18] [INFO ] Deduced a trap composed of 79 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:28:18] [INFO ] Deduced a trap composed of 81 places in 190 ms of which 4 ms to minimize.
[2024-05-22 00:28:19] [INFO ] Deduced a trap composed of 86 places in 181 ms of which 4 ms to minimize.
[2024-05-22 00:28:19] [INFO ] Deduced a trap composed of 85 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:28:19] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:28:19] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:28:19] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:28:19] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:28:19] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:28:20] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/274 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:28:20] [INFO ] Deduced a trap composed of 123 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:28:21] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:28:21] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:28:21] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:28:21] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 5 ms to minimize.
[2024-05-22 00:28:21] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:28:21] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:28:21] [INFO ] Deduced a trap composed of 114 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 94 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 120 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 120 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 122 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/294 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:28:24] [INFO ] Deduced a trap composed of 98 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:28:24] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 114 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:28:27] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:28:27] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:28:27] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:28:27] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:28:27] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:28:27] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:28:27] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 20/314 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:28:29] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:28:29] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 4 ms to minimize.
[2024-05-22 00:28:29] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:28:29] [INFO ] Deduced a trap composed of 73 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:28:29] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:28:30] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:28:30] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:28:30] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:28:30] [INFO ] Deduced a trap composed of 91 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:28:30] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:28:30] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:28:30] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:28:31] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:28:31] [INFO ] Deduced a trap composed of 120 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:28:31] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:28:31] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:28:31] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:28:31] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:28:31] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:28:31] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 20/334 constraints. Problems are: Problem set: 31 solved, 431 unsolved
[2024-05-22 00:28:33] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:28:33] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:28:34] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:28:34] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 60121ms, After SMT, problems are : Problem set: 31 solved, 431 unsolved
Search for dead transitions found 31 dead transitions in 60126ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 531/569 places, 432/501 transitions.
Applied a total of 0 rules in 8 ms. Remains 531 /531 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61009 ms. Remains : 531/569 places, 432/501 transitions.
[2024-05-22 00:28:34] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:28:34] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:28:34] [INFO ] Input system was already deterministic with 432 transitions.
[2024-05-22 00:28:34] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:28:34] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:28:34] [INFO ] Time to serialize gal into /tmp/CTLFireability12034063811575046963.gal : 2 ms
[2024-05-22 00:28:34] [INFO ] Time to serialize properties into /tmp/CTLFireability16136366452346396854.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/CTLFireability12034063811575046963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16136366452346396854.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-22 00:29:04] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:29:04] [INFO ] Applying decomposition
[2024-05-22 00:29:04] [INFO ] Flatten gal took : 13 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/graph15737908970611864831.txt' '-o' '/tmp/graph15737908970611864831.bin' '-w' '/tmp/graph15737908970611864831.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15737908970611864831.bin' '-l' '-1' '-v' '-w' '/tmp/graph15737908970611864831.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:29:04] [INFO ] Decomposing Gal with order
[2024-05-22 00:29:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:29:04] [INFO ] Removed a total of 143 redundant transitions.
[2024-05-22 00:29:04] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:29:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2024-05-22 00:29:04] [INFO ] Time to serialize gal into /tmp/CTLFireability6543919080204182163.gal : 5 ms
[2024-05-22 00:29:04] [INFO ] Time to serialize properties into /tmp/CTLFireability1919094584634589477.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/CTLFireability6543919080204182163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1919094584634589477.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,5.95506e+30,0.960364,34260,4078,39,55680,469,1116,125521,54,1245,0


Converting to forward existential form...Done !
original formula: EF(AX((i10.i0.u1.p3==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((i10.i0.u1.p3==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t279, t299, t303, t347, t364, t367, t409, t410, t414, t416, t419, t421, t423, t427, i0.i0.u80...1455
(forward)formula 0,1,4.6654,161772,1,0,344715,469,6116,579961,237,1245,891601
FORMULA BusinessProcesses-PT-18-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 545 transition count 477
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 545 transition count 477
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 535 transition count 467
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 533 transition count 465
Applied a total of 72 rules in 69 ms. Remains 533 /569 variables (removed 36) and now considering 465/501 (removed 36) transitions.
// Phase 1: matrix 465 rows 533 cols
[2024-05-22 00:29:09] [INFO ] Computed 106 invariants in 10 ms
[2024-05-22 00:29:09] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-05-22 00:29:09] [INFO ] Invariant cache hit.
[2024-05-22 00:29:10] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2024-05-22 00:29:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/533 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 82 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 118 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 3 ms to minimize.
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 20/126 constraints. Problems are: Problem set: 4 solved, 460 unsolved
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 102 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 103 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 121 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 121 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/146 constraints. Problems are: Problem set: 8 solved, 456 unsolved
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 120 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 104 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/166 constraints. Problems are: Problem set: 14 solved, 450 unsolved
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:29:29] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:29:29] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:29:29] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:29:29] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:29:29] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:29:29] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:29:29] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:29:30] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:29:30] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:29:30] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:29:30] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:29:30] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/186 constraints. Problems are: Problem set: 14 solved, 450 unsolved
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 124 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 115 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 4 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 20/206 constraints. Problems are: Problem set: 14 solved, 450 unsolved
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 1 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 1 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:29:38] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 117 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 1 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 20/226 constraints. Problems are: Problem set: 14 solved, 450 unsolved
[2024-05-22 00:29:40] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:29:40] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:29:40] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
SMT process timed out in 30148ms, After SMT, problems are : Problem set: 14 solved, 450 unsolved
Search for dead transitions found 14 dead transitions in 30152ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 533/569 places, 451/501 transitions.
Applied a total of 0 rules in 6 ms. Remains 533 /533 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31436 ms. Remains : 533/569 places, 451/501 transitions.
[2024-05-22 00:29:40] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:29:40] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:29:40] [INFO ] Input system was already deterministic with 451 transitions.
[2024-05-22 00:29:40] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:29:40] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:29:40] [INFO ] Time to serialize gal into /tmp/CTLFireability5259487553817846583.gal : 15 ms
[2024-05-22 00:29:40] [INFO ] Time to serialize properties into /tmp/CTLFireability5307965580543665645.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/CTLFireability5259487553817846583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5307965580543665645.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-22 00:30:10] [INFO ] Flatten gal took : 34 ms
[2024-05-22 00:30:10] [INFO ] Applying decomposition
[2024-05-22 00:30:10] [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/graph4977224515063391761.txt' '-o' '/tmp/graph4977224515063391761.bin' '-w' '/tmp/graph4977224515063391761.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4977224515063391761.bin' '-l' '-1' '-v' '-w' '/tmp/graph4977224515063391761.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:30:10] [INFO ] Decomposing Gal with order
[2024-05-22 00:30:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:30:10] [INFO ] Removed a total of 217 redundant transitions.
[2024-05-22 00:30:10] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:30:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2024-05-22 00:30:10] [INFO ] Time to serialize gal into /tmp/CTLFireability8375894989326703423.gal : 5 ms
[2024-05-22 00:30:10] [INFO ] Time to serialize properties into /tmp/CTLFireability4140846025120590509.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/CTLFireability8375894989326703423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4140846025120590509.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,7.5437e+30,4.79316,121808,7012,55,192960,579,1172,407262,61,1505,0


Converting to forward existential form...Done !
original formula: EX((EF(AG(EX((i10.i1.u91.p295==1)))) + EG((((AX((((i1.u75.p232==1)&&(i12.i1.u133.p468==1))&&(i1.u169.p655==1))) + (i16.i0.u23.p65==0)) * ...203
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(E(TRUE U !(EX((i10.i1.u91.p295==1))))))] != FALSE + [FwdG(EY(Init),(((!(EX(!((((i1.u7...295
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t280, t292, t296, t305, t349, t366, t369, t429, t433, t435, t437, t438, t440, t442, t...1533
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 1
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 a local SCC at level 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,17.6401,430160,1,0,818497,579,8101,1.376e+06,330,1808,2157444
FORMULA BusinessProcesses-PT-18-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 286 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1245 edges and 564 vertex of which 563 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 562 transition count 418
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 487 transition count 418
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 152 place count 487 transition count 303
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 406 place count 348 transition count 303
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 429 place count 325 transition count 280
Ensure Unique test removed 1 places
Iterating global reduction 2 with 24 rules applied. Total rules applied 453 place count 324 transition count 280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 454 place count 323 transition count 279
Iterating global reduction 2 with 1 rules applied. Total rules applied 455 place count 323 transition count 279
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 737 place count 181 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 738 place count 180 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 739 place count 179 transition count 138
Applied a total of 739 rules in 36 ms. Remains 179 /569 variables (removed 390) and now considering 138/501 (removed 363) transitions.
// Phase 1: matrix 138 rows 179 cols
[2024-05-22 00:30:28] [INFO ] Computed 78 invariants in 2 ms
[2024-05-22 00:30:28] [INFO ] Implicit Places using invariants in 173 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 11, 12, 13, 14, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 174 ms to find 27 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 152/569 places, 138/501 transitions.
Applied a total of 0 rules in 17 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 227 ms. Remains : 152/569 places, 138/501 transitions.
[2024-05-22 00:30:28] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:30:28] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:30:28] [INFO ] Input system was already deterministic with 138 transitions.
[2024-05-22 00:30:28] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:30:29] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:30:29] [INFO ] Time to serialize gal into /tmp/CTLFireability16958742461947622093.gal : 2 ms
[2024-05-22 00:30:29] [INFO ] Time to serialize properties into /tmp/CTLFireability7470939755146854163.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/CTLFireability16958742461947622093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7470939755146854163.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,558144,0.124502,7712,2,1777,5,12049,6,0,744,8903,0


Converting to forward existential form...Done !
original formula: EG(EF(((p146==1)&&(p609==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p146==1)&&(p609==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t39, t40, t41, t42, t70, t71, t72, t73, t85, t86, t100, t101, t102, t103, t104, t105, t112, t...266
(forward)formula 0,1,1.16845,42076,1,0,405,192085,266,329,5593,199358,488
FORMULA BusinessProcesses-PT-18-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 544 transition count 476
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 544 transition count 476
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 534 transition count 466
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Applied a total of 74 rules in 73 ms. Remains 532 /569 variables (removed 37) and now considering 464/501 (removed 37) transitions.
// Phase 1: matrix 464 rows 532 cols
[2024-05-22 00:30:30] [INFO ] Computed 106 invariants in 11 ms
[2024-05-22 00:30:30] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-22 00:30:30] [INFO ] Invariant cache hit.
[2024-05-22 00:30:31] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2024-05-22 00:30:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (OVERLAPS) 1/532 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-22 00:30:37] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:30:37] [INFO ] Deduced a trap composed of 120 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:30:37] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:30:37] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 15 ms to minimize.
[2024-05-22 00:30:37] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:30:37] [INFO ] Deduced a trap composed of 115 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:30:38] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:30:38] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:30:38] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:30:38] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:30:38] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:30:38] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:30:38] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:30:38] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:30:38] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:30:39] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:30:39] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:30:39] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:30:39] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:30:39] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-22 00:30:42] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:30:43] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:30:43] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:30:43] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:30:43] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:30:43] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:30:43] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:30:43] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:30:44] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:30:44] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:30:44] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:30:44] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:30:44] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:30:44] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:30:45] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:30:45] [INFO ] Deduced a trap composed of 116 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:30:45] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:30:45] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 11 ms to minimize.
[2024-05-22 00:30:45] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:30:45] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/146 constraints. Problems are: Problem set: 13 solved, 450 unsolved
[2024-05-22 00:30:46] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:30:46] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:30:46] [INFO ] Deduced a trap composed of 120 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:30:46] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:30:46] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:30:46] [INFO ] Deduced a trap composed of 106 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:30:46] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:30:47] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:30:47] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:30:47] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:30:47] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:30:47] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 6 ms to minimize.
[2024-05-22 00:30:47] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:30:47] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:30:47] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:30:47] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:30:48] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:30:48] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:30:48] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:30:48] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/166 constraints. Problems are: Problem set: 13 solved, 450 unsolved
[2024-05-22 00:30:48] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:30:48] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 101 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/186 constraints. Problems are: Problem set: 13 solved, 450 unsolved
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 120 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:30:57] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 20/206 constraints. Problems are: Problem set: 13 solved, 450 unsolved
[2024-05-22 00:30:57] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:30:57] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:30:57] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:30:57] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:30:58] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:30:58] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:30:58] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:30:58] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:30:58] [INFO ] Deduced a trap composed of 97 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:30:58] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:30:59] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:30:59] [INFO ] Deduced a trap composed of 95 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:30:59] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:30:59] [INFO ] Deduced a trap composed of 121 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:30:59] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:30:59] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:30:59] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:31:00] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:31:00] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:31:00] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 3 ms to minimize.
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 20/226 constraints. Problems are: Problem set: 21 solved, 442 unsolved
[2024-05-22 00:31:00] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:31:01] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:31:01] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
SMT process timed out in 30163ms, After SMT, problems are : Problem set: 21 solved, 442 unsolved
Search for dead transitions found 21 dead transitions in 30168ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 532/569 places, 443/501 transitions.
Applied a total of 0 rules in 9 ms. Remains 532 /532 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31032 ms. Remains : 532/569 places, 443/501 transitions.
[2024-05-22 00:31:01] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:31:01] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:31:01] [INFO ] Input system was already deterministic with 443 transitions.
[2024-05-22 00:31:01] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:31:01] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:31:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13389321807409291448.gal : 3 ms
[2024-05-22 00:31:01] [INFO ] Time to serialize properties into /tmp/CTLFireability15399707098172385707.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/CTLFireability13389321807409291448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15399707098172385707.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-22 00:31:31] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:31:31] [INFO ] Applying decomposition
[2024-05-22 00:31:31] [INFO ] Flatten gal took : 18 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/graph5544928546087710853.txt' '-o' '/tmp/graph5544928546087710853.bin' '-w' '/tmp/graph5544928546087710853.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5544928546087710853.bin' '-l' '-1' '-v' '-w' '/tmp/graph5544928546087710853.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:31:31] [INFO ] Decomposing Gal with order
[2024-05-22 00:31:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:31:31] [INFO ] Removed a total of 185 redundant transitions.
[2024-05-22 00:31:31] [INFO ] Flatten gal took : 28 ms
[2024-05-22 00:31:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2024-05-22 00:31:31] [INFO ] Time to serialize gal into /tmp/CTLFireability5162153776725081418.gal : 6 ms
[2024-05-22 00:31:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7310707022857786659.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/CTLFireability5162153776725081418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7310707022857786659.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,6.01402e+30,1.43255,44508,4181,56,70252,798,1094,176528,57,2085,0


Converting to forward existential form...Done !
original formula: E(A((i17.u146.p561==1) U (i8.i1.u94.p299==1)) U AX(EF(EX(((i6.u18.p43==1)||(i7.i1.u72.p221==1))))))
=> equivalent forward existential formula: [(FwdU(Init,!((E(!((i8.i1.u94.p299==1)) U (!((i17.u146.p561==1)) * !((i8.i1.u94.p299==1)))) + EG(!((i8.i1.u94.p2...242
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t280, t296, t304, t312, t348, t365, t368, t420, t425, t429, t430, t432, t434,...1432
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 478
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 478
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 538 transition count 470
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 538 transition count 470
Applied a total of 62 rules in 56 ms. Remains 538 /569 variables (removed 31) and now considering 470/501 (removed 31) transitions.
// Phase 1: matrix 470 rows 538 cols
[2024-05-22 00:32:01] [INFO ] Computed 106 invariants in 5 ms
[2024-05-22 00:32:01] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-22 00:32:01] [INFO ] Invariant cache hit.
[2024-05-22 00:32:02] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2024-05-22 00:32:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-22 00:32:09] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:32:09] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:32:09] [INFO ] Deduced a trap composed of 123 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:32:09] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 112 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 20/126 constraints. Problems are: Problem set: 10 solved, 459 unsolved
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:32:16] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:32:16] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:32:16] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:32:16] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:32:16] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:32:16] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:32:16] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:32:16] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:32:17] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:32:17] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:32:17] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/146 constraints. Problems are: Problem set: 10 solved, 459 unsolved
[2024-05-22 00:32:17] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:32:17] [INFO ] Deduced a trap composed of 100 places in 209 ms of which 4 ms to minimize.
[2024-05-22 00:32:17] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 121 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 119 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD436 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/166 constraints. Problems are: Problem set: 19 solved, 450 unsolved
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 116 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 110 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 2 ms to minimize.
[2024-05-22 00:32:23] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:32:23] [INFO ] Deduced a trap composed of 117 places in 161 ms of which 2 ms to minimize.
[2024-05-22 00:32:23] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:32:23] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:32:23] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/186 constraints. Problems are: Problem set: 19 solved, 450 unsolved
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
Problem TDEAD391 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/206 constraints. Problems are: Problem set: 25 solved, 444 unsolved
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 126 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:32:32] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:32:32] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:32:32] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:32:32] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1008 variables, and 224 constraints, problems are : Problem set: 25 solved, 444 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 118/118 constraints]
Escalating to Integer solving :Problem set: 25 solved, 444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 25 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 25 solved, 444 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 65/106 constraints. Problems are: Problem set: 25 solved, 444 unsolved
Problem TDEAD402 is UNSAT
Problem TDEAD420 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 118/224 constraints. Problems are: Problem set: 27 solved, 442 unsolved
[2024-05-22 00:32:36] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:32:36] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:32:39] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:32:39] [INFO ] Deduced a trap composed of 109 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:32:39] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 2 ms to minimize.
Problem TDEAD396 is UNSAT
Problem TDEAD403 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/244 constraints. Problems are: Problem set: 29 solved, 440 unsolved
[2024-05-22 00:32:39] [INFO ] Deduced a trap composed of 94 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 120 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 94 places in 175 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/264 constraints. Problems are: Problem set: 29 solved, 440 unsolved
[2024-05-22 00:32:43] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:32:43] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:32:43] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:32:43] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:32:43] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:32:43] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:32:43] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:32:44] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:32:44] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:32:44] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:32:44] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:32:44] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:32:44] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:32:45] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:32:45] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:32:45] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:32:45] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:32:45] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:32:46] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:32:46] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
Problem TDEAD387 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD411 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/284 constraints. Problems are: Problem set: 32 solved, 437 unsolved
[2024-05-22 00:32:47] [INFO ] Deduced a trap composed of 94 places in 205 ms of which 3 ms to minimize.
[2024-05-22 00:32:47] [INFO ] Deduced a trap composed of 95 places in 160 ms of which 2 ms to minimize.
[2024-05-22 00:32:47] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:32:47] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:32:48] [INFO ] Deduced a trap composed of 101 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:32:48] [INFO ] Deduced a trap composed of 94 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:32:48] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:32:48] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:32:48] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:32:48] [INFO ] Deduced a trap composed of 96 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 91 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 98 places in 195 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/304 constraints. Problems are: Problem set: 32 solved, 437 unsolved
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 136 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 107 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/324 constraints. Problems are: Problem set: 32 solved, 437 unsolved
[2024-05-22 00:32:55] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:32:55] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:32:55] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/344 constraints. Problems are: Problem set: 32 solved, 437 unsolved
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 121 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 102 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 93 places in 201 ms of which 4 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 5 ms to minimize.
SMT process timed out in 60129ms, After SMT, problems are : Problem set: 32 solved, 437 unsolved
Search for dead transitions found 32 dead transitions in 60135ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/569 places, 438/501 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 438
Applied a total of 1 rules in 8 ms. Remains 537 /538 variables (removed 1) and now considering 438/438 (removed 0) transitions.
// Phase 1: matrix 438 rows 537 cols
[2024-05-22 00:33:02] [INFO ] Computed 110 invariants in 4 ms
[2024-05-22 00:33:02] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-22 00:33:02] [INFO ] Invariant cache hit.
[2024-05-22 00:33:03] [INFO ] Implicit Places using invariants and state equation in 430 ms returned [119, 122]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 678 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 535/569 places, 438/501 transitions.
Applied a total of 0 rules in 9 ms. Remains 535 /535 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61728 ms. Remains : 535/569 places, 438/501 transitions.
[2024-05-22 00:33:03] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:33:03] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:33:03] [INFO ] Input system was already deterministic with 438 transitions.
[2024-05-22 00:33:03] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:33:03] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:33:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10055552567964595335.gal : 2 ms
[2024-05-22 00:33:03] [INFO ] Time to serialize properties into /tmp/CTLFireability18065051223398973599.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/CTLFireability10055552567964595335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18065051223398973599.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-22 00:33:33] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:33:33] [INFO ] Applying decomposition
[2024-05-22 00:33:33] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11094650732919059410.txt' '-o' '/tmp/graph11094650732919059410.bin' '-w' '/tmp/graph11094650732919059410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11094650732919059410.bin' '-l' '-1' '-v' '-w' '/tmp/graph11094650732919059410.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:33:33] [INFO ] Decomposing Gal with order
[2024-05-22 00:33:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:33:33] [INFO ] Removed a total of 144 redundant transitions.
[2024-05-22 00:33:33] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:33:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 6 ms.
[2024-05-22 00:33:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1574560504086569099.gal : 6 ms
[2024-05-22 00:33:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7753179697564387655.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/CTLFireability1574560504086569099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7753179697564387655.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.01047e+31,4.14541,119316,6521,30,217592,417,1080,374613,47,1040,0


Converting to forward existential form...Done !
original formula: EF(EX((EG((((i7.i0.u21.p53==1)&&(i7.i1.u118.p368==1))&&(i7.i0.u153.p548==1))) * !(E((i18.u149.p654!=1) U ((i8.i0.u45.p140==1)||(i18.u149....169
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * EG((((i7.i0.u21.p53==1)&&(i7.i1.u118.p368==1))&&(i7.i0.u153.p548==1)))) * !(E((i18.u149...221
Reverse transition relation is NOT exact ! Due to transitions t285, t297, t305, t313, t353, t370, t373, t415, t419, t421, t424, t426, t428, t434, i0.i0.u82...1503
Detected timeout of ITS tools.
[2024-05-22 00:34:03] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:34:03] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:34:03] [INFO ] Applying decomposition
[2024-05-22 00:34:03] [INFO ] Flatten gal took : 40 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/graph6639194513671134100.txt' '-o' '/tmp/graph6639194513671134100.bin' '-w' '/tmp/graph6639194513671134100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6639194513671134100.bin' '-l' '-1' '-v' '-w' '/tmp/graph6639194513671134100.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:34:03] [INFO ] Decomposing Gal with order
[2024-05-22 00:34:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:34:03] [INFO ] Removed a total of 285 redundant transitions.
[2024-05-22 00:34:03] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:34:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-22 00:34:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4971573530204206188.gal : 4 ms
[2024-05-22 00:34:03] [INFO ] Time to serialize properties into /tmp/CTLFireability15705926840765828810.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/CTLFireability4971573530204206188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15705926840765828810.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46125e+31,52.0151,1158500,32334,235,1.55633e+06,2848,1022,2.97255e+06,85,13306,0


Converting to forward existential form...Done !
original formula: EF(((A((i16.u185.p645==1) U (i16.u176.p615==1)) * (i11.u167.p579==1)) * ((i16.u155.p679==1) + EX(((i10.u14.p32==0) + AX((((i0.u93.p285==1...203
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (!((E(!((i16.u176.p615==1)) U (!((i16.u185.p645==1)) * !((i16.u176.p615==1)))) + EG(!((i16...662
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t46, t315, t331, t340, t344, t477, t482, t486, t487, t489, t492, t497, i0.u95.t206, i...1607
ITS-tools command line returned an error code 137
[2024-05-22 00:48:54] [INFO ] Applying decomposition
[2024-05-22 00:48:54] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:48:54] [INFO ] Decomposing Gal with order
[2024-05-22 00:48:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:48:54] [INFO ] Removed a total of 136 redundant transitions.
[2024-05-22 00:48:54] [INFO ] Flatten gal took : 37 ms
[2024-05-22 00:48:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 136 ms.
[2024-05-22 00:48:54] [INFO ] Time to serialize gal into /tmp/CTLFireability13747483988773127035.gal : 8 ms
[2024-05-22 00:48:54] [INFO ] Time to serialize properties into /tmp/CTLFireability1898258569964987328.ctl : 14 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/CTLFireability13747483988773127035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1898258569964987328.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 5 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 00:55:08] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:55:09] [INFO ] Input system was already deterministic with 501 transitions.
[2024-05-22 00:55:09] [INFO ] Transformed 569 places.
[2024-05-22 00:55:09] [INFO ] Transformed 501 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:55:39] [INFO ] Time to serialize gal into /tmp/CTLFireability9870027257894586097.gal : 3 ms
[2024-05-22 00:55:39] [INFO ] Time to serialize properties into /tmp/CTLFireability839050012932895432.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/CTLFireability9870027257894586097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability839050012932895432.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 -...327
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3106941 ms.

BK_STOP 1716340161709

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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-18"
export BK_EXAMINATION="CTLFireability"
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-18, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399800586"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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