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

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

=== Now, execution of the tool begins

BK_START 1717008554212

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202405141337
[2024-05-29 18:49:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:49:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:49:15] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-29 18:49:15] [INFO ] Transformed 86 places.
[2024-05-29 18:49:15] [INFO ] Transformed 1042 transitions.
[2024-05-29 18:49:15] [INFO ] Found NUPN structural information;
[2024-05-29 18:49:15] [INFO ] Parsed PT model containing 86 places and 1042 transitions and 11192 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
FORMULA StigmergyElection-PT-06a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 242/242 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 75 transition count 225
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 75 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 70 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 70 transition count 215
Applied a total of 32 rules in 38 ms. Remains 70 /86 variables (removed 16) and now considering 215/242 (removed 27) transitions.
[2024-05-29 18:49:15] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
// Phase 1: matrix 208 rows 70 cols
[2024-05-29 18:49:15] [INFO ] Computed 2 invariants in 13 ms
[2024-05-29 18:49:16] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-29 18:49:16] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
[2024-05-29 18:49:16] [INFO ] Invariant cache hit.
[2024-05-29 18:49:16] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 18:49:16] [INFO ] Implicit Places using invariants and state equation in 177 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 401 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/86 places, 215/242 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 59 transition count 205
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 59 transition count 205
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 53 transition count 199
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 53 transition count 199
Applied a total of 32 rules in 6 ms. Remains 53 /69 variables (removed 16) and now considering 199/215 (removed 16) transitions.
[2024-05-29 18:49:16] [INFO ] Flow matrix only has 192 transitions (discarded 7 similar events)
// Phase 1: matrix 192 rows 53 cols
[2024-05-29 18:49:16] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 18:49:16] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 18:49:16] [INFO ] Flow matrix only has 192 transitions (discarded 7 similar events)
[2024-05-29 18:49:16] [INFO ] Invariant cache hit.
[2024-05-29 18:49:16] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:49:16] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 53/86 places, 199/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 612 ms. Remains : 53/86 places, 199/242 transitions.
Support contains 8 out of 53 places after structural reductions.
[2024-05-29 18:49:16] [INFO ] Flatten gal took : 40 ms
[2024-05-29 18:49:16] [INFO ] Flatten gal took : 18 ms
[2024-05-29 18:49:16] [INFO ] Input system was already deterministic with 199 transitions.
Reduction of identical properties reduced properties to check from 8 to 5
RANDOM walk for 202 steps (0 resets) in 44 ms. (4 steps per ms) remains 0/5 properties
Computed a total of 1 stabilizing places and 1 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((F(p0)&&(X(p0)||p1))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 50 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 50 transition count 195
Applied a total of 6 rules in 16 ms. Remains 50 /53 variables (removed 3) and now considering 195/199 (removed 4) transitions.
[2024-05-29 18:49:17] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-05-29 18:49:17] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 18:49:17] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 18:49:17] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:49:17] [INFO ] Invariant cache hit.
[2024-05-29 18:49:17] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:49:17] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-29 18:49:17] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:49:17] [INFO ] Invariant cache hit.
[2024-05-29 18:49:17] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:49:18] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 7 ms to minimize.
[2024-05-29 18:49:18] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:49:18] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:49:18] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:49:18] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:49:18] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:49:18] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:49:18] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:49:18] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:49:18] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:49:18] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:49:18] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:49:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:49:19] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:49:20] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:49:21] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 6 ms to minimize.
[2024-05-29 18:49:21] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:49:21] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 229 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9856 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 194/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 423 constraints, problems are : Problem set: 0 solved, 194 unsolved in 17383 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
After SMT, in 27806ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 27830ms
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27960 ms. Remains : 50/53 places, 195/199 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-00
Product exploration explored 100000 steps with 7142 reset in 408 ms.
Product exploration explored 100000 steps with 7142 reset in 241 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 52 steps (0 resets) in 7 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-05-29 18:49:46] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:49:46] [INFO ] Invariant cache hit.
[2024-05-29 18:49:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 18:49:46] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-29 18:49:46] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:49:46] [INFO ] [Real]Added 131 Read/Feed constraints in 15 ms returned sat
[2024-05-29 18:49:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:49:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 18:49:46] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-29 18:49:46] [INFO ] [Nat]Added 131 Read/Feed constraints in 12 ms returned sat
[2024-05-29 18:49:46] [INFO ] Computed and/alt/rep : 42/48/42 causal constraints (skipped 145 transitions) in 23 ms.
[2024-05-29 18:49:46] [INFO ] Added : 20 causal constraints over 4 iterations in 79 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 49 transition count 182
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 37 transition count 182
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 25 transition count 170
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 111 place count 25 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 117 place count 25 transition count 101
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 1 with 12 rules applied. Total rules applied 129 place count 19 transition count 95
Applied a total of 129 rules in 43 ms. Remains 19 /50 variables (removed 31) and now considering 95/195 (removed 100) transitions.
[2024-05-29 18:49:46] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-05-29 18:49:46] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:49:46] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-29 18:49:46] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:49:46] [INFO ] Invariant cache hit.
[2024-05-29 18:49:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-29 18:49:46] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-29 18:49:46] [INFO ] Redundant transitions in 3 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-29 18:49:46] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:49:46] [INFO ] Invariant cache hit.
[2024-05-29 18:49:46] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:49:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:49:48] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:49:48] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:49:48] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:49:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:49:49] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:49:49] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:49:49] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:49:50] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4237 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7531ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7534ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/50 places, 95/195 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7647 ms. Remains : 19/50 places, 95/195 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 16 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-05-29 18:49:54] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:49:54] [INFO ] Invariant cache hit.
[2024-05-29 18:49:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:49:54] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-29 18:49:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-29 18:49:54] [INFO ] [Real]Added 75 Read/Feed constraints in 8 ms returned sat
[2024-05-29 18:49:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:49:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:49:54] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-29 18:49:54] [INFO ] [Nat]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-05-29 18:49:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 18 ms.
[2024-05-29 18:49:54] [INFO ] Added : 0 causal constraints over 0 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 196 ms.
Product exploration explored 100000 steps with 14285 reset in 239 ms.
Built C files in :
/tmp/ltsmin16424918807555588475
[2024-05-29 18:49:55] [INFO ] Computing symmetric may disable matrix : 95 transitions.
[2024-05-29 18:49:55] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:49:55] [INFO ] Computing symmetric may enable matrix : 95 transitions.
[2024-05-29 18:49:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:49:55] [INFO ] Computing Do-Not-Accords matrix : 95 transitions.
[2024-05-29 18:49:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:49:55] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16424918807555588475
Running compilation step : cd /tmp/ltsmin16424918807555588475;'/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 393 ms.
Running link step : cd /tmp/ltsmin16424918807555588475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16424918807555588475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8367434305506881712.hoa' '--buchi-type=spotba'
LTSmin run took 332 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-06a-LTLFireability-00 finished in 39271 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(G(p0))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 50 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 50 transition count 195
Applied a total of 6 rules in 4 ms. Remains 50 /53 variables (removed 3) and now considering 195/199 (removed 4) transitions.
[2024-05-29 18:49:56] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-05-29 18:49:56] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 18:49:56] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 18:49:56] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:49:56] [INFO ] Invariant cache hit.
[2024-05-29 18:49:56] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:49:56] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-29 18:49:56] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:49:56] [INFO ] Invariant cache hit.
[2024-05-29 18:49:56] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:49:57] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:49:58] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:49:59] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:49:59] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:49:59] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:49:59] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:49:59] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:49:59] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:49:59] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:49:59] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:49:59] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:50:00] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:50:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:50:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 229 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9617 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 194/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 423 constraints, problems are : Problem set: 0 solved, 194 unsolved in 17676 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
After SMT, in 27736ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 27738ms
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27833 ms. Remains : 50/53 places, 195/199 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLFireability-01 finished in 27984 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(p0))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 50 transition count 196
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 4 place count 50 transition count 184
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 28 place count 38 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 36 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 36 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 36 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 36 transition count 177
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 37 place count 35 transition count 177
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 57 place count 25 transition count 167
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 117 place count 25 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 25 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 135 place count 19 transition count 95
Applied a total of 135 rules in 37 ms. Remains 19 /53 variables (removed 34) and now considering 95/199 (removed 104) transitions.
[2024-05-29 18:50:24] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-05-29 18:50:24] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:50:24] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 18:50:24] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:50:24] [INFO ] Invariant cache hit.
[2024-05-29 18:50:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-29 18:50:24] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-29 18:50:24] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-29 18:50:24] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:50:24] [INFO ] Invariant cache hit.
[2024-05-29 18:50:24] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:50:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:50:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:50:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:50:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:25] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:25] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:26] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:50:26] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:26] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:50:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:26] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3055 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:50:27] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:50:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:50:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:50:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:50:27] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:50:27] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:50:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:50:28] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:28] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:50:28] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:50:28] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:28] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:50:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:50:28] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4284 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7465ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7466ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/53 places, 95/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7567 ms. Remains : 19/53 places, 95/199 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-02
Product exploration explored 100000 steps with 14285 reset in 188 ms.
Product exploration explored 100000 steps with 14285 reset in 230 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 24 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-29 18:50:32] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:50:32] [INFO ] Invariant cache hit.
[2024-05-29 18:50:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:50:32] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-29 18:50:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-29 18:50:32] [INFO ] [Real]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-05-29 18:50:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:50:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:50:32] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-29 18:50:32] [INFO ] [Nat]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-05-29 18:50:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 7 ms.
[2024-05-29 18:50:32] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 19 /19 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-05-29 18:50:32] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:50:32] [INFO ] Invariant cache hit.
[2024-05-29 18:50:32] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 18:50:32] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:50:32] [INFO ] Invariant cache hit.
[2024-05-29 18:50:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-29 18:50:32] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-29 18:50:32] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-29 18:50:32] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:50:32] [INFO ] Invariant cache hit.
[2024-05-29 18:50:32] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:50:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:34] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:50:34] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:35] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:50:35] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:35] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:50:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4207 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7470ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7472ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7545 ms. Remains : 19/19 places, 95/95 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 24 steps (0 resets) in 7 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-05-29 18:50:40] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:50:40] [INFO ] Invariant cache hit.
[2024-05-29 18:50:40] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:50:40] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-29 18:50:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-29 18:50:40] [INFO ] [Real]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-05-29 18:50:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:50:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:50:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-29 18:50:40] [INFO ] [Nat]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-05-29 18:50:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 6 ms.
[2024-05-29 18:50:40] [INFO ] Added : 0 causal constraints over 0 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 274 ms.
Product exploration explored 100000 steps with 14285 reset in 236 ms.
Built C files in :
/tmp/ltsmin14994021293382112692
[2024-05-29 18:50:41] [INFO ] Computing symmetric may disable matrix : 95 transitions.
[2024-05-29 18:50:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:50:41] [INFO ] Computing symmetric may enable matrix : 95 transitions.
[2024-05-29 18:50:41] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:50:41] [INFO ] Computing Do-Not-Accords matrix : 95 transitions.
[2024-05-29 18:50:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:50:41] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14994021293382112692
Running compilation step : cd /tmp/ltsmin14994021293382112692;'/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 306 ms.
Running link step : cd /tmp/ltsmin14994021293382112692;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14994021293382112692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15436283164514779012.hoa' '--buchi-type=spotba'
LTSmin run took 127 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-06a-LTLFireability-02 finished in 17549 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(G(p1))||p0)))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 50 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 50 transition count 195
Applied a total of 6 rules in 2 ms. Remains 50 /53 variables (removed 3) and now considering 195/199 (removed 4) transitions.
[2024-05-29 18:50:41] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-05-29 18:50:41] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:50:41] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 18:50:41] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:50:41] [INFO ] Invariant cache hit.
[2024-05-29 18:50:41] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:50:41] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-29 18:50:41] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:50:41] [INFO ] Invariant cache hit.
[2024-05-29 18:50:41] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:50:42] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:50:42] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:50:42] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:50:42] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:50:43] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:50:44] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:50:44] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:50:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:50:44] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 5 ms to minimize.
[2024-05-29 18:50:44] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:50:44] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:50:44] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:50:44] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:50:45] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:50:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:50:45] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:50:45] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 3 ms to minimize.
[2024-05-29 18:50:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:50:45] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:50:45] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:50:45] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:50:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 229 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9451 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 194/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 423 constraints, problems are : Problem set: 0 solved, 194 unsolved in 17404 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
After SMT, in 27244ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 27246ms
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27333 ms. Remains : 50/53 places, 195/199 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-06a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-06a-LTLFireability-04 finished in 27598 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)||G(!p0))))'
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 52 transition count 191
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 45 transition count 191
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 14 place count 45 transition count 185
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 39 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 38 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 38 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 38 transition count 182
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 51 place count 27 transition count 171
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 81 place count 27 transition count 141
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 4 with 12 rules applied. Total rules applied 93 place count 21 transition count 135
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 99 place count 21 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 93 transitions
Redundant transition composition rules discarded 93 transitions
Iterating global reduction 5 with 93 rules applied. Total rules applied 192 place count 21 transition count 36
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 204 place count 15 transition count 30
Applied a total of 204 rules in 28 ms. Remains 15 /53 variables (removed 38) and now considering 30/199 (removed 169) transitions.
[2024-05-29 18:51:09] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
// Phase 1: matrix 24 rows 15 cols
[2024-05-29 18:51:09] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:51:09] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 18:51:09] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-05-29 18:51:09] [INFO ] Invariant cache hit.
[2024-05-29 18:51:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 18:51:09] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-29 18:51:09] [INFO ] Redundant transitions in 1 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-29 18:51:09] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-05-29 18:51:09] [INFO ] Invariant cache hit.
[2024-05-29 18:51:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 6/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:51:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-29 18:51:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:51:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:51:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:51:10] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:51:10] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:51:10] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-29 18:51:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:51:10] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:51:10] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:51:10] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:51:10] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 23/38 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-29 18:51:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 46 constraints, problems are : Problem set: 0 solved, 15 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 6/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 23/38 variables, 15/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 61 constraints, problems are : Problem set: 0 solved, 15 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 29/29 constraints]
After SMT, in 1035ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 1035ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/53 places, 30/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1124 ms. Remains : 15/53 places, 30/199 transitions.
Stuttering acceptance computed with spot in 35 ms :[false]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 78 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[false]
RANDOM walk for 269 steps (31 resets) in 8 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[false]
Stuttering acceptance computed with spot in 26 ms :[false]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-05-29 18:51:11] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-05-29 18:51:11] [INFO ] Invariant cache hit.
[2024-05-29 18:51:11] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 18:51:11] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-05-29 18:51:11] [INFO ] Invariant cache hit.
[2024-05-29 18:51:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 18:51:11] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-29 18:51:11] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-29 18:51:11] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-05-29 18:51:11] [INFO ] Invariant cache hit.
[2024-05-29 18:51:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 6/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 23/38 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-29 18:51:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 46 constraints, problems are : Problem set: 0 solved, 15 unsolved in 775 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 6/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 23/38 variables, 15/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 61 constraints, problems are : Problem set: 0 solved, 15 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 29/29 constraints]
After SMT, in 944ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 945ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1001 ms. Remains : 15/15 places, 30/30 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[false]
RANDOM walk for 127 steps (14 resets) in 7 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[false]
Stuttering acceptance computed with spot in 26 ms :[false]
Stuttering acceptance computed with spot in 27 ms :[false]
Product exploration explored 100000 steps with 0 reset in 38 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 13 in 0 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyElection-PT-06a-LTLFireability-05 finished in 3126 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||F(G(p0)))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 50 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 50 transition count 195
Applied a total of 6 rules in 6 ms. Remains 50 /53 variables (removed 3) and now considering 195/199 (removed 4) transitions.
[2024-05-29 18:51:12] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-05-29 18:51:12] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:51:12] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 18:51:12] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:51:12] [INFO ] Invariant cache hit.
[2024-05-29 18:51:12] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:51:12] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-29 18:51:12] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:51:12] [INFO ] Invariant cache hit.
[2024-05-29 18:51:12] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:51:13] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:51:13] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 18:51:13] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:51:13] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:51:13] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:51:13] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:51:13] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:51:13] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:51:13] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:51:14] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:51:15] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:51:15] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:51:15] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:51:15] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:51:15] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:51:15] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:51:15] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:51:15] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:51:15] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:51:15] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:51:15] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:51:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:51:16] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:51:16] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:51:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 229 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9668 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 194/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 423 constraints, problems are : Problem set: 0 solved, 194 unsolved in 17523 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
After SMT, in 27564ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 27566ms
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27653 ms. Remains : 50/53 places, 195/199 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-06
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLFireability-06 finished in 27771 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 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 50 transition count 196
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 4 place count 50 transition count 184
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 28 place count 38 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 36 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 36 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 36 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 36 transition count 177
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 37 place count 35 transition count 177
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 57 place count 25 transition count 167
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 117 place count 25 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 25 transition count 101
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 4 with 12 rules applied. Total rules applied 135 place count 19 transition count 95
Applied a total of 135 rules in 21 ms. Remains 19 /53 variables (removed 34) and now considering 95/199 (removed 104) transitions.
[2024-05-29 18:51:40] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-05-29 18:51:40] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:51:40] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-29 18:51:40] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:51:40] [INFO ] Invariant cache hit.
[2024-05-29 18:51:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-29 18:51:40] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-29 18:51:40] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-29 18:51:40] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:51:40] [INFO ] Invariant cache hit.
[2024-05-29 18:51:40] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:51:40] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:51:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:51:40] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:51:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:51:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:51:40] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:51:40] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:51:40] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:51:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:51:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:51:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:51:41] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:51:41] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:51:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:51:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:51:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:51:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:51:41] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:51:41] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:51:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:51:42] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:51:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:51:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:51:42] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:51:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:51:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:51:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:51:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:51:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:51:43] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:51:44] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:51:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:51:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:51:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:51:44] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:51:44] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:51:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:51:44] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:51:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:51:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7524ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7525ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/53 places, 95/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7605 ms. Remains : 19/53 places, 95/199 transitions.
Stuttering acceptance computed with spot in 41 ms :[p0]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-07
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLFireability-07 finished in 7657 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(G(p0))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 50 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 50 transition count 195
Applied a total of 6 rules in 5 ms. Remains 50 /53 variables (removed 3) and now considering 195/199 (removed 4) transitions.
[2024-05-29 18:51:47] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-05-29 18:51:47] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 18:51:48] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 18:51:48] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:51:48] [INFO ] Invariant cache hit.
[2024-05-29 18:51:48] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:51:48] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-29 18:51:48] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:51:48] [INFO ] Invariant cache hit.
[2024-05-29 18:51:48] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:51:48] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 42 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.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 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.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:51:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:51:50] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:51:50] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:51:50] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:51:50] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:51:50] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:51:50] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:51:50] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:51:50] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:51:51] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:51:51] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:51:51] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:51:51] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:51:51] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:51:51] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:51:51] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:51:51] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 229 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9555 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 194/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 423 constraints, problems are : Problem set: 0 solved, 194 unsolved in 17520 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
After SMT, in 27429ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 27431ms
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27521 ms. Remains : 50/53 places, 195/199 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLFireability-09 finished in 27656 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(p0)&&F(!p0)))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 50 transition count 196
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 4 place count 50 transition count 184
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 28 place count 38 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 36 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 36 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 36 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 36 transition count 177
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 37 place count 35 transition count 177
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 57 place count 25 transition count 167
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 117 place count 25 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 25 transition count 101
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 4 with 12 rules applied. Total rules applied 135 place count 19 transition count 95
Applied a total of 135 rules in 20 ms. Remains 19 /53 variables (removed 34) and now considering 95/199 (removed 104) transitions.
[2024-05-29 18:52:15] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-05-29 18:52:15] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:52:15] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-29 18:52:15] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:52:15] [INFO ] Invariant cache hit.
[2024-05-29 18:52:15] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-29 18:52:15] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-29 18:52:15] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-29 18:52:15] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:52:15] [INFO ] Invariant cache hit.
[2024-05-29 18:52:15] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:15] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:52:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:17] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:17] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:52:17] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:52:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:18] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3163 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:52:19] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4129 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7399ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7400ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/53 places, 95/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7488 ms. Remains : 19/53 places, 95/199 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, p0, (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-11
Product exploration explored 100000 steps with 14285 reset in 204 ms.
Product exploration explored 100000 steps with 14285 reset in 206 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2024-05-29 18:52:24] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:52:24] [INFO ] Invariant cache hit.
[2024-05-29 18:52:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:52:24] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-29 18:52:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-29 18:52:24] [INFO ] [Real]Added 75 Read/Feed constraints in 9 ms returned sat
[2024-05-29 18:52:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:52:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:52:24] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-29 18:52:24] [INFO ] [Nat]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-05-29 18:52:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 5 ms.
[2024-05-29 18:52:24] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 19 /19 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-05-29 18:52:24] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:52:24] [INFO ] Invariant cache hit.
[2024-05-29 18:52:24] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-29 18:52:24] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:52:24] [INFO ] Invariant cache hit.
[2024-05-29 18:52:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-29 18:52:24] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-29 18:52:24] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-29 18:52:24] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:52:24] [INFO ] Invariant cache hit.
[2024-05-29 18:52:24] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:25] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:25] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:52:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:26] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:52:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:26] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:52:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:52:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:52:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:52:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:52:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:52:27] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:52:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:52:28] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:28] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:52:28] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:52:28] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:52:28] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:52:28] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:52:28] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7564ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7566ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7643 ms. Remains : 19/19 places, 95/95 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2024-05-29 18:52:32] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:52:32] [INFO ] Invariant cache hit.
[2024-05-29 18:52:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:52:32] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-29 18:52:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-29 18:52:32] [INFO ] [Real]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-05-29 18:52:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:52:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:52:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-29 18:52:32] [INFO ] [Nat]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-05-29 18:52:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 5 ms.
[2024-05-29 18:52:32] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 199 ms.
Product exploration explored 100000 steps with 14285 reset in 206 ms.
Built C files in :
/tmp/ltsmin1730813835807436119
[2024-05-29 18:52:32] [INFO ] Computing symmetric may disable matrix : 95 transitions.
[2024-05-29 18:52:32] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:52:32] [INFO ] Computing symmetric may enable matrix : 95 transitions.
[2024-05-29 18:52:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:52:32] [INFO ] Computing Do-Not-Accords matrix : 95 transitions.
[2024-05-29 18:52:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:52:32] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1730813835807436119
Running compilation step : cd /tmp/ltsmin1730813835807436119;'/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 271 ms.
Running link step : cd /tmp/ltsmin1730813835807436119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1730813835807436119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13335068694015662842.hoa' '--buchi-type=spotba'
LTSmin run took 125 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-06a-LTLFireability-11 finished in 17693 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((p0||((G(p2)&&p1) U p3))))'
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 197
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 2 place count 51 transition count 185
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 26 place count 39 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 38 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 38 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 38 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 29 place count 38 transition count 182
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 31 place count 37 transition count 182
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 51 place count 27 transition count 172
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 81 place count 27 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 87 place count 27 transition count 136
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 4 with 12 rules applied. Total rules applied 99 place count 21 transition count 130
Applied a total of 99 rules in 21 ms. Remains 21 /53 variables (removed 32) and now considering 130/199 (removed 69) transitions.
[2024-05-29 18:52:33] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
// Phase 1: matrix 123 rows 21 cols
[2024-05-29 18:52:33] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:52:33] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-29 18:52:33] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-05-29 18:52:33] [INFO ] Invariant cache hit.
[2024-05-29 18:52:33] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-29 18:52:33] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-29 18:52:33] [INFO ] Redundant transitions in 4 ms returned []
Running 124 sub problems to find dead transitions.
[2024-05-29 18:52:33] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-05-29 18:52:33] [INFO ] Invariant cache hit.
[2024-05-29 18:52:33] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 18:52:33] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:52:33] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:52:33] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:52:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:52:33] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:52:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:52:34] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 122/143 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 105/148 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 18:52:35] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:52:35] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 151 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3346 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 122/143 variables, 21/45 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 105/150 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 124/274 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 275 constraints, problems are : Problem set: 0 solved, 124 unsolved in 6249 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 23/23 constraints]
After SMT, in 9840ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 9841ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/53 places, 130/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9928 ms. Remains : 21/53 places, 130/199 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p3))]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-12
Product exploration explored 100000 steps with 14285 reset in 268 ms.
Product exploration explored 100000 steps with 14285 reset in 278 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p3))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 72 steps (0 resets) in 9 ms. (7 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p3), (F p0), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p3))]
[2024-05-29 18:52:44] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-05-29 18:52:44] [INFO ] Invariant cache hit.
[2024-05-29 18:52:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:52:44] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-29 18:52:44] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-29 18:52:44] [INFO ] [Real]Added 106 Read/Feed constraints in 10 ms returned sat
[2024-05-29 18:52:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:52:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:52:44] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-29 18:52:44] [INFO ] [Nat]Added 106 Read/Feed constraints in 13 ms returned sat
[2024-05-29 18:52:44] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 115 transitions) in 8 ms.
[2024-05-29 18:52:44] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 7 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-29 18:52:44] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-05-29 18:52:44] [INFO ] Invariant cache hit.
[2024-05-29 18:52:44] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-29 18:52:44] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-05-29 18:52:44] [INFO ] Invariant cache hit.
[2024-05-29 18:52:44] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-29 18:52:44] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-29 18:52:44] [INFO ] Redundant transitions in 1 ms returned []
Running 124 sub problems to find dead transitions.
[2024-05-29 18:52:44] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-05-29 18:52:44] [INFO ] Invariant cache hit.
[2024-05-29 18:52:44] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 18:52:44] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:52:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 122/143 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 105/148 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 18:52:46] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:52:46] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 151 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3202 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 122/143 variables, 21/45 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 105/150 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 124/274 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 275 constraints, problems are : Problem set: 0 solved, 124 unsolved in 6422 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 23/23 constraints]
After SMT, in 9840ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 9841ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9923 ms. Remains : 21/21 places, 130/130 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 71 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p3))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 63 steps (1 resets) in 9 ms. (6 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p3), (F p0), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 7 factoid took 162 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p3))]
[2024-05-29 18:52:54] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-05-29 18:52:54] [INFO ] Invariant cache hit.
[2024-05-29 18:52:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:52:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-29 18:52:54] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-29 18:52:54] [INFO ] [Real]Added 106 Read/Feed constraints in 8 ms returned sat
[2024-05-29 18:52:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:52:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 18:52:54] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-29 18:52:54] [INFO ] [Nat]Added 106 Read/Feed constraints in 9 ms returned sat
[2024-05-29 18:52:54] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 115 transitions) in 7 ms.
[2024-05-29 18:52:55] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 14285 reset in 275 ms.
Product exploration explored 100000 steps with 14285 reset in 275 ms.
Built C files in :
/tmp/ltsmin5465650172020399801
[2024-05-29 18:52:55] [INFO ] Computing symmetric may disable matrix : 130 transitions.
[2024-05-29 18:52:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:52:55] [INFO ] Computing symmetric may enable matrix : 130 transitions.
[2024-05-29 18:52:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:52:55] [INFO ] Computing Do-Not-Accords matrix : 130 transitions.
[2024-05-29 18:52:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:52:55] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5465650172020399801
Running compilation step : cd /tmp/ltsmin5465650172020399801;'/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 358 ms.
Running link step : cd /tmp/ltsmin5465650172020399801;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5465650172020399801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15103726021878866072.hoa' '--buchi-type=spotba'
LTSmin run took 679 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-06a-LTLFireability-12 finished in 23387 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(G(p0)))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 50 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 50 transition count 195
Applied a total of 6 rules in 3 ms. Remains 50 /53 variables (removed 3) and now considering 195/199 (removed 4) transitions.
[2024-05-29 18:52:56] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-05-29 18:52:56] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:52:56] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 18:52:56] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:52:56] [INFO ] Invariant cache hit.
[2024-05-29 18:52:56] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 18:52:56] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-29 18:52:56] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-05-29 18:52:56] [INFO ] Invariant cache hit.
[2024-05-29 18:52:56] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:52:57] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:52:57] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:52:57] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:52:57] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:52:57] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:52:57] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:52:57] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:52:57] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:52:58] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:52:59] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:52:59] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:52:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:52:59] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:52:59] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:52:59] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:52:59] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:52:59] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:52:59] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:52:59] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:52:59] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:52:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:53:00] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:53:00] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-29 18:53:00] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 229 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9477 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 194/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 423 constraints, problems are : Problem set: 0 solved, 194 unsolved in 17641 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
After SMT, in 27430ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 27433ms
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27525 ms. Remains : 50/53 places, 195/199 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLFireability-13 finished in 27617 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 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 50 transition count 196
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 4 place count 50 transition count 184
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 28 place count 38 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 36 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 36 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 36 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 36 transition count 177
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 37 place count 35 transition count 177
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 57 place count 25 transition count 167
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 117 place count 25 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 25 transition count 101
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 4 with 12 rules applied. Total rules applied 135 place count 19 transition count 95
Applied a total of 135 rules in 16 ms. Remains 19 /53 variables (removed 34) and now considering 95/199 (removed 104) transitions.
[2024-05-29 18:53:24] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-05-29 18:53:24] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:53:24] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-29 18:53:24] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:53:24] [INFO ] Invariant cache hit.
[2024-05-29 18:53:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-29 18:53:24] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-29 18:53:24] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-29 18:53:24] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-05-29 18:53:24] [INFO ] Invariant cache hit.
[2024-05-29 18:53:24] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:53:24] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:53:24] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:53:24] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 18:53:24] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:53:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:53:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:53:24] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:53:24] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:53:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:53:24] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:53:24] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:53:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:53:24] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 18:53:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:53:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:53:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:53:25] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:53:25] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:53:25] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:53:26] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:53:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:53:26] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:53:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:53:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:53:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:53:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:53:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:53:27] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:53:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:53:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:53:28] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:53:28] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:53:28] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:53:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:53:28] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:53:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:53:28] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:53:28] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:53:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:53:28] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4196 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7420ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7422ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/53 places, 95/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7507 ms. Remains : 19/53 places, 95/199 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-15
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLFireability-15 finished in 7571 ms.
All properties solved by simple procedures.
Total runtime 256571 ms.

BK_STOP 1717008811929

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 LTLFireability"
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-171690532100316"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;