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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 11 18:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 145K Apr 11 18:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 565K 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-06a-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-06a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717008473214

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 18:47:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:47:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:47:54] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-05-29 18:47:54] [INFO ] Transformed 86 places.
[2024-05-29 18:47:54] [INFO ] Transformed 1042 transitions.
[2024-05-29 18:47:54] [INFO ] Found NUPN structural information;
[2024-05-29 18:47:54] [INFO ] Parsed PT model containing 86 places and 1042 transitions and 11192 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
FORMULA StigmergyElection-PT-06a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 242/242 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 80 transition count 233
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 80 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 79 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 79 transition count 231
Applied a total of 14 rules in 30 ms. Remains 79 /86 variables (removed 7) and now considering 231/242 (removed 11) transitions.
[2024-05-29 18:47:54] [INFO ] Flow matrix only has 219 transitions (discarded 12 similar events)
// Phase 1: matrix 219 rows 79 cols
[2024-05-29 18:47:54] [INFO ] Computed 4 invariants in 16 ms
[2024-05-29 18:47:54] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-29 18:47:54] [INFO ] Flow matrix only has 219 transitions (discarded 12 similar events)
[2024-05-29 18:47:54] [INFO ] Invariant cache hit.
[2024-05-29 18:47:54] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:47:55] [INFO ] Implicit Places using invariants and state equation in 179 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 400 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/86 places, 231/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 77 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 77 transition count 230
Applied a total of 2 rules in 4 ms. Remains 77 /78 variables (removed 1) and now considering 230/231 (removed 1) transitions.
[2024-05-29 18:47:55] [INFO ] Flow matrix only has 218 transitions (discarded 12 similar events)
// Phase 1: matrix 218 rows 77 cols
[2024-05-29 18:47:55] [INFO ] Computed 3 invariants in 5 ms
[2024-05-29 18:47:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 18:47:55] [INFO ] Flow matrix only has 218 transitions (discarded 12 similar events)
[2024-05-29 18:47:55] [INFO ] Invariant cache hit.
[2024-05-29 18:47:55] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:47:55] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 77/86 places, 230/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 608 ms. Remains : 77/86 places, 230/242 transitions.
Support contains 26 out of 77 places after structural reductions.
[2024-05-29 18:47:55] [INFO ] Flatten gal took : 41 ms
[2024-05-29 18:47:55] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:47:55] [INFO ] Input system was already deterministic with 230 transitions.
RANDOM walk for 7216 steps (16 resets) in 370 ms. (19 steps per ms) remains 0/15 properties
FORMULA StigmergyElection-PT-06a-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 12 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(p2)&&p1))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 230/230 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 63 transition count 211
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 63 transition count 211
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 55 transition count 202
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 55 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 54 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 54 transition count 201
Applied a total of 46 rules in 9 ms. Remains 54 /77 variables (removed 23) and now considering 201/230 (removed 29) transitions.
[2024-05-29 18:47:56] [INFO ] Flow matrix only has 194 transitions (discarded 7 similar events)
// Phase 1: matrix 194 rows 54 cols
[2024-05-29 18:47:56] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 18:47:56] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 18:47:56] [INFO ] Flow matrix only has 194 transitions (discarded 7 similar events)
[2024-05-29 18:47:56] [INFO ] Invariant cache hit.
[2024-05-29 18:47:56] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:47:56] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-29 18:47:56] [INFO ] Flow matrix only has 194 transitions (discarded 7 similar events)
[2024-05-29 18:47:56] [INFO ] Invariant cache hit.
[2024-05-29 18:47:56] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 8 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 2 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:47:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 4 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:47:58] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:47:59] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:48:00] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:48:00] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-29 18:48:00] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:48:00] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:48:00] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-29 18:48:00] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 193/247 variables, 54/110 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 130/240 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-29 18:48:02] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:48:02] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 12 (OVERLAPS) 1/248 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 14 (OVERLAPS) 0/248 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 243 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11931 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-29 18:48:09] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:48:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:48:09] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:48:09] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-29 18:48:10] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:48:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-29 18:48:10] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 193/247 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 130/249 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 200/449 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (OVERLAPS) 1/248 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 13 (OVERLAPS) 0/248 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 450 constraints, problems are : Problem set: 0 solved, 200 unsolved in 21573 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 64/64 constraints]
After SMT, in 34114ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 34125ms
Starting structural reductions in LTL mode, iteration 1 : 54/77 places, 201/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34299 ms. Remains : 54/77 places, 201/230 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-06a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLCardinality-02 finished in 34625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U G(p1))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 230/230 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 65 transition count 214
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 65 transition count 214
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 58 transition count 205
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 58 transition count 205
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 56 transition count 203
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 56 transition count 203
Applied a total of 42 rules in 7 ms. Remains 56 /77 variables (removed 21) and now considering 203/230 (removed 27) transitions.
[2024-05-29 18:48:30] [INFO ] Flow matrix only has 196 transitions (discarded 7 similar events)
// Phase 1: matrix 196 rows 56 cols
[2024-05-29 18:48:30] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:48:30] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 18:48:30] [INFO ] Flow matrix only has 196 transitions (discarded 7 similar events)
[2024-05-29 18:48:30] [INFO ] Invariant cache hit.
[2024-05-29 18:48:30] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:48:30] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-29 18:48:30] [INFO ] Flow matrix only has 196 transitions (discarded 7 similar events)
[2024-05-29 18:48:30] [INFO ] Invariant cache hit.
[2024-05-29 18:48:30] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 18:48:31] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 18:48:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:48:32] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:48:33] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 18:48:34] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:48:34] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:48:34] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:48:34] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:48:34] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-29 18:48:34] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:48:34] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 18:48:34] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:48:34] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:48:34] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:48:34] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:48:34] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 18:48:35] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:48:35] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:48:35] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 18:48:36] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 18:48:36] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:48:36] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 18:48:36] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:48:36] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (OVERLAPS) 195/251 variables, 56/117 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 130/247 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-29 18:48:40] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 15 (OVERLAPS) 1/252 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 17 (OVERLAPS) 0/252 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 249 constraints, problems are : Problem set: 0 solved, 202 unsolved in 14682 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 195/251 variables, 56/118 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 130/248 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 202/450 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 451 constraints, problems are : Problem set: 0 solved, 202 unsolved in 22118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 61/61 constraints]
After SMT, in 37287ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 37291ms
Starting structural reductions in LTL mode, iteration 1 : 56/77 places, 203/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37419 ms. Remains : 56/77 places, 203/230 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 153 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 28 in 0 ms.
FORMULA StigmergyElection-PT-06a-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyElection-PT-06a-LTLCardinality-04 finished in 37792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 230/230 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 64 transition count 212
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 64 transition count 212
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 55 transition count 200
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 55 transition count 200
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 52 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 52 transition count 197
Applied a total of 50 rules in 9 ms. Remains 52 /77 variables (removed 25) and now considering 197/230 (removed 33) transitions.
[2024-05-29 18:49:08] [INFO ] Flow matrix only has 190 transitions (discarded 7 similar events)
// Phase 1: matrix 190 rows 52 cols
[2024-05-29 18:49:08] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:49:08] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 18:49:08] [INFO ] Flow matrix only has 190 transitions (discarded 7 similar events)
[2024-05-29 18:49:08] [INFO ] Invariant cache hit.
[2024-05-29 18:49:08] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:49:08] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-29 18:49:08] [INFO ] Flow matrix only has 190 transitions (discarded 7 similar events)
[2024-05-29 18:49:08] [INFO ] Invariant cache hit.
[2024-05-29 18:49:08] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 18:49:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:49:09] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:49:09] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:49:09] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:49:09] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:49:09] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:49:09] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:49:09] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:49:09] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:49:09] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:49:09] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:49:10] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 18:49:11] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:49:11] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:49:11] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:49:11] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:49:11] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:49:11] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:49:11] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:49:11] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:49:11] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:49:11] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 18:49:11] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:49:12] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:49:12] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:49:12] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:49:12] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:49:12] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:49:12] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:49:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 18:49:12] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:49:12] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 189/241 variables, 52/108 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 130/238 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 1/242 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 13 (OVERLAPS) 0/242 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 239 constraints, problems are : Problem set: 0 solved, 196 unsolved in 10589 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 189/241 variables, 52/111 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 130/241 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 196/437 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 1/242 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 438 constraints, problems are : Problem set: 0 solved, 196 unsolved in 20281 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 58/58 constraints]
After SMT, in 31214ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 31216ms
Starting structural reductions in LTL mode, iteration 1 : 52/77 places, 197/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31350 ms. Remains : 52/77 places, 197/230 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLCardinality-07
Product exploration explored 100000 steps with 14847 reset in 173 ms.
Product exploration explored 100000 steps with 14856 reset in 233 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/52 stabilizing places and 3/197 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 18:49:41] [INFO ] Flow matrix only has 190 transitions (discarded 7 similar events)
[2024-05-29 18:49:41] [INFO ] Invariant cache hit.
[2024-05-29 18:49:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 18:49:41] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-29 18:49:41] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:49:41] [INFO ] [Real]Added 131 Read/Feed constraints in 14 ms returned sat
[2024-05-29 18:49:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:49:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 18:49:41] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-29 18:49:41] [INFO ] [Nat]Added 131 Read/Feed constraints in 11 ms returned sat
[2024-05-29 18:49:41] [INFO ] Computed and/alt/rep : 44/49/44 causal constraints (skipped 145 transitions) in 20 ms.
[2024-05-29 18:49:41] [INFO ] Added : 21 causal constraints over 5 iterations in 94 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-05-29 18:49:41] [INFO ] Flow matrix only has 190 transitions (discarded 7 similar events)
[2024-05-29 18:49:41] [INFO ] Invariant cache hit.
[2024-05-29 18:49:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 18:49:41] [INFO ] Flow matrix only has 190 transitions (discarded 7 similar events)
[2024-05-29 18:49:41] [INFO ] Invariant cache hit.
[2024-05-29 18:49:41] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:49:41] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-29 18:49:41] [INFO ] Flow matrix only has 190 transitions (discarded 7 similar events)
[2024-05-29 18:49:41] [INFO ] Invariant cache hit.
[2024-05-29 18:49:41] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:49:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:49:44] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:49:45] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:49:45] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 18:49:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:49:45] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 189/241 variables, 52/108 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 130/238 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 1/242 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 13 (OVERLAPS) 0/242 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 239 constraints, problems are : Problem set: 0 solved, 196 unsolved in 10343 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 18:49:53] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:49:53] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 18:49:53] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 189/241 variables, 52/111 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 130/241 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 196/437 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 1/242 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 438 constraints, problems are : Problem set: 0 solved, 196 unsolved in 19423 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 58/58 constraints]
After SMT, in 30147ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 30151ms
Finished structural reductions in LTL mode , in 1 iterations and 30281 ms. Remains : 52/52 places, 197/197 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/52 stabilizing places and 3/197 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 19 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 18:50:12] [INFO ] Flow matrix only has 190 transitions (discarded 7 similar events)
[2024-05-29 18:50:12] [INFO ] Invariant cache hit.
[2024-05-29 18:50:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 18:50:12] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-29 18:50:12] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:50:12] [INFO ] [Real]Added 131 Read/Feed constraints in 10 ms returned sat
[2024-05-29 18:50:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:50:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 18:50:12] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-29 18:50:12] [INFO ] [Nat]Added 131 Read/Feed constraints in 11 ms returned sat
[2024-05-29 18:50:12] [INFO ] Computed and/alt/rep : 44/49/44 causal constraints (skipped 145 transitions) in 18 ms.
[2024-05-29 18:50:12] [INFO ] Added : 21 causal constraints over 5 iterations in 95 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14787 reset in 112 ms.
Product exploration explored 100000 steps with 14786 reset in 115 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 197/197 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 52 transition count 197
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 7 place count 52 transition count 203
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 52 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 51 transition count 202
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 51 transition count 202
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 32 place count 51 transition count 208
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 101 place count 51 transition count 139
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 106 place count 46 transition count 134
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 111 place count 46 transition count 134
Deduced a syphon composed of 24 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 2 with 75 rules applied. Total rules applied 186 place count 46 transition count 59
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 192 place count 46 transition count 59
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 204 place count 34 transition count 47
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 216 place count 34 transition count 47
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 216 rules in 46 ms. Remains 34 /52 variables (removed 18) and now considering 47/197 (removed 150) transitions.
[2024-05-29 18:50:13] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-29 18:50:13] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 34 cols
[2024-05-29 18:50:13] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:50:13] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 3 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:50:13] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 18:50:14] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:50:14] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 18:50:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:50:14] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:50:14] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:50:14] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:50:14] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:50:14] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-29 18:50:14] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 7 (OVERLAPS) 40/74 variables, 34/70 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 6/76 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/76 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 1/75 variables, 1/77 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/77 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 0/75 variables, 0/77 constraints. Problems are: Problem set: 24 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 77 constraints, problems are : Problem set: 24 solved, 22 unsolved in 1512 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 24 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 19/34 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 35/36 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/36 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 40/74 variables, 34/70 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 6/76 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 22/98 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/98 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 1/75 variables, 1/99 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/99 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/75 variables, 0/99 constraints. Problems are: Problem set: 24 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 99 constraints, problems are : Problem set: 24 solved, 22 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 22/46 constraints, Known Traps: 35/35 constraints]
After SMT, in 2228ms problems are : Problem set: 24 solved, 22 unsolved
Search for dead transitions found 24 dead transitions in 2229ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 34/52 places, 23/197 transitions.
Graph (complete) has 99 edges and 34 vertex of which 16 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 16 /34 variables (removed 18) and now considering 23/23 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/52 places, 23/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2287 ms. Remains : 16/52 places, 23/197 transitions.
Built C files in :
/tmp/ltsmin1667269367879921991
[2024-05-29 18:50:15] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1667269367879921991
Running compilation step : cd /tmp/ltsmin1667269367879921991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 522 ms.
Running link step : cd /tmp/ltsmin1667269367879921991;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1667269367879921991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4865186523896267228.hoa' '--buchi-type=spotba'
LTSmin run took 417 ms.
FORMULA StigmergyElection-PT-06a-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-06a-LTLCardinality-07 finished in 68018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0) U p0))&&G(F(p1))))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 230/230 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 67 transition count 217
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 67 transition count 217
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 61 transition count 210
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 61 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 60 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 60 transition count 209
Applied a total of 34 rules in 10 ms. Remains 60 /77 variables (removed 17) and now considering 209/230 (removed 21) transitions.
[2024-05-29 18:50:16] [INFO ] Flow matrix only has 200 transitions (discarded 9 similar events)
// Phase 1: matrix 200 rows 60 cols
[2024-05-29 18:50:16] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:50:16] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 18:50:16] [INFO ] Flow matrix only has 200 transitions (discarded 9 similar events)
[2024-05-29 18:50:16] [INFO ] Invariant cache hit.
[2024-05-29 18:50:16] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:50:16] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-29 18:50:16] [INFO ] Flow matrix only has 200 transitions (discarded 9 similar events)
[2024-05-29 18:50:16] [INFO ] Invariant cache hit.
[2024-05-29 18:50:16] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-29 18:50:17] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 18:50:17] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:50:17] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:50:17] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:50:17] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:50:17] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:50:17] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:50:17] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:50:18] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:50:19] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:50:19] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:50:19] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:50:19] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:50:19] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:50:19] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:50:19] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-29 18:50:19] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:50:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-29 18:50:21] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:50:21] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:50:21] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:50:21] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:50:21] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 199/259 variables, 60/122 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 130/252 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 11 (OVERLAPS) 1/260 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 13 (OVERLAPS) 0/260 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 253 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12777 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-29 18:50:30] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:50:30] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 199/259 variables, 60/124 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 130/254 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 208/462 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 9 (OVERLAPS) 1/260 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 11 (OVERLAPS) 0/260 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 463 constraints, problems are : Problem set: 0 solved, 208 unsolved in 21386 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 63/63 constraints]
After SMT, in 34512ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 34515ms
Starting structural reductions in LTL mode, iteration 1 : 60/77 places, 209/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34643 ms. Remains : 60/77 places, 209/230 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : StigmergyElection-PT-06a-LTLCardinality-08
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-06a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLCardinality-08 finished in 34872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0&&X(p1)) U (p2&&G(F(p3)))))))'
Support contains 7 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 230/230 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 67 transition count 216
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 67 transition count 216
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 61 transition count 207
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 61 transition count 207
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 58 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 58 transition count 204
Applied a total of 38 rules in 9 ms. Remains 58 /77 variables (removed 19) and now considering 204/230 (removed 26) transitions.
[2024-05-29 18:50:51] [INFO ] Flow matrix only has 197 transitions (discarded 7 similar events)
// Phase 1: matrix 197 rows 58 cols
[2024-05-29 18:50:51] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:50:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 18:50:51] [INFO ] Flow matrix only has 197 transitions (discarded 7 similar events)
[2024-05-29 18:50:51] [INFO ] Invariant cache hit.
[2024-05-29 18:50:51] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:50:51] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-29 18:50:51] [INFO ] Flow matrix only has 197 transitions (discarded 7 similar events)
[2024-05-29 18:50:51] [INFO ] Invariant cache hit.
[2024-05-29 18:50:51] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:50:54] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:50:54] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:50:54] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:50:54] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 18:50:54] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:50:54] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:50:54] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:50:54] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:50:55] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 18:50:55] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:50:55] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 18:50:55] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:50:55] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:50:55] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:50:55] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:50:55] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 18:50:56] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:50:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:50:56] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 196/254 variables, 58/114 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 130/244 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 18:50:58] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:50:58] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 13 (OVERLAPS) 1/255 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 15 (OVERLAPS) 0/255 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 247 constraints, problems are : Problem set: 0 solved, 203 unsolved in 14672 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 18:51:07] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 196/254 variables, 58/117 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 130/247 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 203/450 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 1/255 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 451 constraints, problems are : Problem set: 0 solved, 203 unsolved in 19261 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 58/58 constraints]
After SMT, in 34300ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 34302ms
Starting structural reductions in LTL mode, iteration 1 : 58/77 places, 204/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34419 ms. Remains : 58/77 places, 204/230 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLCardinality-09
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-06a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLCardinality-09 finished in 34599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 230/230 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 76 transition count 207
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 54 transition count 207
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 44 place count 54 transition count 198
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 62 place count 45 transition count 198
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 69 place count 38 transition count 187
Iterating global reduction 2 with 7 rules applied. Total rules applied 76 place count 38 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 38 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 79 place count 38 transition count 183
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 37 transition count 183
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 35 transition count 179
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 35 transition count 179
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 97 place count 35 transition count 167
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 111 place count 28 transition count 160
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 117 place count 28 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 5 with 102 rules applied. Total rules applied 219 place count 28 transition count 52
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 231 place count 22 transition count 46
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 237 place count 16 transition count 40
Applied a total of 237 rules in 30 ms. Remains 16 /77 variables (removed 61) and now considering 40/230 (removed 190) transitions.
[2024-05-29 18:51:26] [INFO ] Flow matrix only has 33 transitions (discarded 7 similar events)
// Phase 1: matrix 33 rows 16 cols
[2024-05-29 18:51:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:51:26] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 18:51:26] [INFO ] Flow matrix only has 33 transitions (discarded 7 similar events)
[2024-05-29 18:51:26] [INFO ] Invariant cache hit.
[2024-05-29 18:51:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 18:51:26] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-29 18:51:26] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-29 18:51:26] [INFO ] Flow matrix only has 33 transitions (discarded 7 similar events)
[2024-05-29 18:51:26] [INFO ] Invariant cache hit.
[2024-05-29 18:51:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 6/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 32/48 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 0/49 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 44 constraints, problems are : Problem set: 0 solved, 18 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 6/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-29 18:51:26] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 32/48 variables, 16/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/49 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 63 constraints, problems are : Problem set: 0 solved, 18 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 27/27 constraints]
After SMT, in 1057ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 1058ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/77 places, 40/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1153 ms. Remains : 16/77 places, 40/230 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLCardinality-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLCardinality-12 finished in 1212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 230/230 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 65 transition count 213
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 65 transition count 213
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 56 transition count 201
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 56 transition count 201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 54 transition count 199
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 54 transition count 199
Applied a total of 46 rules in 5 ms. Remains 54 /77 variables (removed 23) and now considering 199/230 (removed 31) transitions.
[2024-05-29 18:51:27] [INFO ] Flow matrix only has 192 transitions (discarded 7 similar events)
// Phase 1: matrix 192 rows 54 cols
[2024-05-29 18:51:27] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 18:51:27] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 18:51:27] [INFO ] Flow matrix only has 192 transitions (discarded 7 similar events)
[2024-05-29 18:51:27] [INFO ] Invariant cache hit.
[2024-05-29 18:51:27] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:51:27] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-29 18:51:27] [INFO ] Flow matrix only has 192 transitions (discarded 7 similar events)
[2024-05-29 18:51:27] [INFO ] Invariant cache hit.
[2024-05-29 18:51:27] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:51:28] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:51:29] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-29 18:51:30] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:51:30] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:51:30] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:51:30] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:51:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:51:30] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:51:30] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-29 18:51:30] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:51:30] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:51:31] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:51:31] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-29 18:51:31] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:51:31] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:51:31] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:51:31] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:51:31] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:51:31] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 191/245 variables, 54/112 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 130/242 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 1/246 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (OVERLAPS) 0/246 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 243 constraints, problems are : Problem set: 0 solved, 198 unsolved in 11101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-29 18:51:39] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 191/245 variables, 54/113 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 130/243 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 198/441 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 1/246 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (OVERLAPS) 0/246 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 444 constraints, problems are : Problem set: 0 solved, 198 unsolved in 24585 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 60/60 constraints]
After SMT, in 36088ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 36090ms
Starting structural reductions in LTL mode, iteration 1 : 54/77 places, 199/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36218 ms. Remains : 54/77 places, 199/230 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLCardinality-15
Stuttering criterion allowed to conclude after 40506 steps with 13530 reset in 73 ms.
FORMULA StigmergyElection-PT-06a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLCardinality-15 finished in 36491 ms.
All properties solved by simple procedures.
Total runtime 249441 ms.

BK_STOP 1717008723761

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-06a"
export BK_EXAMINATION="LTLCardinality"
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-06a, examination is LTLCardinality"
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-171690532100315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-06a.tgz
mv StigmergyElection-PT-06a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;