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.r400-tall-171690532100330.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 StigmergyElection-PT-07a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532100330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 19:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 11 19:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:43 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 StigmergyElection-PT-07a-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717009501251

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 19:05:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 19:05:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:05:02] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-05-29 19:05:02] [INFO ] Transformed 100 places.
[2024-05-29 19:05:02] [INFO ] Transformed 2618 transitions.
[2024-05-29 19:05:02] [INFO ] Found NUPN structural information;
[2024-05-29 19:05:02] [INFO ] Parsed PT model containing 100 places and 2618 transitions and 34799 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
Support contains 14 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 389/389 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 88 transition count 370
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 88 transition count 370
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 84 transition count 362
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 84 transition count 362
Applied a total of 32 rules in 31 ms. Remains 84 /100 variables (removed 16) and now considering 362/389 (removed 27) transitions.
[2024-05-29 19:05:02] [INFO ] Flow matrix only has 353 transitions (discarded 9 similar events)
// Phase 1: matrix 353 rows 84 cols
[2024-05-29 19:05:02] [INFO ] Computed 3 invariants in 20 ms
[2024-05-29 19:05:03] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-29 19:05:03] [INFO ] Flow matrix only has 353 transitions (discarded 9 similar events)
[2024-05-29 19:05:03] [INFO ] Invariant cache hit.
[2024-05-29 19:05:03] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:05:03] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-29 19:05:03] [INFO ] Flow matrix only has 353 transitions (discarded 9 similar events)
[2024-05-29 19:05:03] [INFO ] Invariant cache hit.
[2024-05-29 19:05:03] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 8 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 4 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 4 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:05:09] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:05:09] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:05:09] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:05:09] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:05:09] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:05:09] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:05:09] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:05:09] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:05:12] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:05:12] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:05:12] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:05:12] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:05:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:05:12] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:05:12] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:05:12] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:05:12] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:05:12] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:05:12] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:05:12] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:05:12] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:05:12] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:05:13] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:05:13] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:05:13] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:05:13] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:05:13] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:05:13] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:05:14] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 17/100 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:05:14] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:05:14] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:05:15] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:05:15] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:05:15] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:05:16] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:05:16] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:05:16] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 19:05:16] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:05:17] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:05:17] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:05:17] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 11 (OVERLAPS) 352/436 variables, 84/196 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 287/483 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:05:25] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:05:27] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 361 unsolved
SMT process timed out in 31841ms, After SMT, problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 31858ms
Starting structural reductions in LTL mode, iteration 1 : 84/100 places, 362/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32347 ms. Remains : 84/100 places, 362/389 transitions.
Support contains 14 out of 84 places after structural reductions.
[2024-05-29 19:05:35] [INFO ] Flatten gal took : 67 ms
[2024-05-29 19:05:35] [INFO ] Flatten gal took : 36 ms
[2024-05-29 19:05:35] [INFO ] Input system was already deterministic with 362 transitions.
Reduction of identical properties reduced properties to check from 18 to 9
RANDOM walk for 40000 steps (55 resets) in 1886 ms. (21 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (25 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (24 resets) in 303 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (25 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
[2024-05-29 19:05:36] [INFO ] Flow matrix only has 353 transitions (discarded 9 similar events)
[2024-05-29 19:05:36] [INFO ] Invariant cache hit.
[2024-05-29 19:05:36] [INFO ] State equation strengthened by 288 read => feed constraints.
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/83 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/436 variables, 84/87 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 287/374 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/374 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/437 variables, 1/375 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/375 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/437 variables, 0/375 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 375 constraints, problems are : Problem set: 3 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Int declared 83/437 variables, and 2 constraints, problems are : Problem set: 4 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/84 constraints, ReadFeed: 0/288 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 285ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-29 19:05:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 19:05:36] [INFO ] Flatten gal took : 36 ms
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 19:05:36] [INFO ] Flatten gal took : 40 ms
[2024-05-29 19:05:36] [INFO ] Input system was already deterministic with 362 transitions.
Computed a total of 16 stabilizing places and 15 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 5 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
[2024-05-29 19:05:36] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2024-05-29 19:05:36] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 19:05:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 19:05:36] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:05:36] [INFO ] Invariant cache hit.
[2024-05-29 19:05:37] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:05:37] [INFO ] Implicit Places using invariants and state equation in 230 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 275 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/84 places, 355/362 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 11 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2024-05-29 19:05:37] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2024-05-29 19:05:37] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 19:05:37] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 19:05:37] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:05:37] [INFO ] Invariant cache hit.
[2024-05-29 19:05:37] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:05:37] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/84 places, 334/362 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 406 ms. Remains : 58/84 places, 334/362 transitions.
[2024-05-29 19:05:37] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:05:37] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:05:37] [INFO ] Input system was already deterministic with 334 transitions.
[2024-05-29 19:05:37] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:05:37] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:05:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16225601237506212728.gal : 16 ms
[2024-05-29 19:05:37] [INFO ] Time to serialize properties into /tmp/CTLFireability4910624088084193124.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/CTLFireability16225601237506212728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4910624088084193124.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,80326,0.550322,21332,2,2335,5,32142,6,0,558,20332,0


