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-171690532100329.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyElection-PT-07a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532100329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 19:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 11 19:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-07a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717009349216

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 19:02:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 19:02:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:02:30] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2024-05-29 19:02:30] [INFO ] Transformed 100 places.
[2024-05-29 19:02:30] [INFO ] Transformed 2618 transitions.
[2024-05-29 19:02:30] [INFO ] Found NUPN structural information;
[2024-05-29 19:02:30] [INFO ] Parsed PT model containing 100 places and 2618 transitions and 34799 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 389/389 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 98 transition count 387
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 98 transition count 387
Applied a total of 4 rules in 26 ms. Remains 98 /100 variables (removed 2) and now considering 387/389 (removed 2) transitions.
[2024-05-29 19:02:30] [INFO ] Flow matrix only has 368 transitions (discarded 19 similar events)
// Phase 1: matrix 368 rows 98 cols
[2024-05-29 19:02:30] [INFO ] Computed 6 invariants in 19 ms
[2024-05-29 19:02:31] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-29 19:02:31] [INFO ] Flow matrix only has 368 transitions (discarded 19 similar events)
[2024-05-29 19:02:31] [INFO ] Invariant cache hit.
[2024-05-29 19:02:31] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:02:31] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2024-05-29 19:02:31] [INFO ] Flow matrix only has 368 transitions (discarded 19 similar events)
[2024-05-29 19:02:31] [INFO ] Invariant cache hit.
[2024-05-29 19:02:31] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 15 ms to minimize.
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 3 ms to minimize.
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:02:35] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:02:36] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:02:37] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:02:37] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:02:37] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:02:37] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:02:37] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:02:37] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:02:37] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:02:37] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-29 19:02:38] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:02:38] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:02:38] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:02:38] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:02:38] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:02:38] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:02:38] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:02:38] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:02:38] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:02:38] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:02:38] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:02:38] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:02:38] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:02:38] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 3 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:02:41] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:02:41] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-29 19:02:41] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:02:41] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:02:41] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:02:41] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:02:41] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:02:41] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-29 19:02:43] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:02:43] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:02:44] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-29 19:02:44] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:02:44] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 10 (OVERLAPS) 367/465 variables, 98/195 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 287/482 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-29 19:02:49] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 14 (OVERLAPS) 1/466 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/466 variables, and 484 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 92/98 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-29 19:03:04] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:03:04] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:03:05] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-29 19:03:06] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:03:06] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:03:06] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:03:06] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (OVERLAPS) 367/465 variables, 98/203 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 287/490 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 386/876 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 386 unsolved
SMT process timed out in 61957ms, After SMT, problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 61979ms
Starting structural reductions in LTL mode, iteration 1 : 98/100 places, 387/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62507 ms. Remains : 98/100 places, 387/389 transitions.
Support contains 61 out of 98 places after structural reductions.
[2024-05-29 19:03:33] [INFO ] Flatten gal took : 73 ms
[2024-05-29 19:03:33] [INFO ] Flatten gal took : 37 ms
[2024-05-29 19:03:33] [INFO ] Input system was already deterministic with 387 transitions.
Support contains 58 out of 98 places (down from 61) after GAL structural reductions.
RANDOM walk for 40000 steps (54 resets) in 2630 ms. (15 steps per ms) remains 3/52 properties
BEST_FIRST walk for 40004 steps (9 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
[2024-05-29 19:03:34] [INFO ] Flow matrix only has 368 transitions (discarded 19 similar events)
[2024-05-29 19:03:34] [INFO ] Invariant cache hit.
[2024-05-29 19:03:34] [INFO ] State equation strengthened by 288 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/83 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/98 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 367/465 variables, 98/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 287/391 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/466 variables, 1/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/466 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 392 constraints, problems are : Problem set: 1 solved, 2 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 64/69 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-29 19:03:34] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:03:34] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:03:34] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 19:03:35] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 19:03:35] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:03:35] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:03:35] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:03:35] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:03:35] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:03:35] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:03:35] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:03:35] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:03:35] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
Problem AtomicPropp3 is UNSAT
[2024-05-29 19:03:35] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Int declared 69/466 variables, and 17 constraints, problems are : Problem set: 3 solved, 0 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 3/6 constraints, State Equation: 0/98 constraints, ReadFeed: 0/288 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 14/14 constraints]
After SMT, in 1050ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 19:03:35] [INFO ] Flatten gal took : 27 ms
[2024-05-29 19:03:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyElection-PT-07a-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 19:03:35] [INFO ] Flatten gal took : 27 ms
[2024-05-29 19:03:35] [INFO ] Input system was already deterministic with 387 transitions.
Support contains 51 out of 98 places (down from 53) after GAL structural reductions.
Computed a total of 16 stabilizing places and 15 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 375
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 375
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 90 transition count 373
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 90 transition count 373
Applied a total of 16 rules in 7 ms. Remains 90 /98 variables (removed 8) and now considering 373/387 (removed 14) transitions.
[2024-05-29 19:03:35] [INFO ] Flow matrix only has 361 transitions (discarded 12 similar events)
// Phase 1: matrix 361 rows 90 cols
[2024-05-29 19:03:35] [INFO ] Computed 4 invariants in 5 ms
[2024-05-29 19:03:35] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-29 19:03:35] [INFO ] Flow matrix only has 361 transitions (discarded 12 similar events)
[2024-05-29 19:03:35] [INFO ] Invariant cache hit.
[2024-05-29 19:03:35] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:03:36] [INFO ] Implicit Places using invariants and state equation in 283 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 362 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/98 places, 373/387 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 86 transition count 370
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 86 transition count 370
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 84 transition count 368
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 84 transition count 368
Applied a total of 10 rules in 9 ms. Remains 84 /89 variables (removed 5) and now considering 368/373 (removed 5) transitions.
[2024-05-29 19:03:36] [INFO ] Flow matrix only has 356 transitions (discarded 12 similar events)
// Phase 1: matrix 356 rows 84 cols
[2024-05-29 19:03:36] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 19:03:36] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 19:03:36] [INFO ] Flow matrix only has 356 transitions (discarded 12 similar events)
[2024-05-29 19:03:36] [INFO ] Invariant cache hit.
[2024-05-29 19:03:36] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:03:36] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 84/98 places, 368/387 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 603 ms. Remains : 84/98 places, 368/387 transitions.
[2024-05-29 19:03:36] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:03:36] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:03:36] [INFO ] Input system was already deterministic with 368 transitions.
[2024-05-29 19:03:36] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:03:36] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:03:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality7644822154073882932.gal : 15 ms
[2024-05-29 19:03:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality9184030375909387985.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/CTLCardinality7644822154073882932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9184030375909387985.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,96671,0.508173,20972,2,3016,5,39849,6,0,688,24467,0


Converting to forward existential form...Done !
original formula: E((A(EG(AF(((p6==0)||(p34==1)))) U E(((p44==0)||(p59==1)) U (p30==1))) + (AX(EF(((p98==0)||(p61==1)))) * (!(EG((p83==1))) + A((p23==1) U ...388
=> equivalent forward existential formula: [FwdG(FwdU((FwdU(Init,(!((E(!(E(((p44==0)||(p59==1)) U (p30==1))) U (!(EG(!(EG(!(((p6==0)||(p34==1))))))) * !(E(...669
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t15, t16, t18, t19, t21, t23, t24, t26, t27, t...416
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 364/4/4
(forward)formula 0,1,7.7734,230716,1,0,739,887425,800,240,11871,562971,1048
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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


Converting to forward existential form...Done !
original formula: AF(AG(EX((p99==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(EX((p99==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t23, t24, t25, ...407
(forward)formula 0,0,2.80104,76812,1,0,478,159342,726,99,10970,110549,734
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 87 transition count 369
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 87 transition count 369
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 80 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 80 transition count 355
Applied a total of 36 rules in 15 ms. Remains 80 /98 variables (removed 18) and now considering 355/387 (removed 32) transitions.
[2024-05-29 19:04:49] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:04:49] [INFO ] Invariant cache hit.
[2024-05-29 19:04:49] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-29 19:04:49] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:04:49] [INFO ] Invariant cache hit.
[2024-05-29 19:04:49] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:04:49] [INFO ] Implicit Places using invariants and state equation in 275 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 354 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/98 places, 355/387 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 66 transition count 342
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 66 transition count 342
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 61 transition count 337
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 61 transition count 337
Applied a total of 36 rules in 12 ms. Remains 61 /79 variables (removed 18) and now considering 337/355 (removed 18) transitions.
[2024-05-29 19:04:49] [INFO ] Flow matrix only has 329 transitions (discarded 8 similar events)
// Phase 1: matrix 329 rows 61 cols
[2024-05-29 19:04:49] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 19:04:49] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 19:04:49] [INFO ] Flow matrix only has 329 transitions (discarded 8 similar events)
[2024-05-29 19:04:49] [INFO ] Invariant cache hit.
[2024-05-29 19:04:49] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:04:49] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 61/98 places, 337/387 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 578 ms. Remains : 61/98 places, 337/387 transitions.
[2024-05-29 19:04:49] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:04:49] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:04:49] [INFO ] Input system was already deterministic with 337 transitions.
[2024-05-29 19:04:49] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:04:49] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:04:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality9333277914727064458.gal : 4 ms
[2024-05-29 19:04:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality11549716717256595068.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/CTLCardinality9333277914727064458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11549716717256595068.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,80329,0.615864,21460,2,2350,5,32342,6,0,573,20491,0


Converting to forward existential form...Done !
original formula: EX((AF((((p40==0)||(p88==1)) * AG(((p40==0)&&(p83==1))))) * ((p52==0)||(p53==1))))
=> equivalent forward existential formula: [((EY(Init) * ((p52==0)||(p53==1))) * !(EG(!((((p40==0)||(p88==1)) * !(E(TRUE U !(((p40==0)&&(p83==1))))))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...338
(forward)formula 0,0,2.38657,64756,1,0,434,137550,691,83,10873,100082,698
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 96 transition count 361
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 71 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 70 transition count 360
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 53 place count 70 transition count 346
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 81 place count 56 transition count 346
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 93 place count 44 transition count 327
Iterating global reduction 3 with 12 rules applied. Total rules applied 105 place count 44 transition count 327
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 112 place count 37 transition count 313
Iterating global reduction 3 with 7 rules applied. Total rules applied 119 place count 37 transition count 313
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 182 place count 37 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 183 transitions
Redundant transition composition rules discarded 183 transitions
Iterating global reduction 4 with 183 rules applied. Total rules applied 365 place count 37 transition count 67
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 379 place count 30 transition count 60
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 385 place count 24 transition count 54
Applied a total of 385 rules in 72 ms. Remains 24 /98 variables (removed 74) and now considering 54/387 (removed 333) transitions.
[2024-05-29 19:04:52] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
// Phase 1: matrix 47 rows 24 cols
[2024-05-29 19:04:52] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:04:52] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 19:04:52] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
[2024-05-29 19:04:52] [INFO ] Invariant cache hit.
[2024-05-29 19:04:52] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 19:04:52] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-29 19:04:52] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-29 19:04:52] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
[2024-05-29 19:04:52] [INFO ] Invariant cache hit.
[2024-05-29 19:04:52] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:04:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 46/70 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 1/71 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/71 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 81 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1915 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 19:04:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:04:54] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 46/70 variables, 24/68 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 53/135 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/71 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/71 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 136 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1256 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 43/43 constraints]
After SMT, in 3192ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3192ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/98 places, 54/387 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3324 ms. Remains : 24/98 places, 54/387 transitions.
[2024-05-29 19:04:55] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:04:55] [INFO ] Flatten gal took : 3 ms
[2024-05-29 19:04:55] [INFO ] Input system was already deterministic with 54 transitions.
[2024-05-29 19:04:55] [INFO ] Flatten gal took : 2 ms
[2024-05-29 19:04:55] [INFO ] Flatten gal took : 2 ms
[2024-05-29 19:04:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality3772031836779243386.gal : 0 ms
[2024-05-29 19:04:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality4992834238662713298.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/CTLCardinality3772031836779243386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4992834238662713298.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,207,0.012808,4024,2,137,5,1218,6,0,143,791,0


Converting to forward existential form...Done !
original formula: AF(((p26==0) * EG((p46==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((p26==0) * EG((p46==1)))))] = FALSE
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, t20, t21, t34...255
(forward)formula 0,0,0.043202,4604,1,0,115,4941,127,53,1512,5127,134
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 98 transition count 378
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 89 transition count 378
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 80 transition count 363
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 80 transition count 363
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 75 transition count 353
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 75 transition count 353
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 73 transition count 351
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 73 transition count 351
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 73 transition count 348
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 67 place count 66 transition count 341
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 74 place count 59 transition count 334
Iterating global reduction 1 with 7 rules applied. Total rules applied 81 place count 59 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 89 place count 59 transition count 326
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 103 place count 52 transition count 319
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 52 transition count 319
Applied a total of 105 rules in 91 ms. Remains 52 /98 variables (removed 46) and now considering 319/387 (removed 68) transitions.
[2024-05-29 19:04:55] [INFO ] Flow matrix only has 309 transitions (discarded 10 similar events)
// Phase 1: matrix 309 rows 52 cols
[2024-05-29 19:04:55] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 19:04:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 19:04:55] [INFO ] Flow matrix only has 309 transitions (discarded 10 similar events)
[2024-05-29 19:04:55] [INFO ] Invariant cache hit.
[2024-05-29 19:04:55] [INFO ] State equation strengthened by 278 read => feed constraints.
[2024-05-29 19:04:56] [INFO ] Implicit Places using invariants and state equation in 228 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 299 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 51/98 places, 319/387 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 51 transition count 318
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 318
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 30 place count 36 transition count 304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 36 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 235 transitions
Redundant transition composition rules discarded 235 transitions
Iterating global reduction 1 with 235 rules applied. Total rules applied 266 place count 36 transition count 68
Applied a total of 266 rules in 29 ms. Remains 36 /51 variables (removed 15) and now considering 68/319 (removed 251) transitions.
[2024-05-29 19:04:56] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
// Phase 1: matrix 59 rows 36 cols
[2024-05-29 19:04:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 19:04:56] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 19:04:56] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
[2024-05-29 19:04:56] [INFO ] Invariant cache hit.
[2024-05-29 19:04:56] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-29 19:04:56] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 36/98 places, 68/387 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 493 ms. Remains : 36/98 places, 68/387 transitions.
[2024-05-29 19:04:56] [INFO ] Flatten gal took : 4 ms
[2024-05-29 19:04:56] [INFO ] Flatten gal took : 4 ms
[2024-05-29 19:04:56] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-29 19:04:56] [INFO ] Flatten gal took : 3 ms
[2024-05-29 19:04:56] [INFO ] Flatten gal took : 3 ms
[2024-05-29 19:04:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality13360667663500038635.gal : 0 ms
[2024-05-29 19:04:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality18282886107575551525.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/CTLCardinality13360667663500038635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18282886107575551525.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,3154,0.017731,4060,2,356,5,2049,6,0,200,1283,0


Converting to forward existential form...Done !
original formula: ((EG(AF(((p3==0)&&(p88==1)))) + EF(AG(((p50==0)||(p39==1))))) + (EF(((p81==0)&&((p28==0)||((p42==0)&&(p57==1))))) * EG(EF((((p73==0)&&(p1...176
=> equivalent forward existential formula: (([FwdG(Init,!(EG(!(((p3==0)&&(p88==1))))))] != FALSE + [(FwdU(Init,TRUE) * !(E(TRUE U !(((p50==0)||(p39==1)))))...294
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t15, t37, t38, t39, t40, t42, t4...286
(forward)formula 0,1,0.118345,8600,1,0,177,23819,160,76,1958,20502,201
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 98 transition count 375
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 86 transition count 375
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 78 transition count 362
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 78 transition count 362
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 73 transition count 352
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 73 transition count 352
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 69 transition count 348
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 69 transition count 348
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 73 place count 69 transition count 333
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 87 place count 62 transition count 326
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 55 transition count 319
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 55 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 108 place count 55 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 122 place count 48 transition count 305
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 48 transition count 305
Applied a total of 125 rules in 54 ms. Remains 48 /98 variables (removed 50) and now considering 305/387 (removed 82) transitions.
[2024-05-29 19:04:56] [INFO ] Flow matrix only has 294 transitions (discarded 11 similar events)
// Phase 1: matrix 294 rows 48 cols
[2024-05-29 19:04:56] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 19:04:56] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-29 19:04:56] [INFO ] Flow matrix only has 294 transitions (discarded 11 similar events)
[2024-05-29 19:04:56] [INFO ] Invariant cache hit.
[2024-05-29 19:04:56] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-29 19:04:56] [INFO ] Implicit Places using invariants and state equation in 205 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 278 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 47/98 places, 305/387 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 33 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 33 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 237 transitions
Redundant transition composition rules discarded 237 transitions
Iterating global reduction 1 with 237 rules applied. Total rules applied 266 place count 33 transition count 53
Applied a total of 266 rules in 21 ms. Remains 33 /47 variables (removed 14) and now considering 53/305 (removed 252) transitions.
[2024-05-29 19:04:56] [INFO ] Flow matrix only has 43 transitions (discarded 10 similar events)
// Phase 1: matrix 43 rows 33 cols
[2024-05-29 19:04:56] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 19:04:56] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 19:04:56] [INFO ] Flow matrix only has 43 transitions (discarded 10 similar events)
[2024-05-29 19:04:56] [INFO ] Invariant cache hit.
[2024-05-29 19:04:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 19:04:56] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 33/98 places, 53/387 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 417 ms. Remains : 33/98 places, 53/387 transitions.
[2024-05-29 19:04:56] [INFO ] Flatten gal took : 1 ms
[2024-05-29 19:04:56] [INFO ] Flatten gal took : 1 ms
[2024-05-29 19:04:56] [INFO ] Input system was already deterministic with 53 transitions.
[2024-05-29 19:04:56] [INFO ] Flatten gal took : 2 ms
[2024-05-29 19:04:56] [INFO ] Flatten gal took : 2 ms
[2024-05-29 19:04:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality11664687125810097369.gal : 1 ms
[2024-05-29 19:04:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality18430343532810499714.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/CTLCardinality11664687125810097369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18430343532810499714.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,752,0.013586,3752,2,226,5,1153,6,0,172,880,0


Converting to forward existential form...Done !
original formula: EF(EG((AF((((p33==0)&&(p8==1))||(p3==1))) + ((p14==0)&&(p75==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EG(!((((p33==0)&&(p8==1))||(p3==1))))) + ((p14==0)&&(p75==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t6, t7, t8, t9, t10, t12, t13, t14, t15, t17, t39, t40, t41, t42, t43, t4...276
(forward)formula 0,1,0.04527,5124,1,0,116,7552,123,55,1288,7537,119
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 88 transition count 371
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 88 transition count 371
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 84 transition count 363
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 84 transition count 363
Applied a total of 28 rules in 9 ms. Remains 84 /98 variables (removed 14) and now considering 363/387 (removed 24) transitions.
[2024-05-29 19:04:56] [INFO ] Flow matrix only has 354 transitions (discarded 9 similar events)
// Phase 1: matrix 354 rows 84 cols
[2024-05-29 19:04:56] [INFO ] Computed 2 invariants in 9 ms
[2024-05-29 19:04:56] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 19:04:56] [INFO ] Flow matrix only has 354 transitions (discarded 9 similar events)
[2024-05-29 19:04:56] [INFO ] Invariant cache hit.
[2024-05-29 19:04:56] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:04:57] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-29 19:04:57] [INFO ] Flow matrix only has 354 transitions (discarded 9 similar events)
[2024-05-29 19:04:57] [INFO ] Invariant cache hit.
[2024-05-29 19:04:57] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:04:59] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:04:59] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:05:00] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:05:02] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:05:02] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:05:02] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:05:02] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:05:02] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:05:02] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:05:03] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:05:03] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:05:03] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:05:03] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:05:03] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:05:03] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:05:03] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:05:03] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:05:03] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:05:03] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2024-05-29 19:05:03] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:05:03] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 19:05:03] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:05:03] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:05:04] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:05:05] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:05:05] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:05:05] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:05:05] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:05:05] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:05:05] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:05:05] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:05:05] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:05:05] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:05:06] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:05:07] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:05:08] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:05:09] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:05:09] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
[2024-05-29 19:05:09] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:05:10] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:05:11] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:05:13] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:05:13] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:05:13] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 12 (OVERLAPS) 353/437 variables, 84/197 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 287/484 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 15 (OVERLAPS) 1/438 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 485 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 111/111 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:05:32] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:05:35] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:05:35] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:05:35] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:05:35] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:05:38] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (OVERLAPS) 353/437 variables, 84/203 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 287/490 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 362/852 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/438 variables, and 852 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 117/117 constraints]
After SMT, in 61536ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 61542ms
Starting structural reductions in LTL mode, iteration 1 : 84/98 places, 363/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61845 ms. Remains : 84/98 places, 363/387 transitions.
[2024-05-29 19:05:58] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:05:58] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:05:58] [INFO ] Input system was already deterministic with 363 transitions.
[2024-05-29 19:05:58] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:05:58] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:05:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality14424141131069093475.gal : 3 ms
[2024-05-29 19:05:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality3270088341608087289.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/CTLCardinality14424141131069093475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3270088341608087289.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,96400,0.72087,27744,2,3032,5,52811,6,0,688,26588,0


Converting to forward existential form...Done !
original formula: E(!((EF(((p96==1)||(p99==1))) * (EG(AX(((p75==0)||(p97==1)))) + AG(EX(((p30==0)||(p16==1))))))) U (p87==1))
=> equivalent forward existential formula: [(FwdU(Init,!((E(TRUE U ((p96==1)||(p99==1))) * (EG(!(EX(!(((p75==0)||(p97==1)))))) + !(E(TRUE U !(EX(((p30==0)|...195
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t11, t12, t14, t16, t17, t18, t19, t21, t22, t23, t24, t25, t26, ...417
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,5.71414,155264,1,0,542,488228,753,146,11748,288257,828
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 88 transition count 371
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 88 transition count 371
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 82 transition count 359
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 82 transition count 359
Applied a total of 32 rules in 4 ms. Remains 82 /98 variables (removed 16) and now considering 359/387 (removed 28) transitions.
[2024-05-29 19:06:04] [INFO ] Flow matrix only has 350 transitions (discarded 9 similar events)
// Phase 1: matrix 350 rows 82 cols
[2024-05-29 19:06:04] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 19:06:04] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-29 19:06:04] [INFO ] Flow matrix only has 350 transitions (discarded 9 similar events)
[2024-05-29 19:06:04] [INFO ] Invariant cache hit.
[2024-05-29 19:06:04] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:06:04] [INFO ] Implicit Places using invariants and state equation in 286 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 411 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/98 places, 359/387 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 68 transition count 346
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 68 transition count 346
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 61 transition count 339
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 61 transition count 339
Applied a total of 40 rules in 7 ms. Remains 61 /81 variables (removed 20) and now considering 339/359 (removed 20) transitions.
[2024-05-29 19:06:04] [INFO ] Flow matrix only has 330 transitions (discarded 9 similar events)
// Phase 1: matrix 330 rows 61 cols
[2024-05-29 19:06:04] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 19:06:04] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-29 19:06:04] [INFO ] Flow matrix only has 330 transitions (discarded 9 similar events)
[2024-05-29 19:06:04] [INFO ] Invariant cache hit.
[2024-05-29 19:06:05] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:06:05] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 61/98 places, 339/387 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 636 ms. Remains : 61/98 places, 339/387 transitions.
[2024-05-29 19:06:05] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:06:05] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:06:05] [INFO ] Input system was already deterministic with 339 transitions.
[2024-05-29 19:06:05] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:06:05] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:06:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality10075093823132602611.gal : 5 ms
[2024-05-29 19:06:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality10424427778140587765.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/CTLCardinality10075093823132602611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10424427778140587765.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,92614,0.168706,9536,2,1400,5,13464,6,0,574,7513,0


Converting to forward existential form...Done !
original formula: AF((EX(A(((p74==1)&&(p18==0)) U EF((p43==1)))) * EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,!((EX(!((E(!(E(TRUE U (p43==1))) U (!(((p74==1)&&(p18==0))) * !(E(TRUE U (p43==1))))) + EG(!(E(TRUE U...193
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t22, t24, t26, t27, t29, t31, t32,...378
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.58678,56844,1,0,490,133758,703,116,9501,100433,767
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 96 transition count 359
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 69 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 68 transition count 358
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 57 place count 68 transition count 346
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 81 place count 56 transition count 346
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 92 place count 45 transition count 328
Iterating global reduction 3 with 11 rules applied. Total rules applied 103 place count 45 transition count 328
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 110 place count 38 transition count 314
Iterating global reduction 3 with 7 rules applied. Total rules applied 117 place count 38 transition count 314
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 148 place count 38 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 221 transitions
Redundant transition composition rules discarded 221 transitions
Iterating global reduction 4 with 221 rules applied. Total rules applied 369 place count 38 transition count 62
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 383 place count 31 transition count 55
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 390 place count 24 transition count 48
Applied a total of 390 rules in 28 ms. Remains 24 /98 variables (removed 74) and now considering 48/387 (removed 339) transitions.
[2024-05-29 19:06:06] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
// Phase 1: matrix 41 rows 24 cols
[2024-05-29 19:06:06] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:06:06] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 19:06:06] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
[2024-05-29 19:06:06] [INFO ] Invariant cache hit.
[2024-05-29 19:06:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 19:06:06] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-29 19:06:06] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-29 19:06:06] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
[2024-05-29 19:06:06] [INFO ] Invariant cache hit.
[2024-05-29 19:06:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 7/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 19:06:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 40/64 variables, 24/68 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 1/65 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 0/65 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 73 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1860 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 7/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 40/64 variables, 24/72 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 31/103 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 1/65 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 104 constraints, problems are : Problem set: 0 solved, 31 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 47/47 constraints]
After SMT, in 2383ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 2383ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/98 places, 48/387 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2480 ms. Remains : 24/98 places, 48/387 transitions.
[2024-05-29 19:06:09] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:06:09] [INFO ] Flatten gal took : 1 ms
[2024-05-29 19:06:09] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-29 19:06:09] [INFO ] Flatten gal took : 2 ms
[2024-05-29 19:06:09] [INFO ] Flatten gal took : 1 ms
[2024-05-29 19:06:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality17332436265838129322.gal : 1 ms
[2024-05-29 19:06:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality11823061756203523243.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/CTLCardinality17332436265838129322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11823061756203523243.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,302,0.012202,3876,2,148,5,947,6,0,137,661,0


Converting to forward existential form...Done !
original formula: E(AF((p77==1)) U !(((p63==0)||(p11==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((p77==1))))) * !(((p63==0)||(p11==1))))] != FALSE
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, t18, t19, t20, t35...255
(forward)formula 0,0,0.033789,4456,1,0,96,3999,117,40,1307,3603,103
FORMULA StigmergyElection-PT-07a-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 88 transition count 371
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 88 transition count 371
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 83 transition count 361
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 83 transition count 361
Applied a total of 30 rules in 6 ms. Remains 83 /98 variables (removed 15) and now considering 361/387 (removed 26) transitions.
[2024-05-29 19:06:09] [INFO ] Flow matrix only has 352 transitions (discarded 9 similar events)
// Phase 1: matrix 352 rows 83 cols
[2024-05-29 19:06:09] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 19:06:09] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 19:06:09] [INFO ] Flow matrix only has 352 transitions (discarded 9 similar events)
[2024-05-29 19:06:09] [INFO ] Invariant cache hit.
[2024-05-29 19:06:09] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:06:09] [INFO ] Implicit Places using invariants and state equation in 275 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 351 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/98 places, 361/387 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 350
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 350
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 65 transition count 344
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 65 transition count 344
Applied a total of 34 rules in 5 ms. Remains 65 /82 variables (removed 17) and now considering 344/361 (removed 17) transitions.
[2024-05-29 19:06:09] [INFO ] Flow matrix only has 335 transitions (discarded 9 similar events)
// Phase 1: matrix 335 rows 65 cols
[2024-05-29 19:06:09] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 19:06:09] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 19:06:09] [INFO ] Flow matrix only has 335 transitions (discarded 9 similar events)
[2024-05-29 19:06:09] [INFO ] Invariant cache hit.
[2024-05-29 19:06:09] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:06:09] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 65/98 places, 344/387 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 566 ms. Remains : 65/98 places, 344/387 transitions.
[2024-05-29 19:06:09] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:06:09] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:06:09] [INFO ] Input system was already deterministic with 344 transitions.
[2024-05-29 19:06:09] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:06:09] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:06:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality14490259899936721533.gal : 2 ms
[2024-05-29 19:06:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality14469193873954598500.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/CTLCardinality14490259899936721533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14469193873954598500.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,95175,0.424893,20184,2,2455,5,37246,6,0,595,21691,0


Converting to forward existential form...Done !
original formula: EX(((p49==1) + EG(((EX((p16==1)) + (p30==0)) + ((p42==0)&&(p15==1))))))
=> equivalent forward existential formula: ([(EY(Init) * (p49==1))] != FALSE + [FwdG(EY(Init),((EX((p16==1)) + (p30==0)) + ((p42==0)&&(p15==1))))] != FALSE...156
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t20, t21, t22, t23, t24, t25, t26, t28,...393
(forward)formula 0,1,3.75282,121844,1,0,562,305873,703,164,10912,286785,781
FORMULA StigmergyElection-PT-07a-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 87 transition count 369
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 87 transition count 369
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 80 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 80 transition count 355
Applied a total of 36 rules in 4 ms. Remains 80 /98 variables (removed 18) and now considering 355/387 (removed 32) transitions.
[2024-05-29 19:06:13] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2024-05-29 19:06:13] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 19:06:13] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-29 19:06:13] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:06:13] [INFO ] Invariant cache hit.
[2024-05-29 19:06:13] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:06:14] [INFO ] Implicit Places using invariants and state equation in 260 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 345 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/98 places, 355/387 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 66 transition count 342
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 66 transition count 342
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 59 transition count 335
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 59 transition count 335
Applied a total of 40 rules in 4 ms. Remains 59 /79 variables (removed 20) and now considering 335/355 (removed 20) transitions.
[2024-05-29 19:06:14] [INFO ] Flow matrix only has 327 transitions (discarded 8 similar events)
// Phase 1: matrix 327 rows 59 cols
[2024-05-29 19:06:14] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:06:14] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 19:06:14] [INFO ] Flow matrix only has 327 transitions (discarded 8 similar events)
[2024-05-29 19:06:14] [INFO ] Invariant cache hit.
[2024-05-29 19:06:14] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:06:14] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 59/98 places, 335/387 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 548 ms. Remains : 59/98 places, 335/387 transitions.
[2024-05-29 19:06:14] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:06:14] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:06:14] [INFO ] Input system was already deterministic with 335 transitions.
[2024-05-29 19:06:14] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:06:14] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:06:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality12083932118228171407.gal : 3 ms
[2024-05-29 19:06:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality8034717994605016636.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/CTLCardinality12083932118228171407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8034717994605016636.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,84422,0.568758,22772,2,2567,5,38049,6,0,563,24394,0


Converting to forward existential form...Done !
original formula: AX(EX(E((p96!=1) U EF(EG((p45==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(E((p96!=1) U E(TRUE U EG((p45==1)))))))] = FALSE
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,...373
(forward)formula 0,1,3.53426,104348,1,0,494,252462,692,111,10718,168436,770
FORMULA StigmergyElection-PT-07a-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-29 19:06:17] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:06:17] [INFO ] Flatten gal took : 13 ms
Total runtime 227711 ms.

BK_STOP 1717009578069

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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