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

--------------------
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-CTLFireability-2024-00
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2024-01
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2024-02
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2024-03
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2024-04
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2024-05
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2024-06
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2024-07
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2024-08
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2024-09
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2024-10
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2024-11
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2023-12
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2023-13
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2023-14
FORMULA_NAME StigmergyCommit-PT-06a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716988275252

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
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
CTLFireability PT
Running Version 202405141337
[2024-05-29 13:11:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 13:11:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:11:16] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2024-05-29 13:11:16] [INFO ] Transformed 256 places.
[2024-05-29 13:11:16] [INFO ] Transformed 2816 transitions.
[2024-05-29 13:11:16] [INFO ] Found NUPN structural information;
[2024-05-29 13:11:16] [INFO ] Parsed PT model containing 256 places and 2816 transitions and 35321 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
Support contains 21 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 587/587 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 203 transition count 529
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 203 transition count 529
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 113 place count 203 transition count 522
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 138 place count 178 transition count 493
Iterating global reduction 1 with 25 rules applied. Total rules applied 163 place count 178 transition count 493
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 169 place count 178 transition count 487
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 176 place count 171 transition count 480
Iterating global reduction 2 with 7 rules applied. Total rules applied 183 place count 171 transition count 480
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 190 place count 164 transition count 473
Iterating global reduction 2 with 7 rules applied. Total rules applied 197 place count 164 transition count 473
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 204 place count 157 transition count 466
Iterating global reduction 2 with 7 rules applied. Total rules applied 211 place count 157 transition count 466
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 217 place count 151 transition count 460
Iterating global reduction 2 with 6 rules applied. Total rules applied 223 place count 151 transition count 460
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 229 place count 151 transition count 454
Applied a total of 229 rules in 79 ms. Remains 151 /256 variables (removed 105) and now considering 454/587 (removed 133) transitions.
[2024-05-29 13:11:16] [INFO ] Flow matrix only has 444 transitions (discarded 10 similar events)
// Phase 1: matrix 444 rows 151 cols
[2024-05-29 13:11:17] [INFO ] Computed 2 invariants in 25 ms
[2024-05-29 13:11:17] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-29 13:11:17] [INFO ] Flow matrix only has 444 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 318 read => feed constraints.
[2024-05-29 13:11:17] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2024-05-29 13:11:17] [INFO ] Flow matrix only has 444 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 318 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-29 13:11:22] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 12 ms to minimize.
[2024-05-29 13:11:22] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
[2024-05-29 13:11:22] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
[2024-05-29 13:11:22] [INFO ] Deduced a trap composed of 14 places in 289 ms of which 3 ms to minimize.
[2024-05-29 13:11:22] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-29 13:11:22] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 3 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:11:23] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:11:24] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:11:25] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:11:25] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:11:25] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-05-29 13:11:25] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 5 ms to minimize.
[2024-05-29 13:11:25] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:11:25] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:11:25] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:11:25] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:11:25] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-29 13:11:26] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:11:26] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:11:27] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:11:28] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:11:28] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:11:28] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:11:28] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:11:28] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 4 ms to minimize.
[2024-05-29 13:11:28] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:11:28] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:11:29] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:11:30] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:11:32] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-29 13:11:32] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:11:32] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:11:32] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:11:32] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:11:32] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:11:32] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:11:32] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:11:33] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 8 (OVERLAPS) 443/594 variables, 151/237 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/594 variables, 317/554 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-29 13:11:44] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/594 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/595 variables, and 555 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, ReadFeed: 317/318 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-29 13:11:52] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:11:53] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 10/97 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (OVERLAPS) 443/594 variables, 151/248 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 317/565 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 453/1018 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/595 variables, and 1018 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, ReadFeed: 317/318 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 95/95 constraints]
After SMT, in 61847ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 61866ms
Starting structural reductions in LTL mode, iteration 1 : 151/256 places, 454/587 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62656 ms. Remains : 151/256 places, 454/587 transitions.
Support contains 21 out of 151 places after structural reductions.
[2024-05-29 13:12:19] [INFO ] Flatten gal took : 76 ms
[2024-05-29 13:12:19] [INFO ] Flatten gal took : 43 ms
[2024-05-29 13:12:19] [INFO ] Input system was already deterministic with 454 transitions.
Support contains 20 out of 151 places (down from 21) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 18
RANDOM walk for 40000 steps (17 resets) in 3236 ms. (12 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40004 steps (9 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 202 ms. (197 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (15 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (14 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (10 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
[2024-05-29 13:12:21] [INFO ] Flow matrix only has 444 transitions (discarded 10 similar events)
[2024-05-29 13:12:21] [INFO ] Invariant cache hit.
[2024-05-29 13:12:21] [INFO ] State equation strengthened by 318 read => feed constraints.
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp23 is UNSAT
After SMT solving in domain Real declared 151/595 variables, and 2 constraints, problems are : Problem set: 5 solved, 0 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/151 constraints, ReadFeed: 0/318 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA StigmergyCommit-PT-06a-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 13:12:21] [INFO ] Flatten gal took : 35 ms
[2024-05-29 13:12:21] [INFO ] Flatten gal took : 36 ms
[2024-05-29 13:12:21] [INFO ] Input system was already deterministic with 454 transitions.
Support contains 15 out of 151 places (down from 16) after GAL structural reductions.
Computed a total of 44 stabilizing places and 43 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 446
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 146 transition count 445
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 143 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 143 transition count 439
Applied a total of 18 rules in 11 ms. Remains 143 /151 variables (removed 8) and now considering 439/454 (removed 15) transitions.
[2024-05-29 13:12:21] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:12:21] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 13:12:21] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-29 13:12:21] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:12:21] [INFO ] Invariant cache hit.
[2024-05-29 13:12:21] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:12:21] [INFO ] Implicit Places using invariants and state equation in 416 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 494 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/151 places, 439/454 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:12:21] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2024-05-29 13:12:21] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:12:22] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 13:12:22] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:12:22] [INFO ] Invariant cache hit.
[2024-05-29 13:12:22] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:12:22] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/151 places, 378/454 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 656 ms. Remains : 88/151 places, 378/454 transitions.
[2024-05-29 13:12:22] [INFO ] Flatten gal took : 21 ms
[2024-05-29 13:12:22] [INFO ] Flatten gal took : 20 ms
[2024-05-29 13:12:22] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-29 13:12:22] [INFO ] Flatten gal took : 18 ms
[2024-05-29 13:12:22] [INFO ] Flatten gal took : 18 ms
[2024-05-29 13:12:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16521186004464616008.gal : 18 ms
[2024-05-29 13:12:22] [INFO ] Time to serialize properties into /tmp/CTLFireability14467034296055772417.ctl : 3 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/CTLFireability16521186004464616008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14467034296055772417.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.13698e+06,0.568313,21872,2,2634,5,33772,6,0,722,21534,0


Converting to forward existential form...Done !
original formula: (EG(AG(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||(p246==0))))) + (E(((((E(((((p30==1)&&(p66==1))&&((p102=...1141
=> equivalent forward existential formula: ([((Init * !(EG(!(E(TRUE U !(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||(p246==0)...1553
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
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.02403,199604,1,0,754,705277,799,240,11684,448482,1151
FORMULA StigmergyCommit-PT-06a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 446
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 146 transition count 445
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 143 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 143 transition count 439
Applied a total of 18 rules in 17 ms. Remains 143 /151 variables (removed 8) and now considering 439/454 (removed 15) transitions.
[2024-05-29 13:12:29] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:12:29] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 13:12:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 13:12:29] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:12:29] [INFO ] Invariant cache hit.
[2024-05-29 13:12:29] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:12:29] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 438 sub problems to find dead transitions.
[2024-05-29 13:12:29] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:12:29] [INFO ] Invariant cache hit.
[2024-05-29 13:12:29] [INFO ] State equation strengthened by 316 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:12:33] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:12:33] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 0 ms to minimize.
[2024-05-29 13:12:33] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2024-05-29 13:12:34] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:12:34] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:12:34] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:12:34] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:12:34] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:12:34] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:12:34] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:12:34] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:12:34] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:12:34] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:12:34] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:12:36] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:12:36] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:12:36] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:12:36] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:12:36] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:12:36] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:12:36] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:12:36] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:12:36] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:12:36] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:12:36] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:12:37] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:12:37] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:12:37] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:12:37] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:12:38] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:12:38] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-05-29 13:12:38] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-29 13:12:38] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-29 13:12:38] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:12:38] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:12:38] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:12:38] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:12:39] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:12:39] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:12:39] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:12:39] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:12:40] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:12:40] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:12:40] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:12:40] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-05-29 13:12:40] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:12:40] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:12:40] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:12:41] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-29 13:12:41] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:12:41] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:12:41] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:12:41] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:12:42] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:12:42] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:12:42] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:12:43] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-05-29 13:12:43] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:12:43] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:12:43] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:12:43] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:12:43] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:12:43] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:12:43] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:12:43] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:12:44] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:12:44] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:12:44] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:12:46] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:12:46] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:12:46] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:12:46] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:12:46] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:12:46] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:12:48] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:12:48] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:12:48] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:12:48] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:12:48] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:12:48] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:12:48] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:12:48] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:12:48] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:12:48] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:12:48] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:12:48] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-05-29 13:12:49] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:12:49] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:12:49] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:12:49] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:12:49] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:12:49] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 18/109 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:12:51] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:12:52] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:12:54] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:12:54] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:12:54] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:12:54] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:12:54] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:12:54] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:12:55] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:12:55] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:12:55] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:12:55] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:12:56] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:12:56] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:12:56] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 13 (OVERLAPS) 430/573 variables, 143/267 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/573 variables, 315/582 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/574 variables, and 582 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 143/143 constraints, ReadFeed: 315/316 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 122/122 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:13:18] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:13:18] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:13:18] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:13:28] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 143/574 variables, and 131 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/143 constraints, ReadFeed: 0/316 constraints, PredecessorRefiner: 0/438 constraints, Known Traps: 129/129 constraints]
After SMT, in 61739ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 61748ms
Starting structural reductions in LTL mode, iteration 1 : 143/151 places, 439/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62097 ms. Remains : 143/151 places, 439/454 transitions.
[2024-05-29 13:13:31] [INFO ] Flatten gal took : 20 ms
[2024-05-29 13:13:31] [INFO ] Flatten gal took : 23 ms
[2024-05-29 13:13:31] [INFO ] Input system was already deterministic with 439 transitions.
[2024-05-29 13:13:31] [INFO ] Flatten gal took : 17 ms
[2024-05-29 13:13:31] [INFO ] Flatten gal took : 17 ms
[2024-05-29 13:13:31] [INFO ] Time to serialize gal into /tmp/CTLFireability7449889284560791023.gal : 9 ms
[2024-05-29 13:13:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15970955368742291070.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/CTLFireability7449889284560791023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15970955368742291070.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.15122e+06,1.32691,42980,2,6242,5,68682,6,0,1001,36680,0


Converting to forward existential form...Done !
original formula: !(E((EF(AX(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1))))) + AG(!(((((p30==1)&&(p66==1))&&((p102=...336
=> equivalent forward existential formula: [(((FwdU(Init,(E(TRUE U !(EX(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==...402
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t23, t24, t25, ...417
(forward)formula 0,0,13.1372,336500,1,0,598,882853,894,211,13413,500703,993
FORMULA StigmergyCommit-PT-06a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 454/454 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 147 transition count 448
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 147 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 147 transition count 447
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 145 transition count 444
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 145 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 145 transition count 443
Applied a total of 14 rules in 16 ms. Remains 145 /151 variables (removed 6) and now considering 443/454 (removed 11) transitions.
[2024-05-29 13:13:44] [INFO ] Flow matrix only has 434 transitions (discarded 9 similar events)
// Phase 1: matrix 434 rows 145 cols
[2024-05-29 13:13:44] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 13:13:44] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-29 13:13:45] [INFO ] Flow matrix only has 434 transitions (discarded 9 similar events)
[2024-05-29 13:13:45] [INFO ] Invariant cache hit.
[2024-05-29 13:13:45] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:13:45] [INFO ] Implicit Places using invariants and state equation in 448 ms returned [144]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 519 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/151 places, 443/454 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 125 transition count 424
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 125 transition count 424
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 417
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 118 transition count 410
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 118 transition count 410
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 111 transition count 403
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 111 transition count 403
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 80 place count 104 transition count 396
Iterating global reduction 1 with 7 rules applied. Total rules applied 87 place count 104 transition count 396
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 97 transition count 389
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 97 transition count 389
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 107 place count 91 transition count 383
Iterating global reduction 1 with 6 rules applied. Total rules applied 113 place count 91 transition count 383
Applied a total of 113 rules in 17 ms. Remains 91 /144 variables (removed 53) and now considering 383/443 (removed 60) transitions.
[2024-05-29 13:13:45] [INFO ] Flow matrix only has 374 transitions (discarded 9 similar events)
// Phase 1: matrix 374 rows 91 cols
[2024-05-29 13:13:45] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 13:13:45] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 13:13:45] [INFO ] Flow matrix only has 374 transitions (discarded 9 similar events)
[2024-05-29 13:13:45] [INFO ] Invariant cache hit.
[2024-05-29 13:13:45] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:13:45] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 91/151 places, 383/454 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 869 ms. Remains : 91/151 places, 383/454 transitions.
[2024-05-29 13:13:45] [INFO ] Flatten gal took : 14 ms
[2024-05-29 13:13:45] [INFO ] Flatten gal took : 14 ms
[2024-05-29 13:13:45] [INFO ] Input system was already deterministic with 383 transitions.
[2024-05-29 13:13:45] [INFO ] Flatten gal took : 14 ms
[2024-05-29 13:13:45] [INFO ] Flatten gal took : 14 ms
[2024-05-29 13:13:45] [INFO ] Time to serialize gal into /tmp/CTLFireability13741498022637270910.gal : 3 ms
[2024-05-29 13:13:45] [INFO ] Time to serialize properties into /tmp/CTLFireability17343917543429560300.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/CTLFireability13741498022637270910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17343917543429560300.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.14927e+06,0.530449,20364,2,2411,5,31909,6,0,738,19530,0


Converting to forward existential form...Done !
original formula: E((!(((AX((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p30==1))))&&((((p66==1)&&(p102==1))&&((...586
=> equivalent forward existential formula: ([FwdG(FwdU(Init,(!(((!(EX(!((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==...1066
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t12, t14, t16, t17, t19, t21, t22, t24, t26, t27, t29, t31, t32,...452
(forward)formula 0,1,7.37446,204344,1,0,717,526933,789,279,12057,460267,1022
FORMULA StigmergyCommit-PT-06a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 446
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 146 transition count 445
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 143 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 143 transition count 439
Applied a total of 18 rules in 17 ms. Remains 143 /151 variables (removed 8) and now considering 439/454 (removed 15) transitions.
[2024-05-29 13:13:53] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:13:53] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 13:13:53] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 13:13:53] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:13:53] [INFO ] Invariant cache hit.
[2024-05-29 13:13:53] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:13:53] [INFO ] Implicit Places using invariants and state equation in 442 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 528 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/151 places, 439/454 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 12 ms. Remains 88 /142 variables (removed 54) and now considering 378/439 (removed 61) transitions.
[2024-05-29 13:13:53] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2024-05-29 13:13:53] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 13:13:53] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 13:13:53] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:13:53] [INFO ] Invariant cache hit.
[2024-05-29 13:13:54] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:13:54] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/151 places, 378/454 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 710 ms. Remains : 88/151 places, 378/454 transitions.
[2024-05-29 13:13:54] [INFO ] Flatten gal took : 15 ms
[2024-05-29 13:13:54] [INFO ] Flatten gal took : 14 ms
[2024-05-29 13:13:54] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-29 13:13:54] [INFO ] Flatten gal took : 14 ms
[2024-05-29 13:13:54] [INFO ] Flatten gal took : 14 ms
[2024-05-29 13:13:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15863192032456254529.gal : 5 ms
[2024-05-29 13:13:54] [INFO ] Time to serialize properties into /tmp/CTLFireability14498503629006681418.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/CTLFireability15863192032456254529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14498503629006681418.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.13698e+06,0.574831,21672,2,2634,5,33772,6,0,722,21534,0


Converting to forward existential form...Done !
original formula: EX(!(A(AF((AF(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1)))) * !(((((p30==1)&&(p66==1))&&((p102==...400
=> equivalent forward existential formula: (([(EY((FwdU((FwdU(EY(Init),!(!((E(!(!(EX(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210=...2179
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
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,8.60046,227424,1,0,934,806457,794,417,11634,544797,1415
FORMULA StigmergyCommit-PT-06a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 446
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 146 transition count 445
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 143 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 143 transition count 439
Applied a total of 18 rules in 5 ms. Remains 143 /151 variables (removed 8) and now considering 439/454 (removed 15) transitions.
[2024-05-29 13:14:02] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:14:02] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 13:14:02] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 13:14:02] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:14:02] [INFO ] Invariant cache hit.
[2024-05-29 13:14:03] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:14:03] [INFO ] Implicit Places using invariants and state equation in 408 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 466 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/151 places, 439/454 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 15 ms. Remains 88 /142 variables (removed 54) and now considering 378/439 (removed 61) transitions.
[2024-05-29 13:14:03] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2024-05-29 13:14:03] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 13:14:03] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 13:14:03] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:14:03] [INFO ] Invariant cache hit.
[2024-05-29 13:14:03] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:14:03] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/151 places, 378/454 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 632 ms. Remains : 88/151 places, 378/454 transitions.
[2024-05-29 13:14:03] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:14:03] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:14:03] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-29 13:14:03] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:14:03] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:14:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4668626126296881417.gal : 3 ms
[2024-05-29 13:14:03] [INFO ] Time to serialize properties into /tmp/CTLFireability3756673170504760207.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/CTLFireability4668626126296881417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3756673170504760207.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,1.13698e+06,0.565759,21932,2,2634,5,33772,6,0,722,21534,0


Converting to forward existential form...Done !
original formula: (EF(EG(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||(p246==0))))) * (EX(((AF(((((p30==1)&&(p66==1))&&((p102=...487
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EG(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||(p246==0))))))...569
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
Hit Full ! (commute/partial/dont) 95/0/283
(forward)formula 0,1,6.47021,170416,1,0,751,655414,791,218,12003,429504,1216
FORMULA StigmergyCommit-PT-06a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 446
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 146 transition count 445
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 143 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 143 transition count 439
Applied a total of 18 rules in 9 ms. Remains 143 /151 variables (removed 8) and now considering 439/454 (removed 15) transitions.
[2024-05-29 13:14:10] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:14:10] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 13:14:10] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 13:14:10] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:14:10] [INFO ] Invariant cache hit.
[2024-05-29 13:14:10] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:14:10] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 438 sub problems to find dead transitions.
[2024-05-29 13:14:10] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:14:10] [INFO ] Invariant cache hit.
[2024-05-29 13:14:10] [INFO ] State equation strengthened by 316 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:14:14] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:14:14] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:14:14] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:14:14] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:14:14] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-05-29 13:14:14] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:14:14] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:14:14] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:14:15] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:14:15] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:14:15] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:14:15] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:14:15] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:14:15] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:14:15] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:14:15] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:14:15] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:14:15] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:14:15] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:14:15] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:14:15] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:14:16] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:14:17] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:14:17] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:14:17] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:14:17] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:14:18] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:14:18] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:14:18] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:14:18] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:14:18] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:14:18] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-05-29 13:14:18] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:14:19] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:14:19] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:14:19] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:14:19] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:14:19] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:14:19] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:14:19] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:14:19] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:14:19] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:14:20] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:14:20] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:14:21] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:14:21] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-05-29 13:14:21] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:14:21] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:14:21] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:14:21] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:14:21] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-05-29 13:14:21] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:14:21] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:14:21] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:14:23] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:14:23] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:14:23] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:14:23] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:14:23] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:14:23] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-29 13:14:23] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:14:24] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:14:24] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:14:24] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:14:24] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:14:24] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:14:25] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:14:25] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:14:25] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:14:27] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:14:27] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:14:27] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:14:27] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:14:27] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:14:27] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:14:28] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:14:28] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:14:28] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:14:28] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:14:28] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:14:28] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:14:28] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:14:28] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:14:29] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:14:29] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:14:29] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:14:29] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:14:29] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:14:29] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:14:29] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:14:29] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:14:29] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:14:29] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 18/109 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:14:31] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:14:32] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:14:34] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:14:34] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:14:34] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:14:34] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:14:34] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:14:34] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:14:36] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:14:36] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:14:36] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:14:36] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:14:36] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:14:36] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:14:36] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 13 (OVERLAPS) 430/573 variables, 143/267 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/573 variables, 315/582 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/574 variables, and 582 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 143/143 constraints, ReadFeed: 315/316 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 122/122 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:14:59] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:14:59] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:14:59] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:15:04] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:15:05] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:15:05] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-29 13:15:09] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 143/574 variables, and 131 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/143 constraints, ReadFeed: 0/316 constraints, PredecessorRefiner: 0/438 constraints, Known Traps: 129/129 constraints]
After SMT, in 61626ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 61633ms
Starting structural reductions in LTL mode, iteration 1 : 143/151 places, 439/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61977 ms. Remains : 143/151 places, 439/454 transitions.
[2024-05-29 13:15:12] [INFO ] Flatten gal took : 14 ms
[2024-05-29 13:15:12] [INFO ] Flatten gal took : 15 ms
[2024-05-29 13:15:12] [INFO ] Input system was already deterministic with 439 transitions.
[2024-05-29 13:15:12] [INFO ] Flatten gal took : 14 ms
[2024-05-29 13:15:12] [INFO ] Flatten gal took : 14 ms
[2024-05-29 13:15:12] [INFO ] Time to serialize gal into /tmp/CTLFireability17058413641401918938.gal : 4 ms
[2024-05-29 13:15:12] [INFO ] Time to serialize properties into /tmp/CTLFireability8513660580488950961.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/CTLFireability17058413641401918938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8513660580488950961.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.15122e+06,1.27594,42976,2,6242,5,68682,6,0,1001,36680,0


