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-171690531700153.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 StigmergyCommit-PT-06a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531700153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 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 StigmergyCommit-PT-06a-CTLCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716988191159

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 13:09:52] [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 13:09:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:09:52] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2024-05-29 13:09:52] [INFO ] Transformed 256 places.
[2024-05-29 13:09:52] [INFO ] Transformed 2816 transitions.
[2024-05-29 13:09:52] [INFO ] Found NUPN structural information;
[2024-05-29 13:09:52] [INFO ] Parsed PT model containing 256 places and 2816 transitions and 35321 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 587/587 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 218 transition count 547
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 218 transition count 547
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 82 place count 218 transition count 541
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 92 place count 208 transition count 529
Iterating global reduction 1 with 10 rules applied. Total rules applied 102 place count 208 transition count 529
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 208 transition count 526
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 207 transition count 525
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 207 transition count 525
Applied a total of 107 rules in 66 ms. Remains 207 /256 variables (removed 49) and now considering 525/587 (removed 62) transitions.
[2024-05-29 13:09:52] [INFO ] Flow matrix only has 510 transitions (discarded 15 similar events)
// Phase 1: matrix 510 rows 207 cols
[2024-05-29 13:09:52] [INFO ] Computed 4 invariants in 21 ms
[2024-05-29 13:09:53] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-29 13:09:53] [INFO ] Flow matrix only has 510 transitions (discarded 15 similar events)
[2024-05-29 13:09:53] [INFO ] Invariant cache hit.
[2024-05-29 13:09:53] [INFO ] State equation strengthened by 343 read => feed constraints.
[2024-05-29 13:09:53] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2024-05-29 13:09:53] [INFO ] Flow matrix only has 510 transitions (discarded 15 similar events)
[2024-05-29 13:09:53] [INFO ] Invariant cache hit.
[2024-05-29 13:09:53] [INFO ] State equation strengthened by 343 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-29 13:09:59] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 16 ms to minimize.
[2024-05-29 13:09:59] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-29 13:10:00] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 2 ms to minimize.
[2024-05-29 13:10:00] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 5 ms to minimize.
[2024-05-29 13:10:00] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 1 ms to minimize.
[2024-05-29 13:10:00] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2024-05-29 13:10:00] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2024-05-29 13:10:00] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 5 ms to minimize.
[2024-05-29 13:10:00] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 15 ms to minimize.
[2024-05-29 13:10:01] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 8 ms to minimize.
[2024-05-29 13:10:01] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:10:01] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2024-05-29 13:10:01] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2024-05-29 13:10:01] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:10:01] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2024-05-29 13:10:01] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:10:01] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-29 13:10:01] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:10:02] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:10:02] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-29 13:10:02] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:10:02] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:10:02] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:10:02] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:10:02] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:10:02] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:10:02] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:10:02] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:10:02] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:10:02] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:10:03] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-29 13:10:03] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:10:03] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:10:03] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-29 13:10:03] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 3 ms to minimize.
[2024-05-29 13:10:03] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:10:03] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:10:03] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:10:03] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-29 13:10:03] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-29 13:10:05] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:10:05] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:10:05] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:10:05] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:10:06] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:10:06] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:10:06] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:10:06] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:10:06] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:10:06] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:10:06] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:10:06] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:10:06] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:10:06] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:10:06] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:10:06] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:10:07] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 5 ms to minimize.
[2024-05-29 13:10:07] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:10:07] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:10:07] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-29 13:10:07] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:10:07] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:10:07] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:10:07] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:10:07] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:10:07] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:10:08] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:10:08] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:10:08] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:10:08] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:10:08] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:10:08] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-05-29 13:10:08] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:10:08] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:10:08] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:10:08] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:10:08] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:10:09] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:10:09] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:10:09] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-29 13:10:09] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:10:09] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:10:09] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:10:09] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:10:10] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:10:10] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:10:10] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:10:10] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:10:10] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:10:10] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 3 ms to minimize.
[2024-05-29 13:10:10] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:10:10] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:10:10] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:10:10] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:10:10] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:10:11] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:10:11] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:10:12] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:10:13] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:10:13] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-29 13:10:17] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:10:17] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:10:17] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-29 13:10:17] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:10:18] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:10:18] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:10:18] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:10:18] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:10:18] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-29 13:10:21] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:10:23] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 207/717 variables, and 115 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/207 constraints, ReadFeed: 0/343 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 111/111 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 111/115 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-29 13:10:29] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:10:29] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-29 13:10:34] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 509/716 variables, 207/325 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/716 variables, 342/667 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/716 variables, 524/1191 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 716/717 variables, and 1191 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 207/207 constraints, ReadFeed: 342/343 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 114/114 constraints]
After SMT, in 62017ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 62046ms
Starting structural reductions in LTL mode, iteration 1 : 207/256 places, 525/587 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62897 ms. Remains : 207/256 places, 525/587 transitions.
Support contains 80 out of 207 places after structural reductions.
[2024-05-29 13:10:55] [INFO ] Flatten gal took : 76 ms
[2024-05-29 13:10:55] [INFO ] Flatten gal took : 41 ms
[2024-05-29 13:10:56] [INFO ] Input system was already deterministic with 525 transitions.
Support contains 77 out of 207 places (down from 80) after GAL structural reductions.
RANDOM walk for 40000 steps (12 resets) in 3333 ms. (11 steps per ms) remains 6/52 properties
BEST_FIRST walk for 40001 steps (8 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 74 ms. (533 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
[2024-05-29 13:10:57] [INFO ] Flow matrix only has 510 transitions (discarded 15 similar events)
[2024-05-29 13:10:57] [INFO ] Invariant cache hit.
[2024-05-29 13:10:57] [INFO ] State equation strengthened by 343 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 194/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 509/716 variables, 207/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/716 variables, 342/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/716 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/717 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/717 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 717/717 variables, and 554 constraints, problems are : Problem set: 0 solved, 5 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 207/207 constraints, ReadFeed: 343/343 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 194/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 13:10:57] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:10:58] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 10 ms to minimize.
[2024-05-29 13:10:58] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-05-29 13:10:58] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
[2024-05-29 13:10:58] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:10:58] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-05-29 13:10:58] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:10:58] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:10:58] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 2 ms to minimize.
[2024-05-29 13:10:58] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
[2024-05-29 13:10:59] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2024-05-29 13:10:59] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-05-29 13:10:59] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:10:59] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:10:59] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:10:59] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-29 13:10:59] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-05-29 13:10:59] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:10:59] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
Problem AtomicPropp10 is UNSAT
[2024-05-29 13:10:59] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
Problem AtomicPropp10 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/23 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-29 13:10:59] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:11:00] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:11:00] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:11:00] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:11:00] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
Problem AtomicPropp13 is UNSAT
[2024-05-29 13:11:00] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:11:00] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:11:00] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:11:00] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:11:00] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:11:00] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:11:00] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:11:00] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:11:00] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:11:00] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:11:01] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:11:01] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:11:01] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:11:01] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:11:01] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
Problem AtomicPropp13 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 20/43 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-29 13:11:01] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:11:01] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:11:01] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:11:01] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:11:01] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:11:01] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:11:01] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:11:01] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:11:02] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:11:02] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:11:02] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:11:02] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:11:02] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:11:02] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:11:02] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:11:02] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:11:02] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
Problem AtomicPropp49 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 17/60 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-29 13:11:02] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
SMT process timed out in 5474ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 525/525 transitions.
Graph (complete) has 479 edges and 207 vertex of which 204 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 204 transition count 481
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 183 transition count 460
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 89 place count 178 transition count 460
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 89 place count 178 transition count 416
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 177 place count 134 transition count 416
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 202 place count 109 transition count 391
Iterating global reduction 3 with 25 rules applied. Total rules applied 227 place count 109 transition count 391
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 229 place count 109 transition count 389
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 250 place count 88 transition count 368
Iterating global reduction 4 with 21 rules applied. Total rules applied 271 place count 88 transition count 368
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 304 place count 88 transition count 335
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 306 place count 86 transition count 333
Iterating global reduction 5 with 2 rules applied. Total rules applied 308 place count 86 transition count 333
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 310 place count 84 transition count 331
Iterating global reduction 5 with 2 rules applied. Total rules applied 312 place count 84 transition count 331
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 314 place count 84 transition count 329
Performed 19 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 352 place count 65 transition count 307
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 362 place count 65 transition count 297
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 375 place count 52 transition count 284
Iterating global reduction 7 with 13 rules applied. Total rules applied 388 place count 52 transition count 284
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 7 with 96 rules applied. Total rules applied 484 place count 52 transition count 188
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 495 place count 41 transition count 177
Iterating global reduction 8 with 11 rules applied. Total rules applied 506 place count 41 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 510 place count 41 transition count 173
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 517 place count 34 transition count 166
Iterating global reduction 9 with 7 rules applied. Total rules applied 524 place count 34 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 527 place count 34 transition count 163
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 531 place count 34 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 533 place count 34 transition count 161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 534 place count 33 transition count 160
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 6 rules applied. Total rules applied 540 place count 32 transition count 155
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 545 place count 27 transition count 155
Performed 9 Post agglomeration using F-continuation condition with reduction of 118 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 11 with 18 rules applied. Total rules applied 563 place count 18 transition count 28
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 571 place count 18 transition count 20
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 15 rules applied. Total rules applied 586 place count 8 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 591 place count 8 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 593 place count 8 transition count 8
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 595 place count 6 transition count 6
Applied a total of 595 rules in 137 ms. Remains 6 /207 variables (removed 201) and now considering 6/525 (removed 519) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 6/207 places, 6/525 transitions.
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/2 properties
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2024-05-29 13:11:02] [INFO ] Flatten gal took : 32 ms
[2024-05-29 13:11:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 13:11:02] [INFO ] Flatten gal took : 33 ms
[2024-05-29 13:11:03] [INFO ] Input system was already deterministic with 525 transitions.
Support contains 61 out of 207 places (down from 71) after GAL structural reductions.
Computed a total of 45 stabilizing places and 44 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 525/525 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 183 transition count 496
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 183 transition count 496
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 183 transition count 492
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 170 transition count 474
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 170 transition count 474
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 163 transition count 467
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 163 transition count 467
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 93 place count 163 transition count 466
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 99 place count 157 transition count 460
Iterating global reduction 2 with 6 rules applied. Total rules applied 105 place count 157 transition count 460
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 111 place count 151 transition count 454
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 151 transition count 454
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 123 place count 145 transition count 448
Iterating global reduction 2 with 6 rules applied. Total rules applied 129 place count 145 transition count 448
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 135 place count 145 transition count 442
Applied a total of 135 rules in 23 ms. Remains 145 /207 variables (removed 62) and now considering 442/525 (removed 83) transitions.
[2024-05-29 13:11:03] [INFO ] Flow matrix only has 434 transitions (discarded 8 similar events)
// Phase 1: matrix 434 rows 145 cols
[2024-05-29 13:11:03] [INFO ] Computed 2 invariants in 7 ms
[2024-05-29 13:11:03] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-29 13:11:03] [INFO ] Flow matrix only has 434 transitions (discarded 8 similar events)
[2024-05-29 13:11:03] [INFO ] Invariant cache hit.
[2024-05-29 13:11:03] [INFO ] State equation strengthened by 317 read => feed constraints.
[2024-05-29 13:11:03] [INFO ] Implicit Places using invariants and state equation in 466 ms returned [144]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 578 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/207 places, 442/525 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 125 transition count 423
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 125 transition count 423
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 45 place count 125 transition count 416
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 118 transition count 409
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 118 transition count 409
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 111 transition count 402
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 111 transition count 402
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 80 place count 104 transition count 395
Iterating global reduction 1 with 7 rules applied. Total rules applied 87 place count 104 transition count 395
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 93 place count 98 transition count 389
Iterating global reduction 1 with 6 rules applied. Total rules applied 99 place count 98 transition count 389
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 93 transition count 384
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 93 transition count 384
Applied a total of 109 rules in 17 ms. Remains 93 /144 variables (removed 51) and now considering 384/442 (removed 58) transitions.
[2024-05-29 13:11:03] [INFO ] Flow matrix only has 376 transitions (discarded 8 similar events)
// Phase 1: matrix 376 rows 93 cols
[2024-05-29 13:11:03] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 13:11:03] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 13:11:03] [INFO ] Flow matrix only has 376 transitions (discarded 8 similar events)
[2024-05-29 13:11:03] [INFO ] Invariant cache hit.
[2024-05-29 13:11:03] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:11:03] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/207 places, 384/525 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 867 ms. Remains : 93/207 places, 384/525 transitions.
[2024-05-29 13:11:03] [INFO ] Flatten gal took : 21 ms
[2024-05-29 13:11:03] [INFO ] Flatten gal took : 20 ms
[2024-05-29 13:11:04] [INFO ] Input system was already deterministic with 384 transitions.
[2024-05-29 13:11:04] [INFO ] Flatten gal took : 18 ms
[2024-05-29 13:11:04] [INFO ] Flatten gal took : 18 ms
[2024-05-29 13:11:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality9724452245520104109.gal : 20 ms
[2024-05-29 13:11:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality11296970157064953582.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9724452245520104109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11296970157064953582.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,1.14108e+06,0.542538,20000,2,2415,5,32325,6,0,748,19863,0


Converting to forward existential form...Done !
original formula: (EF((p147==1)) * EX(((p157==0)||(p179==1))))
=> equivalent forward existential formula: [(EY((Init * E(TRUE U (p147==1)))) * ((p157==0)||(p179==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,...454
(forward)formula 0,1,3.16407,89988,1,0,521,248949,781,139,12095,156914,834
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 205 transition count 410
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 137 rules applied. Total rules applied 252 place count 91 transition count 387
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 13 rules applied. Total rules applied 265 place count 86 transition count 379
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 274 place count 83 transition count 373
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 277 place count 80 transition count 373
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 277 place count 80 transition count 362
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 299 place count 69 transition count 362
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 308 place count 60 transition count 349
Iterating global reduction 5 with 9 rules applied. Total rules applied 317 place count 60 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 320 place count 60 transition count 346
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 320 place count 60 transition count 344
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 324 place count 58 transition count 344
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 327 place count 55 transition count 338
Iterating global reduction 6 with 3 rules applied. Total rules applied 330 place count 55 transition count 338
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 342 place count 55 transition count 326
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 348 place count 52 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 351 place count 52 transition count 320
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 353 place count 51 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 236 transitions
Redundant transition composition rules discarded 236 transitions
Iterating global reduction 8 with 236 rules applied. Total rules applied 589 place count 51 transition count 83
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 8 with 14 rules applied. Total rules applied 603 place count 44 transition count 76
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 605 place count 44 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 606 place count 44 transition count 75
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 609 place count 41 transition count 72
Applied a total of 609 rules in 61 ms. Remains 41 /207 variables (removed 166) and now considering 72/525 (removed 453) transitions.
[2024-05-29 13:11:07] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
// Phase 1: matrix 64 rows 41 cols
[2024-05-29 13:11:07] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 13:11:07] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 13:11:07] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
[2024-05-29 13:11:07] [INFO ] Invariant cache hit.
[2024-05-29 13:11:07] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 13:11:07] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-29 13:11:07] [INFO ] Redundant transitions in 0 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-29 13:11:07] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
[2024-05-29 13:11:07] [INFO ] Invariant cache hit.
[2024-05-29 13:11:07] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 3/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-29 13:11:07] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:07] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:11:07] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:07] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:11:07] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:11:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:11:07] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:11:07] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:11:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:11:07] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:11:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:08] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-29 13:11:09] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:11:09] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-29 13:11:09] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-29 13:11:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:11:09] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:11:09] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-29 13:11:09] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:11:09] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 63/104 variables, 41/97 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 18/115 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-29 13:11:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:11:10] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/104 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 14 (OVERLAPS) 1/105 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/105 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 16 (OVERLAPS) 0/105 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 118 constraints, problems are : Problem set: 0 solved, 69 unsolved in 3738 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 3/41 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 63/104 variables, 41/99 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 18/117 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 69/186 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 1/105 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 187 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1850 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 57/57 constraints]
After SMT, in 5613ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 5614ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/207 places, 72/525 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5751 ms. Remains : 41/207 places, 72/525 transitions.
[2024-05-29 13:11:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 13:11:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 13:11:13] [INFO ] Input system was already deterministic with 72 transitions.
[2024-05-29 13:11:13] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:11:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 13:11:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality9876775461974876714.gal : 1 ms
[2024-05-29 13:11:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality9101141125029807231.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/CTLCardinality9876775461974876714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9101141125029807231.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,879,0.016762,3996,2,297,5,1690,6,0,225,1166,0


Converting to forward existential form...Done !
original formula: EF((AF(((p181==1) * E(((p70==0)||(p249==1)) U (p179==1)))) + ((E(((p195==0)||(p25==1)) U (p154==0)) * (p39==0)) * ((p146==0)&&(p11==1))))...156
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!(((p181==1) * E(((p70==0)||(p249==1)) U (p179==1)))))))] != FALSE + [(FwdU(((FwdU(Ini...246
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t19, t25, t26, t28, t37, t44...300
Hit Full ! (commute/partial/dont) 68/0/4
(forward)formula 0,1,0.0773,6424,1,0,157,11647,172,66,1963,11030,171
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 525/525 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 182 transition count 495
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 182 transition count 495
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 182 transition count 491
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 68 place count 168 transition count 472
Iterating global reduction 1 with 14 rules applied. Total rules applied 82 place count 168 transition count 472
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 168 transition count 471
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 161 transition count 464
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 161 transition count 464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 161 transition count 463
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 104 place count 155 transition count 457
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 155 transition count 457
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 116 place count 149 transition count 451
Iterating global reduction 3 with 6 rules applied. Total rules applied 122 place count 149 transition count 451
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 128 place count 143 transition count 445
Iterating global reduction 3 with 6 rules applied. Total rules applied 134 place count 143 transition count 445
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 140 place count 143 transition count 439
Applied a total of 140 rules in 29 ms. Remains 143 /207 variables (removed 64) and now considering 439/525 (removed 86) transitions.
[2024-05-29 13:11:13] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:11:13] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 13:11:13] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-29 13:11:13] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:11:13] [INFO ] Invariant cache hit.
[2024-05-29 13:11:13] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:11:13] [INFO ] Implicit Places using invariants and state equation in 496 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 683 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/207 places, 439/525 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 122 transition count 419
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 122 transition count 419
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 122 transition count 412
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 115 transition count 405
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 115 transition count 405
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 108 transition count 398
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 108 transition count 398
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 101 transition count 391
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 101 transition count 391
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 94 transition count 384
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 94 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 109 place count 88 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 115 place count 88 transition count 378
Applied a total of 115 rules in 14 ms. Remains 88 /142 variables (removed 54) and now considering 378/439 (removed 61) transitions.
[2024-05-29 13:11:13] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2024-05-29 13:11:13] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:11:13] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 13:11:13] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:11:13] [INFO ] Invariant cache hit.
[2024-05-29 13:11:14] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:11:14] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/207 places, 378/525 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 978 ms. Remains : 88/207 places, 378/525 transitions.
[2024-05-29 13:11:14] [INFO ] Flatten gal took : 17 ms
[2024-05-29 13:11:14] [INFO ] Flatten gal took : 17 ms
[2024-05-29 13:11:14] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-29 13:11:14] [INFO ] Flatten gal took : 16 ms
[2024-05-29 13:11:14] [INFO ] Flatten gal took : 15 ms
[2024-05-29 13:11:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality9406830074648092564.gal : 4 ms
[2024-05-29 13:11:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality13151362778403327296.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/CTLCardinality9406830074648092564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13151362778403327296.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,1.13698e+06,0.588941,21940,2,2634,5,33772,6,0,722,21534,0


Converting to forward existential form...Done !
original formula: EG(EX(EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,EX(EX(TRUE)))] != 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,...410
(forward)formula 0,1,3.32041,92956,1,0,502,226382,766,108,11664,179101,802
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 525/525 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 186 transition count 501
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 186 transition count 501
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 186 transition count 498
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 176 transition count 486
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 176 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 176 transition count 485
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 170 transition count 479
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 170 transition count 479
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 170 transition count 478
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 166 transition count 474
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 166 transition count 474
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 164 transition count 472
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 164 transition count 472
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 162 transition count 470
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 162 transition count 470
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 97 place count 162 transition count 468
Applied a total of 97 rules in 21 ms. Remains 162 /207 variables (removed 45) and now considering 468/525 (removed 57) transitions.
[2024-05-29 13:11:17] [INFO ] Flow matrix only has 458 transitions (discarded 10 similar events)
// Phase 1: matrix 458 rows 162 cols
[2024-05-29 13:11:17] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 13:11:17] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-29 13:11:17] [INFO ] Flow matrix only has 458 transitions (discarded 10 similar events)
[2024-05-29 13:11:17] [INFO ] Invariant cache hit.
[2024-05-29 13:11:17] [INFO ] State equation strengthened by 324 read => feed constraints.
[2024-05-29 13:11:18] [INFO ] Implicit Places using invariants and state equation in 540 ms returned [161]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 633 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/207 places, 468/525 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 144 transition count 451
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 144 transition count 451
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 41 place count 144 transition count 444
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 137 transition count 437
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 137 transition count 437
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 130 transition count 430
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 130 transition count 430
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 123 transition count 423
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 123 transition count 423
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 116 transition count 416
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 116 transition count 416
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 111 transition count 411
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 111 transition count 411
Applied a total of 107 rules in 13 ms. Remains 111 /161 variables (removed 50) and now considering 411/468 (removed 57) transitions.
[2024-05-29 13:11:18] [INFO ] Flow matrix only has 401 transitions (discarded 10 similar events)
// Phase 1: matrix 401 rows 111 cols
[2024-05-29 13:11:18] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 13:11:18] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-29 13:11:18] [INFO ] Flow matrix only has 401 transitions (discarded 10 similar events)
[2024-05-29 13:11:18] [INFO ] Invariant cache hit.
[2024-05-29 13:11:18] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:11:18] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/207 places, 411/525 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1017 ms. Remains : 111/207 places, 411/525 transitions.
[2024-05-29 13:11:18] [INFO ] Flatten gal took : 17 ms
[2024-05-29 13:11:18] [INFO ] Flatten gal took : 16 ms
[2024-05-29 13:11:18] [INFO ] Input system was already deterministic with 411 transitions.
[2024-05-29 13:11:18] [INFO ] Flatten gal took : 15 ms
[2024-05-29 13:11:18] [INFO ] Flatten gal took : 16 ms
[2024-05-29 13:11:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality17850016795081177374.gal : 3 ms
[2024-05-29 13:11:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality8519247811787833285.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/CTLCardinality17850016795081177374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8519247811787833285.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,1.15287e+06,0.600021,21292,2,3077,5,43353,6,0,845,25311,0


Converting to forward existential form...Done !
original formula: EG(((((p98==1) + AG(EF((p216==1)))) + EX(AX((p235==1)))) * (((p145==1)||(p77==1)) + ((p14==0) + ((AG(((p61!=0)&&(p159!=1))) * (p63==0)) *...169
=> equivalent forward existential formula: [FwdG(Init,((((p98==1) + !(E(TRUE U !(E(TRUE U (p216==1)))))) + EX(!(EX(!((p235==1)))))) * (((p145==1)||(p77==1)...248
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t17, t19, t21, t22, t24, t26, t27, t29, t30, t32,...504
(forward)formula 0,0,3.95407,112716,1,0,584,311485,847,154,12947,243576,894
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 205 transition count 406
Reduce places removed 118 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 140 rules applied. Total rules applied 259 place count 87 transition count 384
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 13 rules applied. Total rules applied 272 place count 82 transition count 376
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 279 place count 79 transition count 372
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 281 place count 77 transition count 372
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 281 place count 77 transition count 363
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 299 place count 68 transition count 363
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 310 place count 57 transition count 347
Iterating global reduction 5 with 11 rules applied. Total rules applied 321 place count 57 transition count 347
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 324 place count 57 transition count 344
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 324 place count 57 transition count 342
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 328 place count 55 transition count 342
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 332 place count 51 transition count 334
Iterating global reduction 6 with 4 rules applied. Total rules applied 336 place count 51 transition count 334
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 364 place count 51 transition count 306
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 368 place count 49 transition count 304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 369 place count 49 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 373 place count 47 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 375 place count 47 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 216 transitions
Redundant transition composition rules discarded 216 transitions
Iterating global reduction 9 with 216 rules applied. Total rules applied 591 place count 47 transition count 83
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 9 with 14 rules applied. Total rules applied 605 place count 40 transition count 76
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 609 place count 40 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 610 place count 40 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 611 place count 40 transition count 74
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 10 with 5 rules applied. Total rules applied 616 place count 35 transition count 69
Applied a total of 616 rules in 62 ms. Remains 35 /207 variables (removed 172) and now considering 69/525 (removed 456) transitions.
[2024-05-29 13:11:22] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
// Phase 1: matrix 62 rows 35 cols
[2024-05-29 13:11:22] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 13:11:22] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 13:11:22] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
[2024-05-29 13:11:22] [INFO ] Invariant cache hit.
[2024-05-29 13:11:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 13:11:22] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-29 13:11:22] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-29 13:11:22] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
[2024-05-29 13:11:22] [INFO ] Invariant cache hit.
[2024-05-29 13:11:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 4 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 61/96 variables, 35/75 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 1/97 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 0/97 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 85 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2610 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 61/96 variables, 35/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 44/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 1/97 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 129 constraints, problems are : Problem set: 0 solved, 44 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 48/48 constraints]
After SMT, in 3558ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 3559ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/207 places, 69/525 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3739 ms. Remains : 35/207 places, 69/525 transitions.
[2024-05-29 13:11:26] [INFO ] Flatten gal took : 5 ms
[2024-05-29 13:11:26] [INFO ] Flatten gal took : 4 ms
[2024-05-29 13:11:26] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-29 13:11:26] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:11:26] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:11:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality15898349955159724472.gal : 1 ms
[2024-05-29 13:11:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality4276712208893351519.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/CTLCardinality15898349955159724472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4276712208893351519.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,408,0.017036,4076,2,187,5,1568,6,0,202,1050,0


Converting to forward existential form...Done !
original formula: E((((p87==1)||(p48==0))||(p233==1)) U !(((EF(!(((p40==0)||(p182==1)))) + AG(((p201==0)||(p25==1)))) + (p119==1))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,(((p87==1)||(p48==0))||(p233==1))) * !((p119==1))) * !(E(TRUE U !(((p40==0)||(p182==1)))))),T...197
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t16, t18, t25, t35, t38, t40, t44, t46, t4...266
Hit Full ! (commute/partial/dont) 63/0/6
(forward)formula 0,0,0.068896,5976,1,0,137,11238,164,66,2080,9246,180
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 205 transition count 395
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 157 rules applied. Total rules applied 287 place count 76 transition count 367
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 18 rules applied. Total rules applied 305 place count 69 transition count 356
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 313 place count 65 transition count 352
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 313 place count 65 transition count 341
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 335 place count 54 transition count 341
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 344 place count 45 transition count 327
Iterating global reduction 4 with 9 rules applied. Total rules applied 353 place count 45 transition count 327
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 356 place count 45 transition count 324
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 356 place count 45 transition count 322
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 360 place count 43 transition count 322
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 365 place count 38 transition count 312
Iterating global reduction 5 with 5 rules applied. Total rules applied 370 place count 38 transition count 312
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 5 with 124 rules applied. Total rules applied 494 place count 38 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 496 place count 37 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 497 place count 37 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 131 transitions
Redundant transition composition rules discarded 131 transitions
Iterating global reduction 7 with 131 rules applied. Total rules applied 628 place count 37 transition count 55
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 7 with 14 rules applied. Total rules applied 642 place count 30 transition count 48
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 648 place count 24 transition count 42
Applied a total of 648 rules in 37 ms. Remains 24 /207 variables (removed 183) and now considering 42/525 (removed 483) transitions.
[2024-05-29 13:11:26] [INFO ] Flow matrix only has 35 transitions (discarded 7 similar events)
// Phase 1: matrix 35 rows 24 cols
[2024-05-29 13:11:26] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:11:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 13:11:26] [INFO ] Flow matrix only has 35 transitions (discarded 7 similar events)
[2024-05-29 13:11:26] [INFO ] Invariant cache hit.
[2024-05-29 13:11:26] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:11:26] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-29 13:11:26] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2024-05-29 13:11:26] [INFO ] Flow matrix only has 35 transitions (discarded 7 similar events)
[2024-05-29 13:11:26] [INFO ] Invariant cache hit.
[2024-05-29 13:11:26] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-29 13:11:26] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:26] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:26] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:11:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 5 places in 18 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, 41 unsolved
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:11:28] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:11:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:28] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-29 13:11:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 34/58 variables, 24/73 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/58 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/58 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 1/59 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/59 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 14 (OVERLAPS) 0/59 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 82 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1886 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 34/58 variables, 24/73 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 41/122 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 1/59 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/59 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/59 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 123 constraints, problems are : Problem set: 0 solved, 41 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 48/48 constraints]
After SMT, in 2653ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 2653ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/207 places, 42/525 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2754 ms. Remains : 24/207 places, 42/525 transitions.
[2024-05-29 13:11:29] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:11:29] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:11:29] [INFO ] Input system was already deterministic with 42 transitions.
[2024-05-29 13:11:29] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:11:29] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:11:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality6842817550147008083.gal : 0 ms
[2024-05-29 13:11:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality16898308418431732361.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/CTLCardinality6842817550147008083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16898308418431732361.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,144,0.011643,3712,2,143,5,900,6,0,130,633,0


Converting to forward existential form...Done !
original formula: EG((p248==0))
=> equivalent forward existential formula: [FwdG(Init,(p248==0))] != FALSE
Hit Full ! (commute/partial/dont) 40/0/2
(forward)formula 0,0,0.021665,4028,1,0,9,2391,19,2,849,1378,10
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 205 transition count 413
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 132 rules applied. Total rules applied 244 place count 94 transition count 392
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 13 rules applied. Total rules applied 257 place count 89 transition count 384
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 10 rules applied. Total rules applied 267 place count 86 transition count 377
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 271 place count 82 transition count 377
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 271 place count 82 transition count 365
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 295 place count 70 transition count 365
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 306 place count 59 transition count 349
Iterating global reduction 5 with 11 rules applied. Total rules applied 317 place count 59 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 320 place count 59 transition count 346
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 320 place count 59 transition count 344
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 324 place count 57 transition count 344
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 329 place count 52 transition count 334
Iterating global reduction 6 with 5 rules applied. Total rules applied 334 place count 52 transition count 334
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 6 with 124 rules applied. Total rules applied 458 place count 52 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 460 place count 51 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 461 place count 51 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 467 place count 48 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 469 place count 48 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 131 transitions
Redundant transition composition rules discarded 131 transitions
Iterating global reduction 9 with 131 rules applied. Total rules applied 600 place count 48 transition count 72
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 9 with 14 rules applied. Total rules applied 614 place count 41 transition count 65
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 621 place count 41 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 623 place count 41 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 624 place count 41 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 626 place count 39 transition count 60
Applied a total of 626 rules in 36 ms. Remains 39 /207 variables (removed 168) and now considering 60/525 (removed 465) transitions.
[2024-05-29 13:11:29] [INFO ] Flow matrix only has 52 transitions (discarded 8 similar events)
// Phase 1: matrix 52 rows 39 cols
[2024-05-29 13:11:29] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 13:11:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 13:11:29] [INFO ] Flow matrix only has 52 transitions (discarded 8 similar events)
[2024-05-29 13:11:29] [INFO ] Invariant cache hit.
[2024-05-29 13:11:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 13:11:29] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-29 13:11:29] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-29 13:11:29] [INFO ] Flow matrix only has 52 transitions (discarded 8 similar events)
[2024-05-29 13:11:29] [INFO ] Invariant cache hit.
[2024-05-29 13:11:29] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:11:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:11:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 51/90 variables, 39/87 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 11/98 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 1/91 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 0/91 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 99 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2456 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 13:11:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 51/90 variables, 39/88 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 58/157 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 1/91 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (OVERLAPS) 0/91 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 158 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1444 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 47/47 constraints]
After SMT, in 3917ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3917ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/207 places, 60/525 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4028 ms. Remains : 39/207 places, 60/525 transitions.
[2024-05-29 13:11:33] [INFO ] Flatten gal took : 5 ms
[2024-05-29 13:11:33] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:11:33] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-29 13:11:33] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:11:33] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:11:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality9702894440892985681.gal : 1 ms
[2024-05-29 13:11:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality11958844346135764708.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/CTLCardinality9702894440892985681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11958844346135764708.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,162,0.012269,3880,2,212,5,1202,6,0,204,754,0


Converting to forward existential form...Done !
original formula: (AG((((p90==0) * EF((p167==1))) + (((((p214==1)||(p58==0))||(p169==1))&&(p86==0))&&(p152==1)))) + AF(AG((((p67!=0)&&(p125!=1))&&(p243!=1)...159
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !((((p90==0) * E(TRUE U (p167==1))) + (((((p214==1)||(p58==0))||(p169==1))&&(p86==0))...237
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t6, t7, t8, t9, t10, t11, t13, t22, t25, t27, t28, t41, t44, t45, t46, t4...266
(forward)formula 0,0,0.061911,6044,1,0,153,12590,140,86,1591,11772,208
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 205 transition count 394
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 157 rules applied. Total rules applied 288 place count 75 transition count 367
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 18 rules applied. Total rules applied 306 place count 68 transition count 356
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 314 place count 64 transition count 352
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 314 place count 64 transition count 342
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 334 place count 54 transition count 342
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 343 place count 45 transition count 328
Iterating global reduction 4 with 9 rules applied. Total rules applied 352 place count 45 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 355 place count 45 transition count 325
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 355 place count 45 transition count 323
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 359 place count 43 transition count 323
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 364 place count 38 transition count 313
Iterating global reduction 5 with 5 rules applied. Total rules applied 369 place count 38 transition count 313
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 5 with 124 rules applied. Total rules applied 493 place count 38 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 495 place count 37 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 496 place count 37 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 131 transitions
Redundant transition composition rules discarded 131 transitions
Iterating global reduction 7 with 131 rules applied. Total rules applied 627 place count 37 transition count 56
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 7 with 14 rules applied. Total rules applied 641 place count 30 transition count 49
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 643 place count 30 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 644 place count 30 transition count 48
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 7 with 7 rules applied. Total rules applied 651 place count 23 transition count 41
Applied a total of 651 rules in 26 ms. Remains 23 /207 variables (removed 184) and now considering 41/525 (removed 484) transitions.
[2024-05-29 13:11:33] [INFO ] Flow matrix only has 34 transitions (discarded 7 similar events)
// Phase 1: matrix 34 rows 23 cols
[2024-05-29 13:11:33] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 13:11:33] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 13:11:33] [INFO ] Flow matrix only has 34 transitions (discarded 7 similar events)
[2024-05-29 13:11:33] [INFO ] Invariant cache hit.
[2024-05-29 13:11:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 13:11:33] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-29 13:11:33] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2024-05-29 13:11:33] [INFO ] Flow matrix only has 34 transitions (discarded 7 similar events)
[2024-05-29 13:11:33] [INFO ] Invariant cache hit.
[2024-05-29 13:11:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 7/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 13:11:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:11:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:11:33] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:11:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:11:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:33] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:11:33] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 13:11:33] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 13:11:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/23 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 13:11:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/23 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/23 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 33/56 variables, 23/68 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 13:11:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:11:35] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:11:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:11:35] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:35] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/56 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 1/57 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/57 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 17 (OVERLAPS) 0/57 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 74 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1926 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 7/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-29 13:11:35] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 33/56 variables, 23/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 29/103 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/57 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 104 constraints, problems are : Problem set: 0 solved, 29 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 50/50 constraints]
After SMT, in 2486ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 2486ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/207 places, 41/525 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2578 ms. Remains : 23/207 places, 41/525 transitions.
[2024-05-29 13:11:36] [INFO ] Flatten gal took : 3 ms
[2024-05-29 13:11:36] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:11:36] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-29 13:11:36] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:11:36] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:11:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality9901764786989125928.gal : 1 ms
[2024-05-29 13:11:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality7860767244059334541.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/CTLCardinality9901764786989125928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7860767244059334541.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,143,0.011947,3720,2,127,5,909,6,0,126,542,0


Converting to forward existential form...Done !
original formula: EG((p230==0))
=> equivalent forward existential formula: [FwdG(Init,(p230==0))] != FALSE
Hit Full ! (commute/partial/dont) 39/0/2
(forward)formula 0,1,0.020359,4036,1,0,7,2314,19,2,850,1456,8
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 525/525 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 183 transition count 497
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 183 transition count 497
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 183 transition count 493
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 171 transition count 478
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 171 transition count 478
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 171 transition count 477
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 84 place count 164 transition count 470
Iterating global reduction 2 with 7 rules applied. Total rules applied 91 place count 164 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 164 transition count 469
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 97 place count 159 transition count 464
Iterating global reduction 3 with 5 rules applied. Total rules applied 102 place count 159 transition count 464
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 107 place count 154 transition count 459
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 154 transition count 459
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 117 place count 149 transition count 454
Iterating global reduction 3 with 5 rules applied. Total rules applied 122 place count 149 transition count 454
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 127 place count 149 transition count 449
Applied a total of 127 rules in 20 ms. Remains 149 /207 variables (removed 58) and now considering 449/525 (removed 76) transitions.
[2024-05-29 13:11:36] [INFO ] Flow matrix only has 440 transitions (discarded 9 similar events)
// Phase 1: matrix 440 rows 149 cols
[2024-05-29 13:11:36] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 13:11:36] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-29 13:11:36] [INFO ] Flow matrix only has 440 transitions (discarded 9 similar events)
[2024-05-29 13:11:36] [INFO ] Invariant cache hit.
[2024-05-29 13:11:36] [INFO ] State equation strengthened by 318 read => feed constraints.
[2024-05-29 13:11:36] [INFO ] Implicit Places using invariants and state equation in 407 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 503 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 148/207 places, 449/525 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 130 transition count 431
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 130 transition count 431
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 43 place count 130 transition count 424
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 123 transition count 417
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 123 transition count 417
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 116 transition count 410
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 116 transition count 410
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 78 place count 109 transition count 403
Iterating global reduction 1 with 7 rules applied. Total rules applied 85 place count 109 transition count 403
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 92 place count 102 transition count 396
Iterating global reduction 1 with 7 rules applied. Total rules applied 99 place count 102 transition count 396
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 105 place count 96 transition count 390
Iterating global reduction 1 with 6 rules applied. Total rules applied 111 place count 96 transition count 390
Applied a total of 111 rules in 9 ms. Remains 96 /148 variables (removed 52) and now considering 390/449 (removed 59) transitions.
[2024-05-29 13:11:36] [INFO ] Flow matrix only has 381 transitions (discarded 9 similar events)
// Phase 1: matrix 381 rows 96 cols
[2024-05-29 13:11:36] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:11:36] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-29 13:11:36] [INFO ] Flow matrix only has 381 transitions (discarded 9 similar events)
[2024-05-29 13:11:36] [INFO ] Invariant cache hit.
[2024-05-29 13:11:36] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:11:36] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/207 places, 390/525 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 776 ms. Remains : 96/207 places, 390/525 transitions.
[2024-05-29 13:11:36] [INFO ] Flatten gal took : 15 ms
[2024-05-29 13:11:36] [INFO ] Flatten gal took : 14 ms
[2024-05-29 13:11:37] [INFO ] Input system was already deterministic with 390 transitions.
[2024-05-29 13:11:37] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:11:37] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:11:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality14224815673720500833.gal : 3 ms
[2024-05-29 13:11:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality17957850665398404609.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/CTLCardinality14224815673720500833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17957850665398404609.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,1.15132e+06,0.585864,21456,2,2926,5,37216,6,0,765,23201,0


Converting to forward existential form...Done !
original formula: (AG((EF(((p173==0)||(p41==1))) * (p97==0))) * EX((AX(AX(FALSE)) + (p182==0))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U ((p173==0)||(p41==1)))))] = FALSE * [(FwdU(Init,TRUE) * !((p97==0)))] = FALSE) ...223
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t8, t9, t10, t11, t13, t15, t16, t18, t20, t21, t23, t25, t26, t28, t30, ...470
(forward)formula 0,0,2.15206,66864,1,0,500,166692,788,124,11368,122575,782
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 205 transition count 396
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 155 rules applied. Total rules applied 284 place count 77 transition count 369
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 18 rules applied. Total rules applied 302 place count 70 transition count 358
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 311 place count 66 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 312 place count 65 transition count 353
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 312 place count 65 transition count 343
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 332 place count 55 transition count 343
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 341 place count 46 transition count 329
Iterating global reduction 5 with 9 rules applied. Total rules applied 350 place count 46 transition count 329
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 353 place count 46 transition count 326
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 353 place count 46 transition count 324
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 357 place count 44 transition count 324
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 362 place count 39 transition count 314
Iterating global reduction 6 with 5 rules applied. Total rules applied 367 place count 39 transition count 314
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 6 with 124 rules applied. Total rules applied 491 place count 39 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 493 place count 38 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 494 place count 38 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 131 transitions
Redundant transition composition rules discarded 131 transitions
Iterating global reduction 8 with 131 rules applied. Total rules applied 625 place count 38 transition count 57
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 8 with 14 rules applied. Total rules applied 639 place count 31 transition count 50
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 8 with 7 rules applied. Total rules applied 646 place count 24 transition count 43
Applied a total of 646 rules in 28 ms. Remains 24 /207 variables (removed 183) and now considering 43/525 (removed 482) transitions.
[2024-05-29 13:11:39] [INFO ] Flow matrix only has 36 transitions (discarded 7 similar events)
// Phase 1: matrix 36 rows 24 cols
[2024-05-29 13:11:39] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 13:11:39] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 13:11:39] [INFO ] Flow matrix only has 36 transitions (discarded 7 similar events)
[2024-05-29 13:11:39] [INFO ] Invariant cache hit.
[2024-05-29 13:11:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 13:11:39] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-29 13:11:39] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-29 13:11:39] [INFO ] Flow matrix only has 36 transitions (discarded 7 similar events)
[2024-05-29 13:11:39] [INFO ] Invariant cache hit.
[2024-05-29 13:11:39] [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, 32 unsolved
At refinement iteration 1 (OVERLAPS) 7/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 35/59 variables, 24/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 1/60 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 73 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1772 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 7/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 35/59 variables, 24/72 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 32/104 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 1/60 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 105 constraints, problems are : Problem set: 0 solved, 32 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 47/47 constraints]
After SMT, in 2294ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2295ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/207 places, 43/525 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2434 ms. Remains : 24/207 places, 43/525 transitions.
[2024-05-29 13:11:41] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:11:41] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:11:41] [INFO ] Input system was already deterministic with 43 transitions.
[2024-05-29 13:11:41] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:11:41] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:11:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality2932860187524026102.gal : 0 ms
[2024-05-29 13:11:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality16307138168432232534.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/CTLCardinality2932860187524026102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16307138168432232534.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,144,0.017347,3716,2,133,5,841,6,0,132,578,0


Converting to forward existential form...Done !
original formula: EG((p53==0))
=> equivalent forward existential formula: [FwdG(Init,(p53==0))] != FALSE
Hit Full ! (commute/partial/dont) 41/0/2
(forward)formula 0,1,0.02638,4032,1,0,7,2372,19,2,851,1522,8
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 525/525 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 182 transition count 495
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 182 transition count 495
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 182 transition count 491
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 68 place count 168 transition count 472
Iterating global reduction 1 with 14 rules applied. Total rules applied 82 place count 168 transition count 472
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 168 transition count 471
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 161 transition count 464
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 161 transition count 464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 161 transition count 463
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 104 place count 155 transition count 457
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 155 transition count 457
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 116 place count 149 transition count 451
Iterating global reduction 3 with 6 rules applied. Total rules applied 122 place count 149 transition count 451
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 128 place count 143 transition count 445
Iterating global reduction 3 with 6 rules applied. Total rules applied 134 place count 143 transition count 445
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 140 place count 143 transition count 439
Applied a total of 140 rules in 17 ms. Remains 143 /207 variables (removed 64) and now considering 439/525 (removed 86) transitions.
[2024-05-29 13:11:41] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:11:41] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 13:11:41] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-29 13:11:41] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:11:41] [INFO ] Invariant cache hit.
[2024-05-29 13:11:41] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:11:42] [INFO ] Implicit Places using invariants and state equation in 477 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 607 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/207 places, 439/525 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 122 transition count 419
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 122 transition count 419
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 122 transition count 412
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 115 transition count 405
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 115 transition count 405
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 108 transition count 398
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 108 transition count 398
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 101 transition count 391
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 101 transition count 391
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 94 transition count 384
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 94 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 109 place count 88 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 115 place count 88 transition count 378
Applied a total of 115 rules in 7 ms. Remains 88 /142 variables (removed 54) and now considering 378/439 (removed 61) transitions.
[2024-05-29 13:11:42] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2024-05-29 13:11:42] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:11:42] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-29 13:11:42] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:11:42] [INFO ] Invariant cache hit.
[2024-05-29 13:11:42] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:11:42] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/207 places, 378/525 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 879 ms. Remains : 88/207 places, 378/525 transitions.
[2024-05-29 13:11:42] [INFO ] Flatten gal took : 14 ms
[2024-05-29 13:11:42] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:11:42] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-29 13:11:42] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:11:42] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:11:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality17057989650713266515.gal : 4 ms
[2024-05-29 13:11:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality5337211395616444455.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/CTLCardinality17057989650713266515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5337211395616444455.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,1.13698e+06,0.589516,21668,2,2634,5,33772,6,0,722,21534,0


Converting to forward existential form...Done !
original formula: EX(EX(EG(EF(((p0==0)&&(p40==1))))))
=> equivalent forward existential formula: [FwdG(EY(EY(Init)),E(TRUE U ((p0==0)&&(p40==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,...410
(forward)formula 0,1,8.61755,233548,1,0,665,516896,774,246,11512,468691,966
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 525/525 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 205 transition count 398
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 152 rules applied. Total rules applied 279 place count 79 transition count 372
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 16 rules applied. Total rules applied 295 place count 73 transition count 362
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 305 place count 69 transition count 356
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 307 place count 67 transition count 356
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 307 place count 67 transition count 346
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 327 place count 57 transition count 346
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 337 place count 47 transition count 331
Iterating global reduction 5 with 10 rules applied. Total rules applied 347 place count 47 transition count 331
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 350 place count 47 transition count 328
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 350 place count 47 transition count 326
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 354 place count 45 transition count 326
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 359 place count 40 transition count 316
Iterating global reduction 6 with 5 rules applied. Total rules applied 364 place count 40 transition count 316
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 6 with 124 rules applied. Total rules applied 488 place count 40 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 490 place count 39 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 491 place count 39 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 493 place count 38 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 494 place count 38 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 131 transitions
Redundant transition composition rules discarded 131 transitions
Iterating global reduction 9 with 131 rules applied. Total rules applied 625 place count 38 transition count 57
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 9 with 14 rules applied. Total rules applied 639 place count 31 transition count 50
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 644 place count 26 transition count 45
Applied a total of 644 rules in 25 ms. Remains 26 /207 variables (removed 181) and now considering 45/525 (removed 480) transitions.
[2024-05-29 13:11:51] [INFO ] Flow matrix only has 38 transitions (discarded 7 similar events)
// Phase 1: matrix 38 rows 26 cols
[2024-05-29 13:11:51] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 13:11:51] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-29 13:11:51] [INFO ] Flow matrix only has 38 transitions (discarded 7 similar events)
[2024-05-29 13:11:51] [INFO ] Invariant cache hit.
[2024-05-29 13:11:51] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 13:11:51] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-29 13:11:51] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-29 13:11:51] [INFO ] Flow matrix only has 38 transitions (discarded 7 similar events)
[2024-05-29 13:11:51] [INFO ] Invariant cache hit.
[2024-05-29 13:11:51] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 13:11:51] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:11:51] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 13:11:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:51] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 37/63 variables, 26/75 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/63 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 13 (OVERLAPS) 1/64 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/64 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 15 (OVERLAPS) 0/64 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 84 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2324 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 37/63 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 44/127 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 1/64 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/64 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 128 constraints, problems are : Problem set: 0 solved, 44 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 50/50 constraints]
After SMT, in 3171ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 3171ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/207 places, 45/525 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3521 ms. Remains : 26/207 places, 45/525 transitions.
[2024-05-29 13:11:54] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:11:54] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:11:54] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 1168 steps (78 resets) in 12 ms. (89 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 13:11:54] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:11:54] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:11:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14195196006156604026.gal : 1 ms
[2024-05-29 13:11:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15602614522802365511.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14195196006156604026.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15602614522802365511.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 525/525 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 184 transition count 497
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 184 transition count 497
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 184 transition count 494
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 170 transition count 475
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 170 transition count 475
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 170 transition count 474
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 164 transition count 468
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 164 transition count 468
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 96 place count 158 transition count 462
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 158 transition count 462
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 152 transition count 456
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 152 transition count 456
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 147 transition count 451
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 147 transition count 451
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 129 place count 147 transition count 446
Applied a total of 129 rules in 10 ms. Remains 147 /207 variables (removed 60) and now considering 446/525 (removed 79) transitions.
[2024-05-29 13:11:54] [INFO ] Flow matrix only has 437 transitions (discarded 9 similar events)
// Phase 1: matrix 437 rows 147 cols
[2024-05-29 13:11:54] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 13:11:55] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-29 13:11:55] [INFO ] Flow matrix only has 437 transitions (discarded 9 similar events)
[2024-05-29 13:11:55] [INFO ] Invariant cache hit.
[2024-05-29 13:11:55] [INFO ] State equation strengthened by 319 read => feed constraints.
[2024-05-29 13:11:55] [INFO ] Implicit Places using invariants and state equation in 522 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 617 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/207 places, 446/525 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 127 transition count 427
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 127 transition count 427
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 127 transition count 421
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 120 transition count 414
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 120 transition count 414
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 113 transition count 407
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 113 transition count 407
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 79 place count 106 transition count 400
Iterating global reduction 1 with 7 rules applied. Total rules applied 86 place count 106 transition count 400
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 93 place count 99 transition count 393
Iterating global reduction 1 with 7 rules applied. Total rules applied 100 place count 99 transition count 393
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 106 place count 93 transition count 387
Iterating global reduction 1 with 6 rules applied. Total rules applied 112 place count 93 transition count 387
Applied a total of 112 rules in 15 ms. Remains 93 /146 variables (removed 53) and now considering 387/446 (removed 59) transitions.
[2024-05-29 13:11:55] [INFO ] Flow matrix only has 378 transitions (discarded 9 similar events)
// Phase 1: matrix 378 rows 93 cols
[2024-05-29 13:11:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 13:11:55] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 13:11:55] [INFO ] Flow matrix only has 378 transitions (discarded 9 similar events)
[2024-05-29 13:11:55] [INFO ] Invariant cache hit.
[2024-05-29 13:11:55] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:11:55] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/207 places, 387/525 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 895 ms. Remains : 93/207 places, 387/525 transitions.
[2024-05-29 13:11:55] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:11:55] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:11:55] [INFO ] Input system was already deterministic with 387 transitions.
[2024-05-29 13:11:55] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:11:55] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:11:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality2137736715678571799.gal : 3 ms
[2024-05-29 13:11:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality17977738768529958570.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/CTLCardinality2137736715678571799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17977738768529958570.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,1.13698e+06,0.575646,21704,2,2660,5,32925,6,0,748,20999,0


Converting to forward existential form...Done !
original formula: A((((p173==0)||(p152==1))&&((p173==0)||(p20==1))) U (!(EX((E(((p86==0)||(p152==1)) U (p112==0)) * EF((p200==1))))) + (p84==1)))
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX((E(((p86==0)||(p152==1)) U (p112==0)) * E(TRUE U (p200==1))))) + (p84==1)))))) * !(E(!((!...388
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33, t34,...429
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,9.6481,278380,1,0,760,837398,801,323,12041,607223,1108
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 525/525 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 185 transition count 499
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 185 transition count 499
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 185 transition count 495
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 176 transition count 483
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 176 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 176 transition count 482
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 173 transition count 479
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 173 transition count 479
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 171 transition count 477
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 171 transition count 477
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 169 transition count 475
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 169 transition count 475
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 167 transition count 473
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 167 transition count 473
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 167 transition count 471
Applied a total of 87 rules in 11 ms. Remains 167 /207 variables (removed 40) and now considering 471/525 (removed 54) transitions.
[2024-05-29 13:12:05] [INFO ] Flow matrix only has 462 transitions (discarded 9 similar events)
// Phase 1: matrix 462 rows 167 cols
[2024-05-29 13:12:05] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 13:12:05] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-29 13:12:05] [INFO ] Flow matrix only has 462 transitions (discarded 9 similar events)
[2024-05-29 13:12:05] [INFO ] Invariant cache hit.
[2024-05-29 13:12:05] [INFO ] State equation strengthened by 328 read => feed constraints.
[2024-05-29 13:12:06] [INFO ] Implicit Places using invariants and state equation in 518 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 631 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/207 places, 471/525 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 454
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 454
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 149 transition count 448
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 143 transition count 442
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 143 transition count 442
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 137 transition count 436
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 137 transition count 436
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 131 transition count 430
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 131 transition count 430
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 126 transition count 425
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 126 transition count 425
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 121 transition count 420
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 121 transition count 420
Applied a total of 96 rules in 11 ms. Remains 121 /166 variables (removed 45) and now considering 420/471 (removed 51) transitions.
[2024-05-29 13:12:06] [INFO ] Flow matrix only has 411 transitions (discarded 9 similar events)
// Phase 1: matrix 411 rows 121 cols
[2024-05-29 13:12:06] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:12:06] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 13:12:06] [INFO ] Flow matrix only has 411 transitions (discarded 9 similar events)
[2024-05-29 13:12:06] [INFO ] Invariant cache hit.
[2024-05-29 13:12:06] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:12:06] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/207 places, 420/525 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 915 ms. Remains : 121/207 places, 420/525 transitions.
[2024-05-29 13:12:06] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:12:06] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:12:06] [INFO ] Input system was already deterministic with 420 transitions.
[2024-05-29 13:12:06] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:12:06] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:12:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality6147583880271309826.gal : 3 ms
[2024-05-29 13:12:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality14787589037983825113.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/CTLCardinality6147583880271309826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14787589037983825113.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,1.15134e+06,0.608681,21608,2,3231,5,38767,6,0,895,24350,0


Converting to forward existential form...Done !
original formula: (EG((EX((EG((p126!=1)) * ((p243==0)||(p0==1)))) + EG(EX(((p196==0)||(p156==1)))))) * (AX(((p231==1)||(p18==1))) + !(A(EX(A((p176==1) U ((...213
=> equivalent forward existential formula: ([(Init * !(EG((EX((EG((p126!=1)) * ((p243==0)||(p0==1)))) + EG(EX(((p196==0)||(p156==1))))))))] = FALSE * [(EY(...481
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t16, t17, t19, t21, t22, t24, t26, t27, t29, t30, t31,...495
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.39604,167440,1,0,659,526555,882,209,12652,365420,1024
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 13:12:13] [INFO ] Flatten gal took : 31 ms
[2024-05-29 13:12:13] [INFO ] Flatten gal took : 19 ms
Total runtime 140976 ms.

BK_STOP 1716988333313

--------------------
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="StigmergyCommit-PT-06a"
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 StigmergyCommit-PT-06a, 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-171690531700153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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