Converting to forward existential form...Done !
original formula: AF(((EX(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) * AG(A(((((p12==1)&&(p26==1))&&((p40==1)&&(p54=...370
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) * !(E(TRUE U...622
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...338
(forward)formula 0,0,2.81487,81252,1,0,504,203869,697,113,10737,138561,794
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 84 transition count 352
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 74 transition count 352
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 71 transition count 346
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 71 transition count 346
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 69 transition count 344
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 69 transition count 344
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 69 transition count 341
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 1 with 8 rules applied. Total rules applied 41 place count 65 transition count 337
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 61 transition count 333
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 61 transition count 333
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 109 place count 61 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 116 place count 61 transition count 266
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 130 place count 54 transition count 259
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 54 transition count 259
Applied a total of 131 rules in 103 ms. Remains 54 /84 variables (removed 30) and now considering 259/362 (removed 103) transitions.
[2024-05-29 19:05:40] [INFO ] Flow matrix only has 250 transitions (discarded 9 similar events)
// Phase 1: matrix 250 rows 54 cols
[2024-05-29 19:05:40] [INFO ] Computed 3 invariants in 8 ms
[2024-05-29 19:05:40] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 19:05:40] [INFO ] Flow matrix only has 250 transitions (discarded 9 similar events)
[2024-05-29 19:05:40] [INFO ] Invariant cache hit.
[2024-05-29 19:05:40] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-29 19:05:40] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-29 19:05:40] [INFO ] Redundant transitions in 20 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-29 19:05:40] [INFO ] Flow matrix only has 250 transitions (discarded 9 similar events)
[2024-05-29 19:05:40] [INFO ] Invariant cache hit.
[2024-05-29 19:05:40] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:05:42] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:05:43] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:05:44] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:05:44] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 19:05:44] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:05:44] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:05:44] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:05:44] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:05:44] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:05:44] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:05:44] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:05:45] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:05:45] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:05:45] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 19:05:45] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:05:45] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:05:45] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:05:45] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:05:45] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:05:45] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:05:45] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 19:05:46] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:05:46] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:05:46] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:05:46] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:05:46] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:05:46] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 19:05:47] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 19:05:47] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:05:47] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:05:47] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 19:05:48] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:05:48] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 11 (OVERLAPS) 249/303 variables, 54/123 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 219/342 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 14 (OVERLAPS) 1/304 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/304 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 16 (OVERLAPS) 0/304 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 343 constraints, problems are : Problem set: 0 solved, 258 unsolved in 16334 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 54/54 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 19:05:58] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:05:58] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:05:59] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 249/303 variables, 54/126 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 219/345 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 258/603 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (OVERLAPS) 1/304 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 11 (OVERLAPS) 0/304 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 604 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 54/54 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 69/69 constraints]
After SMT, in 47278ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 47284ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/84 places, 259/362 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47573 ms. Remains : 54/84 places, 259/362 transitions.
[2024-05-29 19:06:27] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:06:27] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:06:27] [INFO ] Input system was already deterministic with 259 transitions.
[2024-05-29 19:06:27] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:06:27] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:06:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17110525852846137488.gal : 4 ms
[2024-05-29 19:06:27] [INFO ] Time to serialize properties into /tmp/CTLFireability828775322388039095.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/CTLFireability17110525852846137488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability828775322388039095.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,3072,0.276753,12756,2,2831,5,9337,6,0,462,4584,0


