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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 18:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 11 18:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 71K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717006938186

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 18:22:19] [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 18:22:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:22:19] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-29 18:22:19] [INFO ] Transformed 58 places.
[2024-05-29 18:22:19] [INFO ] Transformed 218 transitions.
[2024-05-29 18:22:19] [INFO ] Found NUPN structural information;
[2024-05-29 18:22:19] [INFO ] Parsed PT model containing 58 places and 218 transitions and 1238 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 110 transitions
Reduce redundant transitions removed 110 transitions.
FORMULA StigmergyElection-PT-04a-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04a-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04a-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 108/108 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 56 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 106
Applied a total of 4 rules in 17 ms. Remains 56 /58 variables (removed 2) and now considering 106/108 (removed 2) transitions.
[2024-05-29 18:22:19] [INFO ] Flow matrix only has 96 transitions (discarded 10 similar events)
// Phase 1: matrix 96 rows 56 cols
[2024-05-29 18:22:19] [INFO ] Computed 3 invariants in 11 ms
[2024-05-29 18:22:19] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-29 18:22:19] [INFO ] Flow matrix only has 96 transitions (discarded 10 similar events)
[2024-05-29 18:22:19] [INFO ] Invariant cache hit.
[2024-05-29 18:22:19] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-29 18:22:19] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-29 18:22:19] [INFO ] Flow matrix only has 96 transitions (discarded 10 similar events)
[2024-05-29 18:22:19] [INFO ] Invariant cache hit.
[2024-05-29 18:22:19] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 11 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 3 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:22:21] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:22:21] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:22:21] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:22:21] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:22:21] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-29 18:22:21] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:22:21] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:22:21] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:22:21] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:22:21] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:22:21] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:22:21] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 95/151 variables, 56/86 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 48/134 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/152 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 135 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3589 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 56/56 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 95/151 variables, 56/86 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 48/134 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 105/239 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/152 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 240 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2963 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 56/56 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 27/27 constraints]
After SMT, in 6661ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 6673ms
Starting structural reductions in LTL mode, iteration 1 : 56/58 places, 106/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6988 ms. Remains : 56/58 places, 106/108 transitions.
Support contains 33 out of 56 places after structural reductions.
[2024-05-29 18:22:26] [INFO ] Flatten gal took : 25 ms
[2024-05-29 18:22:26] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:22:26] [INFO ] Input system was already deterministic with 106 transitions.
Reduction of identical properties reduced properties to check from 42 to 41
RANDOM walk for 40000 steps (326 resets) in 1573 ms. (25 steps per ms) remains 8/41 properties
BEST_FIRST walk for 40003 steps (154 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (191 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (162 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (142 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (148 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (139 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (164 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (146 resets) in 72 ms. (548 steps per ms) remains 8/8 properties
[2024-05-29 18:22:27] [INFO ] Flow matrix only has 96 transitions (discarded 10 similar events)
[2024-05-29 18:22:27] [INFO ] Invariant cache hit.
[2024-05-29 18:22:27] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (OVERLAPS) 42/56 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 95/151 variables, 56/59 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 48/107 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/107 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/152 variables, 1/108 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/108 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/108 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 108 constraints, problems are : Problem set: 4 solved, 4 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 56/56 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp41 is UNSAT
After SMT solving in domain Int declared 56/152 variables, and 3 constraints, problems are : Problem set: 8 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/56 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
[2024-05-29 18:22:27] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:22:27] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:22:27] [INFO ] Input system was already deterministic with 106 transitions.
Support contains 28 out of 56 places (down from 30) after GAL structural reductions.
Computed a total of 10 stabilizing places and 9 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 54 transition count 97
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 46 transition count 97
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 17 place count 46 transition count 85
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 41 place count 34 transition count 85
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 49 place count 26 transition count 74
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 26 transition count 74
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 23 transition count 68
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 23 transition count 68
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 70 place count 23 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 23 transition count 57
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 82 place count 19 transition count 53
Applied a total of 82 rules in 25 ms. Remains 19 /56 variables (removed 37) and now considering 53/106 (removed 53) transitions.
[2024-05-29 18:22:27] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
// Phase 1: matrix 47 rows 19 cols
[2024-05-29 18:22:27] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:22:27] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-29 18:22:27] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2024-05-29 18:22:27] [INFO ] Invariant cache hit.
[2024-05-29 18:22:27] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-29 18:22:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-29 18:22:27] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-05-29 18:22:27] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2024-05-29 18:22:27] [INFO ] Invariant cache hit.
[2024-05-29 18:22:27] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 4 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 46/65 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 25/62 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 1/66 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 63 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-29 18:22:29] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 46/65 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 25/63 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 49/112 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 1/66 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/66 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 113 constraints, problems are : Problem set: 0 solved, 49 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 18/18 constraints]
After SMT, in 2050ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2051ms
Starting structural reductions in SI_CTL mode, iteration 1 : 19/56 places, 53/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2129 ms. Remains : 19/56 places, 53/106 transitions.
[2024-05-29 18:22:29] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:22:29] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:22:30] [INFO ] Input system was already deterministic with 53 transitions.
[2024-05-29 18:22:30] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:30] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:22:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10128837697756117080.gal : 1 ms
[2024-05-29 18:22:30] [INFO ] Time to serialize properties into /tmp/CTLFireability2247501249109898440.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/CTLFireability10128837697756117080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2247501249109898440.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,55,0.016514,3660,2,105,5,559,6,0,124,380,0


