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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 19:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 11 19:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 11 19:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 193K 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-05a-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-05a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717007576175

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-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 18:32:57] [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:32:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:32:57] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-29 18:32:57] [INFO ] Transformed 72 places.
[2024-05-29 18:32:57] [INFO ] Transformed 450 transitions.
[2024-05-29 18:32:57] [INFO ] Found NUPN structural information;
[2024-05-29 18:32:57] [INFO ] Parsed PT model containing 72 places and 450 transitions and 3637 arcs in 193 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 291 transitions
Reduce redundant transitions removed 291 transitions.
FORMULA StigmergyElection-PT-05a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 159/159 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 64 transition count 147
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 64 transition count 147
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 61 transition count 141
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 61 transition count 141
Applied a total of 22 rules in 23 ms. Remains 61 /72 variables (removed 11) and now considering 141/159 (removed 18) transitions.
[2024-05-29 18:32:57] [INFO ] Flow matrix only has 134 transitions (discarded 7 similar events)
// Phase 1: matrix 134 rows 61 cols
[2024-05-29 18:32:57] [INFO ] Computed 2 invariants in 7 ms
[2024-05-29 18:32:57] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-29 18:32:57] [INFO ] Flow matrix only has 134 transitions (discarded 7 similar events)
[2024-05-29 18:32:57] [INFO ] Invariant cache hit.
[2024-05-29 18:32:57] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-29 18:32:58] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-29 18:32:58] [INFO ] Flow matrix only has 134 transitions (discarded 7 similar events)
[2024-05-29 18:32:58] [INFO ] Invariant cache hit.
[2024-05-29 18:32:58] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 18:32:58] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 8 ms to minimize.
[2024-05-29 18:32:58] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:32:58] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 3 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:33:00] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:33:00] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:33:00] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:33:00] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:33:00] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:33:00] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 4 ms to minimize.
[2024-05-29 18:33:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:33:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 18:33:00] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:33:00] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:33:00] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:33:00] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:33:00] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:33:01] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 18:33:01] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:33:01] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:33:01] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:33:01] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:33:01] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:33:01] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:33:01] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:33:01] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:33:01] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 18:33:01] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:33:01] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:33:01] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 133/194 variables, 61/118 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 85/203 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 1/195 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 18:33:04] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 18:33:05] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 15 (OVERLAPS) 0/195 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 206 constraints, problems are : Problem set: 0 solved, 140 unsolved in 9539 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 18:33:08] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 18:33:09] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 18:33:09] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 18:33:10] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 133/194 variables, 61/124 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 85/209 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 140/349 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 1/195 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 14 (OVERLAPS) 0/195 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 350 constraints, problems are : Problem set: 0 solved, 140 unsolved in 10661 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 61/61 constraints]
After SMT, in 20445ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 20465ms
Starting structural reductions in LTL mode, iteration 1 : 61/72 places, 141/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20802 ms. Remains : 61/72 places, 141/159 transitions.
Support contains 15 out of 61 places after structural reductions.
[2024-05-29 18:33:18] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:33:18] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:33:18] [INFO ] Input system was already deterministic with 141 transitions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (168 resets) in 2008 ms. (19 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40004 steps (85 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
[2024-05-29 18:33:19] [INFO ] Flow matrix only has 134 transitions (discarded 7 similar events)
[2024-05-29 18:33:19] [INFO ] Invariant cache hit.
[2024-05-29 18:33:19] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 60/195 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/61 constraints, ReadFeed: 0/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 35ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyElection-PT-05a-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 12 stabilizing places and 11 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' '!(G(F(p0)))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 141/141 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 59 transition count 130
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 49 transition count 130
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 21 place count 49 transition count 121
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 39 place count 40 transition count 121
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 49 place count 30 transition count 109
Iterating global reduction 2 with 10 rules applied. Total rules applied 59 place count 30 transition count 109
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 74 place count 30 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 74 place count 30 transition count 91
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 27 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 26 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 26 transition count 89
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 98 place count 26 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 108 place count 21 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 113 place count 21 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 123 place count 16 transition count 58
Applied a total of 123 rules in 32 ms. Remains 16 /61 variables (removed 45) and now considering 58/141 (removed 83) transitions.
[2024-05-29 18:33:19] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 16 cols
[2024-05-29 18:33:19] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:33:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 18:33:19] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-29 18:33:19] [INFO ] Invariant cache hit.
[2024-05-29 18:33:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-29 18:33:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-29 18:33:19] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-29 18:33:19] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-29 18:33:19] [INFO ] Invariant cache hit.
[2024-05-29 18:33:19] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:19] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:33:19] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:33:19] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 51/67 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 1/68 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 73 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1107 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:21] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:33:21] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:33:21] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:33:21] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:33:21] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:21] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:33:21] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 51/67 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 53/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/68 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 133 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1454 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 22/22 constraints]
After SMT, in 2620ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2622ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/61 places, 58/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2716 ms. Remains : 16/61 places, 58/141 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-01
Stuttering criterion allowed to conclude after 276 steps with 45 reset in 5 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-01 finished in 2981 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' '!(G(((p0 U (p1||G(p0))) U (!p0||F(G(!p0))))))'
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 141/141 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 61 transition count 134
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 54 transition count 134
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 52 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 52 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 50 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 50 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 50 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 49 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 49 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 49 transition count 123
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 43 place count 41 transition count 115
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 38 transition count 112
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 38 transition count 112
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 77 place count 38 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 82 place count 38 transition count 79
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 92 place count 33 transition count 74
Applied a total of 92 rules in 32 ms. Remains 33 /61 variables (removed 28) and now considering 74/141 (removed 67) transitions.
[2024-05-29 18:33:22] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
// Phase 1: matrix 68 rows 33 cols
[2024-05-29 18:33:22] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 18:33:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 18:33:22] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
[2024-05-29 18:33:22] [INFO ] Invariant cache hit.
[2024-05-29 18:33:22] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-29 18:33:22] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 89 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/61 places, 74/141 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 32 transition count 69
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 27 transition count 69
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 22 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 22 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 30 place count 17 transition count 59
Applied a total of 30 rules in 10 ms. Remains 17 /32 variables (removed 15) and now considering 59/74 (removed 15) transitions.
[2024-05-29 18:33:22] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
// Phase 1: matrix 53 rows 17 cols
[2024-05-29 18:33:22] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 18:33:22] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 18:33:22] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
[2024-05-29 18:33:22] [INFO ] Invariant cache hit.
[2024-05-29 18:33:22] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-29 18:33:22] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/61 places, 59/141 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 194 ms. Remains : 17/61 places, 59/141 transitions.
Stuttering acceptance computed with spot in 169 ms :[p0, false, p0, p0]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-02
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-02 finished in 382 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 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 141/141 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 59 transition count 130
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 49 transition count 130
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 21 place count 49 transition count 121
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 39 place count 40 transition count 121
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 49 place count 30 transition count 109
Iterating global reduction 2 with 10 rules applied. Total rules applied 59 place count 30 transition count 109
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 74 place count 30 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 74 place count 30 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 27 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 26 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 26 transition count 89
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 98 place count 26 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 108 place count 21 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 113 place count 21 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 123 place count 16 transition count 58
Applied a total of 123 rules in 27 ms. Remains 16 /61 variables (removed 45) and now considering 58/141 (removed 83) transitions.
[2024-05-29 18:33:23] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 16 cols
[2024-05-29 18:33:23] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 18:33:23] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 18:33:23] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-29 18:33:23] [INFO ] Invariant cache hit.
[2024-05-29 18:33:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-29 18:33:23] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-29 18:33:23] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-29 18:33:23] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-29 18:33:23] [INFO ] Invariant cache hit.
[2024-05-29 18:33:23] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:33:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 51/67 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 1/68 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 73 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1087 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:33:24] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:33:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:33:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:33:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:24] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:33:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 51/67 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 53/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/68 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 133 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1486 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 22/22 constraints]
After SMT, in 2620ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2621ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/61 places, 58/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2712 ms. Remains : 16/61 places, 58/141 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-05
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-05 finished in 2778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(p1)&&p0)))&&G((p2 U X(!p1)))))'
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 141/141 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 139
Applied a total of 2 rules in 7 ms. Remains 60 /61 variables (removed 1) and now considering 139/141 (removed 2) transitions.
[2024-05-29 18:33:25] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
// Phase 1: matrix 132 rows 60 cols
[2024-05-29 18:33:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:33:25] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 18:33:25] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
[2024-05-29 18:33:25] [INFO ] Invariant cache hit.
[2024-05-29 18:33:25] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-29 18:33:25] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 126 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/61 places, 139/141 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 50 transition count 130
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 50 transition count 130
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 45 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 45 transition count 125
Applied a total of 28 rules in 4 ms. Remains 45 /59 variables (removed 14) and now considering 125/139 (removed 14) transitions.
[2024-05-29 18:33:25] [INFO ] Flow matrix only has 118 transitions (discarded 7 similar events)
// Phase 1: matrix 118 rows 45 cols
[2024-05-29 18:33:25] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:33:25] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 18:33:25] [INFO ] Flow matrix only has 118 transitions (discarded 7 similar events)
[2024-05-29 18:33:25] [INFO ] Invariant cache hit.
[2024-05-29 18:33:25] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 18:33:25] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 45/61 places, 125/141 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 204 ms. Remains : 45/61 places, 125/141 transitions.
Stuttering acceptance computed with spot in 351 ms :[true, p1, (OR (NOT p0) (NOT p1)), p1, p1, true, (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 8 steps with 2 reset in 0 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-07 finished in 584 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(p1))))'
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 141/141 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 61 transition count 135
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 55 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 53 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 53 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 51 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 51 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 51 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 50 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 50 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 50 transition count 124
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 41 place count 42 transition count 116
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 39 transition count 113
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 39 transition count 113
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 75 place count 39 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 80 place count 39 transition count 80
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 90 place count 34 transition count 75
Applied a total of 90 rules in 26 ms. Remains 34 /61 variables (removed 27) and now considering 75/141 (removed 66) transitions.
[2024-05-29 18:33:26] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
// Phase 1: matrix 69 rows 34 cols
[2024-05-29 18:33:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:33:26] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 18:33:26] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
[2024-05-29 18:33:26] [INFO ] Invariant cache hit.
[2024-05-29 18:33:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-29 18:33:26] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 78 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/61 places, 75/141 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 33 transition count 70
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 28 transition count 70
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 23 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 23 transition count 65
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 30 place count 18 transition count 60
Applied a total of 30 rules in 6 ms. Remains 18 /33 variables (removed 15) and now considering 60/75 (removed 15) transitions.
[2024-05-29 18:33:26] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
// Phase 1: matrix 54 rows 18 cols
[2024-05-29 18:33:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:33:26] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 18:33:26] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2024-05-29 18:33:26] [INFO ] Invariant cache hit.
[2024-05-29 18:33:26] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-29 18:33:26] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/61 places, 60/141 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 160 ms. Remains : 18/61 places, 60/141 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 179 ms.
Product exploration explored 100000 steps with 0 reset in 118 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/18 stabilizing places and 2/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 355 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1251 resets) in 321 ms. (124 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (256 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
[2024-05-29 18:33:27] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2024-05-29 18:33:27] [INFO ] Invariant cache hit.
[2024-05-29 18:33:27] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 18/72 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/18 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 606 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Support contains 1 out of 18 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-29 18:33:28] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2024-05-29 18:33:28] [INFO ] Invariant cache hit.
[2024-05-29 18:33:28] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 18:33:28] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2024-05-29 18:33:28] [INFO ] Invariant cache hit.
[2024-05-29 18:33:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-29 18:33:28] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-29 18:33:28] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-29 18:33:28] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2024-05-29 18:33:28] [INFO ] Invariant cache hit.
[2024-05-29 18:33:28] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 53/71 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 40/80 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 1/72 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 81 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1461 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-29 18:33:29] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:33:29] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:33:29] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:33:29] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:33:29] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 53/71 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 40/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 59/144 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 1/72 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 145 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1665 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 26/26 constraints]
After SMT, in 3177ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3178ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3243 ms. Remains : 18/18 places, 60/60 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/18 stabilizing places and 2/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 141 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 47 ms :[(NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 168 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 44 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 148 ms.
Product exploration explored 100000 steps with 0 reset in 44 ms.
Built C files in :
/tmp/ltsmin11128306438018985427
[2024-05-29 18:33:32] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2024-05-29 18:33:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:33:32] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2024-05-29 18:33:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:33:32] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2024-05-29 18:33:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:33:32] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11128306438018985427
Running compilation step : cd /tmp/ltsmin11128306438018985427;'/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 331 ms.
Running link step : cd /tmp/ltsmin11128306438018985427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11128306438018985427;'/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/stateBased788585029309597679.hoa' '--buchi-type=spotba'
LTSmin run took 286 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-05a-LTLFireability-08 finished in 6455 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' '!(G((F(p0)&&F(p1))))'
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 141/141 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 59 transition count 131
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 50 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 49 transition count 130
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 21 place count 49 transition count 121
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 39 place count 40 transition count 121
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 49 place count 30 transition count 109
Iterating global reduction 3 with 10 rules applied. Total rules applied 59 place count 30 transition count 109
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 74 place count 30 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 74 place count 30 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 80 place count 27 transition count 91
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 26 transition count 89
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 26 transition count 89
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 98 place count 26 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 106 place count 22 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 111 place count 22 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 121 place count 17 transition count 59
Applied a total of 121 rules in 25 ms. Remains 17 /61 variables (removed 44) and now considering 59/141 (removed 82) transitions.
[2024-05-29 18:33:32] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
// Phase 1: matrix 53 rows 17 cols
[2024-05-29 18:33:32] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:33:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 18:33:32] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
[2024-05-29 18:33:32] [INFO ] Invariant cache hit.
[2024-05-29 18:33:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-29 18:33:32] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-29 18:33:32] [INFO ] Redundant transitions in 0 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-29 18:33:32] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
[2024-05-29 18:33:32] [INFO ] Invariant cache hit.
[2024-05-29 18:33:32] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 5/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 52/69 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 39/72 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 1/70 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/70 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 73 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 5/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:33:34] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:33:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:33:34] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:33:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:33:34] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:33:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:33:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:33:34] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:33:34] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:33:34] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 52/69 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 39/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 54/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 1/70 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 0/70 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 137 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1721 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 25/25 constraints]
After SMT, in 2832ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2834ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/61 places, 59/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2922 ms. Remains : 17/61 places, 59/141 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-11
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-11 finished in 3087 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 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 141/141 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 59 transition count 130
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 49 transition count 130
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 21 place count 49 transition count 122
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 37 place count 41 transition count 122
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 46 place count 32 transition count 112
Iterating global reduction 2 with 9 rules applied. Total rules applied 55 place count 32 transition count 112
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 62 place count 32 transition count 105
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 62 place count 32 transition count 102
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 68 place count 29 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 28 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 28 transition count 100
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 78 place count 28 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 88 place count 23 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 93 place count 23 transition count 82
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 103 place count 18 transition count 77
Applied a total of 103 rules in 20 ms. Remains 18 /61 variables (removed 43) and now considering 77/141 (removed 64) transitions.
[2024-05-29 18:33:35] [INFO ] Flow matrix only has 71 transitions (discarded 6 similar events)
// Phase 1: matrix 71 rows 18 cols
[2024-05-29 18:33:35] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:33:35] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 18:33:35] [INFO ] Flow matrix only has 71 transitions (discarded 6 similar events)
[2024-05-29 18:33:35] [INFO ] Invariant cache hit.
[2024-05-29 18:33:36] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-29 18:33:36] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-29 18:33:36] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 18:33:36] [INFO ] Flow matrix only has 71 transitions (discarded 6 similar events)
[2024-05-29 18:33:36] [INFO ] Invariant cache hit.
[2024-05-29 18:33:36] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 5/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:33:37] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:33:37] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:33:37] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 70/88 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 55/93 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 1/89 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/89 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 94 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1807 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 5/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:33:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:33:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:33:38] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:33:38] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:33:38] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:33:38] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:33:38] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:33:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:33:38] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:33:38] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 70/88 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 55/103 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 72/175 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 1/89 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/89 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 13 (OVERLAPS) 0/89 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 176 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2444 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 29/29 constraints]
After SMT, in 4355ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 4356ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/61 places, 77/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4490 ms. Remains : 18/61 places, 77/141 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-12
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-12 finished in 4560 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(p1)&&p0)))'
Support contains 7 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 141/141 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 59 transition count 137
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 58 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 58 transition count 135
Applied a total of 6 rules in 7 ms. Remains 58 /61 variables (removed 3) and now considering 135/141 (removed 6) transitions.
[2024-05-29 18:33:40] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 58 cols
[2024-05-29 18:33:40] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 18:33:40] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 18:33:40] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2024-05-29 18:33:40] [INFO ] Invariant cache hit.
[2024-05-29 18:33:40] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-29 18:33:40] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-29 18:33:40] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2024-05-29 18:33:40] [INFO ] Invariant cache hit.
[2024-05-29 18:33:40] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 3 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:33:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:33:43] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 18:33:43] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:33:43] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:33:43] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:33:43] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:33:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:33:43] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:33:43] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 128/186 variables, 58/114 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 85/199 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 1/187 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 18:33:45] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:33:45] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (OVERLAPS) 0/187 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 202 constraints, problems are : Problem set: 0 solved, 134 unsolved in 7487 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 18:33:48] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:33:48] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:33:48] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:33:48] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 18:33:49] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 18:33:50] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 128/186 variables, 58/122 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 85/207 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 134/341 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (OVERLAPS) 1/187 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (OVERLAPS) 0/187 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 342 constraints, problems are : Problem set: 0 solved, 134 unsolved in 9057 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 62/62 constraints]
After SMT, in 16668ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 16671ms
Starting structural reductions in LTL mode, iteration 1 : 58/61 places, 135/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16788 ms. Remains : 58/61 places, 135/141 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-13 finished in 16964 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 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 141/141 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 59 transition count 130
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 49 transition count 130
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 21 place count 49 transition count 121
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 39 place count 40 transition count 121
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 49 place count 30 transition count 109
Iterating global reduction 2 with 10 rules applied. Total rules applied 59 place count 30 transition count 109
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 74 place count 30 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 74 place count 30 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 27 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 26 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 26 transition count 89
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 98 place count 26 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 108 place count 21 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 113 place count 21 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 123 place count 16 transition count 58
Applied a total of 123 rules in 10 ms. Remains 16 /61 variables (removed 45) and now considering 58/141 (removed 83) transitions.
[2024-05-29 18:33:57] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 16 cols
[2024-05-29 18:33:57] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 18:33:57] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 18:33:57] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-29 18:33:57] [INFO ] Invariant cache hit.
[2024-05-29 18:33:57] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-29 18:33:57] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-29 18:33:57] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-29 18:33:57] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-29 18:33:57] [INFO ] Invariant cache hit.
[2024-05-29 18:33:57] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:33:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:33:57] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:33:57] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:33:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:33:57] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:33:57] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:33:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
[2024-05-29 18:33:57] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:58] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:33:58] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:33:58] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:58] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:33:58] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:33:58] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 51/67 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 1/68 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 73 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1110 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:33:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:33:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:33:58] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:33:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:33:59] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:33:59] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 51/67 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 53/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/68 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 133 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1475 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 22/22 constraints]
After SMT, in 2643ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2645ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/61 places, 58/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2776 ms. Remains : 16/61 places, 58/141 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-14
Product exploration explored 100000 steps with 16666 reset in 170 ms.
Product exploration explored 100000 steps with 16666 reset in 166 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 112 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 30 ms :[(NOT p0)]
RANDOM walk for 20 steps (0 resets) in 5 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 140 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-29 18:34:00] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-29 18:34:00] [INFO ] Invariant cache hit.
[2024-05-29 18:34:00] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:34:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-29 18:34:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-29 18:34:01] [INFO ] [Real]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-05-29 18:34:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:34:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:34:01] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-29 18:34:01] [INFO ] [Nat]Added 41 Read/Feed constraints in 4 ms returned sat
[2024-05-29 18:34:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 47 transitions) in 4 ms.
[2024-05-29 18:34:01] [INFO ] Added : 0 causal constraints over 0 iterations in 49 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 58/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-29 18:34:01] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-29 18:34:01] [INFO ] Invariant cache hit.
[2024-05-29 18:34:01] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 18:34:01] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-29 18:34:01] [INFO ] Invariant cache hit.
[2024-05-29 18:34:01] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-29 18:34:01] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-29 18:34:01] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-29 18:34:01] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-29 18:34:01] [INFO ] Invariant cache hit.
[2024-05-29 18:34:01] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:34:01] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 51/67 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 1/68 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 73 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1002 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:34:02] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:34:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:34:02] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:34:02] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:34:02] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 18:34:02] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:34:02] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 51/67 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 53/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/68 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/68 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 133 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1503 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 22/22 constraints]
After SMT, in 2551ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2553ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2624 ms. Remains : 16/16 places, 58/58 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 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 25 ms :[(NOT p0)]
RANDOM walk for 20 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 103 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)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-29 18:34:04] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-29 18:34:04] [INFO ] Invariant cache hit.
[2024-05-29 18:34:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 18:34:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-29 18:34:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-29 18:34:04] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-29 18:34:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:34:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 18:34:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-29 18:34:04] [INFO ] [Nat]Added 41 Read/Feed constraints in 4 ms returned sat
[2024-05-29 18:34:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 47 transitions) in 4 ms.
[2024-05-29 18:34:04] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 127 ms.
Product exploration explored 100000 steps with 16666 reset in 132 ms.
Built C files in :
/tmp/ltsmin14883523981599482527
[2024-05-29 18:34:04] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2024-05-29 18:34:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:34:04] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2024-05-29 18:34:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:34:04] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2024-05-29 18:34:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:34:04] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14883523981599482527
Running compilation step : cd /tmp/ltsmin14883523981599482527;'/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 172 ms.
Running link step : cd /tmp/ltsmin14883523981599482527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14883523981599482527;'/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/stateBased15280503207998803541.hoa' '--buchi-type=spotba'
LTSmin run took 395 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-05a-LTLFireability-14 finished in 7676 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 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 141/141 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 59 transition count 137
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 58 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 58 transition count 135
Applied a total of 6 rules in 3 ms. Remains 58 /61 variables (removed 3) and now considering 135/141 (removed 6) transitions.
[2024-05-29 18:34:05] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 58 cols
[2024-05-29 18:34:05] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 18:34:05] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 18:34:05] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2024-05-29 18:34:05] [INFO ] Invariant cache hit.
[2024-05-29 18:34:05] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-29 18:34:05] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 136 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/61 places, 135/141 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 48 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 48 transition count 126
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 43 transition count 121
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 43 transition count 121
Applied a total of 28 rules in 4 ms. Remains 43 /57 variables (removed 14) and now considering 121/135 (removed 14) transitions.
[2024-05-29 18:34:05] [INFO ] Flow matrix only has 115 transitions (discarded 6 similar events)
// Phase 1: matrix 115 rows 43 cols
[2024-05-29 18:34:05] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:34:05] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 18:34:05] [INFO ] Flow matrix only has 115 transitions (discarded 6 similar events)
[2024-05-29 18:34:05] [INFO ] Invariant cache hit.
[2024-05-29 18:34:05] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 18:34:05] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 43/61 places, 121/141 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 238 ms. Remains : 43/61 places, 121/141 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLFireability-15 finished in 360 ms.
All properties solved by simple procedures.
Total runtime 68112 ms.

BK_STOP 1717007645499

--------------------
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-05a"
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-05a, 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-171690532000300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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