Converting to forward existential form...Done !
original formula: AF(EG((!(A(AF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) U !(((((p12==1)&&(p26==1))&&((p40==1)&&(p...503
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(!((E(!(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))))) U...755
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t229, t231, t233, t235, t237, t239, ...303
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.89119,62916,1,0,403,100410,554,119,7894,64862,647
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 9 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
[2024-05-29 19:06:29] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2024-05-29 19:06:29] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 19:06:29] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 19:06:29] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:06:29] [INFO ] Invariant cache hit.
[2024-05-29 19:06:30] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:06:30] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2024-05-29 19:06:30] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:06:30] [INFO ] Invariant cache hit.
[2024-05-29 19:06:30] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-29 19:06:32] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:06:32] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:06:32] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:06:32] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:06:35] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:06:35] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:06:35] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:06:35] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:06:35] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 5 ms to minimize.
[2024-05-29 19:06:35] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:06:35] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:06:35] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-29 19:06:36] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:06:36] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:06:36] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:06:36] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:06:36] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:06:36] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:06:36] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:06:36] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:06:36] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:06:36] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:06:36] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:06:36] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:06:36] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:06:36] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:06:37] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:06:37] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:06:37] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:06:37] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:06:37] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:06:37] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-29 19:06:37] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:06:37] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:06:37] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:06:37] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:06:37] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:06:37] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:06:37] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:06:37] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:06:38] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:06:38] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:06:38] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:06:38] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:06:38] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:06:38] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-29 19:06:38] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:06:38] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:06:38] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:06:38] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:06:38] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:06:39] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-29 19:06:40] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:06:40] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:06:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-29 19:06:41] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:06:42] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:06:42] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-29 19:06:42] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:06:42] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:06:43] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:06:43] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:06:43] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-29 19:06:44] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:06:44] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:06:44] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:06:44] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:06:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-29 19:06:45] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:06:45] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-29 19:06:46] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-29 19:06:48] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/80 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-29 19:06:49] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:06:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/80 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/80 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 16 (OVERLAPS) 346/426 variables, 80/198 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 287/485 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 19 (OVERLAPS) 1/427 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/427 variables, and 486 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 116/116 constraints]
Escalating to Integer solving :Problem set: 0 solved, 354 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-29 19:07:04] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:07:04] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:07:04] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:07:04] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 346/426 variables, 80/202 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 287/489 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 354/843 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 354 unsolved
SMT process timed out in 61383ms, After SMT, problems are : Problem set: 0 solved, 354 unsolved
Search for dead transitions found 0 dead transitions in 61388ms
Starting structural reductions in LTL mode, iteration 1 : 80/84 places, 355/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61577 ms. Remains : 80/84 places, 355/362 transitions.
[2024-05-29 19:07:31] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:07:31] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:07:31] [INFO ] Input system was already deterministic with 355 transitions.
[2024-05-29 19:07:31] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:07:31] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:07:31] [INFO ] Time to serialize gal into /tmp/CTLFireability6737688385067688165.gal : 3 ms
[2024-05-29 19:07:31] [INFO ] Time to serialize properties into /tmp/CTLFireability4176080250921504926.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/CTLFireability6737688385067688165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4176080250921504926.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,94537,0.599513,23748,2,2416,5,32520,6,0,665,17420,0


Converting to forward existential form...Done !
original formula: AG(((AG(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||(p96==0)))) + A(!(((((((p12==1)&&(p26==1))&&((p40==1)&&(p54...743
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !((!(E(TRUE U !(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||(...1182
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t23, t24, t25, ...407
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.05305,145328,1,0,592,443689,740,163,11191,271124,904
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-02 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 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 6 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
[2024-05-29 19:07:36] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:07:36] [INFO ] Invariant cache hit.
[2024-05-29 19:07:36] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 19:07:36] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:07:36] [INFO ] Invariant cache hit.
[2024-05-29 19:07:36] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:07:37] [INFO ] Implicit Places using invariants and state equation in 216 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 259 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/84 places, 355/362 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 13 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2024-05-29 19:07:37] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2024-05-29 19:07:37] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 19:07:37] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 19:07:37] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:07:37] [INFO ] Invariant cache hit.
[2024-05-29 19:07:37] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:07:37] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/84 places, 334/362 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 396 ms. Remains : 58/84 places, 334/362 transitions.
[2024-05-29 19:07:37] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:07:37] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:07:37] [INFO ] Input system was already deterministic with 334 transitions.
[2024-05-29 19:07:37] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:07:37] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:07:37] [INFO ] Time to serialize gal into /tmp/CTLFireability10632360365737916962.gal : 3 ms
[2024-05-29 19:07:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16200670490049558681.ctl : 31 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/CTLFireability10632360365737916962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16200670490049558681.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(E((AF((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p12==1))))&&((((p26==1)&&(p40==1))&&((p54==1)...894
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((!(EG(!((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)...1173
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...338
(forward)formula 0,0,2.49018,74512,1,0,506,199294,694,116,10923,131313,790
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 9 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
[2024-05-29 19:07:39] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2024-05-29 19:07:39] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 19:07:39] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 19:07:39] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:07:39] [INFO ] Invariant cache hit.
[2024-05-29 19:07:39] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:07:40] [INFO ] Implicit Places using invariants and state equation in 219 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 261 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/84 places, 355/362 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 6 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2024-05-29 19:07:40] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2024-05-29 19:07:40] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:07:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 19:07:40] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:07:40] [INFO ] Invariant cache hit.
[2024-05-29 19:07:40] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:07:40] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/84 places, 334/362 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 397 ms. Remains : 58/84 places, 334/362 transitions.
[2024-05-29 19:07:40] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:07:40] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:07:40] [INFO ] Input system was already deterministic with 334 transitions.
[2024-05-29 19:07:40] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:07:40] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:07:40] [INFO ] Time to serialize gal into /tmp/CTLFireability70639060820499972.gal : 2 ms
[2024-05-29 19:07:40] [INFO ] Time to serialize properties into /tmp/CTLFireability1598132132478661138.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/CTLFireability70639060820499972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1598132132478661138.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,80326,0.535492,21188,2,2335,5,32142,6,0,558,20332,0