Converting to forward existential form...Done !
original formula: AF((AF((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))) * ((p1==1) + EG((((p12==0)||(p26==0))||((p40==0)||(p54==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))))) * ((p1==1) + EG((((p12==0)||(p26==0))||((p4...186
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t12, t13, t20, t22, t24, t26, t30, Intersection...240
(forward)formula 0,0,0.035632,4272,1,0,117,3373,130,41,1080,3211,152
FORMULA StigmergyElection-PT-04a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 106/106 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 51 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 51 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 47 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 47 transition count 89
Applied a total of 18 rules in 3 ms. Remains 47 /56 variables (removed 9) and now considering 89/106 (removed 17) transitions.
[2024-05-29 18:22:30] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
// Phase 1: matrix 84 rows 47 cols
[2024-05-29 18:22:30] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 18:22:30] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 18:22:30] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
[2024-05-29 18:22:30] [INFO ] Invariant cache hit.
[2024-05-29 18:22:30] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-29 18:22:30] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-29 18:22:30] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
[2024-05-29 18:22:30] [INFO ] Invariant cache hit.
[2024-05-29 18:22:30] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:22:30] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:22:31] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 83/130 variables, 47/80 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 48/128 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 18:22:32] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:22:32] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 1/131 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (OVERLAPS) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 131 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3695 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 18:22:34] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:22:34] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 83/130 variables, 47/84 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 48/132 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 88/220 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 221 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2851 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 35/35 constraints]
After SMT, in 6585ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 6588ms
Starting structural reductions in LTL mode, iteration 1 : 47/56 places, 89/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6703 ms. Remains : 47/56 places, 89/106 transitions.
[2024-05-29 18:22:36] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:22:36] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:22:36] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-29 18:22:36] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:22:36] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:22:36] [INFO ] Time to serialize gal into /tmp/CTLFireability7657674899787332904.gal : 1 ms
[2024-05-29 18:22:36] [INFO ] Time to serialize properties into /tmp/CTLFireability2116149639057918904.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/CTLFireability7657674899787332904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2116149639057918904.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,897,0.02303,4060,2,506,5,2361,6,0,270,1762,0


