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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 7.7K Apr 11 19:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K 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 5.3M 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-08a-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-08a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717011990220

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-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 19:46:31] [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:46:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:46:31] [INFO ] Load time of PNML (sax parser for PT used): 433 ms
[2024-05-29 19:46:31] [INFO ] Transformed 114 places.
[2024-05-29 19:46:31] [INFO ] Transformed 6882 transitions.
[2024-05-29 19:46:31] [INFO ] Found NUPN structural information;
[2024-05-29 19:46:31] [INFO ] Parsed PT model containing 114 places and 6882 transitions and 107626 arcs in 597 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
Support contains 14 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 664/664 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 99 transition count 641
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 99 transition count 641
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 92 transition count 627
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 92 transition count 627
Applied a total of 44 rules in 32 ms. Remains 92 /114 variables (removed 22) and now considering 627/664 (removed 37) transitions.
[2024-05-29 19:46:32] [INFO ] Flow matrix only has 618 transitions (discarded 9 similar events)
// Phase 1: matrix 618 rows 92 cols
[2024-05-29 19:46:32] [INFO ] Computed 2 invariants in 16 ms
[2024-05-29 19:46:32] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-29 19:46:32] [INFO ] Flow matrix only has 618 transitions (discarded 9 similar events)
[2024-05-29 19:46:32] [INFO ] Invariant cache hit.
[2024-05-29 19:46:32] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-05-29 19:46:32] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Running 626 sub problems to find dead transitions.
[2024-05-29 19:46:32] [INFO ] Flow matrix only has 618 transitions (discarded 9 similar events)
[2024-05-29 19:46:32] [INFO ] Invariant cache hit.
[2024-05-29 19:46:32] [INFO ] State equation strengthened by 549 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:46:42] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 8 ms to minimize.
[2024-05-29 19:46:42] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 9 ms to minimize.
[2024-05-29 19:46:42] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 1 ms to minimize.
[2024-05-29 19:46:42] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2024-05-29 19:46:42] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:46:42] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2024-05-29 19:46:42] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2024-05-29 19:46:42] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-05-29 19:46:43] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2024-05-29 19:46:43] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2024-05-29 19:46:43] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 19:46:43] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:46:43] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 19:46:43] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2024-05-29 19:46:43] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2024-05-29 19:46:43] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 3 ms to minimize.
[2024-05-29 19:46:43] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2024-05-29 19:46:44] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:46:44] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:46:44] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:46:44] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:46:44] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:46:44] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:46:44] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:46:44] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 0 ms to minimize.
[2024-05-29 19:46:44] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:46:47] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-05-29 19:46:47] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:46:47] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:46:47] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:46:47] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:46:47] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:46:47] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:46:47] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:46:47] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 19:46:48] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:46:48] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-29 19:46:48] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:46:48] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:46:48] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:46:48] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:46:48] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-05-29 19:46:48] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 3 ms to minimize.
[2024-05-29 19:46:48] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:46:48] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:46:48] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:46:50] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2024-05-29 19:46:50] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:46:50] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-05-29 19:46:50] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:46:50] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:46:50] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 0 ms to minimize.
[2024-05-29 19:46:50] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:46:50] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:46:52] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:46:52] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:46:52] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:46:52] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:46:52] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:46:52] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:46:53] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 19:46:54] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2024-05-29 19:46:54] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-29 19:46:54] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:46:54] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 19:46:54] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:46:54] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2024-05-29 19:46:54] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-05-29 19:46:54] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2024-05-29 19:46:54] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:46:55] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 11/113 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:46:56] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:46:56] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:46:56] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2024-05-29 19:46:56] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:46:57] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:46:57] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:46:57] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:46:57] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:46:57] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:46:57] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-05-29 19:46:57] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2024-05-29 19:46:57] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:46:57] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 13/126 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:46:59] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2024-05-29 19:46:59] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2024-05-29 19:46:59] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2024-05-29 19:46:59] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:47:00] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:47:00] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:47:00] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-29 19:47:00] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:47:00] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:47:01] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:47:05] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:47:05] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 19:47:05] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 0 ms to minimize.
[2024-05-29 19:47:06] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2024-05-29 19:47:06] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:47:07] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:47:08] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 92/710 variables, and 143 constraints, problems are : Problem set: 0 solved, 626 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/92 constraints, ReadFeed: 0/549 constraints, PredecessorRefiner: 626/626 constraints, Known Traps: 141/141 constraints]
Escalating to Integer solving :Problem set: 0 solved, 626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:47:14] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-05-29 19:47:14] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 3 ms to minimize.
[2024-05-29 19:47:14] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2024-05-29 19:47:15] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2024-05-29 19:47:18] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:47:20] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:47:29] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-29 19:47:34] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 92/710 variables, and 153 constraints, problems are : Problem set: 0 solved, 626 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/92 constraints, ReadFeed: 0/549 constraints, PredecessorRefiner: 0/626 constraints, Known Traps: 151/151 constraints]
After SMT, in 66611ms problems are : Problem set: 0 solved, 626 unsolved
Search for dead transitions found 0 dead transitions in 66651ms
Starting structural reductions in LTL mode, iteration 1 : 92/114 places, 627/664 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67414 ms. Remains : 92/114 places, 627/664 transitions.
Support contains 14 out of 92 places after structural reductions.
[2024-05-29 19:47:39] [INFO ] Flatten gal took : 97 ms
[2024-05-29 19:47:39] [INFO ] Flatten gal took : 70 ms
[2024-05-29 19:47:40] [INFO ] Input system was already deterministic with 627 transitions.
Reduction of identical properties reduced properties to check from 18 to 12
RANDOM walk for 40000 steps (26 resets) in 2404 ms. (16 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (13 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (13 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
[2024-05-29 19:47:41] [INFO ] Flow matrix only has 618 transitions (discarded 9 similar events)
[2024-05-29 19:47:41] [INFO ] Invariant cache hit.
[2024-05-29 19:47:41] [INFO ] State equation strengthened by 549 read => feed constraints.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 81/92 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 617/709 variables, 92/94 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/709 variables, 548/642 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/709 variables, 0/642 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/710 variables, 1/643 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/710 variables, 0/643 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/710 variables, 0/643 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 710/710 variables, and 643 constraints, problems are : Problem set: 4 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 549/549 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Int declared 91/710 variables, and 1 constraints, problems are : Problem set: 5 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/92 constraints, ReadFeed: 0/549 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 443ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-08a-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 19:47:41] [INFO ] Flatten gal took : 44 ms
[2024-05-29 19:47:41] [INFO ] Flatten gal took : 59 ms
[2024-05-29 19:47:41] [INFO ] Input system was already deterministic with 627 transitions.
Computed a total of 18 stabilizing places and 17 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 8 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2024-05-29 19:47:41] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2024-05-29 19:47:41] [INFO ] Computed 2 invariants in 9 ms
[2024-05-29 19:47:41] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 19:47:41] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2024-05-29 19:47:41] [INFO ] Invariant cache hit.
[2024-05-29 19:47:41] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-05-29 19:47:42] [INFO ] Implicit Places using invariants and state equation in 552 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 606 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 10 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2024-05-29 19:47:42] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 19:47:42] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 19:47:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 19:47:42] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 19:47:42] [INFO ] Invariant cache hit.
[2024-05-29 19:47:42] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:47:42] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 822 ms. Remains : 66/92 places, 601/627 transitions.
[2024-05-29 19:47:42] [INFO ] Flatten gal took : 42 ms
[2024-05-29 19:47:42] [INFO ] Flatten gal took : 36 ms
[2024-05-29 19:47:42] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:47:42] [INFO ] Flatten gal took : 36 ms
[2024-05-29 19:47:42] [INFO ] Flatten gal took : 36 ms
[2024-05-29 19:47:42] [INFO ] Time to serialize gal into /tmp/CTLFireability5764250095999765654.gal : 27 ms
[2024-05-29 19:47:42] [INFO ] Time to serialize properties into /tmp/CTLFireability529427593319020285.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/CTLFireability5764250095999765654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability529427593319020285.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,397202,2.46302,67732,2,4225,5,68299,6,0,856,43711,0