Converting to forward existential form...Done !
original formula: A(EF((!(EX(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1))))) + ((((p30==1)&&(p66==1))&&((p102==1)&&...508
=> equivalent forward existential formula: [((Init * !(EG(!(((p79==1)&&(p255==1)))))) * !(E(!(((p79==1)&&(p255==1))) U (!(E(TRUE U (!(EX(((((p30==1)&&(p66=...838
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t23, t24, t25, ...417
(forward)formula 0,0,19.9243,553972,1,0,844,1.59742e+06,908,291,13302,922534,1297
FORMULA StigmergyCommit-PT-06a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 446
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 146 transition count 445
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 143 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 143 transition count 439
Applied a total of 18 rules in 5 ms. Remains 143 /151 variables (removed 8) and now considering 439/454 (removed 15) transitions.
[2024-05-29 13:15:32] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:15:32] [INFO ] Invariant cache hit.
[2024-05-29 13:15:32] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 13:15:32] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:15:32] [INFO ] Invariant cache hit.
[2024-05-29 13:15:32] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:15:32] [INFO ] Implicit Places using invariants and state equation in 422 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 484 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/151 places, 439/454 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 8 ms. Remains 88 /142 variables (removed 54) and now considering 378/439 (removed 61) transitions.
[2024-05-29 13:15:32] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2024-05-29 13:15:32] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 13:15:32] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 13:15:32] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:15:32] [INFO ] Invariant cache hit.
[2024-05-29 13:15:33] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:15:33] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/151 places, 378/454 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 642 ms. Remains : 88/151 places, 378/454 transitions.
[2024-05-29 13:15:33] [INFO ] Flatten gal took : 11 ms
[2024-05-29 13:15:33] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:15:33] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-29 13:15:33] [INFO ] Flatten gal took : 19 ms
[2024-05-29 13:15:33] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:15:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12824959185438425688.gal : 3 ms
[2024-05-29 13:15:33] [INFO ] Time to serialize properties into /tmp/CTLFireability5254022521564915320.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/CTLFireability12824959185438425688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5254022521564915320.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.58127,21672,2,2634,5,33772,6,0,722,21534,0


Converting to forward existential form...Done !
original formula: (AX(EF((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1))) + A(((((p30==1)&&(p66==1))&&((p102==1)&&(p1...668
=> equivalent forward existential formula: [(EY((Init * !((E(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1))) U !(EG(!...947
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,7.27135,204844,1,0,741,702235,777,218,11539,445820,1122
FORMULA StigmergyCommit-PT-06a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 446
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 146 transition count 445
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 143 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 143 transition count 439
Applied a total of 18 rules in 9 ms. Remains 143 /151 variables (removed 8) and now considering 439/454 (removed 15) transitions.
[2024-05-29 13:15:40] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:15:40] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 13:15:40] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 13:15:40] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:15:40] [INFO ] Invariant cache hit.
[2024-05-29 13:15:40] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:15:40] [INFO ] Implicit Places using invariants and state equation in 432 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 495 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/151 places, 439/454 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 11 ms. Remains 88 /142 variables (removed 54) and now considering 378/439 (removed 61) transitions.
[2024-05-29 13:15:40] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2024-05-29 13:15:41] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 13:15:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 13:15:41] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:15:41] [INFO ] Invariant cache hit.
[2024-05-29 13:15:41] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:15:41] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/151 places, 378/454 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 666 ms. Remains : 88/151 places, 378/454 transitions.
[2024-05-29 13:15:41] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:15:41] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:15:41] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-29 13:15:41] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:15:41] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:15:41] [INFO ] Time to serialize gal into /tmp/CTLFireability16601033576234655846.gal : 3 ms
[2024-05-29 13:15:41] [INFO ] Time to serialize properties into /tmp/CTLFireability15212331427514034236.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/CTLFireability16601033576234655846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15212331427514034236.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.13698e+06,0.575526,21932,2,2634,5,33772,6,0,722,21534,0


Converting to forward existential form...Done !
original formula: E((!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1)))) + ((EF(((((p30==1)&&(p66==1))&&((p102==1)&&(p...577
=> equivalent forward existential formula: [(FwdU(Init,(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1)))) + ((E(TRUE...846
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.10977,89516,1,0,548,240468,773,199,11391,189491,896
FORMULA StigmergyCommit-PT-06a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 151/151 places, 454/454 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 149 transition count 382
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 91 rules applied. Total rules applied 163 place count 78 transition count 362
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 178 place count 71 transition count 354
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 180 place count 70 transition count 353
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 180 place count 70 transition count 341
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 204 place count 58 transition count 341
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 218 place count 44 transition count 324
Iterating global reduction 4 with 14 rules applied. Total rules applied 232 place count 44 transition count 324
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 264 place count 44 transition count 292
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 264 place count 44 transition count 288
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 272 place count 40 transition count 288
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 274 place count 38 transition count 284
Iterating global reduction 5 with 2 rules applied. Total rules applied 276 place count 38 transition count 284
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 5 with 96 rules applied. Total rules applied 372 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 374 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 375 place count 37 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 382 place count 37 transition count 179
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 396 place count 30 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 397 place count 29 transition count 171
Applied a total of 397 rules in 102 ms. Remains 29 /151 variables (removed 122) and now considering 171/454 (removed 283) transitions.
[2024-05-29 13:15:44] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
// Phase 1: matrix 163 rows 29 cols
[2024-05-29 13:15:44] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:15:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 13:15:44] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2024-05-29 13:15:44] [INFO ] Invariant cache hit.
[2024-05-29 13:15:44] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-29 13:15:44] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-29 13:15:44] [INFO ] Redundant transitions in 6 ms returned []
Running 164 sub problems to find dead transitions.
[2024-05-29 13:15:44] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2024-05-29 13:15:44] [INFO ] Invariant cache hit.
[2024-05-29 13:15:44] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:15:45] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:15:46] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 13:15:47] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:15:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:15:47] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:15:47] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:15:47] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:15:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:15:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:15:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:15:47] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:15:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:15:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 162/191 variables, 29/86 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 133/219 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 13:15:48] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 1/192 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 13:15:51] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/192 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (OVERLAPS) 0/192 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 222 constraints, problems are : Problem set: 0 solved, 164 unsolved in 8599 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 162/191 variables, 29/88 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 133/221 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 164/385 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 386 constraints, problems are : Problem set: 0 solved, 164 unsolved in 12733 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 58/58 constraints]
After SMT, in 21699ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 21701ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/151 places, 171/454 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21896 ms. Remains : 29/151 places, 171/454 transitions.
[2024-05-29 13:16:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 13:16:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 13:16:06] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-29 13:16:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 13:16:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 13:16:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13301280788966948226.gal : 3 ms
[2024-05-29 13:16:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16172727630274281082.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/CTLFireability13301280788966948226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16172727630274281082.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,269,0.061118,6532,2,386,5,3449,6,0,280,1882,0


Converting to forward existential form...Done !
original formula: AG(((EF(EG(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||(p246==0))))) + AF(((((p30==0)||(p66==0))||((p102==0...299
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1))...363
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t20, t29...292
(forward)formula 0,1,0.272798,11072,1,0,293,20973,367,70,4626,16445,433
FORMULA StigmergyCommit-PT-06a-CTLFireability-2024-09 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 : 151/151 places, 454/454 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 149 transition count 385
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 85 rules applied. Total rules applied 154 place count 81 transition count 368
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 167 place count 75 transition count 361
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 171 place count 74 transition count 358
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 176 place count 72 transition count 355
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 178 place count 71 transition count 354
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 178 place count 71 transition count 342
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 202 place count 59 transition count 342
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 215 place count 46 transition count 326
Iterating global reduction 6 with 13 rules applied. Total rules applied 228 place count 46 transition count 326
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 6 with 31 rules applied. Total rules applied 259 place count 46 transition count 295
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 259 place count 46 transition count 291
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 267 place count 42 transition count 291
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 269 place count 40 transition count 287
Iterating global reduction 7 with 2 rules applied. Total rules applied 271 place count 40 transition count 287
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 7 with 96 rules applied. Total rules applied 367 place count 40 transition count 191
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 369 place count 39 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 370 place count 39 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 377 place count 39 transition count 182
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 391 place count 32 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 392 place count 31 transition count 174
Applied a total of 392 rules in 86 ms. Remains 31 /151 variables (removed 120) and now considering 174/454 (removed 280) transitions.
[2024-05-29 13:16:06] [INFO ] Flow matrix only has 166 transitions (discarded 8 similar events)
// Phase 1: matrix 166 rows 31 cols
[2024-05-29 13:16:06] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 13:16:06] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 13:16:06] [INFO ] Flow matrix only has 166 transitions (discarded 8 similar events)
[2024-05-29 13:16:06] [INFO ] Invariant cache hit.
[2024-05-29 13:16:06] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-29 13:16:06] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-29 13:16:06] [INFO ] Redundant transitions in 6 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-29 13:16:06] [INFO ] Flow matrix only has 166 transitions (discarded 8 similar events)
[2024-05-29 13:16:06] [INFO ] Invariant cache hit.
[2024-05-29 13:16:06] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 7/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-29 13:16:07] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:16:07] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:16:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:16:07] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:16:07] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:16:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:16:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:16:07] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:16:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:16:07] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:16:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:16:07] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:16:07] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:16:08] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:16:09] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:16:09] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:16:09] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-29 13:16:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:16:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:16:09] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:16:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-29 13:16:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:16:09] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-29 13:16:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:16:10] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:16:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:16:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:16:10] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-29 13:16:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:16:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-29 13:16:10] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:16:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:16:10] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-29 13:16:11] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:16:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/31 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 165/196 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 133/221 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 14 (OVERLAPS) 1/197 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-29 13:16:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-29 13:16:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/197 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/197 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 18 (OVERLAPS) 0/197 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 224 constraints, problems are : Problem set: 0 solved, 167 unsolved in 9456 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 7/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-29 13:16:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-29 13:16:17] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:16:17] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 165/196 variables, 31/93 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 133/226 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 167/393 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (OVERLAPS) 1/197 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (OVERLAPS) 0/197 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 394 constraints, problems are : Problem set: 0 solved, 167 unsolved in 14136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 61/61 constraints]
After SMT, in 23938ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 23940ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/151 places, 174/454 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24152 ms. Remains : 31/151 places, 174/454 transitions.
[2024-05-29 13:16:30] [INFO ] Flatten gal took : 9 ms
[2024-05-29 13:16:30] [INFO ] Flatten gal took : 7 ms
[2024-05-29 13:16:30] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-29 13:16:30] [INFO ] Flatten gal took : 7 ms
[2024-05-29 13:16:30] [INFO ] Flatten gal took : 6 ms
[2024-05-29 13:16:30] [INFO ] Time to serialize gal into /tmp/CTLFireability15297030466191409041.gal : 2 ms
[2024-05-29 13:16:30] [INFO ] Time to serialize properties into /tmp/CTLFireability8641823928672208685.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/CTLFireability15297030466191409041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8641823928672208685.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,271,0.055508,6520,2,337,5,2900,6,0,291,1602,0