Converting to forward existential form...Done !
original formula: EX((((AG(A((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1))) U (((p12==1)&&(p26==1))&&((p40==1)&&(p54==1))))) * EX(EX((p53==1)))) * (EX(!(A(E(...337
=> equivalent forward existential formula: (([(FwdU((FwdU(EY((((EY(Init) * (((p26==1)&&(p40==1))&&(p54==1))) * (!(E(TRUE U !(!((E(!((((p12==1)&&(p26==1))&&...1942
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, t22, t24, t26, t27, ...293
(forward)formula 0,0,0.143702,9392,1,0,218,25137,230,88,2020,20855,284
FORMULA StigmergyElection-PT-04a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 106/106 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 56 transition count 99
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 49 transition count 99
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 45 transition count 92
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 45 transition count 92
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 42 transition count 86
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 42 transition count 86
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 39 transition count 83
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 39 transition count 83
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 41 place count 39 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 35 transition count 72
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 32 transition count 69
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 32 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 32 transition count 65
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 28 transition count 61
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 28 transition count 61
Applied a total of 69 rules in 17 ms. Remains 28 /56 variables (removed 28) and now considering 61/106 (removed 45) transitions.
[2024-05-29 18:22:36] [INFO ] Flow matrix only has 55 transitions (discarded 6 similar events)
// Phase 1: matrix 55 rows 28 cols
[2024-05-29 18:22:36] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:22:37] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 18:22:37] [INFO ] Flow matrix only has 55 transitions (discarded 6 similar events)
[2024-05-29 18:22:37] [INFO ] Invariant cache hit.
[2024-05-29 18:22:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-29 18:22:37] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-29 18:22:37] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-29 18:22:37] [INFO ] Flow matrix only has 55 transitions (discarded 6 similar events)
[2024-05-29 18:22:37] [INFO ] Invariant cache hit.
[2024-05-29 18:22:37] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 18:22:37] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 54/82 variables, 28/50 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 37/87 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 1/83 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 18:22:38] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/83 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/83 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 89 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1755 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 54/82 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 37/88 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 60/148 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 1/83 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/83 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 149 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1198 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 21/21 constraints]
After SMT, in 2976ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2976ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/56 places, 61/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3070 ms. Remains : 28/56 places, 61/106 transitions.
[2024-05-29 18:22:40] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:22:40] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:40] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-29 18:22:40] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:40] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:22:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12029012332100383086.gal : 1 ms
[2024-05-29 18:22:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7907813297127472236.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/CTLFireability12029012332100383086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7907813297127472236.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,195,0.012059,3912,2,181,5,1101,6,0,165,789,0


Converting to forward existential form...Done !
original formula: AG(A(((AF(((p10==1)&&(p57==1))) + (p14==1)) + (p33==1)) U AF((p33==1))))
=> equivalent forward existential formula: ([FwdG((FwdU(FwdU(Init,TRUE),!(!(EG(!((p33==1)))))) * !(((!(EG(!(((p10==1)&&(p57==1))))) + (p14==1)) + (p33==1))...236
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t6, t7, t8, t9, t11, t12, t13, t17, t51, t52, t53, t54, t59, Intersection wi...237
(forward)formula 0,0,0.036218,4756,1,0,118,5786,142,42,1314,5321,142
FORMULA StigmergyElection-PT-04a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 106/106 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 51 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 51 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 48 transition count 91
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 48 transition count 91
Applied a total of 16 rules in 3 ms. Remains 48 /56 variables (removed 8) and now considering 91/106 (removed 15) transitions.
[2024-05-29 18:22:40] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
// Phase 1: matrix 86 rows 48 cols
[2024-05-29 18:22:40] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:22:40] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 18:22:40] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2024-05-29 18:22:40] [INFO ] Invariant cache hit.
[2024-05-29 18:22:40] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-29 18:22:40] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-05-29 18:22:40] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2024-05-29 18:22:40] [INFO ] Invariant cache hit.
[2024-05-29 18:22:40] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:22:40] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:22:41] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:22:42] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 18:22:42] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:22:42] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 85/133 variables, 48/88 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 48/136 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 18:22:42] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (OVERLAPS) 1/134 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 14 (OVERLAPS) 0/134 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 138 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4070 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 85/133 variables, 48/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 48/137 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 90/227 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 228 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2776 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 39/39 constraints]
After SMT, in 6878ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 6879ms
Starting structural reductions in LTL mode, iteration 1 : 48/56 places, 91/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6963 ms. Remains : 48/56 places, 91/106 transitions.
[2024-05-29 18:22:47] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:22:47] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:47] [INFO ] Input system was already deterministic with 91 transitions.
[2024-05-29 18:22:47] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:47] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:22:47] [INFO ] Time to serialize gal into /tmp/CTLFireability10695597297938762452.gal : 2 ms
[2024-05-29 18:22:47] [INFO ] Time to serialize properties into /tmp/CTLFireability16721983115229733872.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/CTLFireability10695597297938762452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16721983115229733872.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,924,0.024635,4384,2,542,5,2430,6,0,276,1914,0


Converting to forward existential form...Done !
original formula: AF(((AG(A(EX((p28==1)) U A((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1))) U (((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))))) * E(!(EG((p45==...252
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(!((E(!(!((E(!((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))) U (!((((p12==1)&&(p26==1...883
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t17, t18, t19, t20, t21, t24, t26, ...298
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.236718,13620,1,0,299,53358,226,156,2213,46829,375
FORMULA StigmergyElection-PT-04a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 106/106 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 51 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 51 transition count 97
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 49 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 49 transition count 93
Applied a total of 14 rules in 3 ms. Remains 49 /56 variables (removed 7) and now considering 93/106 (removed 13) transitions.
[2024-05-29 18:22:47] [INFO ] Flow matrix only has 88 transitions (discarded 5 similar events)
// Phase 1: matrix 88 rows 49 cols
[2024-05-29 18:22:47] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 18:22:47] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 18:22:47] [INFO ] Flow matrix only has 88 transitions (discarded 5 similar events)
[2024-05-29 18:22:47] [INFO ] Invariant cache hit.
[2024-05-29 18:22:47] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-29 18:22:47] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/56 places, 93/106 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 43 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 43 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 39 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 39 transition count 84
Applied a total of 18 rules in 2 ms. Remains 39 /48 variables (removed 9) and now considering 84/93 (removed 9) transitions.
[2024-05-29 18:22:47] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
// Phase 1: matrix 79 rows 39 cols
[2024-05-29 18:22:47] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 18:22:47] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 18:22:47] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-05-29 18:22:47] [INFO ] Invariant cache hit.
[2024-05-29 18:22:47] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 18:22:47] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 39/56 places, 84/106 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 39/56 places, 84/106 transitions.
[2024-05-29 18:22:47] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:47] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:47] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-29 18:22:47] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:47] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1465616837784030651.gal : 1 ms
[2024-05-29 18:22:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12048604791547823034.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/CTLFireability1465616837784030651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12048604791547823034.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,922,0.01668,3988,2,383,5,1854,6,0,235,1533,0


Converting to forward existential form...Done !
original formula: AX(AG(A((E((p6==1) U (p34==1)) + (((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))) U ((EF((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))) + (p1...212
=> equivalent forward existential formula: ([((((FwdU(FwdU(EY(Init),TRUE),!(((E(TRUE U (((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))) + (p17!=1)) + (((p12==...566
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t8, t9, t10, t11, t13, t15, t16, t17, t18, t19, t20, t21, t22, t23, t25, ...298
(forward)formula 0,1,0.110793,8792,1,0,194,23665,202,81,1844,20880,231
FORMULA StigmergyElection-PT-04a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 106/106 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 56 transition count 98
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 48 transition count 98
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 43 transition count 89
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 43 transition count 89
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 39 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 39 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 36 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 36 transition count 78
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 36 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 36 transition count 67
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 32 transition count 63
Applied a total of 59 rules in 11 ms. Remains 32 /56 variables (removed 24) and now considering 63/106 (removed 43) transitions.
[2024-05-29 18:22:47] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
// Phase 1: matrix 58 rows 32 cols
[2024-05-29 18:22:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:22:47] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 18:22:47] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2024-05-29 18:22:47] [INFO ] Invariant cache hit.
[2024-05-29 18:22:47] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-29 18:22:47] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-29 18:22:47] [INFO ] Redundant transitions in 1 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-29 18:22:47] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2024-05-29 18:22:47] [INFO ] Invariant cache hit.
[2024-05-29 18:22:47] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-29 18:22:47] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:22:47] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:22:47] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-29 18:22:48] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 57/89 variables, 32/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 38/95 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 1/90 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (OVERLAPS) 0/90 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 96 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1933 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 57/89 variables, 32/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 38/95 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 62/157 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 1/90 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/90 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 158 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 23/23 constraints]
After SMT, in 3294ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 3296ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/56 places, 63/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3378 ms. Remains : 32/56 places, 63/106 transitions.
[2024-05-29 18:22:51] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:22:51] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:51] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-29 18:22:51] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:22:51] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14634993209235611056.gal : 2 ms
[2024-05-29 18:22:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6928201507231183257.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/CTLFireability14634993209235611056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6928201507231183257.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,140,0.014591,3924,2,262,5,1055,6,0,184,681,0


Converting to forward existential form...Done !
original formula: AF((EF((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))||(p0==0)) * AG(((p21==0)||(p57==0))))) * (EF((((p12==1)&&(p26==1))&&((p40==1)&&(p54...176
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))||(p0==0)) * !(E(TRUE U !(((p21==0)||(p57==...245
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t46, t48, t50, t52, t54, t55, t56, t57, Intersection with re...232
(forward)formula 0,1,0.073052,6352,1,0,140,12244,151,67,1398,10269,208
FORMULA StigmergyElection-PT-04a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 106/106 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 52 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 52 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 50 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 50 transition count 95
Applied a total of 12 rules in 3 ms. Remains 50 /56 variables (removed 6) and now considering 95/106 (removed 11) transitions.
[2024-05-29 18:22:51] [INFO ] Flow matrix only has 89 transitions (discarded 6 similar events)
// Phase 1: matrix 89 rows 50 cols
[2024-05-29 18:22:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:22:51] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 18:22:51] [INFO ] Flow matrix only has 89 transitions (discarded 6 similar events)
[2024-05-29 18:22:51] [INFO ] Invariant cache hit.
[2024-05-29 18:22:51] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-29 18:22:51] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/56 places, 95/106 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 43 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 43 transition count 89
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 40 transition count 86
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 40 transition count 86
Applied a total of 18 rules in 2 ms. Remains 40 /49 variables (removed 9) and now considering 86/95 (removed 9) transitions.
[2024-05-29 18:22:51] [INFO ] Flow matrix only has 80 transitions (discarded 6 similar events)
// Phase 1: matrix 80 rows 40 cols
[2024-05-29 18:22:51] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:22:51] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 18:22:51] [INFO ] Flow matrix only has 80 transitions (discarded 6 similar events)
[2024-05-29 18:22:51] [INFO ] Invariant cache hit.
[2024-05-29 18:22:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 18:22:51] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 40/56 places, 86/106 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 40/56 places, 86/106 transitions.
[2024-05-29 18:22:51] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:51] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:51] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-29 18:22:51] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:22:51] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:22:51] [INFO ] Time to serialize gal into /tmp/CTLFireability2923652553858341227.gal : 1 ms
[2024-05-29 18:22:51] [INFO ] Time to serialize properties into /tmp/CTLFireability15504851337820390920.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/CTLFireability2923652553858341227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15504851337820390920.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,939,0.01655,3996,2,374,5,1871,6,0,240,1413,0


Converting to forward existential form...Done !
original formula: AX(A(((p56==1) * (EF((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))) + AG(EX((p19==1))))) U (p30!=1)))
=> equivalent forward existential formula: (([((FwdU(EY(Init),!((p30!=1))) * !((p30!=1))) * !((p56==1)))] = FALSE * [(FwdU(((FwdU(EY(Init),!((p30!=1))) * !...302
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t8, t9, t10, t11, t13, t15, t16, t18, t19, t21, t23, t24, t26, t29, t32, ...288
Hit Full ! (commute/partial/dont) 83/0/3
(forward)formula 0,1,0.106714,8536,1,0,181,23301,205,73,1807,19773,224
FORMULA StigmergyElection-PT-04a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 54 transition count 97
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 46 transition count 97
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 17 place count 46 transition count 85
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 41 place count 34 transition count 85
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 50 place count 25 transition count 72
Iterating global reduction 2 with 9 rules applied. Total rules applied 59 place count 25 transition count 72
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 21 transition count 64
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 21 transition count 64
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 82 place count 21 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 21 transition count 45
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 94 place count 17 transition count 41
Applied a total of 94 rules in 9 ms. Remains 17 /56 variables (removed 39) and now considering 41/106 (removed 65) transitions.
[2024-05-29 18:22:51] [INFO ] Flow matrix only has 36 transitions (discarded 5 similar events)
// Phase 1: matrix 36 rows 17 cols
[2024-05-29 18:22:51] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:22:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 18:22:51] [INFO ] Flow matrix only has 36 transitions (discarded 5 similar events)
[2024-05-29 18:22:51] [INFO ] Invariant cache hit.
[2024-05-29 18:22:51] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 18:22:51] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-29 18:22:51] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2024-05-29 18:22:51] [INFO ] Flow matrix only has 36 transitions (discarded 5 similar events)
[2024-05-29 18:22:51] [INFO ] Invariant cache hit.
[2024-05-29 18:22:51] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 4/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 18:22:51] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:22:51] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:22:51] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:22:51] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:22:51] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:22:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:22:51] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:22:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:22:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:22:51] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 18:22:51] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:22:51] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:22:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:22:51] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 35/52 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 18:22:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 1/53 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 18:22:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:22:52] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/53 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/53 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 0/53 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 54 constraints, problems are : Problem set: 0 solved, 37 unsolved in 941 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 4/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 18:22:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:22:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:22:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:22:52] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:22:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 35/52 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 37/95 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 1/53 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 0/53 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 96 constraints, problems are : Problem set: 0 solved, 37 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 22/22 constraints]
After SMT, in 1613ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 1613ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/56 places, 41/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1694 ms. Remains : 17/56 places, 41/106 transitions.
[2024-05-29 18:22:53] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:22:53] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:22:53] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-29 18:22:53] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:22:53] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:22:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15922110284588229988.gal : 0 ms
[2024-05-29 18:22:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1904639814924452000.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/CTLFireability15922110284588229988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1904639814924452000.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,39,0.006408,3672,2,97,5,500,6,0,105,325,0


Converting to forward existential form...Done !
original formula: EF(AG((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t18, t20, t22, t24, Intersection with reac...230
(forward)formula 0,0,0.015398,3988,1,0,84,2154,98,25,793,1730,86
FORMULA StigmergyElection-PT-04a-CTLFireability-2024-10 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 : 56/56 places, 106/106 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 51 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 51 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 47 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 47 transition count 89
Applied a total of 18 rules in 3 ms. Remains 47 /56 variables (removed 9) and now considering 89/106 (removed 17) transitions.
[2024-05-29 18:22:53] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
// Phase 1: matrix 84 rows 47 cols
[2024-05-29 18:22:53] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:22:53] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 18:22:53] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
[2024-05-29 18:22:53] [INFO ] Invariant cache hit.
[2024-05-29 18:22:53] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-29 18:22:53] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-29 18:22:53] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
[2024-05-29 18:22:53] [INFO ] Invariant cache hit.
[2024-05-29 18:22:53] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:22:53] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 2 ms to minimize.
[2024-05-29 18:22:54] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 83/130 variables, 47/80 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 48/128 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 18:22:55] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:22:55] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 1/131 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (OVERLAPS) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 131 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3639 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 18:22:57] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:22:57] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 83/130 variables, 47/84 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 48/132 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 88/220 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 221 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2906 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 35/35 constraints]
After SMT, in 6584ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 6585ms
Starting structural reductions in LTL mode, iteration 1 : 47/56 places, 89/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6662 ms. Remains : 47/56 places, 89/106 transitions.
[2024-05-29 18:22:59] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:22:59] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:22:59] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-29 18:22:59] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:59] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:22:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7988601661512824420.gal : 2 ms
[2024-05-29 18:22:59] [INFO ] Time to serialize properties into /tmp/CTLFireability6314445770703009075.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/CTLFireability7988601661512824420.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6314445770703009075.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,897,0.024364,4064,2,506,5,2361,6,0,270,1762,0