Converting to forward existential form...Done !
original formula: E((!(AX((((((E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1)))) U ((((p12==1)&&(p26==1))&&((...1032
=> equivalent forward existential formula: ([(EY(FwdU(Init,(!(!(EX(!((((((E(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)...2446
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,...364
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,19.4827,469880,1,0,857,595677,1240,193,21605,350399,1445
FORMULA StigmergyElection-PT-08a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 14 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2024-05-29 19:48:02] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2024-05-29 19:48:02] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 19:48:02] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 19:48:02] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2024-05-29 19:48:02] [INFO ] Invariant cache hit.
[2024-05-29 19:48:02] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-05-29 19:48:03] [INFO ] Implicit Places using invariants and state equation in 503 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 547 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 9 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2024-05-29 19:48:03] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 19:48:03] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 19:48:03] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 19:48:03] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 19:48:03] [INFO ] Invariant cache hit.
[2024-05-29 19:48:03] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:48:03] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 757 ms. Remains : 66/92 places, 601/627 transitions.
[2024-05-29 19:48:03] [INFO ] Flatten gal took : 28 ms
[2024-05-29 19:48:03] [INFO ] Flatten gal took : 30 ms
[2024-05-29 19:48:03] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:48:03] [INFO ] Flatten gal took : 29 ms
[2024-05-29 19:48:03] [INFO ] Flatten gal took : 29 ms
[2024-05-29 19:48:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10075760573468298758.gal : 9 ms
[2024-05-29 19:48:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16989142167514880465.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/CTLFireability10075760573468298758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16989142167514880465.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,397202,2.35609,67600,2,4225,5,68299,6,0,856,43711,0


Converting to forward existential form...Done !
original formula: EX(EX(!(E(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))) U ((((p12==1)&&(p26==1))&&((p4...224
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1...269
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,...364
(forward)formula 0,0,19.4486,485888,1,0,803,769603,1212,156,21298,454932,1348
FORMULA StigmergyElection-PT-08a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 10 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2024-05-29 19:48:23] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2024-05-29 19:48:23] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 19:48:23] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 19:48:23] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2024-05-29 19:48:23] [INFO ] Invariant cache hit.
[2024-05-29 19:48:23] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-05-29 19:48:23] [INFO ] Implicit Places using invariants and state equation in 530 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 571 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 14 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2024-05-29 19:48:23] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 19:48:23] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 19:48:23] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 19:48:23] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 19:48:23] [INFO ] Invariant cache hit.
[2024-05-29 19:48:23] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:48:23] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 784 ms. Remains : 66/92 places, 601/627 transitions.
[2024-05-29 19:48:24] [INFO ] Flatten gal took : 29 ms
[2024-05-29 19:48:24] [INFO ] Flatten gal took : 28 ms
[2024-05-29 19:48:24] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:48:24] [INFO ] Flatten gal took : 27 ms
[2024-05-29 19:48:24] [INFO ] Flatten gal took : 30 ms
[2024-05-29 19:48:24] [INFO ] Time to serialize gal into /tmp/CTLFireability16968197189403557132.gal : 6 ms
[2024-05-29 19:48:24] [INFO ] Time to serialize properties into /tmp/CTLFireability8023745499577830654.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/CTLFireability16968197189403557132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8023745499577830654.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,397202,2.33512,67600,2,4225,5,68299,6,0,856,43711,0


Converting to forward existential form...Done !
original formula: AF(EX((AG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))) + EX(((p25==1)||((((p12==1)&&(p2...237
=> equivalent forward existential formula: [FwdG(Init,!(EX((!(E(TRUE U !(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(...294
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,...364
(forward)formula 0,1,9.26118,235104,1,0,745,292993,1221,123,21794,198142,1261
FORMULA StigmergyElection-PT-08a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 4 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2024-05-29 19:48:33] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2024-05-29 19:48:33] [INFO ] Computed 2 invariants in 7 ms
[2024-05-29 19:48:33] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 19:48:33] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2024-05-29 19:48:33] [INFO ] Invariant cache hit.
[2024-05-29 19:48:33] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-05-29 19:48:34] [INFO ] Implicit Places using invariants and state equation in 509 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 560 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 75 transition count 610
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 75 transition count 610
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 68 transition count 603
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 68 transition count 603
Applied a total of 44 rules in 11 ms. Remains 68 /90 variables (removed 22) and now considering 603/625 (removed 22) transitions.
[2024-05-29 19:48:34] [INFO ] Flow matrix only has 594 transitions (discarded 9 similar events)
// Phase 1: matrix 594 rows 68 cols
[2024-05-29 19:48:34] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 19:48:34] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 19:48:34] [INFO ] Flow matrix only has 594 transitions (discarded 9 similar events)
[2024-05-29 19:48:34] [INFO ] Invariant cache hit.
[2024-05-29 19:48:34] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:48:34] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 68/92 places, 603/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 765 ms. Remains : 68/92 places, 603/627 transitions.
[2024-05-29 19:48:34] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:48:34] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:48:34] [INFO ] Input system was already deterministic with 603 transitions.
[2024-05-29 19:48:34] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:48:34] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:48:34] [INFO ] Time to serialize gal into /tmp/CTLFireability7175857248114487398.gal : 6 ms
[2024-05-29 19:48:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9602617563580399489.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/CTLFireability7175857248114487398.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9602617563580399489.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,397204,2.41189,69188,2,4468,5,78622,6,0,866,46738,0


Converting to forward existential form...Done !
original formula: A(!(AG((!((!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))) + A(((((p12==1)&&(p26==1))&&(...441
=> equivalent forward existential formula: [((Init * !(EG(!(EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1)))...939
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,...364
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,9.13284,230952,1,0,800,388839,1237,152,23277,252544,1366
FORMULA StigmergyElection-PT-08a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 13 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2024-05-29 19:48:43] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2024-05-29 19:48:43] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 19:48:43] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 19:48:43] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2024-05-29 19:48:43] [INFO ] Invariant cache hit.
[2024-05-29 19:48:43] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-05-29 19:48:44] [INFO ] Implicit Places using invariants and state equation in 532 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 576 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 10 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2024-05-29 19:48:44] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 19:48:44] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 19:48:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 19:48:44] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 19:48:44] [INFO ] Invariant cache hit.
[2024-05-29 19:48:44] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:48:44] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 779 ms. Remains : 66/92 places, 601/627 transitions.
[2024-05-29 19:48:44] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:48:44] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:48:44] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:48:44] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:48:44] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:48:44] [INFO ] Time to serialize gal into /tmp/CTLFireability1227512345690373341.gal : 5 ms
[2024-05-29 19:48:44] [INFO ] Time to serialize properties into /tmp/CTLFireability2195565310744060981.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/CTLFireability1227512345690373341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2195565310744060981.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,397202,2.32074,67596,2,4225,5,68299,6,0,856,43711,0


Converting to forward existential form...Done !
original formula: EG((((AG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))) + E(((((p12==1)&&(p26==1))&&((p40...936
=> equivalent forward existential formula: [FwdG(Init,(((!(E(TRUE U !(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p11...991
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,...364
(forward)formula 0,0,9.41465,239920,1,0,753,302758,1226,131,21194,214680,1278
FORMULA StigmergyElection-PT-08a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 3 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2024-05-29 19:48:54] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2024-05-29 19:48:54] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 19:48:54] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 19:48:54] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2024-05-29 19:48:54] [INFO ] Invariant cache hit.
[2024-05-29 19:48:54] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-05-29 19:48:54] [INFO ] Implicit Places using invariants and state equation in 531 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 578 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 11 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2024-05-29 19:48:54] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 19:48:54] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 19:48:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 19:48:54] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 19:48:54] [INFO ] Invariant cache hit.
[2024-05-29 19:48:54] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:48:54] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 779 ms. Remains : 66/92 places, 601/627 transitions.
[2024-05-29 19:48:54] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:48:54] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:48:54] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:48:54] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:48:55] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:48:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13467229145314751297.gal : 5 ms
[2024-05-29 19:48:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17294018044607760711.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/CTLFireability13467229145314751297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17294018044607760711.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,397202,2.31151,67596,2,4225,5,68299,6,0,856,43711,0


Converting to forward existential form...Done !
original formula: EX(AG((AG(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))) * ((((p12==0)||(p26==0))||((p40=...221
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(E(TRUE U !(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((...290
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,...364
(forward)formula 0,0,15.0827,365148,1,0,713,444883,1214,105,21713,226917,1243
FORMULA StigmergyElection-PT-08a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 10 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2024-05-29 19:49:10] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2024-05-29 19:49:10] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 19:49:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 19:49:10] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2024-05-29 19:49:10] [INFO ] Invariant cache hit.
[2024-05-29 19:49:10] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-05-29 19:49:10] [INFO ] Implicit Places using invariants and state equation in 532 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 572 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 10 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2024-05-29 19:49:10] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 19:49:10] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 19:49:10] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 19:49:10] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 19:49:10] [INFO ] Invariant cache hit.
[2024-05-29 19:49:10] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:49:11] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 777 ms. Remains : 66/92 places, 601/627 transitions.
[2024-05-29 19:49:11] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:49:11] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:49:11] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:49:11] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:49:11] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:49:11] [INFO ] Time to serialize gal into /tmp/CTLFireability9188852509485340558.gal : 12 ms
[2024-05-29 19:49:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12409126634587001771.ctl : 87 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/CTLFireability9188852509485340558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12409126634587001771.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,397202,2.39063,67592,2,4225,5,68299,6,0,856,43711,0


Converting to forward existential form...Done !
original formula: A(EG(AX((A(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1)))) U ((((p12==1)&&(p26==1))&&((p40=...1124
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(!((E(!(EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96=...6761
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,...364
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,8.40593,192652,1,0,801,359082,1234,157,22365,235948,1367
FORMULA StigmergyElection-PT-08a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 90 transition count 610
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 74 transition count 610
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 74 transition count 600
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 64 transition count 600
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 69 place count 48 transition count 583
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 48 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 340 place count 48 transition count 328
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 340 place count 48 transition count 321
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 354 place count 41 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 362 place count 41 transition count 313
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 378 place count 33 transition count 305
Applied a total of 378 rules in 118 ms. Remains 33 /92 variables (removed 59) and now considering 305/627 (removed 322) transitions.
[2024-05-29 19:49:19] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
// Phase 1: matrix 296 rows 33 cols
[2024-05-29 19:49:19] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 19:49:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 19:49:19] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2024-05-29 19:49:19] [INFO ] Invariant cache hit.
[2024-05-29 19:49:19] [INFO ] State equation strengthened by 263 read => feed constraints.
[2024-05-29 19:49:19] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-29 19:49:20] [INFO ] Redundant transitions in 22 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-29 19:49:20] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2024-05-29 19:49:20] [INFO ] Invariant cache hit.
[2024-05-29 19:49:20] [INFO ] State equation strengthened by 263 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:49:21] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:49:22] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:49:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:49:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:49:25] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:49:25] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:49:25] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:49:25] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:49:25] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:49:25] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:49:26] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:49:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (OVERLAPS) 295/328 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 262/363 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:49:29] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 14 (OVERLAPS) 1/329 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 16 (OVERLAPS) 0/329 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 365 constraints, problems are : Problem set: 0 solved, 297 unsolved in 23443 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:49:45] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:49:45] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:49:46] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:49:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:49:46] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 295/328 variables, 33/107 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 262/369 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 297/666 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 1/329 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 667 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 73/73 constraints]
After SMT, in 54814ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 54818ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/92 places, 305/627 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55075 ms. Remains : 33/92 places, 305/627 transitions.
[2024-05-29 19:50:14] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:50:14] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:50:14] [INFO ] Input system was already deterministic with 305 transitions.
[2024-05-29 19:50:14] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:50:14] [INFO ] Flatten gal took : 19 ms
[2024-05-29 19:50:14] [INFO ] Time to serialize gal into /tmp/CTLFireability263756189263516356.gal : 5 ms
[2024-05-29 19:50:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13048923727341510808.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/CTLFireability263756189263516356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13048923727341510808.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,527,0.140036,10228,2,508,5,5032,6,0,429,2833,0


Converting to forward existential form...Done !
original formula: EF(EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1)...169
Hit Full ! (commute/partial/dont) 25/112/280
(forward)formula 0,1,0.40241,12920,1,0,14,13557,19,1,9527,7230,15
FORMULA StigmergyElection-PT-08a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 11 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2024-05-29 19:50:15] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2024-05-29 19:50:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 19:50:15] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 19:50:15] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2024-05-29 19:50:15] [INFO ] Invariant cache hit.
[2024-05-29 19:50:15] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-05-29 19:50:15] [INFO ] Implicit Places using invariants and state equation in 556 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 604 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 12 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2024-05-29 19:50:15] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 19:50:15] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 19:50:16] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 19:50:16] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 19:50:16] [INFO ] Invariant cache hit.
[2024-05-29 19:50:16] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:50:16] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 826 ms. Remains : 66/92 places, 601/627 transitions.
[2024-05-29 19:50:16] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:50:16] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:50:16] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:50:16] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:50:16] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:50:16] [INFO ] Time to serialize gal into /tmp/CTLFireability3056644123776837848.gal : 5 ms
[2024-05-29 19:50:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14175795196803107961.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/CTLFireability3056644123776837848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14175795196803107961.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,397202,2.34676,67600,2,4225,5,68299,6,0,856,43711,0


Converting to forward existential form...Done !
original formula: (AX(((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))||((((((((p12==0)||(p26==0))||((p40==0...738
=> equivalent forward existential formula: ([(((Init * !(!(EX(!(((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0...1304
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,...364
Hit Full ! (commute/partial/dont) 58/0/543
(forward)formula 0,0,15.6828,377872,1,0,715,454709,1223,107,21832,244660,1248
FORMULA StigmergyElection-PT-08a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 4 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2024-05-29 19:50:32] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2024-05-29 19:50:32] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 19:50:32] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 19:50:32] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2024-05-29 19:50:32] [INFO ] Invariant cache hit.
[2024-05-29 19:50:32] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-05-29 19:50:32] [INFO ] Implicit Places using invariants and state equation in 520 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 559 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 6 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2024-05-29 19:50:32] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 19:50:32] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:50:32] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 19:50:32] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 19:50:32] [INFO ] Invariant cache hit.
[2024-05-29 19:50:32] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:50:32] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 756 ms. Remains : 66/92 places, 601/627 transitions.
[2024-05-29 19:50:32] [INFO ] Flatten gal took : 27 ms
[2024-05-29 19:50:32] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:50:33] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:50:33] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:50:33] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:50:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6032297436991906968.gal : 5 ms
[2024-05-29 19:50:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9340291038050316442.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/CTLFireability6032297436991906968.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9340291038050316442.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,397202,2.3058,67596,2,4225,5,68299,6,0,856,43711,0


Converting to forward existential form...Done !
original formula: AG((A(!((AX(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))) + ((((p12==1)&&(p26==1))&&((p4...721
=> equivalent forward existential formula: ([((FwdU((FwdU(Init,TRUE) * !(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(...2412
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,...364
(forward)formula 0,0,27.597,687436,1,0,898,1.06624e+06,1229,235,22075,629048,1495
FORMULA StigmergyElection-PT-08a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 90 transition count 610
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 74 transition count 610
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 74 transition count 600
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 64 transition count 600
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 69 place count 48 transition count 583
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 48 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 340 place count 48 transition count 328
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 340 place count 48 transition count 321
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 354 place count 41 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 362 place count 41 transition count 313
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 378 place count 33 transition count 305
Applied a total of 378 rules in 88 ms. Remains 33 /92 variables (removed 59) and now considering 305/627 (removed 322) transitions.
[2024-05-29 19:51:01] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
// Phase 1: matrix 296 rows 33 cols
[2024-05-29 19:51:01] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:51:01] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 19:51:01] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2024-05-29 19:51:01] [INFO ] Invariant cache hit.
[2024-05-29 19:51:01] [INFO ] State equation strengthened by 263 read => feed constraints.
[2024-05-29 19:51:01] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-29 19:51:01] [INFO ] Redundant transitions in 9 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-29 19:51:01] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2024-05-29 19:51:01] [INFO ] Invariant cache hit.
[2024-05-29 19:51:01] [INFO ] State equation strengthened by 263 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:51:03] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:51:04] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:51:05] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:51:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:51:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:51:06] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:51:06] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:51:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:51:07] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:51:07] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (OVERLAPS) 295/328 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 262/363 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:51:10] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 14 (OVERLAPS) 1/329 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 16 (OVERLAPS) 0/329 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 365 constraints, problems are : Problem set: 0 solved, 297 unsolved in 23201 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:51:26] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:51:26] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:51:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:51:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:51:27] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 295/328 variables, 33/107 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 262/369 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 297/666 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 1/329 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 667 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 73/73 constraints]
After SMT, in 54491ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 54495ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/92 places, 305/627 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54710 ms. Remains : 33/92 places, 305/627 transitions.
[2024-05-29 19:51:55] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:51:55] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:51:55] [INFO ] Input system was already deterministic with 305 transitions.
[2024-05-29 19:51:55] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:51:55] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:51:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4920525104247311544.gal : 3 ms
[2024-05-29 19:51:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17897371212694123205.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/CTLFireability4920525104247311544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17897371212694123205.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,527,0.136077,10228,2,508,5,5032,6,0,429,2833,0


Converting to forward existential form...Done !
original formula: AF((E(!(AF(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1)))))) U EF(((((p12==1)&&(p26==1))&&(...323
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EG(!(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110=...380
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, t18, t19, t21...312
(forward)formula 0,1,0.795013,26120,1,0,444,36312,635,84,10161,26969,716
FORMULA StigmergyElection-PT-08a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 625
Applied a total of 2 rules in 7 ms. Remains 91 /92 variables (removed 1) and now considering 625/627 (removed 2) transitions.
[2024-05-29 19:51:56] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2024-05-29 19:51:56] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 19:51:56] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 19:51:56] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2024-05-29 19:51:56] [INFO ] Invariant cache hit.
[2024-05-29 19:51:56] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-05-29 19:51:57] [INFO ] Implicit Places using invariants and state equation in 516 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 570 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 625/627 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 11 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2024-05-29 19:51:57] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 19:51:57] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 19:51:57] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 19:51:57] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 19:51:57] [INFO ] Invariant cache hit.
[2024-05-29 19:51:57] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:51:57] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/92 places, 601/627 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 780 ms. Remains : 66/92 places, 601/627 transitions.
[2024-05-29 19:51:57] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:51:57] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:51:57] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:51:57] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:51:57] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:51:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14569176302104165500.gal : 5 ms
[2024-05-29 19:51:57] [INFO ] Time to serialize properties into /tmp/CTLFireability1410831195681183827.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/CTLFireability14569176302104165500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1410831195681183827.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,397202,2.22763,67592,2,4225,5,68299,6,0,856,43711,0


