About the Execution of ITS-Tools for Anderson-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1255.128 | 722814.00 | 807997.00 | 2472.10 | FFFTTTTFTTFTFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r004-smll-171620118300322.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Anderson-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118300322
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 12 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 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 185K 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 Anderson-PT-05-CTLFireability-2024-00
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-01
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-02
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-03
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-04
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-05
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-06
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-07
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-08
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-09
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-10
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-11
FORMULA_NAME Anderson-PT-05-CTLFireability-2023-12
FORMULA_NAME Anderson-PT-05-CTLFireability-2023-13
FORMULA_NAME Anderson-PT-05-CTLFireability-2023-14
FORMULA_NAME Anderson-PT-05-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716423039951
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-23 00:10:42] [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-23 00:10:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:10:43] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2024-05-23 00:10:43] [INFO ] Transformed 161 places.
[2024-05-23 00:10:43] [INFO ] Transformed 365 transitions.
[2024-05-23 00:10:43] [INFO ] Found NUPN structural information;
[2024-05-23 00:10:43] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 549 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 36 ms.
Support contains 86 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 365/365 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 356
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 356
Applied a total of 18 rules in 67 ms. Remains 152 /161 variables (removed 9) and now considering 356/365 (removed 9) transitions.
// Phase 1: matrix 356 rows 152 cols
[2024-05-23 00:10:43] [INFO ] Computed 13 invariants in 50 ms
[2024-05-23 00:10:43] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-23 00:10:43] [INFO ] Invariant cache hit.
[2024-05-23 00:10:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:10:44] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
Running 351 sub problems to find dead transitions.
[2024-05-23 00:10:44] [INFO ] Invariant cache hit.
[2024-05-23 00:10:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-23 00:10:48] [INFO ] Deduced a trap composed of 57 places in 310 ms of which 41 ms to minimize.
[2024-05-23 00:10:49] [INFO ] Deduced a trap composed of 58 places in 253 ms of which 3 ms to minimize.
[2024-05-23 00:10:49] [INFO ] Deduced a trap composed of 56 places in 200 ms of which 4 ms to minimize.
[2024-05-23 00:10:49] [INFO ] Deduced a trap composed of 99 places in 250 ms of which 3 ms to minimize.
[2024-05-23 00:10:49] [INFO ] Deduced a trap composed of 100 places in 211 ms of which 3 ms to minimize.
[2024-05-23 00:10:50] [INFO ] Deduced a trap composed of 111 places in 192 ms of which 4 ms to minimize.
[2024-05-23 00:10:50] [INFO ] Deduced a trap composed of 88 places in 180 ms of which 4 ms to minimize.
[2024-05-23 00:10:50] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:10:50] [INFO ] Deduced a trap composed of 91 places in 233 ms of which 3 ms to minimize.
[2024-05-23 00:10:50] [INFO ] Deduced a trap composed of 97 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:10:51] [INFO ] Deduced a trap composed of 72 places in 208 ms of which 3 ms to minimize.
[2024-05-23 00:10:51] [INFO ] Deduced a trap composed of 61 places in 219 ms of which 14 ms to minimize.
[2024-05-23 00:10:51] [INFO ] Deduced a trap composed of 107 places in 217 ms of which 4 ms to minimize.
[2024-05-23 00:10:51] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 2 ms to minimize.
[2024-05-23 00:10:52] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
[2024-05-23 00:10:52] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
[2024-05-23 00:10:52] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2024-05-23 00:10:52] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2024-05-23 00:10:52] [INFO ] Deduced a trap composed of 92 places in 223 ms of which 3 ms to minimize.
[2024-05-23 00:10:53] [INFO ] Deduced a trap composed of 80 places in 216 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-23 00:10:53] [INFO ] Deduced a trap composed of 77 places in 220 ms of which 3 ms to minimize.
[2024-05-23 00:10:54] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 4 ms to minimize.
[2024-05-23 00:10:54] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:10:54] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-05-23 00:10:54] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 2 ms to minimize.
[2024-05-23 00:10:54] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 2 ms to minimize.
[2024-05-23 00:10:54] [INFO ] Deduced a trap composed of 78 places in 161 ms of which 3 ms to minimize.
[2024-05-23 00:10:55] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:10:55] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-05-23 00:10:55] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:10:55] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:10:55] [INFO ] Deduced a trap composed of 86 places in 165 ms of which 2 ms to minimize.
[2024-05-23 00:10:56] [INFO ] Deduced a trap composed of 75 places in 200 ms of which 3 ms to minimize.
[2024-05-23 00:10:56] [INFO ] Deduced a trap composed of 58 places in 283 ms of which 3 ms to minimize.
[2024-05-23 00:10:56] [INFO ] Deduced a trap composed of 56 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:10:57] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:10:57] [INFO ] Deduced a trap composed of 73 places in 211 ms of which 3 ms to minimize.
[2024-05-23 00:10:57] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:10:57] [INFO ] Deduced a trap composed of 79 places in 202 ms of which 3 ms to minimize.
[2024-05-23 00:10:58] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-23 00:11:00] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:11:00] [INFO ] Deduced a trap composed of 98 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:11:01] [INFO ] Deduced a trap composed of 81 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:11:01] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:11:01] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 3 ms to minimize.
[2024-05-23 00:11:01] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 3 ms to minimize.
[2024-05-23 00:11:01] [INFO ] Deduced a trap composed of 75 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:11:02] [INFO ] Deduced a trap composed of 64 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:11:02] [INFO ] Deduced a trap composed of 71 places in 201 ms of which 4 ms to minimize.
[2024-05-23 00:11:02] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:11:03] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 4 ms to minimize.
[2024-05-23 00:11:03] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:11:03] [INFO ] Deduced a trap composed of 63 places in 190 ms of which 3 ms to minimize.
[2024-05-23 00:11:03] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 2 ms to minimize.
[2024-05-23 00:11:03] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 2 ms to minimize.
[2024-05-23 00:11:04] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 1 ms to minimize.
[2024-05-23 00:11:04] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:11:04] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:11:04] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:11:04] [INFO ] Deduced a trap composed of 71 places in 158 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-23 00:11:05] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 4 ms to minimize.
[2024-05-23 00:11:05] [INFO ] Deduced a trap composed of 90 places in 165 ms of which 3 ms to minimize.
[2024-05-23 00:11:05] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:11:06] [INFO ] Deduced a trap composed of 83 places in 198 ms of which 4 ms to minimize.
[2024-05-23 00:11:06] [INFO ] Deduced a trap composed of 84 places in 202 ms of which 3 ms to minimize.
[2024-05-23 00:11:06] [INFO ] Deduced a trap composed of 69 places in 201 ms of which 3 ms to minimize.
[2024-05-23 00:11:06] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 3 ms to minimize.
[2024-05-23 00:11:07] [INFO ] Deduced a trap composed of 55 places in 201 ms of which 4 ms to minimize.
[2024-05-23 00:11:07] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 3 ms to minimize.
[2024-05-23 00:11:07] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 3 ms to minimize.
[2024-05-23 00:11:07] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 3 ms to minimize.
[2024-05-23 00:11:07] [INFO ] Deduced a trap composed of 97 places in 215 ms of which 3 ms to minimize.
[2024-05-23 00:11:08] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 2 ms to minimize.
[2024-05-23 00:11:08] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:11:08] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
[2024-05-23 00:11:08] [INFO ] Deduced a trap composed of 74 places in 198 ms of which 3 ms to minimize.
[2024-05-23 00:11:08] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 4 ms to minimize.
[2024-05-23 00:11:09] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 2 ms to minimize.
[2024-05-23 00:11:09] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:11:09] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-23 00:11:10] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 2 ms to minimize.
[2024-05-23 00:11:10] [INFO ] Deduced a trap composed of 88 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:11:11] [INFO ] Deduced a trap composed of 90 places in 205 ms of which 3 ms to minimize.
[2024-05-23 00:11:11] [INFO ] Deduced a trap composed of 63 places in 176 ms of which 3 ms to minimize.
[2024-05-23 00:11:12] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 4 ms to minimize.
[2024-05-23 00:11:12] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 2 ms to minimize.
[2024-05-23 00:11:12] [INFO ] Deduced a trap composed of 102 places in 202 ms of which 2 ms to minimize.
[2024-05-23 00:11:13] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:11:13] [INFO ] Deduced a trap composed of 92 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:11:13] [INFO ] Deduced a trap composed of 101 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:11:13] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:11:13] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 2 ms to minimize.
[2024-05-23 00:11:14] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 2 ms to minimize.
[2024-05-23 00:11:14] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 2 ms to minimize.
[2024-05-23 00:11:15] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:11:15] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 3 ms to minimize.
[2024-05-23 00:11:15] [INFO ] Deduced a trap composed of 77 places in 176 ms of which 2 ms to minimize.
SMT process timed out in 30924ms, After SMT, problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 30976ms
Starting structural reductions in LTL mode, iteration 1 : 152/161 places, 356/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32336 ms. Remains : 152/161 places, 356/365 transitions.
Support contains 86 out of 152 places after structural reductions.
[2024-05-23 00:11:16] [INFO ] Flatten gal took : 129 ms
[2024-05-23 00:11:16] [INFO ] Flatten gal took : 66 ms
[2024-05-23 00:11:16] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 84 out of 152 places (down from 86) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3117 ms. (12 steps per ms) remains 25/89 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 21/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
[2024-05-23 00:11:17] [INFO ] Invariant cache hit.
[2024-05-23 00:11:17] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 1 (OVERLAPS) 117/150 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/152 variables, 4/13 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 356/508 variables, 152/165 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 20/185 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 0/185 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/508 variables, 0/185 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 185 constraints, problems are : Problem set: 9 solved, 4 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/78 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 66/144 variables, 3/6 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/152 variables, 7/13 constraints. Problems are: Problem set: 9 solved, 4 unsolved
[2024-05-23 00:11:18] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 3 ms to minimize.
[2024-05-23 00:11:18] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 2/15 constraints. Problems are: Problem set: 9 solved, 4 unsolved
[2024-05-23 00:11:18] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 2 ms to minimize.
[2024-05-23 00:11:18] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 2 ms to minimize.
[2024-05-23 00:11:19] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 3/18 constraints. Problems are: Problem set: 9 solved, 4 unsolved
[2024-05-23 00:11:19] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 1/19 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 356/508 variables, 152/171 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/508 variables, 20/191 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 4/195 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 0/195 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/508 variables, 0/195 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 195 constraints, problems are : Problem set: 9 solved, 4 unsolved in 1815 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/13 constraints, Known Traps: 6/6 constraints]
After SMT, in 2347ms problems are : Problem set: 9 solved, 4 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 10 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 356/356 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 152 transition count 338
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 134 transition count 338
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 62 place count 108 transition count 176
Iterating global reduction 0 with 26 rules applied. Total rules applied 88 place count 108 transition count 176
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 106 transition count 174
Applied a total of 92 rules in 59 ms. Remains 106 /152 variables (removed 46) and now considering 174/356 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 106/152 places, 174/356 transitions.
RANDOM walk for 40000 steps (8 resets) in 344 ms. (115 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 81 ms. (487 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
// Phase 1: matrix 174 rows 106 cols
[2024-05-23 00:11:20] [INFO ] Computed 13 invariants in 9 ms
[2024-05-23 00:11:20] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/103 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/106 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 174/280 variables, 106/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/280 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/103 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/106 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 174/280 variables, 106/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 350ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 174/174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 103 transition count 147
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 102 transition count 146
Applied a total of 8 rules in 28 ms. Remains 102 /106 variables (removed 4) and now considering 146/174 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 102/106 places, 146/174 transitions.
RANDOM walk for 40000 steps (8 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5748 steps, run visited all 1 properties in 41 ms. (steps per millisecond=140 )
Probabilistic random walk after 5748 steps, saw 3055 distinct states, run finished after 47 ms. (steps per millisecond=122 ) properties seen :1
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2024-05-23 00:11:20] [INFO ] Flatten gal took : 41 ms
[2024-05-23 00:11:20] [INFO ] Flatten gal took : 48 ms
[2024-05-23 00:11:21] [INFO ] Input system was already deterministic with 356 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 128 transition count 228
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 128 transition count 228
Applied a total of 48 rules in 10 ms. Remains 128 /152 variables (removed 24) and now considering 228/356 (removed 128) transitions.
// Phase 1: matrix 228 rows 128 cols
[2024-05-23 00:11:21] [INFO ] Computed 13 invariants in 5 ms
[2024-05-23 00:11:21] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-23 00:11:21] [INFO ] Invariant cache hit.
[2024-05-23 00:11:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:11:21] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-05-23 00:11:21] [INFO ] Invariant cache hit.
[2024-05-23 00:11:21] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-23 00:11:23] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:11:23] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 3 ms to minimize.
[2024-05-23 00:11:23] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 3 ms to minimize.
[2024-05-23 00:11:23] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:11:23] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:11:23] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 5 ms to minimize.
[2024-05-23 00:11:24] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:11:24] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 3 ms to minimize.
[2024-05-23 00:11:24] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 3 ms to minimize.
[2024-05-23 00:11:24] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:11:24] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:11:24] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:11:25] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 3 ms to minimize.
[2024-05-23 00:11:25] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:11:25] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 2 ms to minimize.
[2024-05-23 00:11:25] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 3 ms to minimize.
[2024-05-23 00:11:25] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2024-05-23 00:11:25] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 2 ms to minimize.
[2024-05-23 00:11:26] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 3 ms to minimize.
[2024-05-23 00:11:26] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-23 00:11:26] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 3 ms to minimize.
[2024-05-23 00:11:26] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:11:26] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 3 ms to minimize.
[2024-05-23 00:11:27] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 3 ms to minimize.
[2024-05-23 00:11:27] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:11:27] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:11:27] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:11:27] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 1 ms to minimize.
[2024-05-23 00:11:27] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:11:28] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:11:28] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 3 ms to minimize.
[2024-05-23 00:11:28] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 2 ms to minimize.
[2024-05-23 00:11:28] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 3 ms to minimize.
[2024-05-23 00:11:28] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 3 ms to minimize.
[2024-05-23 00:11:29] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 2 ms to minimize.
[2024-05-23 00:11:29] [INFO ] Deduced a trap composed of 82 places in 161 ms of which 3 ms to minimize.
[2024-05-23 00:11:29] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-23 00:11:31] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:11:32] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 3 ms to minimize.
[2024-05-23 00:11:32] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 2 ms to minimize.
[2024-05-23 00:11:32] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 3 ms to minimize.
[2024-05-23 00:11:32] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-23 00:11:34] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:11:34] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:11:34] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:11:34] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 3 ms to minimize.
[2024-05-23 00:11:34] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
[2024-05-23 00:11:35] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-23 00:11:37] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:11:38] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:11:38] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-23 00:11:40] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 2 ms to minimize.
[2024-05-23 00:11:41] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-23 00:11:43] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-23 00:11:44] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 3 ms to minimize.
[2024-05-23 00:11:44] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-23 00:11:48] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-23 00:11:50] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-23 00:11:51] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-05-23 00:11:51] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 2 ms to minimize.
[2024-05-23 00:11:51] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 2 ms to minimize.
SMT process timed out in 30235ms, After SMT, problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 30241ms
Starting structural reductions in LTL mode, iteration 1 : 128/152 places, 228/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30908 ms. Remains : 128/152 places, 228/356 transitions.
[2024-05-23 00:11:51] [INFO ] Flatten gal took : 30 ms
[2024-05-23 00:11:52] [INFO ] Flatten gal took : 25 ms
[2024-05-23 00:11:52] [INFO ] Input system was already deterministic with 228 transitions.
[2024-05-23 00:11:52] [INFO ] Flatten gal took : 32 ms
[2024-05-23 00:11:52] [INFO ] Flatten gal took : 23 ms
[2024-05-23 00:11:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2398025397236597468.gal : 18 ms
[2024-05-23 00:11:52] [INFO ] Time to serialize properties into /tmp/CTLFireability4580304775256723818.ctl : 5 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/CTLFireability2398025397236597468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4580304775256723818.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,124410,7.31376,155424,2,20241,5,381706,6,0,743,296267,0
Converting to forward existential form...Done !
original formula: A((((!((!((((((next_3==1)&&(ncs_0_1==1))||((next_3==1)&&(ncs_0_4==1)))&&(slot_F.F.F.T.F==1))&&((p2_0_3==1)&&(next_3==1)))&&(ncs_1_2==1)))...487
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG((!((EX(((slot_T.F.F.F.F==1)&&(p3_1_0==1))) + !((E(!(((next_6==1)&&(ncs_3_0==1))) U (!(((ne...1135
Reverse transition relation is NOT exact ! Due to transitions t203, t204, t205, t206, t207, t208, t209, t210, t211, t212, t213, t214, t215, t216, t217, t21...312
(forward)formula 0,0,22.8257,404932,1,0,410,1.85508e+06,494,243,5989,808296,493
FORMULA Anderson-PT-05-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 166
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 166
Applied a total of 60 rules in 8 ms. Remains 122 /152 variables (removed 30) and now considering 166/356 (removed 190) transitions.
// Phase 1: matrix 166 rows 122 cols
[2024-05-23 00:12:15] [INFO ] Computed 13 invariants in 4 ms
[2024-05-23 00:12:15] [INFO ] Implicit Places using invariants in 373 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 379 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/152 places, 166/356 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 390 ms. Remains : 121/152 places, 166/356 transitions.
[2024-05-23 00:12:15] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:12:15] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:12:15] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-23 00:12:15] [INFO ] Flatten gal took : 26 ms
[2024-05-23 00:12:15] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:12:15] [INFO ] Time to serialize gal into /tmp/CTLFireability2228838024031854450.gal : 4 ms
[2024-05-23 00:12:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3784822064949046951.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/CTLFireability2228838024031854450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3784822064949046951.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,68178,0.789115,17632,2,9156,5,52715,6,0,653,42744,0
Converting to forward existential form...Done !
original formula: EF(AX(EX((p1_0_8==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX((p1_0_8==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t54, t59, t64, t69, t73, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t151, t1...337
(forward)formula 0,0,4.42393,110320,1,0,347,462924,348,172,4416,209187,343
FORMULA Anderson-PT-05-CTLFireability-2024-01 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 : 152/152 places, 356/356 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 166
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 166
Applied a total of 60 rules in 14 ms. Remains 122 /152 variables (removed 30) and now considering 166/356 (removed 190) transitions.
// Phase 1: matrix 166 rows 122 cols
[2024-05-23 00:12:20] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:12:20] [INFO ] Implicit Places using invariants in 244 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 245 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/152 places, 166/356 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 264 ms. Remains : 121/152 places, 166/356 transitions.
[2024-05-23 00:12:20] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:12:20] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:12:20] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-23 00:12:20] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:12:20] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:12:20] [INFO ] Time to serialize gal into /tmp/CTLFireability5992006045740986264.gal : 2 ms
[2024-05-23 00:12:20] [INFO ] Time to serialize properties into /tmp/CTLFireability10326404458220264625.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/CTLFireability5992006045740986264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10326404458220264625.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,67098,0.571848,21596,2,9844,5,59359,6,0,653,49032,0
Converting to forward existential form...Done !
original formula: EX(AG((p1_2_6==0)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((p1_2_6==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t47, t48, t49, t52, t53, t54, t62, t63, t64, t67, t68, t69, t79, t141, t142, t143, t144, t145...377
(forward)formula 0,0,7.42002,171840,1,0,376,875851,354,183,4548,367385,380
FORMULA Anderson-PT-05-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 152 transition count 336
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 132 transition count 336
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 71 place count 101 transition count 145
Iterating global reduction 0 with 31 rules applied. Total rules applied 102 place count 101 transition count 145
Applied a total of 102 rules in 18 ms. Remains 101 /152 variables (removed 51) and now considering 145/356 (removed 211) transitions.
// Phase 1: matrix 145 rows 101 cols
[2024-05-23 00:12:28] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:12:28] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-23 00:12:28] [INFO ] Invariant cache hit.
[2024-05-23 00:12:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:12:28] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2024-05-23 00:12:28] [INFO ] Redundant transitions in 8 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-23 00:12:28] [INFO ] Invariant cache hit.
[2024-05-23 00:12:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:12:30] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 2 ms to minimize.
[2024-05-23 00:12:31] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 2 ms to minimize.
[2024-05-23 00:12:31] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 2 ms to minimize.
[2024-05-23 00:12:31] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:12:31] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:12:31] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:12:31] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:12:31] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:12:31] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:12:31] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 3 ms to minimize.
[2024-05-23 00:12:31] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:12:31] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:12:32] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-23 00:12:32] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:12:32] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:12:32] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:12:32] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:12:32] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:12:32] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:12:33] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:12:33] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:12:34] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-23 00:12:34] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:12:34] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 1 ms to minimize.
[2024-05-23 00:12:34] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:12:34] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:12:34] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 1 ms to minimize.
[2024-05-23 00:12:35] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-05-23 00:12:35] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 3 ms to minimize.
[2024-05-23 00:12:35] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:12:35] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 2 ms to minimize.
[2024-05-23 00:12:35] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
[2024-05-23 00:12:35] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:12:36] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 1 ms to minimize.
[2024-05-23 00:12:36] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:12:36] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:12:37] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-05-23 00:12:37] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:12:38] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:12:38] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-23 00:12:38] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 2 ms to minimize.
[2024-05-23 00:12:38] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:12:40] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:12:41] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:12:41] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:12:41] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/101 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/101 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 15 (OVERLAPS) 145/246 variables, 101/160 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 18 (OVERLAPS) 0/246 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 180 constraints, problems are : Problem set: 0 solved, 140 unsolved in 23436 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 101/101 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:12:54] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:12:54] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:12:55] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:12:55] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:12:56] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:12:56] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:12:56] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:12:56] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:12:56] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:12:57] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:12:57] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:12:57] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:12:57] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:12:57] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:12:58] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 11/74 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 145/246 variables, 101/175 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 140/335 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 335 constraints, problems are : Problem set: 0 solved, 140 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 101/101 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 61/61 constraints]
After SMT, in 53590ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 53593ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/152 places, 145/356 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54210 ms. Remains : 101/152 places, 145/356 transitions.
[2024-05-23 00:13:22] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:13:22] [INFO ] Flatten gal took : 31 ms
[2024-05-23 00:13:22] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-23 00:13:22] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:13:22] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:13:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1543919677596533404.gal : 4 ms
[2024-05-23 00:13:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5319103323741562397.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/CTLFireability1543919677596533404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5319103323741562397.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,8145,0.529646,20604,2,10079,5,52820,6,0,552,29016,0
Converting to forward existential form...Done !
original formula: EG(((slot_F.F.F.F.F==0)||(cs_4_0==0)))
=> equivalent forward existential formula: [FwdG(Init,((slot_F.F.F.F.F==0)||(cs_4_0==0)))] != FALSE
Hit Full ! (commute/partial/dont) 95/0/50
(forward)formula 0,1,3.55717,93872,1,0,7,383723,19,2,3207,105905,8
FORMULA Anderson-PT-05-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 128 transition count 228
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 128 transition count 228
Applied a total of 48 rules in 4 ms. Remains 128 /152 variables (removed 24) and now considering 228/356 (removed 128) transitions.
// Phase 1: matrix 228 rows 128 cols
[2024-05-23 00:13:25] [INFO ] Computed 13 invariants in 4 ms
[2024-05-23 00:13:26] [INFO ] Implicit Places using invariants in 178 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/152 places, 228/356 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 185 ms. Remains : 127/152 places, 228/356 transitions.
[2024-05-23 00:13:26] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:13:26] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:13:26] [INFO ] Input system was already deterministic with 228 transitions.
[2024-05-23 00:13:26] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:13:26] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:13:26] [INFO ] Time to serialize gal into /tmp/CTLFireability17694810543086999288.gal : 8 ms
[2024-05-23 00:13:26] [INFO ] Time to serialize properties into /tmp/CTLFireability12180513621047390216.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/CTLFireability17694810543086999288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12180513621047390216.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,124410,2.30095,66112,2,12531,5,168503,6,0,739,122454,0
Converting to forward existential form...Done !
original formula: EG(E(A((AG(((next_3==1)&&(ncs_2_0==1))) * A(((slot_F.F.F.F.T==1)&&(p3_1_4==1)) U ((next_1==1)&&(ncs_1_1==1)))) U AF(((slot_F.F.T.F.F==1)&...419
=> equivalent forward existential formula: [FwdG(Init,E(!((E(!(!(EG(!(((slot_F.F.T.F.F==1)&&(p3_2_2==1)))))) U (!((!(E(TRUE U !(((next_3==1)&&(ncs_2_0==1))...855
Reverse transition relation is NOT exact ! Due to transitions t203, t204, t205, t206, t207, t208, t209, t210, t211, t212, t213, t214, t215, t216, t217, t21...312
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-23 00:13:56] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:13:56] [INFO ] Applying decomposition
[2024-05-23 00:13:56] [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/graph17851238068875101908.txt' '-o' '/tmp/graph17851238068875101908.bin' '-w' '/tmp/graph17851238068875101908.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17851238068875101908.bin' '-l' '-1' '-v' '-w' '/tmp/graph17851238068875101908.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:13:56] [INFO ] Decomposing Gal with order
[2024-05-23 00:13:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:13:56] [INFO ] Removed a total of 441 redundant transitions.
[2024-05-23 00:13:56] [INFO ] Flatten gal took : 78 ms
[2024-05-23 00:13:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 27 ms.
[2024-05-23 00:13:56] [INFO ] Time to serialize gal into /tmp/CTLFireability13107956720582090760.gal : 18 ms
[2024-05-23 00:13:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16728106465042317835.ctl : 8 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/CTLFireability13107956720582090760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16728106465042317835.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,124410,0.694202,16000,1144,27,23971,123,695,24670,35,201,0
Converting to forward existential form...Done !
original formula: EG(E(A((AG(((i0.i0.u1.next_3==1)&&(i7.i2.u47.ncs_2_0==1))) * A(((i6.u33.slot_F.F.F.F.T==1)&&(i6.u36.p3_1_4==1)) U ((i0.i0.u0.next_1==1)&&...613
=> equivalent forward existential formula: [FwdG(Init,E(!((E(!(!(EG(!(((i3.i2.u32.slot_F.F.T.F.F==1)&&(i7.i0.u24.p3_2_2==1)))))) U (!((!(E(TRUE U !(((i0.i0...1191
Reverse transition relation is NOT exact ! Due to transitions t203, t204, t205, t206, t207, t208, t209, t210, t211, t212, t213, t214, t216, t217, t218, t22...318
(forward)formula 0,1,3.53425,91504,1,0,176795,248,4130,166050,183,616,694217
FORMULA Anderson-PT-05-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 174
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 174
Applied a total of 60 rules in 3 ms. Remains 122 /152 variables (removed 30) and now considering 174/356 (removed 182) transitions.
// Phase 1: matrix 174 rows 122 cols
[2024-05-23 00:14:00] [INFO ] Computed 13 invariants in 3 ms
[2024-05-23 00:14:00] [INFO ] Implicit Places using invariants in 153 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 162 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/152 places, 174/356 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 121/152 places, 174/356 transitions.
[2024-05-23 00:14:00] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:14:00] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:14:00] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-23 00:14:00] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:14:00] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:14:00] [INFO ] Time to serialize gal into /tmp/CTLFireability10931592875162875678.gal : 2 ms
[2024-05-23 00:14:00] [INFO ] Time to serialize properties into /tmp/CTLFireability8517972599188887139.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/CTLFireability10931592875162875678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8517972599188887139.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,69630,0.715008,20632,2,10276,5,60453,6,0,661,49046,0
Converting to forward existential form...Done !
original formula: EG((AX(((next_8==0)||(p1_0_4==0))) + AF((((next_3==0)||(ncs_3_3==0))||((slot_F.T.F.F.F==0)||(p2_0_1==0))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(((next_8==0)||(p1_0_4==0))))) + !(EG(!((((next_3==0)||(ncs_3_3==0))||((slot_F.T.F.F.F==0)||(p...181
Reverse transition relation is NOT exact ! Due to transitions t149, t150, t151, t152, t153, t154, t155, t156, t157, t158, t159, t160, t161, t162, t163, t16...312
(forward)formula 0,1,5.01631,143280,1,0,353,526589,375,185,4853,264088,374
FORMULA Anderson-PT-05-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 127 transition count 203
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 127 transition count 203
Applied a total of 50 rules in 3 ms. Remains 127 /152 variables (removed 25) and now considering 203/356 (removed 153) transitions.
// Phase 1: matrix 203 rows 127 cols
[2024-05-23 00:14:05] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:14:05] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-23 00:14:05] [INFO ] Invariant cache hit.
[2024-05-23 00:14:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:14:06] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-23 00:14:06] [INFO ] Invariant cache hit.
[2024-05-23 00:14:06] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-23 00:14:07] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:14:07] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 3 ms to minimize.
[2024-05-23 00:14:07] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:14:07] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:14:07] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 4 ms to minimize.
[2024-05-23 00:14:07] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:14:08] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:14:08] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:14:08] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:14:08] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:14:08] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 2 ms to minimize.
[2024-05-23 00:14:09] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 2 ms to minimize.
[2024-05-23 00:14:09] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:14:09] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:14:09] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:14:10] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:14:10] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:14:10] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:14:10] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:14:10] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-23 00:14:10] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:14:11] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:14:11] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 3 ms to minimize.
[2024-05-23 00:14:11] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:14:11] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2024-05-23 00:14:12] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 2 ms to minimize.
[2024-05-23 00:14:12] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 2 ms to minimize.
[2024-05-23 00:14:12] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:14:12] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 2 ms to minimize.
[2024-05-23 00:14:12] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:14:13] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:14:13] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 2 ms to minimize.
[2024-05-23 00:14:13] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-23 00:14:14] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:14:15] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:14:16] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2024-05-23 00:14:16] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 3 ms to minimize.
[2024-05-23 00:14:16] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 3 ms to minimize.
[2024-05-23 00:14:16] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-23 00:14:17] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 3 ms to minimize.
[2024-05-23 00:14:17] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 2 ms to minimize.
[2024-05-23 00:14:17] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:14:18] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 3 ms to minimize.
[2024-05-23 00:14:18] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 3 ms to minimize.
[2024-05-23 00:14:19] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-23 00:14:19] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 3 ms to minimize.
[2024-05-23 00:14:19] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-23 00:14:20] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:14:21] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 3 ms to minimize.
[2024-05-23 00:14:21] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:14:21] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 2 ms to minimize.
[2024-05-23 00:14:21] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 3 ms to minimize.
[2024-05-23 00:14:21] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 2 ms to minimize.
[2024-05-23 00:14:21] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 2 ms to minimize.
[2024-05-23 00:14:21] [INFO ] Deduced a trap composed of 74 places in 154 ms of which 2 ms to minimize.
[2024-05-23 00:14:22] [INFO ] Deduced a trap composed of 54 places in 149 ms of which 2 ms to minimize.
[2024-05-23 00:14:22] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 3 ms to minimize.
[2024-05-23 00:14:22] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 2 ms to minimize.
[2024-05-23 00:14:22] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 3 ms to minimize.
[2024-05-23 00:14:22] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 4 ms to minimize.
[2024-05-23 00:14:23] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-23 00:14:24] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:14:25] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:14:25] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-23 00:14:26] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:14:26] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 3 ms to minimize.
[2024-05-23 00:14:27] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:14:27] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 3 ms to minimize.
[2024-05-23 00:14:27] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:14:27] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:14:27] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:14:27] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:14:27] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 3 ms to minimize.
[2024-05-23 00:14:28] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:14:28] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:14:28] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-05-23 00:14:28] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:14:28] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:14:29] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:14:29] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-23 00:14:29] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 3 ms to minimize.
[2024-05-23 00:14:30] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 203/330 variables, 127/222 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 330/330 variables, and 242 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 82/95 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-23 00:14:38] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 2 ms to minimize.
[2024-05-23 00:14:38] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:14:38] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:14:38] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:14:39] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2024-05-23 00:14:39] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 127/330 variables, and 101 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/198 constraints, Known Traps: 88/88 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 127/152 places, 203/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60795 ms. Remains : 127/152 places, 203/356 transitions.
[2024-05-23 00:15:06] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:15:06] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:15:06] [INFO ] Input system was already deterministic with 203 transitions.
[2024-05-23 00:15:06] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:15:06] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:15:06] [INFO ] Time to serialize gal into /tmp/CTLFireability16626968440557910478.gal : 3 ms
[2024-05-23 00:15:06] [INFO ] Time to serialize properties into /tmp/CTLFireability11411499959210445640.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/CTLFireability16626968440557910478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11411499959210445640.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,103914,4.44745,109904,2,17304,5,290946,6,0,714,217949,0
Converting to forward existential form...Done !
original formula: (A(((EX(!((((p1_1_5==1)||((next_0==1)&&(ncs_0_1==1)))&&(p1_0_7!=1)))) * (slot_F.T.F.F.F==1)) * (p2_1_1==1)) U (((next_4==1)&&(ncs_1_3==1)...327
=> equivalent forward existential formula: ([((Init * !(EG(!((((next_4==1)&&(ncs_1_3==1)) + !(!(EG(!(((slot_F.F.T.F.F==1)&&(p2_2_2==1))))))))))) * !(E(!(((...592
Reverse transition relation is NOT exact ! Due to transitions t27, t30, t31, t32, t45, t48, t49, t50, t72, t75, t76, t77, t82, t83, t84, t85, t89, t90, t92...485
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-23 00:15:36] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:15:36] [INFO ] Applying decomposition
[2024-05-23 00:15:36] [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/graph9268215219378315344.txt' '-o' '/tmp/graph9268215219378315344.bin' '-w' '/tmp/graph9268215219378315344.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9268215219378315344.bin' '-l' '-1' '-v' '-w' '/tmp/graph9268215219378315344.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:15:36] [INFO ] Decomposing Gal with order
[2024-05-23 00:15:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:15:36] [INFO ] Removed a total of 272 redundant transitions.
[2024-05-23 00:15:36] [INFO ] Flatten gal took : 23 ms
[2024-05-23 00:15:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 4 ms.
[2024-05-23 00:15:36] [INFO ] Time to serialize gal into /tmp/CTLFireability16670761141485230652.gal : 4 ms
[2024-05-23 00:15:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12911503085919452185.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/CTLFireability16670761141485230652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12911503085919452185.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,103914,0.43902,13088,969,951,14184,4583,495,16200,295,5560,0
Converting to forward existential form...Done !
original formula: (A(((EX(!((((i3.u7.p1_1_5==1)||((i1.u1.next_0==1)&&(i2.u16.ncs_0_1==1)))&&(i2.u6.p1_0_7!=1)))) * (u0.slot_F.T.F.F.F==1)) * (i3.u18.p2_1_1...427
=> equivalent forward existential formula: ([((Init * !(EG(!((((i1.u2.next_4==1)&&(i3.u18.ncs_1_3==1)) + !(!(EG(!(((u0.slot_F.F.T.F.F==1)&&(i4.u22.p2_2_2==...738
Reverse transition relation is NOT exact ! Due to transitions t27, t30, t31, t32, t45, t48, t49, t50, t72, t75, t76, t77, t179, t182, t186, t187, t190, t19...473
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
(forward)formula 0,1,2.10926,64832,1,0,106250,26460,2471,100274,1613,79334,356245
FORMULA Anderson-PT-05-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 152 transition count 336
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 132 transition count 336
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 69 place count 103 transition count 163
Iterating global reduction 0 with 29 rules applied. Total rules applied 98 place count 103 transition count 163
Applied a total of 98 rules in 15 ms. Remains 103 /152 variables (removed 49) and now considering 163/356 (removed 193) transitions.
// Phase 1: matrix 163 rows 103 cols
[2024-05-23 00:15:38] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:15:38] [INFO ] Implicit Places using invariants in 164 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 102/152 places, 163/356 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 102 transition count 140
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 79 transition count 140
Applied a total of 46 rules in 9 ms. Remains 79 /102 variables (removed 23) and now considering 140/163 (removed 23) transitions.
// Phase 1: matrix 140 rows 79 cols
[2024-05-23 00:15:38] [INFO ] Computed 12 invariants in 2 ms
[2024-05-23 00:15:39] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-23 00:15:39] [INFO ] Invariant cache hit.
[2024-05-23 00:15:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:15:39] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 79/152 places, 140/356 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 603 ms. Remains : 79/152 places, 140/356 transitions.
[2024-05-23 00:15:39] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:15:39] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:15:39] [INFO ] Input system was already deterministic with 140 transitions.
[2024-05-23 00:15:39] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:15:39] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:15:39] [INFO ] Time to serialize gal into /tmp/CTLFireability8999638053432930443.gal : 2 ms
[2024-05-23 00:15:39] [INFO ] Time to serialize properties into /tmp/CTLFireability1176242547360741042.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/CTLFireability8999638053432930443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1176242547360741042.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,7980,0.730622,17588,2,6072,5,41179,6,0,459,30902,0
Converting to forward existential form...Done !
original formula: !(E(EF(!(((next_3==1)&&(ncs_2_2==1)))) U ((next_1==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(((next_3==1)&&(ncs_2_2==1))))) * ((next_1==1)&&(ncs_0_1==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t93, t95, t96, t97, t98, t99, t100, t101, t102, t103, t104, t106, t107, t108, t109, t110, t11...306
(forward)formula 0,0,3.31131,80004,1,0,291,334195,304,143,3879,161008,293
FORMULA Anderson-PT-05-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 152 transition count 336
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 132 transition count 336
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 64 place count 108 transition count 208
Iterating global reduction 0 with 24 rules applied. Total rules applied 88 place count 108 transition count 208
Applied a total of 88 rules in 17 ms. Remains 108 /152 variables (removed 44) and now considering 208/356 (removed 148) transitions.
// Phase 1: matrix 208 rows 108 cols
[2024-05-23 00:15:42] [INFO ] Computed 13 invariants in 3 ms
[2024-05-23 00:15:42] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-23 00:15:42] [INFO ] Invariant cache hit.
[2024-05-23 00:15:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:15:43] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2024-05-23 00:15:43] [INFO ] Redundant transitions in 14 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-23 00:15:43] [INFO ] Invariant cache hit.
[2024-05-23 00:15:43] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:15:44] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:15:44] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 3 ms to minimize.
[2024-05-23 00:15:45] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:15:45] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 2 ms to minimize.
[2024-05-23 00:15:45] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 3 ms to minimize.
[2024-05-23 00:15:45] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:15:45] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:15:45] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:15:46] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:15:46] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-05-23 00:15:46] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:15:46] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-05-23 00:15:46] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:15:46] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:15:46] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:15:46] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:15:46] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 2 ms to minimize.
[2024-05-23 00:15:47] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-05-23 00:15:47] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 2 ms to minimize.
[2024-05-23 00:15:47] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:15:47] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:15:48] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:15:48] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 1 ms to minimize.
[2024-05-23 00:15:48] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:15:48] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:15:48] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:15:48] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:15:48] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:15:48] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:15:48] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:15:49] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:15:49] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:15:49] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:15:49] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:15:49] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:15:49] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:15:49] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2024-05-23 00:15:49] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2024-05-23 00:15:49] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 1 ms to minimize.
[2024-05-23 00:15:50] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:15:51] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:15:51] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:15:51] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:15:51] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 3 ms to minimize.
[2024-05-23 00:15:51] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:15:52] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:15:52] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 3 ms to minimize.
[2024-05-23 00:15:52] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:15:52] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:15:52] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:15:53] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:15:53] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-05-23 00:15:53] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 2 ms to minimize.
[2024-05-23 00:15:53] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:15:54] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:15:55] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 5 ms to minimize.
[2024-05-23 00:15:55] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-05-23 00:15:55] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:15:55] [INFO ] Deduced a trap composed of 68 places in 137 ms of which 5 ms to minimize.
[2024-05-23 00:15:56] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 3 ms to minimize.
[2024-05-23 00:15:56] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:15:56] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:15:56] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 9/76 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:15:58] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:15:58] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:15:59] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:15:59] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:16:00] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:16:00] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 2 ms to minimize.
[2024-05-23 00:16:00] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:16:01] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:16:01] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:16:02] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:16:03] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:16:07] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:16:08] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 3 ms to minimize.
[2024-05-23 00:16:08] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:16:08] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 2 ms to minimize.
[2024-05-23 00:16:09] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
[2024-05-23 00:16:09] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:16:11] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:16:11] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:16:11] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-05-23 00:16:11] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 3 ms to minimize.
[2024-05-23 00:16:11] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 3 ms to minimize.
[2024-05-23 00:16:12] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 2 ms to minimize.
[2024-05-23 00:16:12] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 2 ms to minimize.
[2024-05-23 00:16:12] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 3 ms to minimize.
[2024-05-23 00:16:12] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 3 ms to minimize.
[2024-05-23 00:16:12] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:16:13] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 108/316 variables, and 104 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 91/91 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:16:14] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-05-23 00:16:15] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 2 ms to minimize.
[2024-05-23 00:16:15] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:16:15] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 3 ms to minimize.
[2024-05-23 00:16:16] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:16:17] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:16:18] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:16:18] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:16:18] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 3 ms to minimize.
[2024-05-23 00:16:18] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:16:19] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:16:21] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:16:21] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:16:24] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:16:24] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-23 00:16:26] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:16:26] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 203 unsolved
SMT process timed out in 60203ms, After SMT, problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Starting structural reductions in SI_CTL mode, iteration 1 : 108/152 places, 208/356 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60812 ms. Remains : 108/152 places, 208/356 transitions.
[2024-05-23 00:16:43] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:16:43] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:16:43] [INFO ] Input system was already deterministic with 208 transitions.
[2024-05-23 00:16:43] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:16:43] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:16:43] [INFO ] Time to serialize gal into /tmp/CTLFireability854303201112541079.gal : 2 ms
[2024-05-23 00:16:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8124129468253027696.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/CTLFireability854303201112541079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8124129468253027696.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.
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,24604,3.39321,94772,2,12687,5,236264,6,0,643,169248,0
Converting to forward existential form...Done !
original formula: AF(((EF(((((next_0==1)&&(ncs_0_1==1))||((next_6==1)&&(ncs_3_3==1)))||(((next_0==1)&&(ncs_2_4==1))||((next_4==1)&&(ncs_4_3==1))))) + A(((n...381
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U ((((next_0==1)&&(ncs_0_1==1))||((next_6==1)&&(ncs_3_3==1)))||(((next_0==1)&&(ncs_2_4==1)...515
Reverse transition relation is NOT exact ! Due to transitions t163, t164, t165, t166, t167, t168, t169, t170, t171, t172, t173, t174, t175, t176, t177, t17...312
(forward)formula 0,1,15.7758,352316,1,0,389,2.02649e+06,454,232,5561,669212,477
FORMULA Anderson-PT-05-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 127 transition count 219
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 127 transition count 219
Applied a total of 50 rules in 5 ms. Remains 127 /152 variables (removed 25) and now considering 219/356 (removed 137) transitions.
// Phase 1: matrix 219 rows 127 cols
[2024-05-23 00:16:59] [INFO ] Computed 13 invariants in 3 ms
[2024-05-23 00:16:59] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-23 00:16:59] [INFO ] Invariant cache hit.
[2024-05-23 00:16:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:17:00] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-23 00:17:00] [INFO ] Invariant cache hit.
[2024-05-23 00:17:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-23 00:17:01] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:17:01] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:17:01] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:17:01] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:17:01] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 2 ms to minimize.
[2024-05-23 00:17:01] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:17:02] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 3 ms to minimize.
[2024-05-23 00:17:02] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:17:02] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:17:02] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 3 ms to minimize.
[2024-05-23 00:17:02] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:17:03] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 2 ms to minimize.
[2024-05-23 00:17:03] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:17:03] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 2 ms to minimize.
[2024-05-23 00:17:03] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 3 ms to minimize.
[2024-05-23 00:17:03] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 2 ms to minimize.
[2024-05-23 00:17:03] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 2 ms to minimize.
[2024-05-23 00:17:04] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 2 ms to minimize.
[2024-05-23 00:17:04] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:17:04] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-23 00:17:04] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 3 ms to minimize.
[2024-05-23 00:17:05] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:17:05] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 2 ms to minimize.
[2024-05-23 00:17:05] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:17:06] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 3 ms to minimize.
[2024-05-23 00:17:06] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 2 ms to minimize.
[2024-05-23 00:17:06] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:17:06] [INFO ] Deduced a trap composed of 69 places in 139 ms of which 2 ms to minimize.
[2024-05-23 00:17:07] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 3 ms to minimize.
[2024-05-23 00:17:07] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 3 ms to minimize.
[2024-05-23 00:17:07] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 3 ms to minimize.
[2024-05-23 00:17:07] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-23 00:17:09] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 3 ms to minimize.
[2024-05-23 00:17:09] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 2 ms to minimize.
[2024-05-23 00:17:10] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 2 ms to minimize.
[2024-05-23 00:17:10] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 2 ms to minimize.
[2024-05-23 00:17:10] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:17:10] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 2 ms to minimize.
[2024-05-23 00:17:10] [INFO ] Deduced a trap composed of 69 places in 135 ms of which 2 ms to minimize.
[2024-05-23 00:17:11] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:17:11] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:17:11] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 2 ms to minimize.
[2024-05-23 00:17:11] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 2 ms to minimize.
[2024-05-23 00:17:11] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 2 ms to minimize.
[2024-05-23 00:17:12] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:17:12] [INFO ] Deduced a trap composed of 67 places in 150 ms of which 2 ms to minimize.
[2024-05-23 00:17:12] [INFO ] Deduced a trap composed of 82 places in 157 ms of which 2 ms to minimize.
[2024-05-23 00:17:12] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 3 ms to minimize.
[2024-05-23 00:17:12] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 3 ms to minimize.
[2024-05-23 00:17:13] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:17:13] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 2 ms to minimize.
[2024-05-23 00:17:13] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-23 00:17:14] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:17:15] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:17:15] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-23 00:17:17] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 3 ms to minimize.
[2024-05-23 00:17:17] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 2 ms to minimize.
[2024-05-23 00:17:17] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-23 00:17:20] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-23 00:17:21] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:17:21] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:17:22] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 3 ms to minimize.
[2024-05-23 00:17:23] [INFO ] Deduced a trap composed of 63 places in 150 ms of which 3 ms to minimize.
[2024-05-23 00:17:23] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
[2024-05-23 00:17:23] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-23 00:17:24] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:17:24] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:17:25] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 3 ms to minimize.
[2024-05-23 00:17:25] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-23 00:17:28] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 127/346 variables, and 83 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 70/83 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 219/346 variables, 127/210 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/346 variables, and 444 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 70/70 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 127/152 places, 219/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60901 ms. Remains : 127/152 places, 219/356 transitions.
[2024-05-23 00:18:00] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:18:00] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:18:00] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-23 00:18:00] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:18:00] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:18:00] [INFO ] Time to serialize gal into /tmp/CTLFireability16037112084130361713.gal : 6 ms
[2024-05-23 00:18:00] [INFO ] Time to serialize properties into /tmp/CTLFireability11013811955279946631.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/CTLFireability16037112084130361713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11013811955279946631.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,113060,4.16702,102740,2,17960,5,265380,6,0,730,179688,0
Converting to forward existential form...Done !
original formula: (EX(AF(((EF(((slot_F.F.F.F.F==1)&&(cs_3_2==1))) + (((slot_F.F.F.T.F==0)||(p2_1_3==0)) * AF(((next_6==1)&&(ncs_3_2==1))))) + AX(((next_7==...482
=> equivalent forward existential formula: ((([((FwdU((Init * EX(!(EG(!(((E(TRUE U ((slot_F.F.F.F.F==1)&&(cs_3_2==1))) + (((slot_F.F.F.T.F==0)||(p2_1_3==0)...2227
Reverse transition relation is NOT exact ! Due to transitions t194, t195, t196, t197, t198, t199, t200, t201, t202, t203, t204, t205, t206, t207, t208, t20...312
Detected timeout of ITS tools.
[2024-05-23 00:18:30] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:18:30] [INFO ] Applying decomposition
[2024-05-23 00:18:30] [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/graph6764478375784353929.txt' '-o' '/tmp/graph6764478375784353929.bin' '-w' '/tmp/graph6764478375784353929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6764478375784353929.bin' '-l' '-1' '-v' '-w' '/tmp/graph6764478375784353929.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:18:30] [INFO ] Decomposing Gal with order
[2024-05-23 00:18:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:18:30] [INFO ] Removed a total of 325 redundant transitions.
[2024-05-23 00:18:30] [INFO ] Flatten gal took : 17 ms
[2024-05-23 00:18:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 5 ms.
[2024-05-23 00:18:30] [INFO ] Time to serialize gal into /tmp/CTLFireability7765802393172185585.gal : 5 ms
[2024-05-23 00:18:30] [INFO ] Time to serialize properties into /tmp/CTLFireability7913669089547007648.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/CTLFireability7765802393172185585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7913669089547007648.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,113060,0.395185,13912,1040,948,18923,2233,577,17922,293,2007,0
Converting to forward existential form...Done !
original formula: (EX(AF(((EF(((u0.slot_F.F.F.F.F==1)&&(i6.u25.cs_3_2==1))) + (((u0.slot_F.F.F.T.F==0)||(i3.u21.p2_1_3==0)) * AF(((i5.i0.u3.next_6==1)&&(i6...638
=> equivalent forward existential formula: ((([((FwdU((Init * EX(!(EG(!(((E(TRUE U ((u0.slot_F.F.F.F.F==1)&&(i6.u25.cs_3_2==1))) + (((u0.slot_F.F.F.T.F==0)...2887
Reverse transition relation is NOT exact ! Due to transitions t195, t196, t198, t201, t203, t204, t208, t209, t210, t211, t214, t216, t218, Intersection w...240
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
(forward)formula 0,1,6.0542,144592,1,0,282231,25685,2919,226373,1563,70259,884401
FORMULA Anderson-PT-05-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 124 transition count 192
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 124 transition count 192
Applied a total of 56 rules in 6 ms. Remains 124 /152 variables (removed 28) and now considering 192/356 (removed 164) transitions.
// Phase 1: matrix 192 rows 124 cols
[2024-05-23 00:18:36] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 00:18:36] [INFO ] Implicit Places using invariants in 192 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 193 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/152 places, 192/356 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 201 ms. Remains : 123/152 places, 192/356 transitions.
[2024-05-23 00:18:36] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:18:36] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:18:36] [INFO ] Input system was already deterministic with 192 transitions.
[2024-05-23 00:18:36] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:18:36] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:18:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15083151807108491657.gal : 1 ms
[2024-05-23 00:18:36] [INFO ] Time to serialize properties into /tmp/CTLFireability14827932084501635114.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/CTLFireability15083151807108491657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14827932084501635114.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,84760,1.11064,27696,2,10883,5,79075,6,0,687,58209,0
Converting to forward existential form...Done !
original formula: AF(((AF(EX((((next_7==0)||(ncs_3_3==0))&&((next_7==0)||(ncs_2_0==0))))) * AF(((EX(((next_3==1)&&(ncs_2_0==1))) * (next_6==1)) * (ncs_0_3=...196
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(EX((((next_7==0)||(ncs_3_3==0))&&((next_7==0)||(ncs_2_0==0))))))) * !(EG(!(((EX(((next_3==...259
Reverse transition relation is NOT exact ! Due to transitions t167, t168, t169, t170, t171, t172, t173, t174, t175, t176, t177, t178, t179, t180, t181, t18...312
(forward)formula 0,0,10.1523,208816,1,0,389,915996,414,213,5324,489335,442
FORMULA Anderson-PT-05-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 133 transition count 257
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 133 transition count 257
Applied a total of 38 rules in 3 ms. Remains 133 /152 variables (removed 19) and now considering 257/356 (removed 99) transitions.
// Phase 1: matrix 257 rows 133 cols
[2024-05-23 00:18:47] [INFO ] Computed 13 invariants in 4 ms
[2024-05-23 00:18:47] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-23 00:18:47] [INFO ] Invariant cache hit.
[2024-05-23 00:18:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:18:47] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-23 00:18:47] [INFO ] Invariant cache hit.
[2024-05-23 00:18:47] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:18:49] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:18:50] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 3 ms to minimize.
[2024-05-23 00:18:50] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:18:50] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:18:50] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:18:50] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:18:50] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:18:51] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:18:51] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:18:51] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2024-05-23 00:18:51] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 1 ms to minimize.
[2024-05-23 00:18:51] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:18:51] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:18:51] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:18:51] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:18:52] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:18:52] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 1 ms to minimize.
[2024-05-23 00:18:52] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 1 ms to minimize.
[2024-05-23 00:18:52] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:18:52] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:18:52] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 7 ms to minimize.
[2024-05-23 00:18:52] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 1 ms to minimize.
[2024-05-23 00:18:53] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:18:53] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-05-23 00:18:53] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:18:53] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:18:53] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:18:53] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:18:53] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 1 ms to minimize.
[2024-05-23 00:18:54] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:18:54] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 3 ms to minimize.
[2024-05-23 00:18:54] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 2 ms to minimize.
[2024-05-23 00:18:54] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:18:54] [INFO ] Deduced a trap composed of 64 places in 181 ms of which 2 ms to minimize.
[2024-05-23 00:18:54] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 1 ms to minimize.
[2024-05-23 00:18:55] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 3 ms to minimize.
[2024-05-23 00:18:55] [INFO ] Deduced a trap composed of 62 places in 162 ms of which 3 ms to minimize.
[2024-05-23 00:18:55] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 3 ms to minimize.
[2024-05-23 00:18:55] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:18:55] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:18:57] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 3 ms to minimize.
[2024-05-23 00:18:57] [INFO ] Deduced a trap composed of 79 places in 171 ms of which 3 ms to minimize.
[2024-05-23 00:18:57] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:18:57] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:18:58] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 3 ms to minimize.
[2024-05-23 00:18:58] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
[2024-05-23 00:18:58] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:18:58] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 3 ms to minimize.
[2024-05-23 00:18:58] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 3 ms to minimize.
[2024-05-23 00:18:58] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:18:59] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 3 ms to minimize.
[2024-05-23 00:18:59] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 1 ms to minimize.
[2024-05-23 00:18:59] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:18:59] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 2 ms to minimize.
[2024-05-23 00:19:00] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:19:00] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 2 ms to minimize.
[2024-05-23 00:19:00] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:19:01] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:19:01] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:19:01] [INFO ] Deduced a trap composed of 89 places in 174 ms of which 2 ms to minimize.
[2024-05-23 00:19:02] [INFO ] Deduced a trap composed of 78 places in 164 ms of which 2 ms to minimize.
[2024-05-23 00:19:02] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:19:02] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:19:02] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:19:02] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:19:02] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:19:03] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:19:03] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 3 ms to minimize.
[2024-05-23 00:19:03] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:19:04] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 13/83 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:19:04] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
[2024-05-23 00:19:05] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 3 ms to minimize.
[2024-05-23 00:19:06] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 3 ms to minimize.
[2024-05-23 00:19:06] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 3 ms to minimize.
[2024-05-23 00:19:06] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 2 ms to minimize.
[2024-05-23 00:19:06] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:19:07] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:19:07] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 2 ms to minimize.
[2024-05-23 00:19:08] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 2 ms to minimize.
[2024-05-23 00:19:08] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:19:08] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:19:08] [INFO ] Deduced a trap composed of 78 places in 173 ms of which 3 ms to minimize.
[2024-05-23 00:19:08] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:19:11] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:19:12] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:19:13] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 2 ms to minimize.
[2024-05-23 00:19:14] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:19:15] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:19:15] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
[2024-05-23 00:19:16] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 2 ms to minimize.
[2024-05-23 00:19:16] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:19:16] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 2 ms to minimize.
[2024-05-23 00:19:16] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 3 ms to minimize.
[2024-05-23 00:19:16] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/390 variables, and 107 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/133 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 94/94 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:19:20] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:19:21] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:19:23] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:19:25] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:19:26] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:19:28] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 3 ms to minimize.
[2024-05-23 00:19:28] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:19:28] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:19:29] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-05-23 00:19:29] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:19:30] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:19:30] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 1 ms to minimize.
[2024-05-23 00:19:31] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:19:32] [INFO ] Deduced a trap composed of 74 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:19:32] [INFO ] Deduced a trap composed of 89 places in 171 ms of which 3 ms to minimize.
[2024-05-23 00:19:32] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 1 ms to minimize.
[2024-05-23 00:19:34] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:19:36] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:19:36] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:19:38] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 2 ms to minimize.
[2024-05-23 00:19:38] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:19:40] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2024-05-23 00:19:41] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:19:42] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
[2024-05-23 00:19:44] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:19:44] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-23 00:19:46] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 3 ms to minimize.
[2024-05-23 00:19:47] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/390 variables, and 135 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/133 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/252 constraints, Known Traps: 122/122 constraints]
After SMT, in 60277ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60281ms
Starting structural reductions in LTL mode, iteration 1 : 133/152 places, 257/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60921 ms. Remains : 133/152 places, 257/356 transitions.
[2024-05-23 00:19:48] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:19:48] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:19:48] [INFO ] Input system was already deterministic with 257 transitions.
[2024-05-23 00:19:48] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:19:48] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:19:48] [INFO ] Time to serialize gal into /tmp/CTLFireability14197123239872939222.gal : 3 ms
[2024-05-23 00:19:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14748061991060876763.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/CTLFireability14197123239872939222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14748061991060876763.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,181773,11.5893,268992,2,26899,5,585620,6,0,792,483480,0
Converting to forward existential form...Done !
original formula: E(((E(((((AX(((next_2==1)&&(ncs_1_0==1))) + (p1_0_0==1)) + ((next_3==1)&&(ncs_2_4==1))) * !((((next_5==1)&&(ncs_4_4==1))||(p1_2_8==1)))) ...510
=> equivalent forward existential formula: (([FwdG((FwdU(Init,((E(((((!(EX(!(((next_2==1)&&(ncs_1_0==1))))) + (p1_0_0==1)) + ((next_3==1)&&(ncs_2_4==1))) *...1643
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t10, t12, t13, t18, t19, t20, t22, t23, t24, t27, t28, t29, t30, ...829
Detected timeout of ITS tools.
[2024-05-23 00:20:18] [INFO ] Flatten gal took : 18 ms
[2024-05-23 00:20:18] [INFO ] Applying decomposition
[2024-05-23 00:20:18] [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/graph4390997858283921523.txt' '-o' '/tmp/graph4390997858283921523.bin' '-w' '/tmp/graph4390997858283921523.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4390997858283921523.bin' '-l' '-1' '-v' '-w' '/tmp/graph4390997858283921523.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:20:18] [INFO ] Decomposing Gal with order
[2024-05-23 00:20:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:20:18] [INFO ] Removed a total of 437 redundant transitions.
[2024-05-23 00:20:18] [INFO ] Flatten gal took : 28 ms
[2024-05-23 00:20:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 8 ms.
[2024-05-23 00:20:18] [INFO ] Time to serialize gal into /tmp/CTLFireability7021000608674433402.gal : 4 ms
[2024-05-23 00:20:18] [INFO ] Time to serialize properties into /tmp/CTLFireability3616304855904629432.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/CTLFireability7021000608674433402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3616304855904629432.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,181773,1.41679,27576,1201,1779,36542,8961,668,45049,311,17323,0
Converting to forward existential form...Done !
original formula: E(((E(((((AX(((i1.i0.u2.next_2==1)&&(i5.u9.ncs_1_0==1))) + (i4.u22.p1_0_0==1)) + ((i1.i0.u2.next_3==1)&&(i2.i1.u12.ncs_2_4==1))) * !((((i...735
=> equivalent forward existential formula: (([FwdG((FwdU(Init,((E(((((!(EX(!(((i1.i0.u2.next_2==1)&&(i5.u9.ncs_1_0==1))))) + (i4.u22.p1_0_0==1)) + ((i1.i0....2222
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t10, t12, t13, t18, t19, t20, t22, t23, t24, t27, t28, t29, t30, ...785
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,8.98462,199176,1,0,351536,57309,3845,317369,1795,206939,1078535
FORMULA Anderson-PT-05-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 126 transition count 194
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 126 transition count 194
Applied a total of 52 rules in 3 ms. Remains 126 /152 variables (removed 26) and now considering 194/356 (removed 162) transitions.
// Phase 1: matrix 194 rows 126 cols
[2024-05-23 00:20:27] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:20:27] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-23 00:20:27] [INFO ] Invariant cache hit.
[2024-05-23 00:20:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:20:27] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-23 00:20:27] [INFO ] Invariant cache hit.
[2024-05-23 00:20:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:20:29] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:20:29] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 3 ms to minimize.
[2024-05-23 00:20:29] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-23 00:20:29] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 3 ms to minimize.
[2024-05-23 00:20:29] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:20:30] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 3 ms to minimize.
[2024-05-23 00:20:30] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 2 ms to minimize.
[2024-05-23 00:20:30] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 3 ms to minimize.
[2024-05-23 00:20:30] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:20:30] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 3 ms to minimize.
[2024-05-23 00:20:30] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 2 ms to minimize.
[2024-05-23 00:20:31] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:20:31] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 3 ms to minimize.
[2024-05-23 00:20:31] [INFO ] Deduced a trap composed of 70 places in 142 ms of which 2 ms to minimize.
[2024-05-23 00:20:31] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-05-23 00:20:31] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 3 ms to minimize.
[2024-05-23 00:20:32] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 3 ms to minimize.
[2024-05-23 00:20:32] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:20:32] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 2 ms to minimize.
[2024-05-23 00:20:32] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:20:33] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:20:33] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:20:33] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:20:33] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 2 ms to minimize.
[2024-05-23 00:20:33] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:20:33] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:20:33] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 1 ms to minimize.
[2024-05-23 00:20:34] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:20:34] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:20:34] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 1 ms to minimize.
[2024-05-23 00:20:34] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 1 ms to minimize.
[2024-05-23 00:20:34] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 2 ms to minimize.
[2024-05-23 00:20:34] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 1 ms to minimize.
[2024-05-23 00:20:34] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 3 ms to minimize.
[2024-05-23 00:20:35] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:20:35] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:20:35] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:20:35] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:20:37] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-05-23 00:20:37] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 2 ms to minimize.
[2024-05-23 00:20:37] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:20:37] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:20:37] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 2 ms to minimize.
[2024-05-23 00:20:37] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:20:37] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:20:38] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:20:38] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:20:38] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:20:38] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:20:39] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:20:39] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:20:39] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:20:40] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-23 00:20:40] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 1 ms to minimize.
[2024-05-23 00:20:40] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:20:40] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:20:40] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 194/320 variables, 126/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/216 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 0/320 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 216 constraints, problems are : Problem set: 0 solved, 189 unsolved in 27323 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:20:57] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 00:20:58] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 3 ms to minimize.
[2024-05-23 00:20:58] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:20:59] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-05-23 00:20:59] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:20:59] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 2 ms to minimize.
[2024-05-23 00:20:59] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 3 ms to minimize.
[2024-05-23 00:20:59] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2024-05-23 00:20:59] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:21:00] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 2 ms to minimize.
[2024-05-23 00:21:00] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:21:00] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:21:00] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:21:00] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:21:00] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 2 ms to minimize.
[2024-05-23 00:21:01] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 3 ms to minimize.
[2024-05-23 00:21:01] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2024-05-23 00:21:05] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/320 variables, and 88 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/189 constraints, Known Traps: 75/75 constraints]
After SMT, in 57425ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 57428ms
Starting structural reductions in LTL mode, iteration 1 : 126/152 places, 194/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57871 ms. Remains : 126/152 places, 194/356 transitions.
[2024-05-23 00:21:25] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:21:25] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:21:25] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-23 00:21:25] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:21:25] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:21:25] [INFO ] Time to serialize gal into /tmp/CTLFireability6612896078234742938.gal : 2 ms
[2024-05-23 00:21:25] [INFO ] Time to serialize properties into /tmp/CTLFireability18344345112235227699.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/CTLFireability6612896078234742938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18344345112235227699.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,94276,4.13069,88580,2,20757,5,233481,6,0,701,169282,0
Converting to forward existential form...Done !
original formula: AF(E(((EG(AG((((slot_F.F.F.F.T==1)&&(p3_2_4==1))&&(p1_0_8==1)))) * AF(((slot_F.F.F.F.T==1)&&(p3_2_4==1)))) * ((A(((slot_F.F.F.F.T==1)&&(p...336
=> equivalent forward existential formula: [FwdG(Init,!(E(((EG(!(E(TRUE U !((((slot_F.F.F.F.T==1)&&(p3_2_4==1))&&(p1_0_8==1)))))) * !(EG(!(((slot_F.F.F.F.T...462
Reverse transition relation is NOT exact ! Due to transitions t13, t18, t19, t22, t23, t24, t54, t55, t58, t59, t60, t74, t75, t76, t79, t80, t81, t84, t85...450
Detected timeout of ITS tools.
[2024-05-23 00:21:55] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:21:55] [INFO ] Applying decomposition
[2024-05-23 00:21:55] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9971058391788931317.txt' '-o' '/tmp/graph9971058391788931317.bin' '-w' '/tmp/graph9971058391788931317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9971058391788931317.bin' '-l' '-1' '-v' '-w' '/tmp/graph9971058391788931317.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:21:55] [INFO ] Decomposing Gal with order
[2024-05-23 00:21:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:21:55] [INFO ] Removed a total of 253 redundant transitions.
[2024-05-23 00:21:55] [INFO ] Flatten gal took : 27 ms
[2024-05-23 00:21:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 4 ms.
[2024-05-23 00:21:55] [INFO ] Time to serialize gal into /tmp/CTLFireability15828957650322242136.gal : 4 ms
[2024-05-23 00:21:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1665966300220587417.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/CTLFireability15828957650322242136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1665966300220587417.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,94276,1.048,22320,1098,828,24361,3463,522,79815,278,3374,0
Converting to forward existential form...Done !
original formula: AF(E(((EG(AG((((u0.slot_F.F.F.F.T==1)&&(u0.p3_2_4==1))&&(i2.u18.p1_0_8==1)))) * AF(((u0.slot_F.F.F.F.T==1)&&(u0.p3_2_4==1)))) * ((A(((u0....434
=> equivalent forward existential formula: [FwdG(Init,!(E(((EG(!(E(TRUE U !((((u0.slot_F.F.F.F.T==1)&&(u0.p3_2_4==1))&&(i2.u18.p1_0_8==1)))))) * !(EG(!(((u...574
Reverse transition relation is NOT exact ! Due to transitions t54, t55, t58, t59, t60, t172, t173, t174, t175, t176, t178, t179, t183, t185, t187, t189, t1...495
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 4
Fast SCC detection found an SCC at level 5
(forward)formula 0,0,12.4995,200520,1,0,240069,21075,2846,1.01213e+06,1487,53472,489746
FORMULA Anderson-PT-05-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 125 transition count 201
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 125 transition count 201
Applied a total of 54 rules in 3 ms. Remains 125 /152 variables (removed 27) and now considering 201/356 (removed 155) transitions.
// Phase 1: matrix 201 rows 125 cols
[2024-05-23 00:22:08] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 00:22:08] [INFO ] Implicit Places using invariants in 125 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/152 places, 201/356 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 124/152 places, 201/356 transitions.
[2024-05-23 00:22:08] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:22:08] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:22:08] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-23 00:22:08] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:22:08] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:22:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5097711645782065673.gal : 1 ms
[2024-05-23 00:22:08] [INFO ] Time to serialize properties into /tmp/CTLFireability162282530639115371.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/CTLFireability5097711645782065673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability162282530639115371.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.
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,92780,1.02195,31140,2,11014,5,85521,6,0,700,61876,0
Converting to forward existential form...Done !
original formula: EX((AF(((next_8==1)&&(ncs_2_0==1))) + ((EG(((slot_F.F.F.F.T==1)&&(p3_3_4==1))) + AG(AF(((slot_F.F.T.F.F==1)&&(p2_3_2==1))))) * (((next_8=...311
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!(((next_8==1)&&(ncs_2_0==1))))))] != FALSE + ([((EY(Init) * (EG(((slot_F.F.F.F.T==1)&&(p3_3_...622
Reverse transition relation is NOT exact ! Due to transitions t176, t177, t178, t179, t180, t181, t182, t183, t184, t185, t186, t187, t188, t189, t190, t19...312
(forward)formula 0,0,14.71,325276,1,0,553,1.77538e+06,454,280,5306,753818,711
FORMULA Anderson-PT-05-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 174
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 174
Applied a total of 60 rules in 3 ms. Remains 122 /152 variables (removed 30) and now considering 174/356 (removed 182) transitions.
// Phase 1: matrix 174 rows 122 cols
[2024-05-23 00:22:23] [INFO ] Computed 13 invariants in 8 ms
[2024-05-23 00:22:23] [INFO ] Implicit Places using invariants in 155 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 166 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/152 places, 174/356 transitions.
Applied a total of 0 rules in 1 ms. Remains 121 /121 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 170 ms. Remains : 121/152 places, 174/356 transitions.
[2024-05-23 00:22:23] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:22:23] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:22:23] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-23 00:22:23] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:22:23] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:22:23] [INFO ] Time to serialize gal into /tmp/CTLFireability702930395567111241.gal : 1 ms
[2024-05-23 00:22:23] [INFO ] Time to serialize properties into /tmp/CTLFireability14375360469493676576.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/CTLFireability702930395567111241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14375360469493676576.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,69630,0.525318,19572,2,9940,5,56925,6,0,661,45952,0
Converting to forward existential form...Done !
original formula: EX(A(EF(EX(AF(((slot_F.T.F.F.F==1)&&(p3_3_1==1))))) U !(AG(EF(((next_8==1)&&(ncs_2_1==1)))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(!(E(TRUE U !(E(TRUE U ((next_8==1)&&(ncs_2_1==1))))))))))) * !(E(!(!(!(E(TRUE U !(E(TRUE ...331
Reverse transition relation is NOT exact ! Due to transitions t149, t150, t151, t152, t153, t154, t155, t156, t157, t158, t159, t160, t161, t162, t163, t16...312
(forward)formula 0,0,10.8737,273120,1,0,519,1.65428e+06,378,260,4785,630891,613
FORMULA Anderson-PT-05-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 123 transition count 175
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 123 transition count 175
Applied a total of 58 rules in 2 ms. Remains 123 /152 variables (removed 29) and now considering 175/356 (removed 181) transitions.
// Phase 1: matrix 175 rows 123 cols
[2024-05-23 00:22:34] [INFO ] Computed 13 invariants in 13 ms
[2024-05-23 00:22:34] [INFO ] Implicit Places using invariants in 169 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 182 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/152 places, 175/356 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 122/152 places, 175/356 transitions.
[2024-05-23 00:22:34] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:22:34] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:22:34] [INFO ] Input system was already deterministic with 175 transitions.
[2024-05-23 00:22:34] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:22:34] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:22:34] [INFO ] Time to serialize gal into /tmp/CTLFireability7176023150428528157.gal : 1 ms
[2024-05-23 00:22:34] [INFO ] Time to serialize properties into /tmp/CTLFireability16428407797097237545.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/CTLFireability7176023150428528157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16428407797097237545.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,74738,0.790205,22748,2,9549,5,59107,6,0,666,43187,0
Converting to forward existential form...Done !
original formula: (EG(AX(EF((p1_3_8==1)))) * EG(((next_5==0)||(ncs_0_1==0))))
=> equivalent forward existential formula: [FwdG((Init * EG(!(EX(!(E(TRUE U (p1_3_8==1))))))),((next_5==0)||(ncs_0_1==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t13, t14, t58, t63, t68, t78, t94, t95, t150, t151, t152, t153, t154, t155, t156, t157, t...356
Hit Full ! (commute/partial/dont) 150/0/25
(forward)formula 0,1,8.05789,181188,1,0,395,808665,382,200,5035,461424,417
FORMULA Anderson-PT-05-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2024-05-23 00:22:42] [INFO ] Flatten gal took : 20 ms
[2024-05-23 00:22:42] [INFO ] Flatten gal took : 10 ms
Total runtime 720227 ms.
BK_STOP 1716423762765
--------------------
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="Anderson-PT-05"
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 Anderson-PT-05, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r004-smll-171620118300322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-05.tgz
mv Anderson-PT-05 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;