Converting to forward existential form...Done !
original formula: EF((A(AG(((p137!=1)&&(!((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1)))))) U (!((AG(((((p30==1)&&(p6...509
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!((!((!(E(TRUE U !(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p21...1244
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t15, t16, t17, t19, t21, t30, t32...297
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.245325,10004,1,0,283,17859,375,77,4872,14588,423
FORMULA StigmergyCommit-PT-06a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 454/454 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 147 transition count 448
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 147 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 147 transition count 447
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 145 transition count 444
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 145 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 145 transition count 443
Applied a total of 14 rules in 11 ms. Remains 145 /151 variables (removed 6) and now considering 443/454 (removed 11) transitions.
[2024-05-29 13:16:31] [INFO ] Flow matrix only has 434 transitions (discarded 9 similar events)
// Phase 1: matrix 434 rows 145 cols
[2024-05-29 13:16:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 13:16:31] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 13:16:31] [INFO ] Flow matrix only has 434 transitions (discarded 9 similar events)
[2024-05-29 13:16:31] [INFO ] Invariant cache hit.
[2024-05-29 13:16:31] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:16:31] [INFO ] Implicit Places using invariants and state equation in 485 ms returned [144]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 547 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/151 places, 443/454 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 125 transition count 424
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 125 transition count 424
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 417
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 118 transition count 410
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 118 transition count 410
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 111 transition count 403
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 111 transition count 403
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 80 place count 104 transition count 396
Iterating global reduction 1 with 7 rules applied. Total rules applied 87 place count 104 transition count 396
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 97 transition count 389
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 97 transition count 389
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 107 place count 91 transition count 383
Iterating global reduction 1 with 6 rules applied. Total rules applied 113 place count 91 transition count 383
Applied a total of 113 rules in 12 ms. Remains 91 /144 variables (removed 53) and now considering 383/443 (removed 60) transitions.
[2024-05-29 13:16:31] [INFO ] Flow matrix only has 374 transitions (discarded 9 similar events)
// Phase 1: matrix 374 rows 91 cols
[2024-05-29 13:16:31] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 13:16:31] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 13:16:31] [INFO ] Flow matrix only has 374 transitions (discarded 9 similar events)
[2024-05-29 13:16:31] [INFO ] Invariant cache hit.
[2024-05-29 13:16:31] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:16:31] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 91/151 places, 383/454 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 709 ms. Remains : 91/151 places, 383/454 transitions.
[2024-05-29 13:16:31] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:16:31] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:16:31] [INFO ] Input system was already deterministic with 383 transitions.
[2024-05-29 13:16:31] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:16:31] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:16:31] [INFO ] Time to serialize gal into /tmp/CTLFireability5400931041325335250.gal : 2 ms
[2024-05-29 13:16:31] [INFO ] Time to serialize properties into /tmp/CTLFireability6905789412257744546.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/CTLFireability5400931041325335250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6905789412257744546.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,1.14927e+06,0.548171,20100,2,2440,5,32115,6,0,738,19616,0


Converting to forward existential form...Done !
original formula: (AF(AX(!(E(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1)))) U (((((p30==1)&&(p66==1))&&((p102==1)...319
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!(!(E(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1)))...398
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, t31, t32,...452
(forward)formula 0,0,11.9556,309712,1,0,923,1.01711e+06,792,405,11823,825943,1294
FORMULA StigmergyCommit-PT-06a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 446
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 146 transition count 445
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 143 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 143 transition count 439
Applied a total of 18 rules in 11 ms. Remains 143 /151 variables (removed 8) and now considering 439/454 (removed 15) transitions.
[2024-05-29 13:16:43] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:16:43] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 13:16:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 13:16:44] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:16:44] [INFO ] Invariant cache hit.
[2024-05-29 13:16:44] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:16:44] [INFO ] Implicit Places using invariants and state equation in 407 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 464 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/151 places, 439/454 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 123 transition count 420
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 123 transition count 420
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 123 transition count 413
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 116 transition count 406
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 116 transition count 406
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 109 transition count 399
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 109 transition count 399
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 80 place count 102 transition count 392
Iterating global reduction 1 with 7 rules applied. Total rules applied 87 place count 102 transition count 392
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 95 transition count 385
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 95 transition count 385
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 107 place count 89 transition count 379
Iterating global reduction 1 with 6 rules applied. Total rules applied 113 place count 89 transition count 379
Applied a total of 113 rules in 13 ms. Remains 89 /142 variables (removed 53) and now considering 379/439 (removed 60) transitions.
[2024-05-29 13:16:44] [INFO ] Flow matrix only has 371 transitions (discarded 8 similar events)
// Phase 1: matrix 371 rows 89 cols
[2024-05-29 13:16:44] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 13:16:44] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 13:16:44] [INFO ] Flow matrix only has 371 transitions (discarded 8 similar events)
[2024-05-29 13:16:44] [INFO ] Invariant cache hit.
[2024-05-29 13:16:44] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:16:44] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 89/151 places, 379/454 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 643 ms. Remains : 89/151 places, 379/454 transitions.
[2024-05-29 13:16:44] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:16:44] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:16:44] [INFO ] Input system was already deterministic with 379 transitions.
[2024-05-29 13:16:44] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:16:44] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:16:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11573388949719161916.gal : 3 ms
[2024-05-29 13:16:44] [INFO ] Time to serialize properties into /tmp/CTLFireability999773000595851356.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/CTLFireability11573388949719161916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability999773000595851356.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,1.14108e+06,0.661645,23520,2,2930,5,40572,6,0,727,25762,0


Converting to forward existential form...Done !
original formula: E(!((E((AG(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1)))) * !(((((p30==1)&&(p66==1))&&((p102==1)&...692
=> equivalent forward existential formula: [((((FwdU(Init,!((E((!(E(TRUE U !(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p24...774
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,...445
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,8.27517,235308,1,0,878,829039,794,334,11793,580189,1305
FORMULA StigmergyCommit-PT-06a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 151/151 places, 454/454 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 149 transition count 382
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 91 rules applied. Total rules applied 163 place count 78 transition count 362
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 178 place count 71 transition count 354
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 180 place count 70 transition count 353
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 180 place count 70 transition count 341
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 204 place count 58 transition count 341
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 218 place count 44 transition count 324
Iterating global reduction 4 with 14 rules applied. Total rules applied 232 place count 44 transition count 324
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 264 place count 44 transition count 292
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 264 place count 44 transition count 288
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 272 place count 40 transition count 288
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 274 place count 38 transition count 284
Iterating global reduction 5 with 2 rules applied. Total rules applied 276 place count 38 transition count 284
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 5 with 96 rules applied. Total rules applied 372 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 374 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 375 place count 37 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 382 place count 37 transition count 179
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 396 place count 30 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 397 place count 29 transition count 171
Applied a total of 397 rules in 45 ms. Remains 29 /151 variables (removed 122) and now considering 171/454 (removed 283) transitions.
[2024-05-29 13:16:53] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
// Phase 1: matrix 163 rows 29 cols
[2024-05-29 13:16:53] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:16:53] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 13:16:53] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2024-05-29 13:16:53] [INFO ] Invariant cache hit.
[2024-05-29 13:16:53] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-29 13:16:53] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-29 13:16:53] [INFO ] Redundant transitions in 6 ms returned []
Running 164 sub problems to find dead transitions.
[2024-05-29 13:16:53] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
[2024-05-29 13:16:53] [INFO ] Invariant cache hit.
[2024-05-29 13:16:53] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 13:16:53] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:16:54] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:16:55] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:16:56] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:16:56] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:16:56] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:16:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:16:56] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:16:56] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:16:56] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 162/191 variables, 29/86 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 133/219 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 13:16:57] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 1/192 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 13:17:00] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/192 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (OVERLAPS) 0/192 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 222 constraints, problems are : Problem set: 0 solved, 164 unsolved in 8596 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 162/191 variables, 29/88 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 133/221 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 164/385 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 386 constraints, problems are : Problem set: 0 solved, 164 unsolved in 12680 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 58/58 constraints]
After SMT, in 21658ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 21660ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/151 places, 171/454 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21839 ms. Remains : 29/151 places, 171/454 transitions.
[2024-05-29 13:17:14] [INFO ] Flatten gal took : 6 ms
[2024-05-29 13:17:14] [INFO ] Flatten gal took : 6 ms
[2024-05-29 13:17:14] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-29 13:17:14] [INFO ] Flatten gal took : 6 ms
[2024-05-29 13:17:14] [INFO ] Flatten gal took : 7 ms
[2024-05-29 13:17:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8336603926750316928.gal : 1 ms
[2024-05-29 13:17:14] [INFO ] Time to serialize properties into /tmp/CTLFireability14210267848315320472.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/CTLFireability8336603926750316928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14210267848315320472.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,269,0.079169,6524,2,386,5,3449,6,0,280,1882,0


Converting to forward existential form...Done !
original formula: (EF(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1)))) * EF(((((p30==0)||(p66==0))||((p102==0)||(p138...201
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U ((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1))))),...259
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t20, t29...292
(forward)formula 0,1,0.223097,9216,1,0,256,17514,356,55,4662,12944,379
FORMULA StigmergyCommit-PT-06a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 446
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 146 transition count 445
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 143 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 143 transition count 439
Applied a total of 18 rules in 14 ms. Remains 143 /151 variables (removed 8) and now considering 439/454 (removed 15) transitions.
[2024-05-29 13:17:15] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:17:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 13:17:15] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-29 13:17:15] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:17:15] [INFO ] Invariant cache hit.
[2024-05-29 13:17:15] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:17:15] [INFO ] Implicit Places using invariants and state equation in 426 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 495 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/151 places, 439/454 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 13 ms. Remains 88 /142 variables (removed 54) and now considering 378/439 (removed 61) transitions.
[2024-05-29 13:17:15] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2024-05-29 13:17:15] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 13:17:15] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 13:17:15] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:17:15] [INFO ] Invariant cache hit.
[2024-05-29 13:17:15] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:17:15] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/151 places, 378/454 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 669 ms. Remains : 88/151 places, 378/454 transitions.
[2024-05-29 13:17:15] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:17:15] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:17:15] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-29 13:17:15] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:17:15] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:17:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1205199479263842988.gal : 2 ms
[2024-05-29 13:17:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16986957049787511930.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/CTLFireability1205199479263842988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16986957049787511930.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.567002,21928,2,2634,5,33772,6,0,722,21534,0


Converting to forward existential form...Done !
original formula: AX(EF(EG(AX(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EG(!(EX(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p24...178
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
Using saturation style SCC detection
(forward)formula 0,0,2.94801,84232,1,0,509,225434,775,112,11544,174360,807
FORMULA StigmergyCommit-PT-06a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 446
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 146 transition count 445
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 143 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 143 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 143 transition count 439
Applied a total of 18 rules in 5 ms. Remains 143 /151 variables (removed 8) and now considering 439/454 (removed 15) transitions.
[2024-05-29 13:17:18] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 143 cols
[2024-05-29 13:17:18] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 13:17:18] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 13:17:18] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-29 13:17:18] [INFO ] Invariant cache hit.
[2024-05-29 13:17:19] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-29 13:17:19] [INFO ] Implicit Places using invariants and state equation in 434 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 495 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/151 places, 439/454 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 10 ms. Remains 88 /142 variables (removed 54) and now considering 378/439 (removed 61) transitions.
[2024-05-29 13:17:19] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2024-05-29 13:17:19] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 13:17:19] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 13:17:19] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2024-05-29 13:17:19] [INFO ] Invariant cache hit.
[2024-05-29 13:17:19] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:17:19] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/151 places, 378/454 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 655 ms. Remains : 88/151 places, 378/454 transitions.
[2024-05-29 13:17:19] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:17:19] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:17:19] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-29 13:17:19] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:17:19] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:17:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16619229063853813401.gal : 3 ms
[2024-05-29 13:17:19] [INFO ] Time to serialize properties into /tmp/CTLFireability11046734709927370120.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/CTLFireability16619229063853813401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11046734709927370120.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.13698e+06,0.576284,21664,2,2634,5,33772,6,0,722,21534,0


Converting to forward existential form...Done !
original formula: AG(EX(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(p246==1)))))...165
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,0,1.87358,57304,1,0,458,126525,763,108,11536,78635,754
FORMULA StigmergyCommit-PT-06a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-29 13:17:21] [INFO ] Flatten gal took : 15 ms
[2024-05-29 13:17:21] [INFO ] Flatten gal took : 14 ms
Total runtime 365216 ms.

BK_STOP 1716988641629

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-06a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531700154"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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