Converting to forward existential form...Done !
original formula: AG((EX(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) + AG(((((p12==0)||(p26==0))||((p40==0)||(p54==0)...195
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EX(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))))...259
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...338
(forward)formula 0,0,1.51411,44948,1,0,415,106870,678,80,10569,69728,669
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 82 transition count 347
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 68 transition count 347
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 29 place count 68 transition count 334
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 55 place count 55 transition count 334
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 40 transition count 316
Iterating global reduction 2 with 15 rules applied. Total rules applied 85 place count 40 transition count 316
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 212 place count 40 transition count 189
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 212 place count 40 transition count 185
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 220 place count 36 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 227 place count 36 transition count 178
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 241 place count 29 transition count 171
Applied a total of 241 rules in 44 ms. Remains 29 /84 variables (removed 55) and now considering 171/362 (removed 191) transitions.
[2024-05-29 19:07:41] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
// Phase 1: matrix 163 rows 29 cols
[2024-05-29 19:07:41] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 19:07:41] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 19:07:41] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2024-05-29 19:07:41] [INFO ] Invariant cache hit.
[2024-05-29 19:07:41] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-29 19:07:41] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-29 19:07:41] [INFO ] Redundant transitions in 6 ms returned []
Running 164 sub problems to find dead transitions.
[2024-05-29 19:07:41] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2024-05-29 19:07:41] [INFO ] Invariant cache hit.
[2024-05-29 19:07:41] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:07:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:07:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:07:44] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:07:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:07:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:07:44] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:07:44] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:07:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:07:44] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:07:44] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 162/191 variables, 29/75 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 133/208 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:07:45] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 1/192 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:07:48] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:07:48] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/192 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 16 (OVERLAPS) 0/192 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 212 constraints, problems are : Problem set: 0 solved, 164 unsolved in 9142 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:07:51] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:07:51] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:07:52] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:07:52] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:07:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 162/191 variables, 29/83 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 133/216 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 164/380 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 1/192 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 381 constraints, problems are : Problem set: 0 solved, 164 unsolved in 12563 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 53/53 constraints]
After SMT, in 22037ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 22039ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/84 places, 171/362 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22169 ms. Remains : 29/84 places, 171/362 transitions.
[2024-05-29 19:08:03] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:08:03] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:08:03] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-29 19:08:04] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:08:04] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:08:04] [INFO ] Time to serialize gal into /tmp/CTLFireability4233362142541563346.gal : 1 ms
[2024-05-29 19:08:04] [INFO ] Time to serialize properties into /tmp/CTLFireability11267270491542439016.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/CTLFireability4233362142541563346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11267270491542439016.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,269,0.058432,6524,2,386,5,3449,6,0,280,1882,0


