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.r576-smll-171734920100129.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 MedleyA-PT-17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100129
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 175K Jun 2 16:33 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 MedleyA-PT-17-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717372137842

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 23:49:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:49:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:49:00] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2024-06-02 23:49:00] [INFO ] Transformed 248 places.
[2024-06-02 23:49:00] [INFO ] Transformed 591 transitions.
[2024-06-02 23:49:00] [INFO ] Found NUPN structural information;
[2024-06-02 23:49:00] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 468 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-17-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 221 transition count 545
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 221 transition count 545
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 71 place count 221 transition count 528
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 220 transition count 526
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 220 transition count 526
Applied a total of 73 rules in 105 ms. Remains 220 /248 variables (removed 28) and now considering 526/589 (removed 63) transitions.
// Phase 1: matrix 526 rows 220 cols
[2024-06-02 23:49:01] [INFO ] Computed 7 invariants in 62 ms
[2024-06-02 23:49:01] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-06-02 23:49:01] [INFO ] Invariant cache hit.
[2024-06-02 23:49:02] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
Running 525 sub problems to find dead transitions.
[2024-06-02 23:49:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 525 unsolved
[2024-06-02 23:49:12] [INFO ] Deduced a trap composed of 18 places in 381 ms of which 44 ms to minimize.
[2024-06-02 23:49:13] [INFO ] Deduced a trap composed of 17 places in 362 ms of which 6 ms to minimize.
[2024-06-02 23:49:13] [INFO ] Deduced a trap composed of 26 places in 402 ms of which 5 ms to minimize.
[2024-06-02 23:49:13] [INFO ] Deduced a trap composed of 18 places in 313 ms of which 5 ms to minimize.
[2024-06-02 23:49:14] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 4 ms to minimize.
[2024-06-02 23:49:14] [INFO ] Deduced a trap composed of 19 places in 317 ms of which 6 ms to minimize.
[2024-06-02 23:49:14] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 3 ms to minimize.
[2024-06-02 23:49:15] [INFO ] Deduced a trap composed of 20 places in 270 ms of which 4 ms to minimize.
[2024-06-02 23:49:15] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 2 ms to minimize.
[2024-06-02 23:49:15] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 2 ms to minimize.
[2024-06-02 23:49:15] [INFO ] Deduced a trap composed of 19 places in 347 ms of which 5 ms to minimize.
[2024-06-02 23:49:16] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 3 ms to minimize.
[2024-06-02 23:49:16] [INFO ] Deduced a trap composed of 21 places in 341 ms of which 5 ms to minimize.
[2024-06-02 23:49:16] [INFO ] Deduced a trap composed of 39 places in 343 ms of which 4 ms to minimize.
[2024-06-02 23:49:17] [INFO ] Deduced a trap composed of 28 places in 308 ms of which 4 ms to minimize.
[2024-06-02 23:49:17] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:49:17] [INFO ] Deduced a trap composed of 127 places in 327 ms of which 4 ms to minimize.
[2024-06-02 23:49:18] [INFO ] Deduced a trap composed of 122 places in 261 ms of which 3 ms to minimize.
[2024-06-02 23:49:18] [INFO ] Deduced a trap composed of 123 places in 278 ms of which 4 ms to minimize.
[2024-06-02 23:49:18] [INFO ] Deduced a trap composed of 96 places in 219 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 525 unsolved
[2024-06-02 23:49:19] [INFO ] Deduced a trap composed of 130 places in 350 ms of which 4 ms to minimize.
[2024-06-02 23:49:19] [INFO ] Deduced a trap composed of 18 places in 333 ms of which 4 ms to minimize.
[2024-06-02 23:49:19] [INFO ] Deduced a trap composed of 131 places in 326 ms of which 4 ms to minimize.
[2024-06-02 23:49:20] [INFO ] Deduced a trap composed of 130 places in 339 ms of which 4 ms to minimize.
[2024-06-02 23:49:22] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 4 ms to minimize.
[2024-06-02 23:49:22] [INFO ] Deduced a trap composed of 30 places in 328 ms of which 4 ms to minimize.
[2024-06-02 23:49:22] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 4 ms to minimize.
[2024-06-02 23:49:23] [INFO ] Deduced a trap composed of 31 places in 297 ms of which 4 ms to minimize.
[2024-06-02 23:49:23] [INFO ] Deduced a trap composed of 28 places in 343 ms of which 4 ms to minimize.
[2024-06-02 23:49:23] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 3 ms to minimize.
[2024-06-02 23:49:24] [INFO ] Deduced a trap composed of 29 places in 320 ms of which 4 ms to minimize.
[2024-06-02 23:49:24] [INFO ] Deduced a trap composed of 24 places in 335 ms of which 4 ms to minimize.
[2024-06-02 23:49:25] [INFO ] Deduced a trap composed of 44 places in 443 ms of which 4 ms to minimize.
[2024-06-02 23:49:25] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 4 ms to minimize.
[2024-06-02 23:49:25] [INFO ] Deduced a trap composed of 26 places in 323 ms of which 8 ms to minimize.
[2024-06-02 23:49:26] [INFO ] Deduced a trap composed of 39 places in 299 ms of which 4 ms to minimize.
[2024-06-02 23:49:26] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 3 ms to minimize.
[2024-06-02 23:49:26] [INFO ] Deduced a trap composed of 39 places in 313 ms of which 4 ms to minimize.
[2024-06-02 23:49:27] [INFO ] Deduced a trap composed of 25 places in 327 ms of which 4 ms to minimize.
[2024-06-02 23:49:27] [INFO ] Deduced a trap composed of 32 places in 323 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 525 unsolved
[2024-06-02 23:49:31] [INFO ] Deduced a trap composed of 18 places in 317 ms of which 4 ms to minimize.
[2024-06-02 23:49:32] [INFO ] Deduced a trap composed of 47 places in 276 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 220/746 variables, and 49 constraints, problems are : Problem set: 0 solved, 525 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/220 constraints, PredecessorRefiner: 525/525 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 525 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 525 unsolved
[2024-06-02 23:49:38] [INFO ] Deduced a trap composed of 139 places in 343 ms of which 4 ms to minimize.
[2024-06-02 23:49:38] [INFO ] Deduced a trap composed of 130 places in 315 ms of which 3 ms to minimize.
[2024-06-02 23:49:40] [INFO ] Deduced a trap composed of 52 places in 317 ms of which 4 ms to minimize.
[2024-06-02 23:49:40] [INFO ] Deduced a trap composed of 32 places in 301 ms of which 4 ms to minimize.
[2024-06-02 23:49:41] [INFO ] Deduced a trap composed of 38 places in 338 ms of which 4 ms to minimize.
[2024-06-02 23:49:41] [INFO ] Deduced a trap composed of 41 places in 291 ms of which 3 ms to minimize.
[2024-06-02 23:49:42] [INFO ] Deduced a trap composed of 44 places in 274 ms of which 4 ms to minimize.
[2024-06-02 23:49:42] [INFO ] Deduced a trap composed of 29 places in 320 ms of which 4 ms to minimize.
[2024-06-02 23:49:42] [INFO ] Deduced a trap composed of 30 places in 333 ms of which 5 ms to minimize.
[2024-06-02 23:49:43] [INFO ] Deduced a trap composed of 26 places in 306 ms of which 4 ms to minimize.
[2024-06-02 23:49:43] [INFO ] Deduced a trap composed of 41 places in 347 ms of which 4 ms to minimize.
[2024-06-02 23:49:43] [INFO ] Deduced a trap composed of 50 places in 325 ms of which 4 ms to minimize.
[2024-06-02 23:49:44] [INFO ] Deduced a trap composed of 41 places in 255 ms of which 4 ms to minimize.
[2024-06-02 23:49:44] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 2 ms to minimize.
[2024-06-02 23:49:44] [INFO ] Deduced a trap composed of 37 places in 255 ms of which 4 ms to minimize.
[2024-06-02 23:49:45] [INFO ] Deduced a trap composed of 112 places in 291 ms of which 3 ms to minimize.
[2024-06-02 23:49:45] [INFO ] Deduced a trap composed of 123 places in 322 ms of which 4 ms to minimize.
[2024-06-02 23:49:45] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 3 ms to minimize.
[2024-06-02 23:49:46] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 3 ms to minimize.
[2024-06-02 23:49:46] [INFO ] Deduced a trap composed of 26 places in 309 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 525 unsolved
[2024-06-02 23:49:47] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 3 ms to minimize.
[2024-06-02 23:49:47] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 4 ms to minimize.
[2024-06-02 23:49:49] [INFO ] Deduced a trap composed of 27 places in 334 ms of which 4 ms to minimize.
[2024-06-02 23:49:50] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 4 ms to minimize.
[2024-06-02 23:49:50] [INFO ] Deduced a trap composed of 143 places in 335 ms of which 4 ms to minimize.
[2024-06-02 23:49:50] [INFO ] Deduced a trap composed of 28 places in 321 ms of which 4 ms to minimize.
[2024-06-02 23:49:51] [INFO ] Deduced a trap composed of 51 places in 328 ms of which 4 ms to minimize.
[2024-06-02 23:49:51] [INFO ] Deduced a trap composed of 119 places in 322 ms of which 3 ms to minimize.
[2024-06-02 23:49:52] [INFO ] Deduced a trap composed of 57 places in 316 ms of which 4 ms to minimize.
[2024-06-02 23:49:52] [INFO ] Deduced a trap composed of 142 places in 323 ms of which 4 ms to minimize.
[2024-06-02 23:49:52] [INFO ] Deduced a trap composed of 139 places in 315 ms of which 3 ms to minimize.
[2024-06-02 23:49:54] [INFO ] Deduced a trap composed of 58 places in 282 ms of which 3 ms to minimize.
[2024-06-02 23:49:54] [INFO ] Deduced a trap composed of 130 places in 284 ms of which 3 ms to minimize.
[2024-06-02 23:49:54] [INFO ] Deduced a trap composed of 126 places in 291 ms of which 4 ms to minimize.
[2024-06-02 23:49:55] [INFO ] Deduced a trap composed of 59 places in 246 ms of which 4 ms to minimize.
[2024-06-02 23:49:55] [INFO ] Deduced a trap composed of 61 places in 249 ms of which 3 ms to minimize.
[2024-06-02 23:49:55] [INFO ] Deduced a trap composed of 41 places in 275 ms of which 3 ms to minimize.
[2024-06-02 23:49:56] [INFO ] Deduced a trap composed of 136 places in 296 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 18/87 constraints. Problems are: Problem set: 0 solved, 525 unsolved
[2024-06-02 23:49:59] [INFO ] Deduced a trap composed of 29 places in 335 ms of which 4 ms to minimize.
[2024-06-02 23:50:00] [INFO ] Deduced a trap composed of 41 places in 311 ms of which 4 ms to minimize.
[2024-06-02 23:50:00] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 3 ms to minimize.
[2024-06-02 23:50:01] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 4 ms to minimize.
[2024-06-02 23:50:01] [INFO ] Deduced a trap composed of 44 places in 283 ms of which 4 ms to minimize.
[2024-06-02 23:50:02] [INFO ] Deduced a trap composed of 135 places in 348 ms of which 4 ms to minimize.
[2024-06-02 23:50:02] [INFO ] Deduced a trap composed of 111 places in 337 ms of which 4 ms to minimize.
[2024-06-02 23:50:02] [INFO ] Deduced a trap composed of 142 places in 336 ms of which 4 ms to minimize.
[2024-06-02 23:50:03] [INFO ] Deduced a trap composed of 142 places in 331 ms of which 4 ms to minimize.
[2024-06-02 23:50:03] [INFO ] Deduced a trap composed of 57 places in 327 ms of which 3 ms to minimize.
[2024-06-02 23:50:03] [INFO ] Deduced a trap composed of 48 places in 314 ms of which 3 ms to minimize.
SMT process timed out in 61274ms, After SMT, problems are : Problem set: 0 solved, 525 unsolved
Search for dead transitions found 0 dead transitions in 61326ms
Starting structural reductions in LTL mode, iteration 1 : 220/248 places, 526/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62859 ms. Remains : 220/248 places, 526/589 transitions.
Support contains 87 out of 220 places after structural reductions.
[2024-06-02 23:50:04] [INFO ] Flatten gal took : 179 ms
[2024-06-02 23:50:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-17-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 23:50:04] [INFO ] Flatten gal took : 116 ms
[2024-06-02 23:50:04] [INFO ] Input system was already deterministic with 526 transitions.
Support contains 77 out of 220 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (1376 resets) in 3483 ms. (11 steps per ms) remains 40/58 properties
BEST_FIRST walk for 4003 steps (29 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (28 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (27 resets) in 52 ms. (75 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 56 ms. (70 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (28 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (28 resets) in 74 ms. (53 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (29 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 45 ms. (87 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (27 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (28 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (27 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (30 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (26 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (29 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (29 resets) in 55 ms. (71 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (27 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (28 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 51 ms. (77 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
[2024-06-02 23:50:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 167/220 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 23:50:07] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 2 ms to minimize.
[2024-06-02 23:50:07] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 23:50:08] [INFO ] Deduced a trap composed of 18 places in 276 ms of which 4 ms to minimize.
[2024-06-02 23:50:08] [INFO ] Deduced a trap composed of 37 places in 330 ms of which 4 ms to minimize.
[2024-06-02 23:50:08] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:50:08] [INFO ] Deduced a trap composed of 37 places in 307 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 23:50:09] [INFO ] Deduced a trap composed of 18 places in 319 ms of which 3 ms to minimize.
[2024-06-02 23:50:09] [INFO ] Deduced a trap composed of 26 places in 325 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 526/746 variables, 220/235 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 23:50:11] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 746/746 variables, and 236 constraints, problems are : Problem set: 0 solved, 40 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 167/220 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 23:50:12] [INFO ] Deduced a trap composed of 35 places in 271 ms of which 4 ms to minimize.
[2024-06-02 23:50:12] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 2 ms to minimize.
[2024-06-02 23:50:12] [INFO ] Deduced a trap composed of 18 places in 288 ms of which 4 ms to minimize.
[2024-06-02 23:50:12] [INFO ] Deduced a trap composed of 41 places in 315 ms of which 3 ms to minimize.
[2024-06-02 23:50:13] [INFO ] Deduced a trap composed of 30 places in 308 ms of which 4 ms to minimize.
Problem AtomicPropp4 is UNSAT
[2024-06-02 23:50:13] [INFO ] Deduced a trap composed of 37 places in 310 ms of which 4 ms to minimize.
[2024-06-02 23:50:13] [INFO ] Deduced a trap composed of 36 places in 289 ms of which 3 ms to minimize.
[2024-06-02 23:50:14] [INFO ] Deduced a trap composed of 28 places in 318 ms of which 3 ms to minimize.
[2024-06-02 23:50:14] [INFO ] Deduced a trap composed of 39 places in 291 ms of which 3 ms to minimize.
[2024-06-02 23:50:14] [INFO ] Deduced a trap composed of 16 places in 321 ms of which 4 ms to minimize.
[2024-06-02 23:50:15] [INFO ] Deduced a trap composed of 120 places in 330 ms of which 4 ms to minimize.
[2024-06-02 23:50:15] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 3 ms to minimize.
[2024-06-02 23:50:15] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 3 ms to minimize.
[2024-06-02 23:50:16] [INFO ] Deduced a trap composed of 28 places in 268 ms of which 4 ms to minimize.
[2024-06-02 23:50:16] [INFO ] Deduced a trap composed of 36 places in 323 ms of which 3 ms to minimize.
SMT process timed out in 10124ms, After SMT, problems are : Problem set: 0 solved, 40 unsolved
Fused 40 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 52 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 526/526 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 220 transition count 508
Reduce places removed 18 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 21 rules applied. Total rules applied 39 place count 202 transition count 505
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 199 transition count 505
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 42 place count 199 transition count 496
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 60 place count 190 transition count 496
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 70 place count 180 transition count 480
Iterating global reduction 3 with 10 rules applied. Total rules applied 80 place count 180 transition count 480
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 120 place count 160 transition count 460
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 123 place count 160 transition count 457
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 147 place count 148 transition count 496
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 4 with 29 rules applied. Total rules applied 176 place count 148 transition count 467
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 177 place count 147 transition count 466
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 147 transition count 466
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 186 place count 143 transition count 462
Free-agglomeration rule applied 26 times.
Iterating global reduction 4 with 26 rules applied. Total rules applied 212 place count 143 transition count 436
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 238 place count 117 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 239 place count 117 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 240 place count 117 transition count 435
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 117 transition count 435
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 242 place count 116 transition count 434
Applied a total of 242 rules in 361 ms. Remains 116 /220 variables (removed 104) and now considering 434/526 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 361 ms. Remains : 116/220 places, 434/526 transitions.
RANDOM walk for 40000 steps (1847 resets) in 889 ms. (44 steps per ms) remains 19/39 properties
BEST_FIRST walk for 4001 steps (58 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (54 resets) in 20 ms. (190 steps per ms) remains 16/19 properties
BEST_FIRST walk for 4002 steps (64 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (57 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (55 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (55 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (55 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (57 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (56 resets) in 17 ms. (222 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4001 steps (54 resets) in 21 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (54 resets) in 13 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (56 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (54 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (60 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (54 resets) in 13 ms. (286 steps per ms) remains 14/14 properties
[2024-06-02 23:50:17] [INFO ] Flow matrix only has 422 transitions (discarded 12 similar events)
// Phase 1: matrix 422 rows 116 cols
[2024-06-02 23:50:17] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:50:17] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 80/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 397/493 variables, 96/101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 44/537 variables, 19/130 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/538 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/538 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 133 constraints, problems are : Problem set: 0 solved, 14 unsolved in 871 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 80/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 397/493 variables, 96/101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 44/537 variables, 19/143 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-02 23:50:19] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1/538 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-02 23:50:19] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:50:19] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2024-06-02 23:50:19] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:50:19] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:50:20] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:50:20] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 2 ms to minimize.
[2024-06-02 23:50:20] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 7/155 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 0/538 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 155 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3194 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 8/8 constraints]
After SMT, in 4090ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 7 properties in 14540 ms.
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 434/434 transitions.
Graph (trivial) has 101 edges and 116 vertex of which 7 / 116 are part of one of the 3 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 112 transition count 423
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 108 transition count 423
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 9 place count 108 transition count 417
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 21 place count 102 transition count 417
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 32 place count 91 transition count 381
Iterating global reduction 2 with 11 rules applied. Total rules applied 43 place count 91 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 91 transition count 380
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 90 transition count 368
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 90 transition count 368
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 58 place count 84 transition count 362
Performed 11 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 80 place count 73 transition count 411
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 85 place count 73 transition count 406
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 96 place count 73 transition count 395
Free-agglomeration rule applied 15 times with reduction of 4 identical transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 111 place count 73 transition count 376
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 162 place count 58 transition count 340
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 181 place count 58 transition count 321
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 183 place count 58 transition count 349
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 185 place count 56 transition count 349
Applied a total of 185 rules in 106 ms. Remains 56 /116 variables (removed 60) and now considering 349/434 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 56/116 places, 349/434 transitions.
RANDOM walk for 9637 steps (689 resets) in 497 ms. (19 steps per ms) remains 0/7 properties
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-06-02 23:50:36] [INFO ] Flatten gal took : 76 ms
[2024-06-02 23:50:36] [INFO ] Flatten gal took : 79 ms
[2024-06-02 23:50:36] [INFO ] Input system was already deterministic with 526 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Graph (trivial) has 241 edges and 220 vertex of which 9 / 220 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 213 transition count 490
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 184 transition count 490
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 59 place count 184 transition count 474
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 91 place count 168 transition count 474
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 117 place count 142 transition count 428
Iterating global reduction 2 with 26 rules applied. Total rules applied 143 place count 142 transition count 428
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 159 place count 142 transition count 412
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 159 place count 142 transition count 410
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 163 place count 140 transition count 410
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 137 transition count 380
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 137 transition count 380
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 201 place count 121 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 121 transition count 363
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 203 place count 120 transition count 361
Iterating global reduction 4 with 1 rules applied. Total rules applied 204 place count 120 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 212 place count 120 transition count 353
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 220 place count 116 transition count 349
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 221 place count 115 transition count 348
Applied a total of 221 rules in 141 ms. Remains 115 /220 variables (removed 105) and now considering 348/526 (removed 178) transitions.
[2024-06-02 23:50:36] [INFO ] Flow matrix only has 346 transitions (discarded 2 similar events)
// Phase 1: matrix 346 rows 115 cols
[2024-06-02 23:50:36] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:50:36] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-02 23:50:36] [INFO ] Flow matrix only has 346 transitions (discarded 2 similar events)
[2024-06-02 23:50:36] [INFO ] Invariant cache hit.
[2024-06-02 23:50:36] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-02 23:50:37] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-06-02 23:50:37] [INFO ] Redundant transitions in 33 ms returned []
Running 339 sub problems to find dead transitions.
[2024-06-02 23:50:37] [INFO ] Flow matrix only has 346 transitions (discarded 2 similar events)
[2024-06-02 23:50:37] [INFO ] Invariant cache hit.
[2024-06-02 23:50:37] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-06-02 23:50:39] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 3 ms to minimize.
[2024-06-02 23:50:39] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 2 ms to minimize.
[2024-06-02 23:50:39] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:50:40] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2024-06-02 23:50:40] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2024-06-02 23:50:40] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:50:40] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:50:40] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:50:40] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:50:41] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:50:41] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 2 ms to minimize.
[2024-06-02 23:50:41] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:50:41] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-06-02 23:50:41] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
[2024-06-02 23:50:41] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (OVERLAPS) 345/460 variables, 115/137 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 64/201 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (OVERLAPS) 1/461 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 339 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 202 constraints, problems are : Problem set: 0 solved, 339 unsolved in 27747 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 115/115 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 3 (OVERLAPS) 345/460 variables, 115/137 constraints. Problems are: Problem set: 36 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 64/201 constraints. Problems are: Problem set: 36 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 303/504 constraints. Problems are: Problem set: 36 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/504 constraints. Problems are: Problem set: 36 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/461 variables, 1/505 constraints. Problems are: Problem set: 36 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/505 constraints. Problems are: Problem set: 36 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 505 constraints, problems are : Problem set: 36 solved, 303 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 115/115 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 303/339 constraints, Known Traps: 15/15 constraints]
After SMT, in 58288ms problems are : Problem set: 36 solved, 303 unsolved
Search for dead transitions found 36 dead transitions in 58297ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 115/220 places, 312/526 transitions.
Applied a total of 0 rules in 10 ms. Remains 115 /115 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-06-02 23:51:35] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 59001 ms. Remains : 115/220 places, 312/526 transitions.
[2024-06-02 23:51:35] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:51:35] [INFO ] Flatten gal took : 33 ms
[2024-06-02 23:51:35] [INFO ] Input system was already deterministic with 312 transitions.
[2024-06-02 23:51:35] [INFO ] Flatten gal took : 62 ms
RANDOM walk for 40000 steps (7401 resets) in 316 ms. (126 steps per ms) remains 1/1 properties
[2024-06-02 23:51:35] [INFO ] Flatten gal took : 28 ms
BEST_FIRST walk for 40004 steps (1390 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
[2024-06-02 23:51:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2162465580686120048.gal : 24 ms
[2024-06-02 23:51:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7725572528412968809.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2162465580686120048.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7725572528412968809.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7725572528412968809.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 32
Finished probabilistic random walk after 50896 steps, run visited all 1 properties in 239 ms. (steps per millisecond=212 )
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 117
Probabilistic random walk after 50896 steps, saw 11676 distinct states, run finished after 245 ms. (steps per millisecond=207 ) properties seen :1
FORMULA MedleyA-PT-17-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Graph (trivial) has 234 edges and 220 vertex of which 9 / 220 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 213 transition count 492
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 186 transition count 492
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 55 place count 186 transition count 476
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 87 place count 170 transition count 476
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 112 place count 145 transition count 432
Iterating global reduction 2 with 25 rules applied. Total rules applied 137 place count 145 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 153 place count 145 transition count 416
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 153 place count 145 transition count 414
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 143 transition count 414
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 140 transition count 384
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 140 transition count 384
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 195 place count 124 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 124 transition count 367
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 123 transition count 365
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 123 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 206 place count 123 transition count 357
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 214 place count 119 transition count 353
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 215 place count 119 transition count 353
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 118 transition count 352
Applied a total of 216 rules in 89 ms. Remains 118 /220 variables (removed 102) and now considering 352/526 (removed 174) transitions.
[2024-06-02 23:51:36] [INFO ] Flow matrix only has 350 transitions (discarded 2 similar events)
// Phase 1: matrix 350 rows 118 cols
[2024-06-02 23:51:36] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:51:36] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-02 23:51:36] [INFO ] Flow matrix only has 350 transitions (discarded 2 similar events)
[2024-06-02 23:51:36] [INFO ] Invariant cache hit.
[2024-06-02 23:51:36] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-02 23:51:36] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-06-02 23:51:36] [INFO ] Redundant transitions in 9 ms returned []
Running 343 sub problems to find dead transitions.
[2024-06-02 23:51:36] [INFO ] Flow matrix only has 350 transitions (discarded 2 similar events)
[2024-06-02 23:51:36] [INFO ] Invariant cache hit.
[2024-06-02 23:51:36] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-06-02 23:51:39] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2024-06-02 23:51:39] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:51:39] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 2 ms to minimize.
[2024-06-02 23:51:39] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 2 ms to minimize.
[2024-06-02 23:51:39] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 3 ms to minimize.
[2024-06-02 23:51:39] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-06-02 23:51:40] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 3 ms to minimize.
[2024-06-02 23:51:40] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 2 ms to minimize.
[2024-06-02 23:51:40] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 2 ms to minimize.
[2024-06-02 23:51:40] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:51:40] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 2 ms to minimize.
[2024-06-02 23:51:41] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:51:41] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 2 ms to minimize.
[2024-06-02 23:51:41] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2024-06-02 23:51:41] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-06-02 23:51:43] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (OVERLAPS) 349/467 variables, 118/141 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 64/205 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 7 (OVERLAPS) 1/468 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 9 (OVERLAPS) 0/468 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 343 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 206 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-06-02 23:52:08] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 4 (OVERLAPS) 349/467 variables, 118/142 constraints. Problems are: Problem set: 36 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 64/206 constraints. Problems are: Problem set: 36 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 307/513 constraints. Problems are: Problem set: 36 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 0/513 constraints. Problems are: Problem set: 36 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 1/468 variables, 1/514 constraints. Problems are: Problem set: 36 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 514 constraints, problems are : Problem set: 36 solved, 307 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 307/343 constraints, Known Traps: 17/17 constraints]
After SMT, in 60510ms problems are : Problem set: 36 solved, 307 unsolved
Search for dead transitions found 36 dead transitions in 60517ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 118/220 places, 316/526 transitions.
Applied a total of 0 rules in 10 ms. Remains 118 /118 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2024-06-02 23:52:37] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61169 ms. Remains : 118/220 places, 316/526 transitions.
[2024-06-02 23:52:37] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:52:37] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:52:37] [INFO ] Input system was already deterministic with 316 transitions.
[2024-06-02 23:52:37] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:52:37] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:52:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality12926539199861948313.gal : 6 ms
[2024-06-02 23:52:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality1753785348307035675.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/CTLCardinality12926539199861948313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1753785348307035675.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.50192e+06,8.96854,228436,2,37924,5,549172,6,0,788,564907,0


Converting to forward existential form...Done !
original formula: AG(EF(((!(E((p189==1) U ((p43==0)||(p118==1)))) + (p139==0)) + (p185==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(E((p189==1) U ((p43==0)||(p118==1)))) + (p139==0)) + (p185==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t8, t10, t11, t12, t17, t18, t19, t28, t31, t37, t39, t41, t43, t44, t45, t51, t52, t...585
Detected timeout of ITS tools.
[2024-06-02 23:53:07] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:53:07] [INFO ] Applying decomposition
[2024-06-02 23:53:07] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18426450420885488621.txt' '-o' '/tmp/graph18426450420885488621.bin' '-w' '/tmp/graph18426450420885488621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18426450420885488621.bin' '-l' '-1' '-v' '-w' '/tmp/graph18426450420885488621.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:53:07] [INFO ] Decomposing Gal with order
[2024-06-02 23:53:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:53:07] [INFO ] Removed a total of 563 redundant transitions.
[2024-06-02 23:53:07] [INFO ] Flatten gal took : 88 ms
[2024-06-02 23:53:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 25 ms.
[2024-06-02 23:53:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality17314284445548250718.gal : 9 ms
[2024-06-02 23:53:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality13783002760985844376.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/CTLCardinality17314284445548250718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13783002760985844376.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.50192e+06,0.900977,19848,747,469,26632,5179,788,49820,129,27033,0


Converting to forward existential form...Done !
original formula: AG(EF(((!(E((i7.u30.p189==1) U ((u3.p43==0)||(i3.u16.p118==1)))) + (i4.u20.p139==0)) + (i7.u28.p185==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(E((i7.u30.p189==1) U ((u3.p43==0)||(i3.u16.p118==1)))) + (i4.u20.p139==0)) + ...184
Reverse transition relation is NOT exact ! Due to transitions t28, t56, t62, t85, t97, t99, t107, t109, t111, t112, t113, t115, t116, t117, t118, t147, t14...706
(forward)formula 0,1,1.46061,29352,1,0,41429,13285,4272,87681,702,79641,116997
FORMULA MedleyA-PT-17-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 197 transition count 486
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 197 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 197 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 195 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 195 transition count 481
Applied a total of 51 rules in 10 ms. Remains 195 /220 variables (removed 25) and now considering 481/526 (removed 45) transitions.
// Phase 1: matrix 481 rows 195 cols
[2024-06-02 23:53:09] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 23:53:09] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 23:53:09] [INFO ] Invariant cache hit.
[2024-06-02 23:53:09] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 480 sub problems to find dead transitions.
[2024-06-02 23:53:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-06-02 23:53:15] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 4 ms to minimize.
[2024-06-02 23:53:16] [INFO ] Deduced a trap composed of 18 places in 350 ms of which 21 ms to minimize.
[2024-06-02 23:53:16] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 2 ms to minimize.
[2024-06-02 23:53:16] [INFO ] Deduced a trap composed of 39 places in 315 ms of which 4 ms to minimize.
[2024-06-02 23:53:16] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 2 ms to minimize.
[2024-06-02 23:53:17] [INFO ] Deduced a trap composed of 17 places in 287 ms of which 3 ms to minimize.
[2024-06-02 23:53:17] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2024-06-02 23:53:17] [INFO ] Deduced a trap composed of 44 places in 285 ms of which 4 ms to minimize.
[2024-06-02 23:53:17] [INFO ] Deduced a trap composed of 113 places in 291 ms of which 4 ms to minimize.
[2024-06-02 23:53:18] [INFO ] Deduced a trap composed of 38 places in 292 ms of which 3 ms to minimize.
[2024-06-02 23:53:18] [INFO ] Deduced a trap composed of 114 places in 296 ms of which 4 ms to minimize.
[2024-06-02 23:53:18] [INFO ] Deduced a trap composed of 41 places in 266 ms of which 2 ms to minimize.
[2024-06-02 23:53:18] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:53:19] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 2 ms to minimize.
[2024-06-02 23:53:20] [INFO ] Deduced a trap composed of 98 places in 173 ms of which 2 ms to minimize.
[2024-06-02 23:53:20] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 2 ms to minimize.
[2024-06-02 23:53:20] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 2 ms to minimize.
[2024-06-02 23:53:20] [INFO ] Deduced a trap composed of 113 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:53:20] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 3 ms to minimize.
[2024-06-02 23:53:21] [INFO ] Deduced a trap composed of 44 places in 258 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-06-02 23:53:22] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 2 ms to minimize.
[2024-06-02 23:53:22] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 2 ms to minimize.
[2024-06-02 23:53:22] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 2 ms to minimize.
[2024-06-02 23:53:22] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:53:23] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2024-06-02 23:53:23] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:53:23] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 2 ms to minimize.
[2024-06-02 23:53:23] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 4 ms to minimize.
[2024-06-02 23:53:23] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 3 ms to minimize.
[2024-06-02 23:53:24] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 2 ms to minimize.
[2024-06-02 23:53:24] [INFO ] Deduced a trap composed of 25 places in 250 ms of which 3 ms to minimize.
[2024-06-02 23:53:24] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 2 ms to minimize.
[2024-06-02 23:53:25] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 2 ms to minimize.
[2024-06-02 23:53:25] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 2 ms to minimize.
[2024-06-02 23:53:25] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 2 ms to minimize.
[2024-06-02 23:53:25] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 2 ms to minimize.
[2024-06-02 23:53:25] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 3 ms to minimize.
[2024-06-02 23:53:26] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 3 ms to minimize.
[2024-06-02 23:53:26] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 2 ms to minimize.
[2024-06-02 23:53:27] [INFO ] Deduced a trap composed of 126 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-06-02 23:53:30] [INFO ] Deduced a trap composed of 113 places in 193 ms of which 3 ms to minimize.
[2024-06-02 23:53:31] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 3 ms to minimize.
[2024-06-02 23:53:31] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 3 ms to minimize.
[2024-06-02 23:53:31] [INFO ] Deduced a trap composed of 45 places in 260 ms of which 4 ms to minimize.
[2024-06-02 23:53:32] [INFO ] Deduced a trap composed of 28 places in 302 ms of which 4 ms to minimize.
[2024-06-02 23:53:32] [INFO ] Deduced a trap composed of 25 places in 324 ms of which 3 ms to minimize.
[2024-06-02 23:53:34] [INFO ] Deduced a trap composed of 122 places in 253 ms of which 3 ms to minimize.
[2024-06-02 23:53:34] [INFO ] Deduced a trap composed of 52 places in 237 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-06-02 23:53:36] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 2 ms to minimize.
[2024-06-02 23:53:36] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:53:36] [INFO ] Deduced a trap composed of 97 places in 168 ms of which 2 ms to minimize.
[2024-06-02 23:53:36] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 2 ms to minimize.
[2024-06-02 23:53:37] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 2 ms to minimize.
[2024-06-02 23:53:37] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 2 ms to minimize.
[2024-06-02 23:53:38] [INFO ] Deduced a trap composed of 113 places in 183 ms of which 2 ms to minimize.
[2024-06-02 23:53:38] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 2 ms to minimize.
[2024-06-02 23:53:38] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/676 variables, and 64 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/195 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 57/64 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-06-02 23:53:43] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 2 ms to minimize.
[2024-06-02 23:53:43] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 2 ms to minimize.
[2024-06-02 23:53:44] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 2 ms to minimize.
[2024-06-02 23:53:44] [INFO ] Deduced a trap composed of 113 places in 156 ms of which 2 ms to minimize.
[2024-06-02 23:53:44] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-06-02 23:53:48] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-06-02 23:53:52] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-06-02 23:53:55] [INFO ] Deduced a trap composed of 120 places in 143 ms of which 2 ms to minimize.
[2024-06-02 23:53:55] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-06-02 23:53:57] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 2 ms to minimize.
[2024-06-02 23:53:57] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 3 ms to minimize.
[2024-06-02 23:53:58] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-06-02 23:54:01] [INFO ] Deduced a trap composed of 116 places in 187 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
At refinement iteration 10 (OVERLAPS) 481/676 variables, 195/272 constraints. Problems are: Problem set: 50 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/676 variables, and 702 constraints, problems are : Problem set: 50 solved, 430 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 430/480 constraints, Known Traps: 70/70 constraints]
After SMT, in 60504ms problems are : Problem set: 50 solved, 430 unsolved
Search for dead transitions found 50 dead transitions in 60511ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 195/220 places, 431/526 transitions.
Applied a total of 0 rules in 3 ms. Remains 195 /195 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61002 ms. Remains : 195/220 places, 431/526 transitions.
[2024-06-02 23:54:10] [INFO ] Flatten gal took : 22 ms
[2024-06-02 23:54:10] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:54:10] [INFO ] Input system was already deterministic with 431 transitions.
[2024-06-02 23:54:10] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:54:10] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:54:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality15640383914522275861.gal : 5 ms
[2024-06-02 23:54:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality8993297346601071513.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/CTLCardinality15640383914522275861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8993297346601071513.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:54:40] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:54:40] [INFO ] Applying decomposition
[2024-06-02 23:54:40] [INFO ] Flatten gal took : 20 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/graph12442350458911739807.txt' '-o' '/tmp/graph12442350458911739807.bin' '-w' '/tmp/graph12442350458911739807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12442350458911739807.bin' '-l' '-1' '-v' '-w' '/tmp/graph12442350458911739807.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:54:40] [INFO ] Decomposing Gal with order
[2024-06-02 23:54:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:54:40] [INFO ] Removed a total of 963 redundant transitions.
[2024-06-02 23:54:40] [INFO ] Flatten gal took : 50 ms
[2024-06-02 23:54:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 22 ms.
[2024-06-02 23:54:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality15915378689153856394.gal : 6 ms
[2024-06-02 23:54:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality5990690995770010775.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/CTLCardinality15915378689153856394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5990690995770010775.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,3.4064e+07,2.06902,63468,2644,45,121669,851,1011,279243,92,2187,0


Converting to forward existential form...Done !
original formula: E((i9.u45.p181!=0) U (AX(((E(((i3.i0.u12.p81==0)||(i3.i0.u18.p78==1)) U (i2.u14.p61==1)) + A(((i3.i1.u11.p52==0)||(i3.i1.u61.p246==1)) U ...388
=> equivalent forward existential formula: (([FwdG((FwdU(Init,(i9.u45.p181!=0)) * !(EX(!(((E(((i3.i0.u12.p81==0)||(i3.i0.u18.p78==1)) U (i2.u14.p61==1)) + ...1686
Reverse transition relation is NOT exact ! Due to transitions t27, t42, t86, t97, t142, t162, t169, t175, t177, t185, t193, t197, t219, t221, t227, t229, t...1172
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 194 transition count 481
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 194 transition count 481
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 68 place count 194 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 193 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 193 transition count 463
Applied a total of 70 rules in 6 ms. Remains 193 /220 variables (removed 27) and now considering 463/526 (removed 63) transitions.
// Phase 1: matrix 463 rows 193 cols
[2024-06-02 23:55:10] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:55:11] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-02 23:55:11] [INFO ] Invariant cache hit.
[2024-06-02 23:55:11] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-02 23:55:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 23:55:19] [INFO ] Deduced a trap composed of 20 places in 324 ms of which 3 ms to minimize.
[2024-06-02 23:55:19] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 4 ms to minimize.
[2024-06-02 23:55:19] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 3 ms to minimize.
[2024-06-02 23:55:19] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 3 ms to minimize.
[2024-06-02 23:55:20] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 8 ms to minimize.
[2024-06-02 23:55:20] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 3 ms to minimize.
[2024-06-02 23:55:20] [INFO ] Deduced a trap composed of 25 places in 294 ms of which 4 ms to minimize.
[2024-06-02 23:55:21] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 3 ms to minimize.
[2024-06-02 23:55:21] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 4 ms to minimize.
[2024-06-02 23:55:21] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 4 ms to minimize.
[2024-06-02 23:55:21] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:55:22] [INFO ] Deduced a trap composed of 34 places in 279 ms of which 3 ms to minimize.
[2024-06-02 23:55:22] [INFO ] Deduced a trap composed of 37 places in 293 ms of which 4 ms to minimize.
[2024-06-02 23:55:22] [INFO ] Deduced a trap composed of 116 places in 289 ms of which 3 ms to minimize.
[2024-06-02 23:55:22] [INFO ] Deduced a trap composed of 113 places in 206 ms of which 3 ms to minimize.
[2024-06-02 23:55:23] [INFO ] Deduced a trap composed of 113 places in 212 ms of which 3 ms to minimize.
[2024-06-02 23:55:23] [INFO ] Deduced a trap composed of 113 places in 227 ms of which 3 ms to minimize.
[2024-06-02 23:55:23] [INFO ] Deduced a trap composed of 113 places in 230 ms of which 3 ms to minimize.
[2024-06-02 23:55:23] [INFO ] Deduced a trap composed of 24 places in 318 ms of which 3 ms to minimize.
[2024-06-02 23:55:24] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 23:55:24] [INFO ] Deduced a trap composed of 16 places in 320 ms of which 3 ms to minimize.
[2024-06-02 23:55:25] [INFO ] Deduced a trap composed of 35 places in 287 ms of which 4 ms to minimize.
[2024-06-02 23:55:25] [INFO ] Deduced a trap composed of 43 places in 277 ms of which 4 ms to minimize.
[2024-06-02 23:55:25] [INFO ] Deduced a trap composed of 122 places in 266 ms of which 3 ms to minimize.
[2024-06-02 23:55:26] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 2 ms to minimize.
[2024-06-02 23:55:27] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 3 ms to minimize.
[2024-06-02 23:55:27] [INFO ] Deduced a trap composed of 21 places in 273 ms of which 3 ms to minimize.
[2024-06-02 23:55:28] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 3 ms to minimize.
[2024-06-02 23:55:28] [INFO ] Deduced a trap composed of 21 places in 300 ms of which 3 ms to minimize.
[2024-06-02 23:55:28] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 3 ms to minimize.
[2024-06-02 23:55:29] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 5 ms to minimize.
[2024-06-02 23:55:29] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 4 ms to minimize.
[2024-06-02 23:55:29] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 3 ms to minimize.
[2024-06-02 23:55:30] [INFO ] Deduced a trap composed of 121 places in 297 ms of which 3 ms to minimize.
[2024-06-02 23:55:30] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 3 ms to minimize.
[2024-06-02 23:55:30] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 3 ms to minimize.
[2024-06-02 23:55:31] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 3 ms to minimize.
[2024-06-02 23:55:31] [INFO ] Deduced a trap composed of 25 places in 292 ms of which 3 ms to minimize.
[2024-06-02 23:55:31] [INFO ] Deduced a trap composed of 49 places in 297 ms of which 4 ms to minimize.
[2024-06-02 23:55:31] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 23:55:36] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 3 ms to minimize.
[2024-06-02 23:55:37] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 3 ms to minimize.
[2024-06-02 23:55:37] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 2 ms to minimize.
[2024-06-02 23:55:37] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 3 ms to minimize.
[2024-06-02 23:55:38] [INFO ] Deduced a trap composed of 101 places in 268 ms of which 3 ms to minimize.
[2024-06-02 23:55:38] [INFO ] Deduced a trap composed of 16 places in 248 ms of which 3 ms to minimize.
[2024-06-02 23:55:38] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 3 ms to minimize.
[2024-06-02 23:55:39] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2024-06-02 23:55:39] [INFO ] Deduced a trap composed of 21 places in 298 ms of which 3 ms to minimize.
[2024-06-02 23:55:39] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-06-02 23:55:39] [INFO ] Deduced a trap composed of 25 places in 303 ms of which 3 ms to minimize.
[2024-06-02 23:55:40] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 3 ms to minimize.
[2024-06-02 23:55:41] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 193/656 variables, and 60 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/193 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 23:55:46] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 2 ms to minimize.
[2024-06-02 23:55:46] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 2 ms to minimize.
[2024-06-02 23:55:46] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 3 ms to minimize.
[2024-06-02 23:55:47] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 3 ms to minimize.
[2024-06-02 23:55:48] [INFO ] Deduced a trap composed of 118 places in 257 ms of which 3 ms to minimize.
[2024-06-02 23:55:48] [INFO ] Deduced a trap composed of 127 places in 286 ms of which 3 ms to minimize.
[2024-06-02 23:55:49] [INFO ] Deduced a trap composed of 122 places in 307 ms of which 3 ms to minimize.
[2024-06-02 23:55:49] [INFO ] Deduced a trap composed of 132 places in 289 ms of which 4 ms to minimize.
[2024-06-02 23:55:50] [INFO ] Deduced a trap composed of 114 places in 301 ms of which 3 ms to minimize.
[2024-06-02 23:55:50] [INFO ] Deduced a trap composed of 119 places in 295 ms of which 4 ms to minimize.
[2024-06-02 23:55:50] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 2 ms to minimize.
[2024-06-02 23:55:50] [INFO ] Deduced a trap composed of 124 places in 306 ms of which 4 ms to minimize.
[2024-06-02 23:55:51] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 3 ms to minimize.
[2024-06-02 23:55:51] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 23:55:56] [INFO ] Deduced a trap composed of 124 places in 294 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 23:55:59] [INFO ] Deduced a trap composed of 121 places in 240 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 23:56:04] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:56:05] [INFO ] Deduced a trap composed of 117 places in 236 ms of which 4 ms to minimize.
[2024-06-02 23:56:05] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 8 (OVERLAPS) 463/656 variables, 193/272 constraints. Problems are: Problem set: 50 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 656/656 variables, and 684 constraints, problems are : Problem set: 50 solved, 412 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 412/462 constraints, Known Traps: 72/72 constraints]
After SMT, in 60579ms problems are : Problem set: 50 solved, 412 unsolved
Search for dead transitions found 50 dead transitions in 60588ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 193/220 places, 413/526 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61187 ms. Remains : 193/220 places, 413/526 transitions.
[2024-06-02 23:56:12] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:56:12] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:56:12] [INFO ] Input system was already deterministic with 413 transitions.
[2024-06-02 23:56:12] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:56:12] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:56:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality637424801560541516.gal : 3 ms
[2024-06-02 23:56:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality9156649693936359214.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality637424801560541516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9156649693936359214.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:56:42] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:56:42] [INFO ] Applying decomposition
[2024-06-02 23:56:42] [INFO ] Flatten gal took : 23 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/graph13297104778806680294.txt' '-o' '/tmp/graph13297104778806680294.bin' '-w' '/tmp/graph13297104778806680294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13297104778806680294.bin' '-l' '-1' '-v' '-w' '/tmp/graph13297104778806680294.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:56:42] [INFO ] Decomposing Gal with order
[2024-06-02 23:56:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:56:42] [INFO ] Removed a total of 944 redundant transitions.
[2024-06-02 23:56:42] [INFO ] Flatten gal took : 54 ms
[2024-06-02 23:56:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 18 ms.
[2024-06-02 23:56:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality15439512557693643161.gal : 9 ms
[2024-06-02 23:56:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality7037201994530054086.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/CTLCardinality15439512557693643161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7037201994530054086.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.96879e+07,3.42642,89024,2615,38,159171,617,823,471688,86,1491,0


Converting to forward existential form...Done !
original formula: EF((AF(((((((i1.u5.p25==0)||(i6.i0.i1.u40.p132==1)) * EG((i1.u24.p105==1))) + EX((i1.u61.p235==1))) + (EF((i1.u44.p238==1)) + (i0.u8.p33=...240
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(EG(!(((((((i1.u5.p25==0)||(i6.i0.i1.u40.p132==1)) * EG((i1.u24.p105==1))) + EX((i1.u61...304
Reverse transition relation is NOT exact ! Due to transitions t19, t38, t107, t112, t115, t167, t172, t177, t185, t191, t193, t218, t226, t250, t258, t264,...1123
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,15.9973,444056,1,0,625713,769,5848,3.54004e+06,403,2452,957865
FORMULA MedleyA-PT-17-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Graph (trivial) has 234 edges and 220 vertex of which 9 / 220 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 213 transition count 492
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 186 transition count 492
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 55 place count 186 transition count 476
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 87 place count 170 transition count 476
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 113 place count 144 transition count 430
Iterating global reduction 2 with 26 rules applied. Total rules applied 139 place count 144 transition count 430
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 155 place count 144 transition count 414
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 155 place count 144 transition count 412
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 142 transition count 412
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 139 transition count 382
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 139 transition count 382
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 195 place count 124 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 124 transition count 366
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 123 transition count 364
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 123 transition count 364
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 205 place count 123 transition count 357
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 211 place count 120 transition count 354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 119 transition count 353
Applied a total of 212 rules in 77 ms. Remains 119 /220 variables (removed 101) and now considering 353/526 (removed 173) transitions.
[2024-06-02 23:56:58] [INFO ] Flow matrix only has 351 transitions (discarded 2 similar events)
// Phase 1: matrix 351 rows 119 cols
[2024-06-02 23:56:58] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:56:58] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-02 23:56:58] [INFO ] Flow matrix only has 351 transitions (discarded 2 similar events)
[2024-06-02 23:56:58] [INFO ] Invariant cache hit.
[2024-06-02 23:56:59] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-02 23:56:59] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2024-06-02 23:56:59] [INFO ] Redundant transitions in 6 ms returned []
Running 345 sub problems to find dead transitions.
[2024-06-02 23:56:59] [INFO ] Flow matrix only has 351 transitions (discarded 2 similar events)
[2024-06-02 23:56:59] [INFO ] Invariant cache hit.
[2024-06-02 23:56:59] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-06-02 23:57:02] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:57:02] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:57:02] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:57:02] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:57:02] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2024-06-02 23:57:02] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 1 ms to minimize.
[2024-06-02 23:57:02] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-06-02 23:57:02] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:57:03] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-06-02 23:57:03] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (OVERLAPS) 2/119 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-06-02 23:57:08] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:57:08] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 3 ms to minimize.
[2024-06-02 23:57:08] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:57:09] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 3 ms to minimize.
[2024-06-02 23:57:09] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 2 ms to minimize.
[2024-06-02 23:57:09] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-06-02 23:57:09] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:57:09] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 2 ms to minimize.
[2024-06-02 23:57:10] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 350/469 variables, 119/145 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 64/209 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 9 (OVERLAPS) 1/470 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 210 constraints, problems are : Problem set: 0 solved, 345 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (OVERLAPS) 2/119 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
At refinement iteration 6 (OVERLAPS) 350/469 variables, 119/145 constraints. Problems are: Problem set: 36 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 64/209 constraints. Problems are: Problem set: 36 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 309/518 constraints. Problems are: Problem set: 36 solved, 309 unsolved
[2024-06-02 23:57:45] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:57:47] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 2/520 constraints. Problems are: Problem set: 36 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/470 variables, and 520 constraints, problems are : Problem set: 36 solved, 309 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 309/345 constraints, Known Traps: 21/21 constraints]
After SMT, in 60496ms problems are : Problem set: 36 solved, 309 unsolved
Search for dead transitions found 36 dead transitions in 60507ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 119/220 places, 317/526 transitions.
Applied a total of 0 rules in 6 ms. Remains 119 /119 variables (removed 0) and now considering 317/317 (removed 0) transitions.
[2024-06-02 23:57:59] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61258 ms. Remains : 119/220 places, 317/526 transitions.
[2024-06-02 23:57:59] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:57:59] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:58:00] [INFO ] Input system was already deterministic with 317 transitions.
[2024-06-02 23:58:00] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:58:00] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:58:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality5179582391602691852.gal : 3 ms
[2024-06-02 23:58:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality12360250139039717672.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/CTLCardinality5179582391602691852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12360250139039717672.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77846e+06,6.1138,119344,2,26883,5,330371,6,0,793,331611,0


Converting to forward existential form...Done !
original formula: EG(((p171==0)||(p53==1)))
=> equivalent forward existential formula: [FwdG(Init,((p171==0)||(p53==1)))] != FALSE
Hit Full ! (commute/partial/dont) 302/0/15
(forward)formula 0,1,22.8662,371276,1,0,17,1.44009e+06,19,4,5636,1.05844e+06,14
FORMULA MedleyA-PT-17-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 191 transition count 477
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 191 transition count 477
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 75 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 189 transition count 456
Applied a total of 79 rules in 6 ms. Remains 189 /220 variables (removed 31) and now considering 456/526 (removed 70) transitions.
// Phase 1: matrix 456 rows 189 cols
[2024-06-02 23:58:23] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:58:23] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 23:58:23] [INFO ] Invariant cache hit.
[2024-06-02 23:58:23] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-06-02 23:58:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:58:28] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 2 ms to minimize.
[2024-06-02 23:58:28] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 3 ms to minimize.
[2024-06-02 23:58:28] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 2 ms to minimize.
[2024-06-02 23:58:29] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:58:29] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
[2024-06-02 23:58:29] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 2 ms to minimize.
[2024-06-02 23:58:29] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 2 ms to minimize.
[2024-06-02 23:58:29] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 2 ms to minimize.
[2024-06-02 23:58:30] [INFO ] Deduced a trap composed of 85 places in 172 ms of which 2 ms to minimize.
[2024-06-02 23:58:30] [INFO ] Deduced a trap composed of 85 places in 163 ms of which 2 ms to minimize.
[2024-06-02 23:58:30] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 3 ms to minimize.
[2024-06-02 23:58:30] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 3 ms to minimize.
[2024-06-02 23:58:30] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 2 ms to minimize.
[2024-06-02 23:58:31] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:58:31] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 3 ms to minimize.
[2024-06-02 23:58:32] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 2 ms to minimize.
[2024-06-02 23:58:32] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 2 ms to minimize.
[2024-06-02 23:58:32] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 2 ms to minimize.
[2024-06-02 23:58:32] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 2 ms to minimize.
[2024-06-02 23:58:32] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:58:33] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:58:33] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 2 ms to minimize.
[2024-06-02 23:58:33] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 3 ms to minimize.
[2024-06-02 23:58:33] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 2 ms to minimize.
[2024-06-02 23:58:34] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:58:34] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2024-06-02 23:58:34] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:58:34] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 2 ms to minimize.
[2024-06-02 23:58:35] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 2 ms to minimize.
[2024-06-02 23:58:35] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 2 ms to minimize.
[2024-06-02 23:58:36] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 2 ms to minimize.
[2024-06-02 23:58:37] [INFO ] Deduced a trap composed of 115 places in 189 ms of which 2 ms to minimize.
[2024-06-02 23:58:37] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 2 ms to minimize.
[2024-06-02 23:58:38] [INFO ] Deduced a trap composed of 125 places in 220 ms of which 2 ms to minimize.
[2024-06-02 23:58:38] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 2 ms to minimize.
[2024-06-02 23:58:38] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:58:42] [INFO ] Deduced a trap composed of 111 places in 221 ms of which 3 ms to minimize.
[2024-06-02 23:58:42] [INFO ] Deduced a trap composed of 111 places in 214 ms of which 2 ms to minimize.
[2024-06-02 23:58:42] [INFO ] Deduced a trap composed of 111 places in 218 ms of which 3 ms to minimize.
[2024-06-02 23:58:43] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 3 ms to minimize.
[2024-06-02 23:58:44] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 3 ms to minimize.
[2024-06-02 23:58:44] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 3 ms to minimize.
[2024-06-02 23:58:44] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 3 ms to minimize.
[2024-06-02 23:58:45] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 3 ms to minimize.
[2024-06-02 23:58:45] [INFO ] Deduced a trap composed of 90 places in 200 ms of which 2 ms to minimize.
[2024-06-02 23:58:45] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 3 ms to minimize.
[2024-06-02 23:58:46] [INFO ] Deduced a trap composed of 47 places in 206 ms of which 2 ms to minimize.
[2024-06-02 23:58:47] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:58:50] [INFO ] Deduced a trap composed of 112 places in 282 ms of which 4 ms to minimize.
[2024-06-02 23:58:50] [INFO ] Deduced a trap composed of 31 places in 305 ms of which 3 ms to minimize.
[2024-06-02 23:58:50] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 3 ms to minimize.
[2024-06-02 23:58:51] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 3 ms to minimize.
[2024-06-02 23:58:51] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/645 variables, and 60 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 23:58:59] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 3 ms to minimize.
[2024-06-02 23:58:59] [INFO ] Deduced a trap composed of 34 places in 281 ms of which 3 ms to minimize.
[2024-06-02 23:58:59] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 3 ms to minimize.
[2024-06-02 23:59:00] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 3 ms to minimize.
[2024-06-02 23:59:00] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 2 ms to minimize.
[2024-06-02 23:59:00] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 2 ms to minimize.
[2024-06-02 23:59:01] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 3 ms to minimize.
[2024-06-02 23:59:01] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 5 (OVERLAPS) 456/645 variables, 189/257 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 405/662 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 662 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 61/61 constraints]
After SMT, in 60391ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60396ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/220 places, 406/526 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60920 ms. Remains : 189/220 places, 406/526 transitions.
[2024-06-02 23:59:23] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:59:24] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:59:24] [INFO ] Input system was already deterministic with 406 transitions.
[2024-06-02 23:59:24] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:59:24] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:59:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality15487012223357335609.gal : 3 ms
[2024-06-02 23:59:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality536450110552047029.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/CTLCardinality15487012223357335609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality536450110552047029.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:59:54] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:59:54] [INFO ] Applying decomposition
[2024-06-02 23:59:54] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10311792681782288130.txt' '-o' '/tmp/graph10311792681782288130.bin' '-w' '/tmp/graph10311792681782288130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10311792681782288130.bin' '-l' '-1' '-v' '-w' '/tmp/graph10311792681782288130.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:59:54] [INFO ] Decomposing Gal with order
[2024-06-02 23:59:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:59:54] [INFO ] Removed a total of 941 redundant transitions.
[2024-06-02 23:59:54] [INFO ] Flatten gal took : 55 ms
[2024-06-02 23:59:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 18 ms.
[2024-06-02 23:59:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality883586730026716530.gal : 6 ms
[2024-06-02 23:59:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality18339325950189490086.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/CTLCardinality883586730026716530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18339325950189490086.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77138e+07,4.20343,118380,2084,32,219542,1106,819,661232,75,3028,0


Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t41, t82, t93, t97, t162, t168, t170, t178, t184, t186, t210, t212, t218, t220, t242, t2...932
(forward)formula 0,0,5.48928,118380,1,0,219542,1106,4895,700765,295,3028,297174
FORMULA MedleyA-PT-17-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 192 transition count 479
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 192 transition count 479
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 73 place count 192 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 190 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 190 transition count 458
Applied a total of 77 rules in 6 ms. Remains 190 /220 variables (removed 30) and now considering 458/526 (removed 68) transitions.
// Phase 1: matrix 458 rows 190 cols
[2024-06-02 23:59:59] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:59:59] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 23:59:59] [INFO ] Invariant cache hit.
[2024-06-03 00:00:00] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-03 00:00:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:00:06] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 2 ms to minimize.
[2024-06-03 00:00:06] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 2 ms to minimize.
[2024-06-03 00:00:06] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-06-03 00:00:06] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-03 00:00:06] [INFO ] Deduced a trap composed of 112 places in 164 ms of which 2 ms to minimize.
[2024-06-03 00:00:06] [INFO ] Deduced a trap composed of 111 places in 226 ms of which 3 ms to minimize.
[2024-06-03 00:00:07] [INFO ] Deduced a trap composed of 112 places in 224 ms of which 4 ms to minimize.
[2024-06-03 00:00:07] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 2 ms to minimize.
[2024-06-03 00:00:07] [INFO ] Deduced a trap composed of 111 places in 262 ms of which 3 ms to minimize.
[2024-06-03 00:00:07] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 3 ms to minimize.
[2024-06-03 00:00:08] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 3 ms to minimize.
[2024-06-03 00:00:08] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 2 ms to minimize.
[2024-06-03 00:00:08] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 2 ms to minimize.
[2024-06-03 00:00:09] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 2 ms to minimize.
[2024-06-03 00:00:09] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 2 ms to minimize.
[2024-06-03 00:00:09] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 3 ms to minimize.
[2024-06-03 00:00:09] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 2 ms to minimize.
[2024-06-03 00:00:10] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 1 ms to minimize.
[2024-06-03 00:00:10] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 3 ms to minimize.
[2024-06-03 00:00:10] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:00:10] [INFO ] Deduced a trap composed of 111 places in 148 ms of which 2 ms to minimize.
[2024-06-03 00:00:11] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 3 ms to minimize.
[2024-06-03 00:00:11] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 2 ms to minimize.
[2024-06-03 00:00:12] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 3 ms to minimize.
[2024-06-03 00:00:12] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 2 ms to minimize.
[2024-06-03 00:00:12] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 2 ms to minimize.
[2024-06-03 00:00:12] [INFO ] Deduced a trap composed of 128 places in 189 ms of which 3 ms to minimize.
[2024-06-03 00:00:12] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 2 ms to minimize.
[2024-06-03 00:00:12] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 2 ms to minimize.
[2024-06-03 00:00:13] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 2 ms to minimize.
[2024-06-03 00:00:13] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:00:13] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 3 ms to minimize.
[2024-06-03 00:00:13] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 3 ms to minimize.
[2024-06-03 00:00:14] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 3 ms to minimize.
[2024-06-03 00:00:14] [INFO ] Deduced a trap composed of 115 places in 139 ms of which 2 ms to minimize.
[2024-06-03 00:00:15] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 3 ms to minimize.
[2024-06-03 00:00:15] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 3 ms to minimize.
[2024-06-03 00:00:15] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:00:19] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 3 ms to minimize.
[2024-06-03 00:00:19] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2024-06-03 00:00:19] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 2 ms to minimize.
[2024-06-03 00:00:19] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-06-03 00:00:19] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 2 ms to minimize.
[2024-06-03 00:00:20] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 2 ms to minimize.
[2024-06-03 00:00:20] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 2 ms to minimize.
[2024-06-03 00:00:20] [INFO ] Deduced a trap composed of 112 places in 162 ms of which 1 ms to minimize.
[2024-06-03 00:00:20] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:00:24] [INFO ] Deduced a trap composed of 112 places in 262 ms of which 3 ms to minimize.
[2024-06-03 00:00:25] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 00:00:29] [INFO ] Deduced a trap composed of 115 places in 258 ms of which 3 ms to minimize.
[2024-06-03 00:00:30] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 3 ms to minimize.
[2024-06-03 00:00:30] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 3 ms to minimize.
[2024-06-03 00:00:30] [INFO ] Deduced a trap composed of 33 places in 287 ms of which 4 ms to minimize.
SMT process timed out in 30399ms, After SMT, problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 30405ms
Starting structural reductions in LTL mode, iteration 1 : 190/220 places, 458/526 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30934 ms. Remains : 190/220 places, 458/526 transitions.
[2024-06-03 00:00:30] [INFO ] Flatten gal took : 26 ms
[2024-06-03 00:00:30] [INFO ] Flatten gal took : 27 ms
[2024-06-03 00:00:30] [INFO ] Input system was already deterministic with 458 transitions.
[2024-06-03 00:00:30] [INFO ] Flatten gal took : 26 ms
[2024-06-03 00:00:30] [INFO ] Flatten gal took : 27 ms
[2024-06-03 00:00:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality16548029824305512210.gal : 5 ms
[2024-06-03 00:00:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality137734367828178164.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/CTLCardinality16548029824305512210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality137734367828178164.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 00:01:01] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:01:01] [INFO ] Applying decomposition
[2024-06-03 00:01:01] [INFO ] Flatten gal took : 16 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/graph3532596594131038774.txt' '-o' '/tmp/graph3532596594131038774.bin' '-w' '/tmp/graph3532596594131038774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3532596594131038774.bin' '-l' '-1' '-v' '-w' '/tmp/graph3532596594131038774.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:01:01] [INFO ] Decomposing Gal with order
[2024-06-03 00:01:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:01:01] [INFO ] Removed a total of 1070 redundant transitions.
[2024-06-03 00:01:01] [INFO ] Flatten gal took : 40 ms
[2024-06-03 00:01:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 7 ms.
[2024-06-03 00:01:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality5271164020130818818.gal : 5 ms
[2024-06-03 00:01:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality5786365143442922116.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/CTLCardinality5271164020130818818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5786365143442922116.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77138e+07,5.10446,119188,3702,513,123252,6519,1003,913195,168,26310,0


Converting to forward existential form...Done !
original formula: EG(AX(AX((AF(((i2.u9.p51==0)&&(i3.u58.p245==1))) * EX((i6.u41.p184==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EX(!((!(EG(!(((i2.u9.p51==0)&&(i3.u58.p245==1))))) * EX((i6.u41.p184==0))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t37, t107, t170, t172, t174, t186, t188, t190, t214, t222, t246, t254, t264, t265, t286,...892
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 191 transition count 477
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 191 transition count 477
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 75 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 189 transition count 456
Applied a total of 79 rules in 8 ms. Remains 189 /220 variables (removed 31) and now considering 456/526 (removed 70) transitions.
// Phase 1: matrix 456 rows 189 cols
[2024-06-03 00:01:31] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 00:01:31] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-03 00:01:31] [INFO ] Invariant cache hit.
[2024-06-03 00:01:31] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-06-03 00:01:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:01:37] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 3 ms to minimize.
[2024-06-03 00:01:37] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 3 ms to minimize.
[2024-06-03 00:01:37] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 3 ms to minimize.
[2024-06-03 00:01:37] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2024-06-03 00:01:38] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 2 ms to minimize.
[2024-06-03 00:01:38] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 3 ms to minimize.
[2024-06-03 00:01:38] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-06-03 00:01:38] [INFO ] Deduced a trap composed of 111 places in 218 ms of which 3 ms to minimize.
[2024-06-03 00:01:38] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 2 ms to minimize.
[2024-06-03 00:01:39] [INFO ] Deduced a trap composed of 85 places in 232 ms of which 3 ms to minimize.
[2024-06-03 00:01:39] [INFO ] Deduced a trap composed of 42 places in 268 ms of which 3 ms to minimize.
[2024-06-03 00:01:39] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 3 ms to minimize.
[2024-06-03 00:01:40] [INFO ] Deduced a trap composed of 41 places in 244 ms of which 3 ms to minimize.
[2024-06-03 00:01:40] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 3 ms to minimize.
[2024-06-03 00:01:41] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 4 ms to minimize.
[2024-06-03 00:01:41] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 3 ms to minimize.
[2024-06-03 00:01:42] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 3 ms to minimize.
[2024-06-03 00:01:42] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 3 ms to minimize.
[2024-06-03 00:01:42] [INFO ] Deduced a trap composed of 40 places in 299 ms of which 3 ms to minimize.
[2024-06-03 00:01:43] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:01:43] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 3 ms to minimize.
[2024-06-03 00:01:43] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 4 ms to minimize.
[2024-06-03 00:01:44] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 3 ms to minimize.
[2024-06-03 00:01:44] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 4 ms to minimize.
[2024-06-03 00:01:44] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 4 ms to minimize.
[2024-06-03 00:01:45] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 3 ms to minimize.
[2024-06-03 00:01:45] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 3 ms to minimize.
[2024-06-03 00:01:46] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 3 ms to minimize.
[2024-06-03 00:01:47] [INFO ] Deduced a trap composed of 39 places in 273 ms of which 3 ms to minimize.
[2024-06-03 00:01:47] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 3 ms to minimize.
[2024-06-03 00:01:48] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 3 ms to minimize.
[2024-06-03 00:01:49] [INFO ] Deduced a trap composed of 115 places in 236 ms of which 4 ms to minimize.
[2024-06-03 00:01:49] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 3 ms to minimize.
[2024-06-03 00:01:50] [INFO ] Deduced a trap composed of 125 places in 291 ms of which 3 ms to minimize.
[2024-06-03 00:01:50] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 2 ms to minimize.
[2024-06-03 00:01:51] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:01:55] [INFO ] Deduced a trap composed of 111 places in 217 ms of which 3 ms to minimize.
[2024-06-03 00:01:55] [INFO ] Deduced a trap composed of 111 places in 213 ms of which 3 ms to minimize.
[2024-06-03 00:01:55] [INFO ] Deduced a trap composed of 111 places in 219 ms of which 3 ms to minimize.
[2024-06-03 00:01:57] [INFO ] Deduced a trap composed of 39 places in 292 ms of which 3 ms to minimize.
[2024-06-03 00:01:57] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 3 ms to minimize.
[2024-06-03 00:01:57] [INFO ] Deduced a trap composed of 28 places in 299 ms of which 3 ms to minimize.
[2024-06-03 00:01:58] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 3 ms to minimize.
[2024-06-03 00:01:58] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 3 ms to minimize.
[2024-06-03 00:01:58] [INFO ] Deduced a trap composed of 90 places in 198 ms of which 2 ms to minimize.
[2024-06-03 00:01:59] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 3 ms to minimize.
[2024-06-03 00:02:00] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 4 ms to minimize.
[2024-06-03 00:02:00] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/645 variables, and 55 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:02:05] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 2 ms to minimize.
[2024-06-03 00:02:06] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:02:06] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:02:08] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:02:11] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 2 ms to minimize.
[2024-06-03 00:02:11] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 1 ms to minimize.
[2024-06-03 00:02:11] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 2 ms to minimize.
[2024-06-03 00:02:12] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 2 ms to minimize.
[2024-06-03 00:02:12] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 2 ms to minimize.
[2024-06-03 00:02:12] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:02:14] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 8 (OVERLAPS) 456/645 variables, 189/255 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 405/660 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 660 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 59/59 constraints]
After SMT, in 60468ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60484ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/220 places, 406/526 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61085 ms. Remains : 189/220 places, 406/526 transitions.
[2024-06-03 00:02:32] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:02:32] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:02:32] [INFO ] Input system was already deterministic with 406 transitions.
[2024-06-03 00:02:32] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:02:32] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:02:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality9686559597364333569.gal : 2 ms
[2024-06-03 00:02:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality11589372417287702758.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/CTLCardinality9686559597364333569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11589372417287702758.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 00:03:02] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:03:02] [INFO ] Applying decomposition
[2024-06-03 00:03:02] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12127839786067091326.txt' '-o' '/tmp/graph12127839786067091326.bin' '-w' '/tmp/graph12127839786067091326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12127839786067091326.bin' '-l' '-1' '-v' '-w' '/tmp/graph12127839786067091326.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:03:02] [INFO ] Decomposing Gal with order
[2024-06-03 00:03:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:03:02] [INFO ] Removed a total of 938 redundant transitions.
[2024-06-03 00:03:02] [INFO ] Flatten gal took : 34 ms
[2024-06-03 00:03:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 6 ms.
[2024-06-03 00:03:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality18131539382313312466.gal : 3 ms
[2024-06-03 00:03:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality9261992258278713617.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/CTLCardinality18131539382313312466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9261992258278713617.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77138e+07,1.95121,57344,2281,39,91786,539,813,315627,84,1322,0


Converting to forward existential form...Done !
original formula: EX(AF((i7.u44.p185==1)))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((i7.u44.p185==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t28, t41, t68, t93, t97, t162, t168, t170, t178, t184, t186, t209, t212, t217, t220, t241, t2...948
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 a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Graph (trivial) has 233 edges and 220 vertex of which 9 / 220 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 213 transition count 491
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 185 transition count 491
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 57 place count 185 transition count 476
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 87 place count 170 transition count 476
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 112 place count 145 transition count 431
Iterating global reduction 2 with 25 rules applied. Total rules applied 137 place count 145 transition count 431
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 153 place count 145 transition count 415
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 153 place count 145 transition count 413
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 143 transition count 413
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 140 transition count 383
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 140 transition count 383
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 195 place count 124 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 124 transition count 366
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 123 transition count 364
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 123 transition count 364
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 206 place count 123 transition count 356
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 214 place count 119 transition count 352
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 215 place count 118 transition count 351
Applied a total of 215 rules in 52 ms. Remains 118 /220 variables (removed 102) and now considering 351/526 (removed 175) transitions.
[2024-06-03 00:03:32] [INFO ] Flow matrix only has 349 transitions (discarded 2 similar events)
// Phase 1: matrix 349 rows 118 cols
[2024-06-03 00:03:32] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 00:03:32] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-03 00:03:32] [INFO ] Flow matrix only has 349 transitions (discarded 2 similar events)
[2024-06-03 00:03:32] [INFO ] Invariant cache hit.
[2024-06-03 00:03:33] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-03 00:03:33] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-06-03 00:03:33] [INFO ] Redundant transitions in 3 ms returned []
Running 342 sub problems to find dead transitions.
[2024-06-03 00:03:33] [INFO ] Flow matrix only has 349 transitions (discarded 2 similar events)
[2024-06-03 00:03:33] [INFO ] Invariant cache hit.
[2024-06-03 00:03:33] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-06-03 00:03:35] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:03:35] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2024-06-03 00:03:35] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 1 ms to minimize.
[2024-06-03 00:03:35] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:03:36] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-06-03 00:03:36] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2024-06-03 00:03:36] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-03 00:03:36] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2024-06-03 00:03:36] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:03:36] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-03 00:03:36] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-03 00:03:36] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-06-03 00:03:36] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-03 00:03:36] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-03 00:03:36] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-06-03 00:03:37] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:03:37] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (OVERLAPS) 348/466 variables, 118/142 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 64/206 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (OVERLAPS) 1/467 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (OVERLAPS) 0/467 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 342 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 207 constraints, problems are : Problem set: 0 solved, 342 unsolved in 21382 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 3 (OVERLAPS) 348/466 variables, 118/142 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 64/206 constraints. Problems are: Problem set: 36 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 306/512 constraints. Problems are: Problem set: 36 solved, 306 unsolved
[2024-06-03 00:04:08] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-06-03 00:04:10] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:04:10] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 3/515 constraints. Problems are: Problem set: 36 solved, 306 unsolved
[2024-06-03 00:04:17] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 1/516 constraints. Problems are: Problem set: 36 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/467 variables, and 516 constraints, problems are : Problem set: 36 solved, 306 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 306/342 constraints, Known Traps: 21/21 constraints]
After SMT, in 51821ms problems are : Problem set: 36 solved, 306 unsolved
Search for dead transitions found 36 dead transitions in 51828ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 118/220 places, 315/526 transitions.
Applied a total of 0 rules in 5 ms. Remains 118 /118 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2024-06-03 00:04:25] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 52322 ms. Remains : 118/220 places, 315/526 transitions.
[2024-06-03 00:04:25] [INFO ] Flatten gal took : 8 ms
[2024-06-03 00:04:25] [INFO ] Flatten gal took : 8 ms
[2024-06-03 00:04:25] [INFO ] Input system was already deterministic with 315 transitions.
[2024-06-03 00:04:25] [INFO ] Flatten gal took : 8 ms
[2024-06-03 00:04:25] [INFO ] Flatten gal took : 8 ms
[2024-06-03 00:04:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality2128004418036454934.gal : 2 ms
[2024-06-03 00:04:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality5689739326255204134.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/CTLCardinality2128004418036454934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5689739326255204134.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((!(E(((p79==0)||(p233==1)) U ((p135==0)||(p63==1)))) + (p31==1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(((p79==0)||(p233==1)) U ((p135==0)||(p63==1)))))] != FALSE + [(FwdU(Init,TRUE) * (p31==...169
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t13, t14, t19, t20, t21, t24, t30, t33, t40, t42, t44, t46, t47, t48, t53, ...587
Detected timeout of ITS tools.
[2024-06-03 00:04:55] [INFO ] Flatten gal took : 9 ms
[2024-06-03 00:04:55] [INFO ] Applying decomposition
[2024-06-03 00:04:55] [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/graph5337549283588719650.txt' '-o' '/tmp/graph5337549283588719650.bin' '-w' '/tmp/graph5337549283588719650.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5337549283588719650.bin' '-l' '-1' '-v' '-w' '/tmp/graph5337549283588719650.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:04:55] [INFO ] Decomposing Gal with order
[2024-06-03 00:04:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:04:55] [INFO ] Removed a total of 622 redundant transitions.
[2024-06-03 00:04:55] [INFO ] Flatten gal took : 32 ms
[2024-06-03 00:04:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 7 ms.
[2024-06-03 00:04:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality2052785992758973891.gal : 4 ms
[2024-06-03 00:04:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality11307390510832860982.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/CTLCardinality2052785992758973891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11307390510832860982.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.5496e+06,0.539628,13860,550,73,20314,611,551,29181,80,1857,0


Converting to forward existential form...Done !
original formula: EF((!(E(((i0.u11.p79==0)||(i8.i1.u28.p233==1)) U ((i5.u22.p135==0)||(i1.u9.p63==1)))) + (i2.u5.p31==1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(((i0.u11.p79==0)||(i8.i1.u28.p233==1)) U ((i5.u22.p135==0)||(i1.u9.p63==1)))))] != FALS...205
Reverse transition relation is NOT exact ! Due to transitions t30, t48, t57, t72, t84, t98, t109, t113, t114, t115, t117, t118, t119, t120, t149, t150, t15...589
(forward)formula 0,1,1.17727,27588,1,0,44815,1319,3124,90577,374,4146,115650
FORMULA MedleyA-PT-17-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 198 transition count 488
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 198 transition count 488
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 61 place count 198 transition count 471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 197 transition count 469
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 197 transition count 469
Applied a total of 63 rules in 6 ms. Remains 197 /220 variables (removed 23) and now considering 469/526 (removed 57) transitions.
// Phase 1: matrix 469 rows 197 cols
[2024-06-03 00:04:56] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:04:56] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-03 00:04:56] [INFO ] Invariant cache hit.
[2024-06-03 00:04:57] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Running 468 sub problems to find dead transitions.
[2024-06-03 00:04:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-03 00:05:04] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 4 ms to minimize.
[2024-06-03 00:05:04] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 3 ms to minimize.
[2024-06-03 00:05:05] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:05:05] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:05:05] [INFO ] Deduced a trap composed of 114 places in 295 ms of which 3 ms to minimize.
[2024-06-03 00:05:05] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 4 ms to minimize.
[2024-06-03 00:05:06] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 3 ms to minimize.
[2024-06-03 00:05:06] [INFO ] Deduced a trap composed of 97 places in 225 ms of which 3 ms to minimize.
[2024-06-03 00:05:07] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 3 ms to minimize.
[2024-06-03 00:05:07] [INFO ] Deduced a trap composed of 92 places in 240 ms of which 3 ms to minimize.
[2024-06-03 00:05:08] [INFO ] Deduced a trap composed of 115 places in 272 ms of which 3 ms to minimize.
[2024-06-03 00:05:08] [INFO ] Deduced a trap composed of 115 places in 274 ms of which 4 ms to minimize.
[2024-06-03 00:05:08] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 3 ms to minimize.
[2024-06-03 00:05:09] [INFO ] Deduced a trap composed of 114 places in 196 ms of which 3 ms to minimize.
[2024-06-03 00:05:09] [INFO ] Deduced a trap composed of 121 places in 277 ms of which 4 ms to minimize.
[2024-06-03 00:05:09] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 10 ms to minimize.
[2024-06-03 00:05:10] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 3 ms to minimize.
[2024-06-03 00:05:10] [INFO ] Deduced a trap composed of 115 places in 263 ms of which 3 ms to minimize.
[2024-06-03 00:05:10] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 3 ms to minimize.
[2024-06-03 00:05:11] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-03 00:05:11] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 2 ms to minimize.
[2024-06-03 00:05:11] [INFO ] Deduced a trap composed of 117 places in 255 ms of which 3 ms to minimize.
[2024-06-03 00:05:12] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 3 ms to minimize.
[2024-06-03 00:05:13] [INFO ] Deduced a trap composed of 25 places in 329 ms of which 4 ms to minimize.
[2024-06-03 00:05:13] [INFO ] Deduced a trap composed of 34 places in 328 ms of which 4 ms to minimize.
[2024-06-03 00:05:14] [INFO ] Deduced a trap composed of 46 places in 322 ms of which 4 ms to minimize.
[2024-06-03 00:05:14] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 3 ms to minimize.
[2024-06-03 00:05:14] [INFO ] Deduced a trap composed of 56 places in 298 ms of which 4 ms to minimize.
[2024-06-03 00:05:15] [INFO ] Deduced a trap composed of 45 places in 275 ms of which 3 ms to minimize.
[2024-06-03 00:05:15] [INFO ] Deduced a trap composed of 39 places in 310 ms of which 3 ms to minimize.
[2024-06-03 00:05:15] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 3 ms to minimize.
[2024-06-03 00:05:16] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 3 ms to minimize.
[2024-06-03 00:05:16] [INFO ] Deduced a trap composed of 30 places in 298 ms of which 4 ms to minimize.
[2024-06-03 00:05:16] [INFO ] Deduced a trap composed of 27 places in 309 ms of which 3 ms to minimize.
[2024-06-03 00:05:17] [INFO ] Deduced a trap composed of 52 places in 301 ms of which 4 ms to minimize.
[2024-06-03 00:05:17] [INFO ] Deduced a trap composed of 30 places in 301 ms of which 3 ms to minimize.
[2024-06-03 00:05:18] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 3 ms to minimize.
[2024-06-03 00:05:18] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 3 ms to minimize.
[2024-06-03 00:05:18] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 2 ms to minimize.
[2024-06-03 00:05:18] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-03 00:05:23] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 3 ms to minimize.
[2024-06-03 00:05:23] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 4 ms to minimize.
[2024-06-03 00:05:24] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 3 ms to minimize.
[2024-06-03 00:05:24] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 4 ms to minimize.
[2024-06-03 00:05:24] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 4 ms to minimize.
[2024-06-03 00:05:24] [INFO ] Deduced a trap composed of 41 places in 297 ms of which 3 ms to minimize.
[2024-06-03 00:05:25] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 2 ms to minimize.
[2024-06-03 00:05:26] [INFO ] Deduced a trap composed of 118 places in 250 ms of which 4 ms to minimize.
[2024-06-03 00:05:26] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 197/666 variables, and 56 constraints, problems are : Problem set: 0 solved, 468 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/197 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 468 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-03 00:05:32] [INFO ] Deduced a trap composed of 36 places in 287 ms of which 4 ms to minimize.
[2024-06-03 00:05:32] [INFO ] Deduced a trap composed of 34 places in 286 ms of which 3 ms to minimize.
[2024-06-03 00:05:32] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 4 ms to minimize.
[2024-06-03 00:05:33] [INFO ] Deduced a trap composed of 41 places in 277 ms of which 3 ms to minimize.
[2024-06-03 00:05:33] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 3 ms to minimize.
[2024-06-03 00:05:33] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 3 ms to minimize.
[2024-06-03 00:05:34] [INFO ] Deduced a trap composed of 23 places in 336 ms of which 3 ms to minimize.
[2024-06-03 00:05:34] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 3 ms to minimize.
[2024-06-03 00:05:34] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-03 00:05:38] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 3 ms to minimize.
[2024-06-03 00:05:38] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 4 ms to minimize.
[2024-06-03 00:05:39] [INFO ] Deduced a trap composed of 116 places in 316 ms of which 4 ms to minimize.
[2024-06-03 00:05:39] [INFO ] Deduced a trap composed of 47 places in 275 ms of which 4 ms to minimize.
[2024-06-03 00:05:39] [INFO ] Deduced a trap composed of 27 places in 285 ms of which 3 ms to minimize.
[2024-06-03 00:05:40] [INFO ] Deduced a trap composed of 30 places in 295 ms of which 3 ms to minimize.
[2024-06-03 00:05:40] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 4 ms to minimize.
[2024-06-03 00:05:40] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 3 ms to minimize.
[2024-06-03 00:05:41] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 2 ms to minimize.
[2024-06-03 00:05:41] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-03 00:05:44] [INFO ] Deduced a trap composed of 51 places in 217 ms of which 3 ms to minimize.
[2024-06-03 00:05:46] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 4 ms to minimize.
[2024-06-03 00:05:47] [INFO ] Deduced a trap composed of 117 places in 233 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-03 00:05:50] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 3 ms to minimize.
[2024-06-03 00:05:51] [INFO ] Deduced a trap composed of 129 places in 219 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-03 00:05:54] [INFO ] Deduced a trap composed of 113 places in 204 ms of which 3 ms to minimize.
[2024-06-03 00:05:55] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 197/666 variables, and 82 constraints, problems are : Problem set: 0 solved, 468 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/197 constraints, PredecessorRefiner: 0/468 constraints, Known Traps: 75/75 constraints]
After SMT, in 60520ms problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 60527ms
Starting structural reductions in LTL mode, iteration 1 : 197/220 places, 469/526 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61145 ms. Remains : 197/220 places, 469/526 transitions.
[2024-06-03 00:05:57] [INFO ] Flatten gal took : 27 ms
[2024-06-03 00:05:57] [INFO ] Flatten gal took : 28 ms
[2024-06-03 00:05:57] [INFO ] Input system was already deterministic with 469 transitions.
[2024-06-03 00:05:57] [INFO ] Flatten gal took : 27 ms
[2024-06-03 00:05:57] [INFO ] Flatten gal took : 27 ms
[2024-06-03 00:05:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality9724378081875722082.gal : 4 ms
[2024-06-03 00:05:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality4758541703581848213.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/CTLCardinality9724378081875722082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4758541703581848213.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 00:06:27] [INFO ] Flatten gal took : 30 ms
[2024-06-03 00:06:27] [INFO ] Applying decomposition
[2024-06-03 00:06:27] [INFO ] Flatten gal took : 28 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/graph6750378316485219114.txt' '-o' '/tmp/graph6750378316485219114.bin' '-w' '/tmp/graph6750378316485219114.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6750378316485219114.bin' '-l' '-1' '-v' '-w' '/tmp/graph6750378316485219114.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:06:28] [INFO ] Decomposing Gal with order
[2024-06-03 00:06:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:06:28] [INFO ] Removed a total of 1256 redundant transitions.
[2024-06-03 00:06:28] [INFO ] Flatten gal took : 55 ms
[2024-06-03 00:06:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 15 ms.
[2024-06-03 00:06:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality9891333224148257130.gal : 7 ms
[2024-06-03 00:06:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality3564971367733559172.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/CTLCardinality9891333224148257130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3564971367733559172.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,3.544e+07,7.30904,158288,4364,39,229673,721,949,921807,81,1974,0


Converting to forward existential form...Done !
original formula: ((EF(((EX(((i6.i1.i1.u39.p152==0)&&(i6.i0.i0.u34.p160==1))) + EF((i10.u51.p196==0))) + EX(TRUE))) * EG((AF(((i7.u65.p241==0)||(i6.i1.i1.u...468
=> equivalent forward existential formula: [(((Init * (E(TRUE U ((EX(((i6.i1.i1.u39.p152==0)&&(i6.i0.i0.u34.p160==1))) + E(TRUE U (i10.u51.p196==0))) + EX(...791
Reverse transition relation is NOT exact ! Due to transitions t27, t42, t121, t159, t163, t180, t182, t184, t194, t195, t197, t201, t223, t225, t231, t233,...1236
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Graph (trivial) has 229 edges and 220 vertex of which 3 / 220 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 217 transition count 495
Reduce places removed 28 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 189 transition count 492
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 186 transition count 492
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 63 place count 186 transition count 477
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 93 place count 171 transition count 477
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 117 place count 147 transition count 434
Iterating global reduction 3 with 24 rules applied. Total rules applied 141 place count 147 transition count 434
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 157 place count 147 transition count 418
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 157 place count 147 transition count 417
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 146 transition count 417
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 145 transition count 401
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 145 transition count 401
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 191 place count 130 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 192 place count 130 transition count 385
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 193 place count 129 transition count 383
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 129 transition count 383
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 202 place count 129 transition count 375
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 210 place count 125 transition count 371
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 124 transition count 370
Applied a total of 211 rules in 46 ms. Remains 124 /220 variables (removed 96) and now considering 370/526 (removed 156) transitions.
// Phase 1: matrix 370 rows 124 cols
[2024-06-03 00:06:58] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:06:58] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-03 00:06:58] [INFO ] Invariant cache hit.
[2024-06-03 00:06:58] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-06-03 00:06:58] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-06-03 00:06:58] [INFO ] Redundant transitions in 3 ms returned []
Running 369 sub problems to find dead transitions.
[2024-06-03 00:06:58] [INFO ] Invariant cache hit.
[2024-06-03 00:06:58] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-03 00:07:03] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 3 ms to minimize.
[2024-06-03 00:07:03] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 3 ms to minimize.
[2024-06-03 00:07:04] [INFO ] Deduced a trap composed of 62 places in 186 ms of which 2 ms to minimize.
[2024-06-03 00:07:04] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 2 ms to minimize.
[2024-06-03 00:07:04] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 2 ms to minimize.
[2024-06-03 00:07:05] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 2 ms to minimize.
[2024-06-03 00:07:05] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 2 ms to minimize.
[2024-06-03 00:07:05] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-06-03 00:07:05] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 2 ms to minimize.
[2024-06-03 00:07:05] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 2 ms to minimize.
[2024-06-03 00:07:06] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 2 ms to minimize.
[2024-06-03 00:07:06] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 3 ms to minimize.
[2024-06-03 00:07:06] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 3 ms to minimize.
[2024-06-03 00:07:06] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2024-06-03 00:07:06] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-03 00:07:07] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:07:07] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2024-06-03 00:07:07] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 2 ms to minimize.
[2024-06-03 00:07:07] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
[2024-06-03 00:07:08] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-03 00:07:10] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 2 ms to minimize.
[2024-06-03 00:07:11] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 2 ms to minimize.
[2024-06-03 00:07:12] [INFO ] Deduced a trap composed of 29 places in 189 ms of which 2 ms to minimize.
[2024-06-03 00:07:12] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 2 ms to minimize.
[2024-06-03 00:07:12] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 2 ms to minimize.
[2024-06-03 00:07:12] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 3 ms to minimize.
[2024-06-03 00:07:13] [INFO ] Deduced a trap composed of 79 places in 161 ms of which 2 ms to minimize.
[2024-06-03 00:07:13] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (OVERLAPS) 369/493 variables, 124/159 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 96/255 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 1/494 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/494 variables, and 256 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 6 (OVERLAPS) 369/493 variables, 124/159 constraints. Problems are: Problem set: 42 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 96/255 constraints. Problems are: Problem set: 42 solved, 327 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 327/582 constraints. Problems are: Problem set: 42 solved, 327 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 0/582 constraints. Problems are: Problem set: 42 solved, 327 unsolved
SMT process timed out in 60351ms, After SMT, problems are : Problem set: 42 solved, 327 unsolved
Search for dead transitions found 42 dead transitions in 60355ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 124/220 places, 328/526 transitions.
Applied a total of 0 rules in 12 ms. Remains 124 /124 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2024-06-03 00:07:59] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61001 ms. Remains : 124/220 places, 328/526 transitions.
[2024-06-03 00:07:59] [INFO ] Flatten gal took : 8 ms
[2024-06-03 00:07:59] [INFO ] Flatten gal took : 9 ms
[2024-06-03 00:07:59] [INFO ] Input system was already deterministic with 328 transitions.
[2024-06-03 00:07:59] [INFO ] Flatten gal took : 9 ms
[2024-06-03 00:07:59] [INFO ] Flatten gal took : 9 ms
[2024-06-03 00:07:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality13329988164167018373.gal : 3 ms
[2024-06-03 00:07:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality5060682229814548438.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/CTLCardinality13329988164167018373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5060682229814548438.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,3.71728e+06,19.0477,399948,2,55828,5,929530,6,0,825,1.07347e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-03 00:08:29] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:08:29] [INFO ] Applying decomposition
[2024-06-03 00:08:29] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10682352236742034841.txt' '-o' '/tmp/graph10682352236742034841.bin' '-w' '/tmp/graph10682352236742034841.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10682352236742034841.bin' '-l' '-1' '-v' '-w' '/tmp/graph10682352236742034841.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:08:29] [INFO ] Decomposing Gal with order
[2024-06-03 00:08:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:08:29] [INFO ] Removed a total of 466 redundant transitions.
[2024-06-03 00:08:29] [INFO ] Flatten gal took : 23 ms
[2024-06-03 00:08:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 8 ms.
[2024-06-03 00:08:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality15106903045923123694.gal : 8 ms
[2024-06-03 00:08:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality14972145075305680838.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/CTLCardinality15106903045923123694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14972145075305680838.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,3.71728e+06,4.77948,112852,1164,5106,61460,204835,604,204703,258,704621,0


Converting to forward existential form...Done !
original formula: EF(AG((AG((((i4.u22.p243==1)||(i7.u28.p224==1))||((i3.u20.p141==0)&&(i6.i0.u7.p65==1)))) + E(A(((i4.u22.p101==0)||(i4.u22.p108==1)) U (i3...198
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !((((i4.u22.p243==1)||(i7.u28.p224==1))||((i3.u20.p141==0)&&(i6.i0....341
Reverse transition relation is NOT exact ! Due to transitions t22, t31, t55, t57, t76, t78, t82, t97, t99, t107, t109, t111, t112, t113, t115, t116, t117, ...686
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 198 transition count 491
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 198 transition count 491
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 61 place count 198 transition count 474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 197 transition count 472
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 197 transition count 472
Applied a total of 63 rules in 7 ms. Remains 197 /220 variables (removed 23) and now considering 472/526 (removed 54) transitions.
// Phase 1: matrix 472 rows 197 cols
[2024-06-03 00:08:59] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:08:59] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-03 00:08:59] [INFO ] Invariant cache hit.
[2024-06-03 00:09:00] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-06-03 00:09:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-03 00:09:07] [INFO ] Deduced a trap composed of 15 places in 266 ms of which 3 ms to minimize.
[2024-06-03 00:09:07] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 3 ms to minimize.
[2024-06-03 00:09:07] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 4 ms to minimize.
[2024-06-03 00:09:07] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 3 ms to minimize.
[2024-06-03 00:09:08] [INFO ] Deduced a trap composed of 114 places in 213 ms of which 3 ms to minimize.
[2024-06-03 00:09:08] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 4 ms to minimize.
[2024-06-03 00:09:08] [INFO ] Deduced a trap composed of 116 places in 301 ms of which 3 ms to minimize.
[2024-06-03 00:09:09] [INFO ] Deduced a trap composed of 115 places in 223 ms of which 3 ms to minimize.
[2024-06-03 00:09:09] [INFO ] Deduced a trap composed of 96 places in 220 ms of which 3 ms to minimize.
[2024-06-03 00:09:09] [INFO ] Deduced a trap composed of 40 places in 294 ms of which 3 ms to minimize.
[2024-06-03 00:09:09] [INFO ] Deduced a trap composed of 96 places in 284 ms of which 3 ms to minimize.
[2024-06-03 00:09:10] [INFO ] Deduced a trap composed of 114 places in 278 ms of which 3 ms to minimize.
[2024-06-03 00:09:11] [INFO ] Deduced a trap composed of 31 places in 321 ms of which 3 ms to minimize.
[2024-06-03 00:09:12] [INFO ] Deduced a trap composed of 25 places in 358 ms of which 3 ms to minimize.
[2024-06-03 00:09:12] [INFO ] Deduced a trap composed of 29 places in 299 ms of which 4 ms to minimize.
[2024-06-03 00:09:12] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 4 ms to minimize.
[2024-06-03 00:09:12] [INFO ] Deduced a trap composed of 25 places in 300 ms of which 4 ms to minimize.
[2024-06-03 00:09:13] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 3 ms to minimize.
[2024-06-03 00:09:13] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 3 ms to minimize.
[2024-06-03 00:09:13] [INFO ] Deduced a trap composed of 25 places in 242 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-03 00:09:14] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 4 ms to minimize.
[2024-06-03 00:09:14] [INFO ] Deduced a trap composed of 25 places in 290 ms of which 3 ms to minimize.
[2024-06-03 00:09:15] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 3 ms to minimize.
[2024-06-03 00:09:16] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 4 ms to minimize.
[2024-06-03 00:09:16] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 3 ms to minimize.
[2024-06-03 00:09:16] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 3 ms to minimize.
[2024-06-03 00:09:17] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 3 ms to minimize.
[2024-06-03 00:09:17] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 3 ms to minimize.
[2024-06-03 00:09:17] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
[2024-06-03 00:09:17] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-06-03 00:09:18] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 2 ms to minimize.
[2024-06-03 00:09:18] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 3 ms to minimize.
[2024-06-03 00:09:18] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 2 ms to minimize.
[2024-06-03 00:09:19] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 4 ms to minimize.
[2024-06-03 00:09:19] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 3 ms to minimize.
[2024-06-03 00:09:19] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 3 ms to minimize.
[2024-06-03 00:09:20] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 4 ms to minimize.
[2024-06-03 00:09:20] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 3 ms to minimize.
[2024-06-03 00:09:20] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 3 ms to minimize.
[2024-06-03 00:09:20] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-03 00:09:25] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:09:25] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 2 ms to minimize.
[2024-06-03 00:09:25] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 2 ms to minimize.
[2024-06-03 00:09:25] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 2 ms to minimize.
[2024-06-03 00:09:25] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 2 ms to minimize.
[2024-06-03 00:09:25] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 2 ms to minimize.
[2024-06-03 00:09:26] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 2 ms to minimize.
[2024-06-03 00:09:26] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 2 ms to minimize.
[2024-06-03 00:09:27] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2024-06-03 00:09:27] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 2 ms to minimize.
[2024-06-03 00:09:27] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-03 00:09:29] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 3 ms to minimize.
[2024-06-03 00:09:29] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 2 ms to minimize.
[2024-06-03 00:09:29] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 2 ms to minimize.
[2024-06-03 00:09:30] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 2 ms to minimize.
[2024-06-03 00:09:30] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 197/669 variables, and 63 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/197 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 56/63 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-03 00:09:33] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 2 ms to minimize.
[2024-06-03 00:09:34] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 2 ms to minimize.
[2024-06-03 00:09:34] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 2 ms to minimize.
[2024-06-03 00:09:34] [INFO ] Deduced a trap composed of 127 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-03 00:09:37] [INFO ] Deduced a trap composed of 122 places in 158 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-03 00:09:42] [INFO ] Deduced a trap composed of 130 places in 279 ms of which 4 ms to minimize.
[2024-06-03 00:09:42] [INFO ] Deduced a trap composed of 121 places in 303 ms of which 4 ms to minimize.
[2024-06-03 00:09:43] [INFO ] Deduced a trap composed of 119 places in 295 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-03 00:09:49] [INFO ] Deduced a trap composed of 132 places in 276 ms of which 3 ms to minimize.
[2024-06-03 00:09:51] [INFO ] Deduced a trap composed of 119 places in 266 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 8 (OVERLAPS) 472/669 variables, 197/270 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/669 variables, and 741 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30156 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 66/66 constraints]
After SMT, in 60471ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60476ms
Starting structural reductions in LTL mode, iteration 1 : 197/220 places, 472/526 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60981 ms. Remains : 197/220 places, 472/526 transitions.
[2024-06-03 00:10:00] [INFO ] Flatten gal took : 25 ms
[2024-06-03 00:10:00] [INFO ] Flatten gal took : 27 ms
[2024-06-03 00:10:00] [INFO ] Input system was already deterministic with 472 transitions.
[2024-06-03 00:10:00] [INFO ] Flatten gal took : 26 ms
[2024-06-03 00:10:00] [INFO ] Flatten gal took : 27 ms
[2024-06-03 00:10:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality12613442579004136452.gal : 4 ms
[2024-06-03 00:10:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality6737635973623131038.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/CTLCardinality12613442579004136452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6737635973623131038.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 00:10:30] [INFO ] Flatten gal took : 22 ms
[2024-06-03 00:10:30] [INFO ] Applying decomposition
[2024-06-03 00:10:30] [INFO ] Flatten gal took : 16 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/graph7616456445191522316.txt' '-o' '/tmp/graph7616456445191522316.bin' '-w' '/tmp/graph7616456445191522316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7616456445191522316.bin' '-l' '-1' '-v' '-w' '/tmp/graph7616456445191522316.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:10:30] [INFO ] Decomposing Gal with order
[2024-06-03 00:10:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:10:30] [INFO ] Removed a total of 1098 redundant transitions.
[2024-06-03 00:10:30] [INFO ] Flatten gal took : 32 ms
[2024-06-03 00:10:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 6 ms.
[2024-06-03 00:10:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality10657897736493694184.gal : 5 ms
[2024-06-03 00:10:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality15298802877545436643.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/CTLCardinality10657897736493694184.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15298802877545436643.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,3.59514e+07,4.25252,83968,3036,301,124200,2887,1070,305902,145,10490,0


Converting to forward existential form...Done !
original formula: EX(E(!(EG(!(((i8.u19.p98==1)&&(i1.u15.p69==0))))) U ((AX(E(((i1.u14.p67==0)||(i5.i1.i0.u30.p148==1)) U ((i7.i0.i0.u47.p206==0)||(i8.u19.p...293
=> equivalent forward existential formula: [(((FwdU(EY(Init),!(EG(!(((i8.u19.p98==1)&&(i1.u15.p69==0)))))) * (!(EX(!(E(((i1.u14.p67==0)||(i5.i1.i0.u30.p148...521
Reverse transition relation is NOT exact ! Due to transitions t48, t105, t106, t111, t144, t180, t182, t184, t192, t201, t202, t224, t226, t232, t234, t256...1242
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Graph (trivial) has 238 edges and 220 vertex of which 9 / 220 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 213 transition count 490
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 184 transition count 490
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 59 place count 184 transition count 474
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 91 place count 168 transition count 474
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 115 place count 144 transition count 432
Iterating global reduction 2 with 24 rules applied. Total rules applied 139 place count 144 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 155 place count 144 transition count 416
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 155 place count 144 transition count 414
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 142 transition count 414
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 139 transition count 384
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 139 transition count 384
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 193 place count 125 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 194 place count 125 transition count 369
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 195 place count 124 transition count 367
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 124 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 204 place count 124 transition count 359
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 212 place count 120 transition count 355
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 119 transition count 354
Applied a total of 213 rules in 37 ms. Remains 119 /220 variables (removed 101) and now considering 354/526 (removed 172) transitions.
[2024-06-03 00:11:00] [INFO ] Flow matrix only has 352 transitions (discarded 2 similar events)
// Phase 1: matrix 352 rows 119 cols
[2024-06-03 00:11:00] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:11:01] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-03 00:11:01] [INFO ] Flow matrix only has 352 transitions (discarded 2 similar events)
[2024-06-03 00:11:01] [INFO ] Invariant cache hit.
[2024-06-03 00:11:01] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-06-03 00:11:01] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2024-06-03 00:11:01] [INFO ] Redundant transitions in 4 ms returned []
Running 353 sub problems to find dead transitions.
[2024-06-03 00:11:01] [INFO ] Flow matrix only has 352 transitions (discarded 2 similar events)
[2024-06-03 00:11:01] [INFO ] Invariant cache hit.
[2024-06-03 00:11:01] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-06-03 00:11:06] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 3 ms to minimize.
[2024-06-03 00:11:06] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 3 ms to minimize.
[2024-06-03 00:11:06] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 2 ms to minimize.
[2024-06-03 00:11:07] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 2 ms to minimize.
[2024-06-03 00:11:07] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 2 ms to minimize.
[2024-06-03 00:11:07] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 2 ms to minimize.
[2024-06-03 00:11:07] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2024-06-03 00:11:07] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-06-03 00:11:08] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 2 ms to minimize.
[2024-06-03 00:11:08] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 2 ms to minimize.
[2024-06-03 00:11:08] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2024-06-03 00:11:08] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 3 ms to minimize.
[2024-06-03 00:11:08] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 2 ms to minimize.
[2024-06-03 00:11:09] [INFO ] Deduced a trap composed of 56 places in 208 ms of which 3 ms to minimize.
[2024-06-03 00:11:09] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2024-06-03 00:11:09] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 2 ms to minimize.
[2024-06-03 00:11:09] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2024-06-03 00:11:09] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 1 ms to minimize.
[2024-06-03 00:11:09] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2024-06-03 00:11:10] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-06-03 00:11:13] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 2 ms to minimize.
[2024-06-03 00:11:13] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 3 ms to minimize.
[2024-06-03 00:11:14] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 2 ms to minimize.
[2024-06-03 00:11:14] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 3 ms to minimize.
[2024-06-03 00:11:14] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-06-03 00:11:15] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (OVERLAPS) 351/470 variables, 119/152 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 96/248 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 10 (OVERLAPS) 1/471 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/471 variables, and 249 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 1/119 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (OVERLAPS) 351/470 variables, 119/152 constraints. Problems are: Problem set: 36 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 96/248 constraints. Problems are: Problem set: 36 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/471 variables, and 565 constraints, problems are : Problem set: 36 solved, 317 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 96/97 constraints, PredecessorRefiner: 317/353 constraints, Known Traps: 26/26 constraints]
After SMT, in 60586ms problems are : Problem set: 36 solved, 317 unsolved
Search for dead transitions found 36 dead transitions in 60593ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 119/220 places, 318/526 transitions.
Applied a total of 0 rules in 5 ms. Remains 119 /119 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2024-06-03 00:12:02] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61341 ms. Remains : 119/220 places, 318/526 transitions.
[2024-06-03 00:12:02] [INFO ] Flatten gal took : 8 ms
[2024-06-03 00:12:02] [INFO ] Flatten gal took : 8 ms
[2024-06-03 00:12:02] [INFO ] Input system was already deterministic with 318 transitions.
[2024-06-03 00:12:02] [INFO ] Flatten gal took : 8 ms
[2024-06-03 00:12:02] [INFO ] Flatten gal took : 8 ms
[2024-06-03 00:12:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality862218084407965008.gal : 2 ms
[2024-06-03 00:12:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality7252871370071592771.ctl : 4 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/CTLCardinality862218084407965008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7252871370071592771.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,2.56263e+06,17.7542,389236,2,48909,5,952599,6,0,793,1.0128e+06,0


Converting to forward existential form...Done !
original formula: !(A(!(EF((p108==1))) U !(((p36==0)||(p11==1)))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(((p36==0)||(p11==1))))) * !(!(((p36==0)||(p11==1))))),TRUE) * (p108==1))] != FALSE + [Fwd...200
Hit Full ! (commute/partial/dont) 298/0/20
(forward)formula 0,1,27.8825,395308,1,0,10,952599,16,2,1864,1.0128e+06,6
FORMULA MedleyA-PT-17-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 191 transition count 477
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 191 transition count 477
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 75 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 189 transition count 456
Applied a total of 79 rules in 6 ms. Remains 189 /220 variables (removed 31) and now considering 456/526 (removed 70) transitions.
// Phase 1: matrix 456 rows 189 cols
[2024-06-03 00:12:30] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:12:30] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-03 00:12:30] [INFO ] Invariant cache hit.
[2024-06-03 00:12:30] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-06-03 00:12:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:12:38] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 3 ms to minimize.
[2024-06-03 00:12:38] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 3 ms to minimize.
[2024-06-03 00:12:38] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 3 ms to minimize.
[2024-06-03 00:12:38] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:12:39] [INFO ] Deduced a trap composed of 41 places in 243 ms of which 3 ms to minimize.
[2024-06-03 00:12:39] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 3 ms to minimize.
[2024-06-03 00:12:39] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 3 ms to minimize.
[2024-06-03 00:12:39] [INFO ] Deduced a trap composed of 111 places in 174 ms of which 3 ms to minimize.
[2024-06-03 00:12:39] [INFO ] Deduced a trap composed of 85 places in 188 ms of which 3 ms to minimize.
[2024-06-03 00:12:40] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 3 ms to minimize.
[2024-06-03 00:12:40] [INFO ] Deduced a trap composed of 42 places in 280 ms of which 3 ms to minimize.
[2024-06-03 00:12:40] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 4 ms to minimize.
[2024-06-03 00:12:41] [INFO ] Deduced a trap composed of 41 places in 297 ms of which 4 ms to minimize.
[2024-06-03 00:12:41] [INFO ] Deduced a trap composed of 38 places in 237 ms of which 2 ms to minimize.
[2024-06-03 00:12:42] [INFO ] Deduced a trap composed of 24 places in 313 ms of which 3 ms to minimize.
[2024-06-03 00:12:42] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 3 ms to minimize.
[2024-06-03 00:12:43] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 3 ms to minimize.
[2024-06-03 00:12:43] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 3 ms to minimize.
[2024-06-03 00:12:43] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 3 ms to minimize.
[2024-06-03 00:12:43] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:12:44] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 3 ms to minimize.
[2024-06-03 00:12:44] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 3 ms to minimize.
[2024-06-03 00:12:44] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 3 ms to minimize.
[2024-06-03 00:12:45] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 3 ms to minimize.
[2024-06-03 00:12:45] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 3 ms to minimize.
[2024-06-03 00:12:46] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 2 ms to minimize.
[2024-06-03 00:12:46] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 3 ms to minimize.
[2024-06-03 00:12:46] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 3 ms to minimize.
[2024-06-03 00:12:47] [INFO ] Deduced a trap composed of 39 places in 309 ms of which 3 ms to minimize.
[2024-06-03 00:12:48] [INFO ] Deduced a trap composed of 28 places in 284 ms of which 4 ms to minimize.
[2024-06-03 00:12:49] [INFO ] Deduced a trap composed of 43 places in 236 ms of which 4 ms to minimize.
[2024-06-03 00:12:49] [INFO ] Deduced a trap composed of 115 places in 247 ms of which 3 ms to minimize.
[2024-06-03 00:12:49] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 3 ms to minimize.
[2024-06-03 00:12:50] [INFO ] Deduced a trap composed of 125 places in 275 ms of which 3 ms to minimize.
[2024-06-03 00:12:50] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 2 ms to minimize.
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:12:55] [INFO ] Deduced a trap composed of 111 places in 208 ms of which 3 ms to minimize.
[2024-06-03 00:12:55] [INFO ] Deduced a trap composed of 111 places in 205 ms of which 3 ms to minimize.
[2024-06-03 00:12:55] [INFO ] Deduced a trap composed of 111 places in 215 ms of which 2 ms to minimize.
[2024-06-03 00:12:57] [INFO ] Deduced a trap composed of 39 places in 301 ms of which 4 ms to minimize.
[2024-06-03 00:12:57] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 3 ms to minimize.
[2024-06-03 00:12:58] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 3 ms to minimize.
[2024-06-03 00:12:58] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 3 ms to minimize.
[2024-06-03 00:12:58] [INFO ] Deduced a trap composed of 28 places in 265 ms of which 3 ms to minimize.
[2024-06-03 00:12:58] [INFO ] Deduced a trap composed of 90 places in 185 ms of which 3 ms to minimize.
[2024-06-03 00:12:59] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 4 ms to minimize.
[2024-06-03 00:13:00] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 3 ms to minimize.
[2024-06-03 00:13:00] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/645 variables, and 55 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:13:06] [INFO ] Deduced a trap composed of 44 places in 282 ms of which 3 ms to minimize.
[2024-06-03 00:13:07] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 3 ms to minimize.
[2024-06-03 00:13:07] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:13:11] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:13:16] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 3 ms to minimize.
[2024-06-03 00:13:16] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 3 ms to minimize.
[2024-06-03 00:13:16] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 3 ms to minimize.
[2024-06-03 00:13:17] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 3 ms to minimize.
[2024-06-03 00:13:17] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 3 ms to minimize.
[2024-06-03 00:13:18] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-03 00:13:21] [INFO ] Deduced a trap composed of 112 places in 296 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 8 (OVERLAPS) 456/645 variables, 189/255 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 660 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 59/59 constraints]
After SMT, in 60578ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60586ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/220 places, 406/526 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61196 ms. Remains : 189/220 places, 406/526 transitions.
[2024-06-03 00:13:31] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:13:31] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:13:31] [INFO ] Input system was already deterministic with 406 transitions.
[2024-06-03 00:13:31] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:13:31] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:13:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality14128980286671402753.gal : 2 ms
[2024-06-03 00:13:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality565378419769997409.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/CTLCardinality14128980286671402753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality565378419769997409.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 00:14:01] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:14:01] [INFO ] Applying decomposition
[2024-06-03 00:14:01] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5477242609894605003.txt' '-o' '/tmp/graph5477242609894605003.bin' '-w' '/tmp/graph5477242609894605003.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5477242609894605003.bin' '-l' '-1' '-v' '-w' '/tmp/graph5477242609894605003.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:14:01] [INFO ] Decomposing Gal with order
[2024-06-03 00:14:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:14:01] [INFO ] Removed a total of 934 redundant transitions.
[2024-06-03 00:14:01] [INFO ] Flatten gal took : 23 ms
[2024-06-03 00:14:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 5 ms.
[2024-06-03 00:14:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality12544411916066105708.gal : 4 ms
[2024-06-03 00:14:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality2216761029592913768.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/CTLCardinality12544411916066105708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2216761029592913768.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77138e+07,9.95263,280020,2082,38,569569,1777,938,1.53583e+06,82,5110,0


Converting to forward existential form...Done !
original formula: AF(AX(A((AF(((i6.i2.u24.p105==0)||(u4.p9==1))) * (i4.i1.u35.p147==1)) U EX(EX((i4.i0.u36.p155==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!((E(!(EX(EX((i4.i0.u36.p155==1)))) U (!((!(EG(!(((i6.i2.u24.p105==0)||(u4.p9==1))))) * (i4....260
Reverse transition relation is NOT exact ! Due to transitions t12, t41, t97, t162, t168, t170, t178, t184, t186, t211, t212, t219, t220, t243, t244, t251, ...1027
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 a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
[2024-06-03 00:14:31] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:14:31] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:14:31] [INFO ] Applying decomposition
[2024-06-03 00:14:31] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9431237973413773502.txt' '-o' '/tmp/graph9431237973413773502.bin' '-w' '/tmp/graph9431237973413773502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9431237973413773502.bin' '-l' '-1' '-v' '-w' '/tmp/graph9431237973413773502.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:14:31] [INFO ] Decomposing Gal with order
[2024-06-03 00:14:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:14:32] [INFO ] Removed a total of 493 redundant transitions.
[2024-06-03 00:14:32] [INFO ] Flatten gal took : 32 ms
[2024-06-03 00:14:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 7 ms.
[2024-06-03 00:14:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality17539460145694285220.gal : 4 ms
[2024-06-03 00:14:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality7094272553019852099.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/CTLCardinality17539460145694285220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7094272553019852099.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 7 CTL formulae.
ITS-tools command line returned an error code 137
[2024-06-03 00:24:26] [INFO ] Applying decomposition
[2024-06-03 00:24:26] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:24:26] [INFO ] Decomposing Gal with order
[2024-06-03 00:24:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:24:26] [INFO ] Removed a total of 931 redundant transitions.
[2024-06-03 00:24:26] [INFO ] Flatten gal took : 27 ms
[2024-06-03 00:24:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 239 labels/synchronizations in 5 ms.
[2024-06-03 00:24:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality5855776027696615381.gal : 61 ms
[2024-06-03 00:24:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality5793267393633215096.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/CTLCardinality5855776027696615381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5793267393633215096.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 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.42817e+07,4.39052,110584,1387,3551,74641,100325,235,358462,542,1.08178e+06,0


Converting to forward existential form...Done !
original formula: E((i0.i1.u11.p181!=0) U (AX(((E(((i0.i0.i1.u7.p81==0)||(i0.i0.i1.u7.p78==1)) U (i0.i0.i1.u7.p61==1)) + A(((i0.i0.i0.u5.p52==0)||(u12.p246...419
=> equivalent forward existential formula: (([FwdG((FwdU(Init,(i0.i1.u11.p181!=0)) * !(EX(!(((E(((i0.i0.i1.u7.p81==0)||(i0.i0.i1.u7.p78==1)) U (i0.i0.i1.u7...1768
Reverse transition relation is NOT exact ! Due to transitions t310, t362, u12.t2, u12.t3, u12.t5, u12.t7, i0.t521, i0.t481, i0.t479, i0.i0.i0.u4.t217, i0.i...2286
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-06-03 00:30:33] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:30:33] [INFO ] Input system was already deterministic with 526 transitions.
[2024-06-03 00:30:34] [INFO ] Transformed 220 places.
[2024-06-03 00:30:34] [INFO ] Transformed 526 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-06-03 00:30:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality16158145461361732384.gal : 3 ms
[2024-06-03 00:30:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality11169695909899499474.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16158145461361732384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11169695909899499474.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.42817e+07,219.272,3402920,2,225592,5,7.80103e+06,6,0,1408,1.20557e+07,0


Converting to forward existential form...Done !
original formula: E((p181!=0) U (AX(((E(((p81==0)||(p78==1)) U (p61==1)) + A(((p52==0)||(p246==1)) U ((p124==0)||(p157==1)))) + AX(((p17==1)||(p180==1)))))...251
=> equivalent forward existential formula: (([FwdG((FwdU(Init,(p181!=0)) * !(EX(!(((E(((p81==0)||(p78==1)) U (p61==1)) + !((E(!(((p124==0)||(p157==1))) U (...1128
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t7, t13, t15, t17, t18, t19, t23, t25, t28, t31, t32, t33, t34, t36, t42, t43, t4...1062

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-17"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-17, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r576-smll-171734920100129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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