Converting to forward existential form...Done !
original formula: AG((EX((AX((((p12==0)||(p26==0))||((p40==0)||(p54==0)))) * EF(((p7==1)&&(p57==1))))) * AF((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX((!(EX(!((((p12==0)||(p26==0))||((p40==0)||(p54==0)))))) * E(TRUE U ((p7==1)&&(p57==1))...252
Hit Full ! (commute/partial/dont) 38/0/51
(forward)formula 0,0,0.08901,7548,1,0,17,15514,20,1,1566,11671,17
FORMULA StigmergyElection-PT-04a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 106/106 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 51 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 51 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 47 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 47 transition count 89
Applied a total of 18 rules in 7 ms. Remains 47 /56 variables (removed 9) and now considering 89/106 (removed 17) transitions.
[2024-05-29 18:22:59] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
[2024-05-29 18:22:59] [INFO ] Invariant cache hit.
[2024-05-29 18:22:59] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 18:22:59] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
[2024-05-29 18:22:59] [INFO ] Invariant cache hit.
[2024-05-29 18:23:00] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/56 places, 89/106 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 38 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 38 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 34 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 34 transition count 77
Applied a total of 24 rules in 2 ms. Remains 34 /46 variables (removed 12) and now considering 77/89 (removed 12) transitions.
[2024-05-29 18:23:00] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
// Phase 1: matrix 72 rows 34 cols
[2024-05-29 18:23:00] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 18:23:00] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2024-05-29 18:23:00] [INFO ] Invariant cache hit.
[2024-05-29 18:23:00] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 34/56 places, 77/106 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 34/56 places, 77/106 transitions.
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:23:00] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:23:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17911662650992961514.gal : 5 ms
[2024-05-29 18:23:00] [INFO ] Time to serialize properties into /tmp/CTLFireability2641974137865196023.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/CTLFireability17911662650992961514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2641974137865196023.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,714,0.018479,3952,2,237,5,1280,6,0,208,871,0


Converting to forward existential form...Done !
original formula: EG(AX(AF((((p12==0)||(p26==0))||((p40==0)||(p54==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!((((p12==0)||(p26==0))||((p40==0)||(p54==0))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t29, t30, t32, t33, t69, t71, t73, t75,...254
(forward)formula 0,0,0.059706,5852,1,0,149,8872,175,65,1606,8412,186
FORMULA StigmergyElection-PT-04a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 106/106 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 51 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 51 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 48 transition count 91
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 48 transition count 91
Applied a total of 16 rules in 6 ms. Remains 48 /56 variables (removed 8) and now considering 91/106 (removed 15) transitions.
[2024-05-29 18:23:00] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
// Phase 1: matrix 86 rows 48 cols
[2024-05-29 18:23:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 18:23:00] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2024-05-29 18:23:00] [INFO ] Invariant cache hit.
[2024-05-29 18:23:00] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/56 places, 91/106 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 40 transition count 84
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 40 transition count 84
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 36 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 36 transition count 80
Applied a total of 22 rules in 2 ms. Remains 36 /47 variables (removed 11) and now considering 80/91 (removed 11) transitions.
[2024-05-29 18:23:00] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
// Phase 1: matrix 75 rows 36 cols
[2024-05-29 18:23:00] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 18:23:00] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
[2024-05-29 18:23:00] [INFO ] Invariant cache hit.
[2024-05-29 18:23:00] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 36/56 places, 80/106 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 175 ms. Remains : 36/56 places, 80/106 transitions.
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:23:00] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:23:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17100149554045778066.gal : 1 ms
[2024-05-29 18:23:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9441766194165851454.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/CTLFireability17100149554045778066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9441766194165851454.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,842,0.014952,3964,2,278,5,1503,6,0,219,1006,0


Converting to forward existential form...Done !
original formula: EX(AG((p44==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((p44==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t6, t8, t10, t11, t13, t15, t16, t18, t20, t21, t25, t26, t27, t32, t33, t35,...279
(forward)formula 0,0,0.050355,5600,1,0,142,9474,176,49,1617,7092,164
FORMULA StigmergyElection-PT-04a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 106/106 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 52 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 52 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 49 transition count 93
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 49 transition count 93
Applied a total of 14 rules in 4 ms. Remains 49 /56 variables (removed 7) and now considering 93/106 (removed 13) transitions.
[2024-05-29 18:23:00] [INFO ] Flow matrix only has 87 transitions (discarded 6 similar events)
// Phase 1: matrix 87 rows 49 cols
[2024-05-29 18:23:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 18:23:00] [INFO ] Flow matrix only has 87 transitions (discarded 6 similar events)
[2024-05-29 18:23:00] [INFO ] Invariant cache hit.
[2024-05-29 18:23:00] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/56 places, 93/106 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 42 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 42 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 39 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 39 transition count 84
Applied a total of 18 rules in 1 ms. Remains 39 /48 variables (removed 9) and now considering 84/93 (removed 9) transitions.
[2024-05-29 18:23:00] [INFO ] Flow matrix only has 78 transitions (discarded 6 similar events)
// Phase 1: matrix 78 rows 39 cols
[2024-05-29 18:23:00] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 18:23:00] [INFO ] Flow matrix only has 78 transitions (discarded 6 similar events)
[2024-05-29 18:23:00] [INFO ] Invariant cache hit.
[2024-05-29 18:23:00] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 39/56 places, 84/106 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 39/56 places, 84/106 transitions.
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:23:00] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:23:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8820676157003086322.gal : 1 ms
[2024-05-29 18:23:00] [INFO ] Time to serialize properties into /tmp/CTLFireability2341234285927539284.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/CTLFireability8820676157003086322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2341234285927539284.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,923,0.01776,3980,2,357,5,1861,6,0,234,1411,0


Converting to forward existential form...Done !
original formula: AF(((AX(!(A((p45==1) U (p5==1)))) + EX(((((p14==1)||(p12==0))||((p26==0)||(p40==0)))||(p54==0)))) + ((p6==0) * AG(AX((((p12==0)||(p26==0)...184
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!(!(!((E(!((p5==1)) U (!((p45==1)) * !((p5==1)))) + EG(!((p5==1))))))))) + EX(((((p14==1)||(...296
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t22, t25, t26, t29, t32, t34, ...283
(forward)formula 0,1,0.106416,8520,1,0,191,24470,201,81,1788,20942,238
FORMULA StigmergyElection-PT-04a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 106/106 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 52 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 52 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 50 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 50 transition count 95
Applied a total of 12 rules in 4 ms. Remains 50 /56 variables (removed 6) and now considering 95/106 (removed 11) transitions.
[2024-05-29 18:23:00] [INFO ] Flow matrix only has 89 transitions (discarded 6 similar events)
// Phase 1: matrix 89 rows 50 cols
[2024-05-29 18:23:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 18:23:00] [INFO ] Flow matrix only has 89 transitions (discarded 6 similar events)
[2024-05-29 18:23:00] [INFO ] Invariant cache hit.
[2024-05-29 18:23:00] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/56 places, 95/106 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 43 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 43 transition count 89
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 39 transition count 85
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 39 transition count 85
Applied a total of 20 rules in 1 ms. Remains 39 /49 variables (removed 10) and now considering 85/95 (removed 10) transitions.
[2024-05-29 18:23:00] [INFO ] Flow matrix only has 79 transitions (discarded 6 similar events)
// Phase 1: matrix 79 rows 39 cols
[2024-05-29 18:23:00] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 18:23:00] [INFO ] Flow matrix only has 79 transitions (discarded 6 similar events)
[2024-05-29 18:23:00] [INFO ] Invariant cache hit.
[2024-05-29 18:23:00] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 18:23:00] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 39/56 places, 85/106 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 39/56 places, 85/106 transitions.
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:23:00] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:23:00] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:23:00] [INFO ] Time to serialize gal into /tmp/CTLFireability10083935835539857906.gal : 1 ms
[2024-05-29 18:23:00] [INFO ] Time to serialize properties into /tmp/CTLFireability5217607219931064862.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/CTLFireability10083935835539857906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5217607219931064862.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,938,0.020263,3988,2,351,5,1879,6,0,235,1328,0


Converting to forward existential form...Done !
original formula: EX((((((p47==1) + EX((((p12==0)||(p26==0))||((p40==0)||(p54==0))))) + AX(EF((p53==0)))) * (EG(((p20==0)&&(((p12==0)||(p26==0))||((p40==0)...324
=> equivalent forward existential formula: ([(FwdU((EY(Init) * ((((p47==1) + EX((((p12==0)||(p26==0))||((p40==0)||(p54==0))))) + !(EX(!(E(TRUE U (p53==0)))...629
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t15, t16, t17, t18, t19, t21, t23, t24, t30, t31, t36,...289
(forward)formula 0,0,0.115703,8528,1,0,248,26662,198,98,1767,22163,311
FORMULA StigmergyElection-PT-04a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-29 18:23:01] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:23:01] [INFO ] Flatten gal took : 3 ms
Total runtime 41731 ms.

BK_STOP 1717006981086

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-04a, 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-171690532000282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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