Converting to forward existential form...Done !
original formula: EG(E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))) U !(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&...191
=> equivalent forward existential formula: [FwdG(Init,E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))) U !(((((p12==1)&&(...234
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...292
(forward)formula 0,1,0.188537,8688,1,0,247,13103,357,46,5247,10191,360
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 81 transition count 357
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 81 transition count 357
Applied a total of 6 rules in 8 ms. Remains 81 /84 variables (removed 3) and now considering 357/362 (removed 5) transitions.
[2024-05-29 19:08:04] [INFO ] Flow matrix only has 349 transitions (discarded 8 similar events)
// Phase 1: matrix 349 rows 81 cols
[2024-05-29 19:08:04] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 19:08:04] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 19:08:04] [INFO ] Flow matrix only has 349 transitions (discarded 8 similar events)
[2024-05-29 19:08:04] [INFO ] Invariant cache hit.
[2024-05-29 19:08:04] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:08:04] [INFO ] Implicit Places using invariants and state equation in 234 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 270 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/84 places, 357/362 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 67 transition count 344
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 67 transition count 344
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 60 transition count 337
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 60 transition count 337
Applied a total of 40 rules in 7 ms. Remains 60 /80 variables (removed 20) and now considering 337/357 (removed 20) transitions.
[2024-05-29 19:08:04] [INFO ] Flow matrix only has 329 transitions (discarded 8 similar events)
// Phase 1: matrix 329 rows 60 cols
[2024-05-29 19:08:04] [INFO ] Computed 1 invariants in 13 ms
[2024-05-29 19:08:04] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 19:08:04] [INFO ] Flow matrix only has 329 transitions (discarded 8 similar events)
[2024-05-29 19:08:04] [INFO ] Invariant cache hit.
[2024-05-29 19:08:04] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:08:04] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 60/84 places, 337/362 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 420 ms. Remains : 60/84 places, 337/362 transitions.
[2024-05-29 19:08:04] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:08:04] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:08:04] [INFO ] Input system was already deterministic with 337 transitions.
[2024-05-29 19:08:04] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:08:04] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:08:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14551273562031311766.gal : 3 ms
[2024-05-29 19:08:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8342251442155258005.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/CTLFireability14551273562031311766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8342251442155258005.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,88518,0.577307,23308,2,2690,5,37693,6,0,569,24572,0


Converting to forward existential form...Done !
original formula: AF((EF(EG((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p12==1))))&&((((p26==1)&&(p40==1))&&((p54==1...463
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U EG((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p12...520
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t32,...378
(forward)formula 0,1,3.45245,103564,1,0,488,237234,699,110,10564,155331,761
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 7 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
[2024-05-29 19:08:08] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2024-05-29 19:08:08] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 19:08:08] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 19:08:08] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:08:08] [INFO ] Invariant cache hit.
[2024-05-29 19:08:08] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:08:08] [INFO ] Implicit Places using invariants and state equation in 223 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 259 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/84 places, 355/362 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 7 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2024-05-29 19:08:08] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2024-05-29 19:08:08] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 19:08:08] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 19:08:08] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:08:08] [INFO ] Invariant cache hit.
[2024-05-29 19:08:08] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:08:08] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/84 places, 334/362 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 389 ms. Remains : 58/84 places, 334/362 transitions.
[2024-05-29 19:08:08] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:08:08] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:08:08] [INFO ] Input system was already deterministic with 334 transitions.
[2024-05-29 19:08:08] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:08:08] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:08:08] [INFO ] Time to serialize gal into /tmp/CTLFireability10861830978887182149.gal : 7 ms
[2024-05-29 19:08:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12170261291104233202.ctl : 63 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/CTLFireability10861830978887182149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12170261291104233202.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((AG(AX(!(E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))) U ((((p12==1)&&(p26==1))&&((p40==1)&&(p54=...284
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||(p96==0)))) * !(E(TRU...354
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...338
(forward)formula 0,1,3.25171,98800,1,0,434,199199,684,92,10709,110505,705
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 82 transition count 348
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 69 transition count 348
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 27 place count 69 transition count 335
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 53 place count 56 transition count 335
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 67 place count 42 transition count 319
Iterating global reduction 2 with 14 rules applied. Total rules applied 81 place count 42 transition count 319
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 144 place count 42 transition count 256
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 144 place count 42 transition count 252
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 152 place count 38 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 159 place count 38 transition count 245
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 173 place count 31 transition count 238
Applied a total of 173 rules in 47 ms. Remains 31 /84 variables (removed 53) and now considering 238/362 (removed 124) transitions.
[2024-05-29 19:08:12] [INFO ] Flow matrix only has 230 transitions (discarded 8 similar events)
// Phase 1: matrix 230 rows 31 cols
[2024-05-29 19:08:12] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 19:08:12] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 19:08:12] [INFO ] Flow matrix only has 230 transitions (discarded 8 similar events)
[2024-05-29 19:08:12] [INFO ] Invariant cache hit.
[2024-05-29 19:08:12] [INFO ] State equation strengthened by 197 read => feed constraints.
[2024-05-29 19:08:12] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-29 19:08:12] [INFO ] Redundant transitions in 5 ms returned []
Running 231 sub problems to find dead transitions.
[2024-05-29 19:08:12] [INFO ] Flow matrix only has 230 transitions (discarded 8 similar events)
[2024-05-29 19:08:12] [INFO ] Invariant cache hit.
[2024-05-29 19:08:12] [INFO ] State equation strengthened by 197 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 7/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:08:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:08:14] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-29 19:08:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:08:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-29 19:08:15] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:08:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:08:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:08:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-29 19:08:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:08:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:08:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:08:15] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:08:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:08:15] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:08:15] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:08:16] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-29 19:08:16] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (OVERLAPS) 229/260 variables, 31/87 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 196/283 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-29 19:08:18] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (OVERLAPS) 1/261 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/261 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 15 (OVERLAPS) 0/261 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 285 constraints, problems are : Problem set: 0 solved, 231 unsolved in 14820 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 197/197 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 7/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 229/260 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 196/284 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 231/515 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (OVERLAPS) 1/261 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (OVERLAPS) 0/261 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 516 constraints, problems are : Problem set: 0 solved, 231 unsolved in 26737 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 197/197 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 56/56 constraints]
After SMT, in 42359ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 42361ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/84 places, 238/362 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42508 ms. Remains : 31/84 places, 238/362 transitions.
[2024-05-29 19:08:54] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:08:54] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:08:54] [INFO ] Input system was already deterministic with 238 transitions.
[2024-05-29 19:08:54] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:08:54] [INFO ] Flatten gal took : 9 ms
[2024-05-29 19:08:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9181822104037906034.gal : 3 ms
[2024-05-29 19:08:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17191343510085850285.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/CTLFireability9181822104037906034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17191343510085850285.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,397,0.101988,7960,2,405,5,3805,6,0,355,2377,0


Converting to forward existential form...Done !
original formula: A(EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) U (((AG(((p44!=1)&&(!((((p12==1)&&(p26==1))&&((p40...294
=> equivalent forward existential formula: [((Init * !(EG(!((((!(E(TRUE U !(((p44!=1)&&(!((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1...785
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21, t2...298
(forward)formula 0,0,0.413873,15932,1,0,368,28678,493,92,7494,20393,588
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 6 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
[2024-05-29 19:08:55] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2024-05-29 19:08:55] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 19:08:55] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 19:08:55] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:08:55] [INFO ] Invariant cache hit.
[2024-05-29 19:08:55] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:08:55] [INFO ] Implicit Places using invariants and state equation in 229 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 273 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/84 places, 355/362 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 3 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2024-05-29 19:08:55] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2024-05-29 19:08:55] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:08:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 19:08:55] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:08:55] [INFO ] Invariant cache hit.
[2024-05-29 19:08:55] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:08:55] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/84 places, 334/362 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 396 ms. Remains : 58/84 places, 334/362 transitions.
[2024-05-29 19:08:55] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:08:55] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:08:55] [INFO ] Input system was already deterministic with 334 transitions.
[2024-05-29 19:08:55] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:08:55] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:08:55] [INFO ] Time to serialize gal into /tmp/CTLFireability15484649166365254653.gal : 2 ms
[2024-05-29 19:08:55] [INFO ] Time to serialize properties into /tmp/CTLFireability10790413668271598647.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/CTLFireability15484649166365254653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10790413668271598647.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(((EX(AF(EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))))) + ((((p12==1)&&(p26==1))&&((p40==1)&&(p...905
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !((EX(!(EG(!(EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p9...1804
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...338
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.03346,127540,1,0,540,289356,697,156,10547,178180,827
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 6 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
[2024-05-29 19:08:59] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2024-05-29 19:08:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 19:08:59] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 19:08:59] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:08:59] [INFO ] Invariant cache hit.
[2024-05-29 19:08:59] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:08:59] [INFO ] Implicit Places using invariants and state equation in 217 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 259 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/84 places, 355/362 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 5 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2024-05-29 19:08:59] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2024-05-29 19:08:59] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 19:08:59] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 19:08:59] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:08:59] [INFO ] Invariant cache hit.
[2024-05-29 19:08:59] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:08:59] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/84 places, 334/362 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 388 ms. Remains : 58/84 places, 334/362 transitions.
[2024-05-29 19:08:59] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:08:59] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:08:59] [INFO ] Input system was already deterministic with 334 transitions.
[2024-05-29 19:08:59] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:09:00] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:09:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8260173715164632338.gal : 3 ms
[2024-05-29 19:09:00] [INFO ] Time to serialize properties into /tmp/CTLFireability8528638141679384046.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/CTLFireability8260173715164632338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8528638141679384046.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,80326,0.534501,21192,2,2335,5,32142,6,0,558,20332,0


Converting to forward existential form...Done !
original formula: AF((AX((((((EX(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) * AX(((((p12==1)&&(p26==1))&&((p40==1)&&...1061
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!((((((EX(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) *...1325
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...338
(forward)formula 0,0,2.80128,82176,1,0,515,207539,697,123,10833,145592,799
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 5 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
[2024-05-29 19:09:02] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2024-05-29 19:09:02] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 19:09:02] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 19:09:02] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:09:02] [INFO ] Invariant cache hit.
[2024-05-29 19:09:02] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:09:03] [INFO ] Implicit Places using invariants and state equation in 224 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 266 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/84 places, 355/362 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 5 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2024-05-29 19:09:03] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2024-05-29 19:09:03] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 19:09:03] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 19:09:03] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:09:03] [INFO ] Invariant cache hit.
[2024-05-29 19:09:03] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:09:03] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/84 places, 334/362 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 397 ms. Remains : 58/84 places, 334/362 transitions.
[2024-05-29 19:09:03] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:09:03] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:09:03] [INFO ] Input system was already deterministic with 334 transitions.
[2024-05-29 19:09:03] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:09:03] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:09:03] [INFO ] Time to serialize gal into /tmp/CTLFireability5057833456166428446.gal : 2 ms
[2024-05-29 19:09:03] [INFO ] Time to serialize properties into /tmp/CTLFireability8025601047388011790.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/CTLFireability5057833456166428446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8025601047388011790.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,80326,0.520656,21188,2,2335,5,32142,6,0,558,20332,0


Converting to forward existential form...Done !
original formula: !(A((!((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))) + E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1))...454
=> equivalent forward existential formula: ([(EY(((FwdU(Init,!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))))) * !(((((p...710
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...338
Hit Full ! (commute/partial/dont) 51/0/283
Hit Full ! (commute/partial/dont) 51/0/283
(forward)formula 0,0,3.71914,112004,1,0,450,217053,699,96,10463,132620,729
FORMULA StigmergyElection-PT-07a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 5 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
[2024-05-29 19:09:07] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2024-05-29 19:09:07] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 19:09:07] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 19:09:07] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:09:07] [INFO ] Invariant cache hit.
[2024-05-29 19:09:07] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:09:07] [INFO ] Implicit Places using invariants and state equation in 225 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 265 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/84 places, 355/362 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 5 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2024-05-29 19:09:07] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2024-05-29 19:09:07] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 19:09:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 19:09:07] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:09:07] [INFO ] Invariant cache hit.
[2024-05-29 19:09:07] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:09:07] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/84 places, 334/362 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 386 ms. Remains : 58/84 places, 334/362 transitions.
[2024-05-29 19:09:07] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:09:07] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:09:07] [INFO ] Input system was already deterministic with 334 transitions.
[2024-05-29 19:09:07] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:09:07] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:09:07] [INFO ] Time to serialize gal into /tmp/CTLFireability13651725360473503777.gal : 3 ms
[2024-05-29 19:09:07] [INFO ] Time to serialize properties into /tmp/CTLFireability4308436229964213757.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/CTLFireability13651725360473503777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4308436229964213757.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,80326,0.522141,21184,2,2335,5,32142,6,0,558,20332,0


Converting to forward existential form...Done !
original formula: EF(AX(A(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))) U EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)...196
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!((E(!(E(TRUE U ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&...469
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...338
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,3.53652,107512,1,0,451,213949,689,97,10682,130791,727
FORMULA StigmergyElection-PT-07a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 82 transition count 347
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 68 transition count 347
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 29 place count 68 transition count 334
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 55 place count 55 transition count 334
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 40 transition count 316
Iterating global reduction 2 with 15 rules applied. Total rules applied 85 place count 40 transition count 316
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 212 place count 40 transition count 189
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 212 place count 40 transition count 185
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 220 place count 36 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 227 place count 36 transition count 178
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 241 place count 29 transition count 171
Applied a total of 241 rules in 22 ms. Remains 29 /84 variables (removed 55) and now considering 171/362 (removed 191) transitions.
[2024-05-29 19:09:11] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
// Phase 1: matrix 163 rows 29 cols
[2024-05-29 19:09:11] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:09:11] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-29 19:09:11] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2024-05-29 19:09:11] [INFO ] Invariant cache hit.
[2024-05-29 19:09:11] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-29 19:09:11] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-29 19:09:11] [INFO ] Redundant transitions in 2 ms returned []
Running 164 sub problems to find dead transitions.
[2024-05-29 19:09:11] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2024-05-29 19:09:11] [INFO ] Invariant cache hit.
[2024-05-29 19:09:11] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:11] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:09:11] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 19:09:11] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:09:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:09:13] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 162/191 variables, 29/75 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 133/208 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 1/192 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:18] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:09:18] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/192 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 16 (OVERLAPS) 0/192 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 212 constraints, problems are : Problem set: 0 solved, 164 unsolved in 9145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:09:21] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:09:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:09:21] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 162/191 variables, 29/83 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 133/216 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 164/380 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 1/192 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 381 constraints, problems are : Problem set: 0 solved, 164 unsolved in 12408 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 53/53 constraints]
After SMT, in 21953ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 21954ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/84 places, 171/362 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22055 ms. Remains : 29/84 places, 171/362 transitions.
[2024-05-29 19:09:33] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:09:33] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:09:33] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-29 19:09:33] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:09:33] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:09:33] [INFO ] Time to serialize gal into /tmp/CTLFireability731057787094721692.gal : 1 ms
[2024-05-29 19:09:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8053938219362009314.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/CTLFireability731057787094721692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8053938219362009314.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,269,0.059699,6524,2,386,5,3449,6,0,280,1882,0


Converting to forward existential form...Done !
original formula: AF(AG(!(E(EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) U ((((AG(((((p12==1)&&(p26==1))&&((p40==1)...375
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(E(E(TRUE U ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p9...450
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...292
(forward)formula 0,1,0.228435,10008,1,0,266,18058,367,56,4842,13753,394
FORMULA StigmergyElection-PT-07a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 82 transition count 347
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 68 transition count 347
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 29 place count 68 transition count 334
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 55 place count 55 transition count 334
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 40 transition count 316
Iterating global reduction 2 with 15 rules applied. Total rules applied 85 place count 40 transition count 316
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 212 place count 40 transition count 189
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 212 place count 40 transition count 185
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 220 place count 36 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 227 place count 36 transition count 178
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 241 place count 29 transition count 171
Applied a total of 241 rules in 31 ms. Remains 29 /84 variables (removed 55) and now considering 171/362 (removed 191) transitions.
[2024-05-29 19:09:33] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2024-05-29 19:09:33] [INFO ] Invariant cache hit.
[2024-05-29 19:09:33] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 19:09:33] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2024-05-29 19:09:33] [INFO ] Invariant cache hit.
[2024-05-29 19:09:33] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-29 19:09:33] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-29 19:09:33] [INFO ] Redundant transitions in 1 ms returned []
Running 164 sub problems to find dead transitions.
[2024-05-29 19:09:33] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2024-05-29 19:09:33] [INFO ] Invariant cache hit.
[2024-05-29 19:09:33] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 19:09:34] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:35] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:09:35] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:09:35] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:09:35] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:09:35] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:09:35] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:09:35] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:09:35] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:09:35] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:09:35] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:09:35] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:09:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:35] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:09:35] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:36] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:09:36] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:09:36] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:09:36] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:09:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:09:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 162/191 variables, 29/75 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 133/208 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:37] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 1/192 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:40] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:09:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/192 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 16 (OVERLAPS) 0/192 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 212 constraints, problems are : Problem set: 0 solved, 164 unsolved in 9036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:09:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:09:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:09:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:09:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 162/191 variables, 29/83 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 133/216 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 164/380 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 1/192 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 381 constraints, problems are : Problem set: 0 solved, 164 unsolved in 12798 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 53/53 constraints]
After SMT, in 22208ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 22211ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/84 places, 171/362 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22333 ms. Remains : 29/84 places, 171/362 transitions.
[2024-05-29 19:09:55] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:09:55] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:09:55] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-29 19:09:55] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:09:55] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:09:55] [INFO ] Time to serialize gal into /tmp/CTLFireability12200758540433675395.gal : 2 ms
[2024-05-29 19:09:55] [INFO ] Time to serialize properties into /tmp/CTLFireability8005244956167265418.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/CTLFireability12200758540433675395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8005244956167265418.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,269,0.057349,6532,2,386,5,3449,6,0,280,1882,0


Converting to forward existential form...Done !
original formula: A(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1))) U EG((EF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))...288
=> equivalent forward existential formula: [((Init * !(EG(!(EG((E(TRUE U ((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&(p96==1)))) ...769
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...292
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.269881,11864,1,0,297,22683,371,78,4886,17781,444
FORMULA StigmergyElection-PT-07a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-29 19:09:56] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:09:56] [INFO ] Flatten gal took : 11 ms
Total runtime 293822 ms.

BK_STOP 1717009796195

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-07a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532100330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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