Converting to forward existential form...Done !
original formula: EG(AX(A((!(EG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1)))))) + ((((p12==1)&&(p26==1))&&(...339
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!((E(!(!(E(TRUE U !(((p67==1)||((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82...671
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,...364
(forward)formula 0,0,7.78274,191868,1,0,714,263564,1226,94,22971,179669,1234
FORMULA StigmergyElection-PT-08a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 627/627 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 90 transition count 610
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 74 transition count 610
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 74 transition count 600
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 64 transition count 600
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 69 place count 48 transition count 583
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 48 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 340 place count 48 transition count 328
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 340 place count 48 transition count 321
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 354 place count 41 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 362 place count 41 transition count 313
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 378 place count 33 transition count 305
Applied a total of 378 rules in 64 ms. Remains 33 /92 variables (removed 59) and now considering 305/627 (removed 322) transitions.
[2024-05-29 19:52:05] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
// Phase 1: matrix 296 rows 33 cols
[2024-05-29 19:52:05] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 19:52:05] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 19:52:05] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2024-05-29 19:52:05] [INFO ] Invariant cache hit.
[2024-05-29 19:52:05] [INFO ] State equation strengthened by 263 read => feed constraints.
[2024-05-29 19:52:05] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-29 19:52:05] [INFO ] Redundant transitions in 8 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-29 19:52:05] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2024-05-29 19:52:05] [INFO ] Invariant cache hit.
[2024-05-29 19:52:05] [INFO ] State equation strengthened by 263 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:52:07] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:52:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:52:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:52:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:52:07] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:52:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:52:07] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:52:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:52:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:52:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:52:07] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:52:07] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:52:08] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:52:09] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:52:10] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:52:10] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:52:10] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:52:10] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:52:10] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:52:10] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:52:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:52:10] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:52:10] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:52:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:52:11] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:52:11] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:52:11] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:52:11] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:52:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (OVERLAPS) 295/328 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 262/363 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:52:14] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 14 (OVERLAPS) 1/329 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 16 (OVERLAPS) 0/329 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 365 constraints, problems are : Problem set: 0 solved, 297 unsolved in 23258 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:52:30] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:52:31] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:52:31] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:52:31] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 19:52:32] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 295/328 variables, 33/107 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 262/369 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 297/666 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 1/329 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 667 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 73/73 constraints]
After SMT, in 54688ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 54691ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/92 places, 305/627 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54885 ms. Remains : 33/92 places, 305/627 transitions.
[2024-05-29 19:53:00] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:53:00] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:53:00] [INFO ] Input system was already deterministic with 305 transitions.
[2024-05-29 19:53:00] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:53:00] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:53:00] [INFO ] Time to serialize gal into /tmp/CTLFireability16384305189818155912.gal : 3 ms
[2024-05-29 19:53:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4281748111420801840.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/CTLFireability16384305189818155912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4281748111420801840.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,527,0.138507,10224,2,508,5,5032,6,0,429,2833,0


Converting to forward existential form...Done !
original formula: EF(EG(((AG(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))) + E(((((p12==1)&&(p26==1))&&((p...418
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((!(E(TRUE U !(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96...480
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, t18, t19, t21...312
(forward)formula 0,1,0.514233,15820,1,0,390,19601,631,50,10167,13837,631
FORMULA StigmergyElection-PT-08a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 19:53:00] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:53:00] [INFO ] Flatten gal took : 25 ms
Total runtime 389586 ms.

BK_STOP 1717012380961

--------------------
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-08a"
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-08a, 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-171690532100346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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