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.r399-tall-171690530000259.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 greatspnxred
Input is StigmergyElection-PT-02b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530000259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 71K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717008647145

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 18:50:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 18:50:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:50:48] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-29 18:50:48] [INFO ] Transformed 291 places.
[2024-05-29 18:50:48] [INFO ] Transformed 332 transitions.
[2024-05-29 18:50:48] [INFO ] Found NUPN structural information;
[2024-05-29 18:50:48] [INFO ] Parsed PT model containing 291 places and 332 transitions and 734 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-02b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 332/332 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 265 transition count 306
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 265 transition count 306
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 255 transition count 296
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 255 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 254 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 254 transition count 295
Applied a total of 74 rules in 72 ms. Remains 254 /291 variables (removed 37) and now considering 295/332 (removed 37) transitions.
// Phase 1: matrix 295 rows 254 cols
[2024-05-29 18:50:48] [INFO ] Computed 3 invariants in 23 ms
[2024-05-29 18:50:48] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-29 18:50:48] [INFO ] Invariant cache hit.
[2024-05-29 18:50:49] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-29 18:50:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/254 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 176 places in 169 ms of which 19 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 5 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 99 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 196 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 209 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:50:52] [INFO ] Deduced a trap composed of 175 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 173 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 172 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:50:53] [INFO ] Deduced a trap composed of 176 places in 93 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 295/549 variables, 254/266 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 0/549 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 266 constraints, problems are : Problem set: 0 solved, 294 unsolved in 14761 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/254 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 295/549 variables, 254/266 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 294/560 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/549 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 560 constraints, problems are : Problem set: 0 solved, 294 unsolved in 11082 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 9/9 constraints]
After SMT, in 25918ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 25935ms
Starting structural reductions in LTL mode, iteration 1 : 254/291 places, 295/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26476 ms. Remains : 254/291 places, 295/332 transitions.
Support contains 45 out of 254 places after structural reductions.
[2024-05-29 18:51:15] [INFO ] Flatten gal took : 41 ms
[2024-05-29 18:51:15] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:51:15] [INFO ] Input system was already deterministic with 295 transitions.
Support contains 44 out of 254 places (down from 45) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (548 resets) in 1668 ms. (23 steps per ms) remains 4/24 properties
BEST_FIRST walk for 40002 steps (226 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (218 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (116 resets) in 87 ms. (454 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (178 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
[2024-05-29 18:51:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 228/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/254 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 295/549 variables, 254/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/549 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 257 constraints, problems are : Problem set: 0 solved, 3 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 228/236 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/254 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 295/549 variables, 254/257 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 2/259 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/259 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/549 variables, 0/259 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 259 constraints, problems are : Problem set: 1 solved, 2 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 365ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 295/295 transitions.
Graph (trivial) has 250 edges and 254 vertex of which 32 / 254 are part of one of the 5 SCC in 7 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (complete) has 323 edges and 227 vertex of which 225 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 157 rules applied. Total rules applied 159 place count 225 transition count 103
Reduce places removed 155 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 159 rules applied. Total rules applied 318 place count 70 transition count 99
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 322 place count 68 transition count 97
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 326 place count 66 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 327 place count 65 transition count 95
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 327 place count 65 transition count 84
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 349 place count 54 transition count 84
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 354 place count 49 transition count 79
Iterating global reduction 5 with 5 rules applied. Total rules applied 359 place count 49 transition count 79
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 359 place count 49 transition count 77
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 363 place count 47 transition count 77
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 364 place count 46 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 365 place count 46 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 366 place count 46 transition count 72
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 386 place count 36 transition count 60
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 387 place count 36 transition count 59
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 391 place count 32 transition count 49
Iterating global reduction 7 with 4 rules applied. Total rules applied 395 place count 32 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 399 place count 32 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 401 place count 31 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 405 place count 31 transition count 41
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 416 place count 31 transition count 30
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 429 place count 20 transition count 28
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 431 place count 18 transition count 26
Iterating global reduction 9 with 2 rules applied. Total rules applied 433 place count 18 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 434 place count 18 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 435 place count 17 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 436 place count 16 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 436 place count 16 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 442 place count 13 transition count 21
Performed 3 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 448 place count 10 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 450 place count 10 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 451 place count 10 transition count 14
Applied a total of 451 rules in 67 ms. Remains 10 /254 variables (removed 244) and now considering 14/295 (removed 281) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 10/254 places, 14/295 transitions.
RANDOM walk for 84 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA StigmergyElection-PT-02b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35 stabilizing places and 37 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)||p0))&&(G(p2) U G(p3))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 241 transition count 282
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 241 transition count 282
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 232 transition count 273
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 232 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 230 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 229 transition count 270
Applied a total of 50 rules in 25 ms. Remains 229 /254 variables (removed 25) and now considering 270/295 (removed 25) transitions.
// Phase 1: matrix 270 rows 229 cols
[2024-05-29 18:51:16] [INFO ] Computed 3 invariants in 4 ms
[2024-05-29 18:51:16] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 18:51:16] [INFO ] Invariant cache hit.
[2024-05-29 18:51:17] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-05-29 18:51:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-29 18:51:19] [INFO ] Deduced a trap composed of 163 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:51:19] [INFO ] Deduced a trap composed of 164 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:51:19] [INFO ] Deduced a trap composed of 164 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:51:20] [INFO ] Deduced a trap composed of 164 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:51:20] [INFO ] Deduced a trap composed of 163 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/499 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (OVERLAPS) 0/499 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 237 constraints, problems are : Problem set: 0 solved, 269 unsolved in 11204 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/499 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 269/506 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-29 18:51:35] [INFO ] Deduced a trap composed of 163 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/499 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/499 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 507 constraints, problems are : Problem set: 0 solved, 269 unsolved in 18576 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 6/6 constraints]
After SMT, in 29818ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 29821ms
Starting structural reductions in LTL mode, iteration 1 : 229/254 places, 270/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30047 ms. Remains : 229/254 places, 270/295 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND p3 (NOT p2)), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-02
Product exploration explored 100000 steps with 65 reset in 205 ms.
Product exploration explored 100000 steps with 180 reset in 124 ms.
Computed a total of 31 stabilizing places and 33 stable transitions
Computed a total of 31 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p3 p2 p0 (NOT p1)), (X p2), (X p3), (X (NOT (AND p3 (NOT p2)))), (X (AND p3 p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X p0), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 103 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p3), true, (AND (NOT p2) p3), (NOT p3)]
RANDOM walk for 40000 steps (408 resets) in 335 ms. (119 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (272 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (244 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (181 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
[2024-05-29 18:51:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/229 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 270/499 variables, 229/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 232 constraints, problems are : Problem set: 0 solved, 3 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/229 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 270/499 variables, 229/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/499 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 235 constraints, problems are : Problem set: 0 solved, 3 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 362ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 270 ms.
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 270/270 transitions.
Graph (trivial) has 227 edges and 229 vertex of which 34 / 229 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (complete) has 295 edges and 201 vertex of which 199 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 135 rules applied. Total rules applied 137 place count 199 transition count 97
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 137 rules applied. Total rules applied 274 place count 66 transition count 93
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 278 place count 64 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 280 place count 62 transition count 91
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 280 place count 62 transition count 80
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 302 place count 51 transition count 80
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 303 place count 51 transition count 79
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 325 place count 40 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 329 place count 40 transition count 64
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 337 place count 32 transition count 47
Iterating global reduction 6 with 8 rules applied. Total rules applied 345 place count 32 transition count 47
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 350 place count 32 transition count 42
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 352 place count 30 transition count 40
Iterating global reduction 7 with 2 rules applied. Total rules applied 354 place count 30 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 358 place count 28 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 360 place count 27 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 362 place count 27 transition count 36
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 373 place count 27 transition count 25
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 387 place count 16 transition count 22
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 390 place count 13 transition count 18
Iterating global reduction 8 with 3 rules applied. Total rules applied 393 place count 13 transition count 18
Applied a total of 393 rules in 15 ms. Remains 13 /229 variables (removed 216) and now considering 18/270 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 13/229 places, 18/270 transitions.
RANDOM walk for 20014 steps (5 resets) in 193 ms. (103 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p3 p2 p0 (NOT p1)), (X p2), (X p3), (X (NOT (AND p3 (NOT p2)))), (X (AND p3 p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X p0), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (AND p2 p3))), (F (NOT p2)), (F (NOT (OR p2 p3))), (F (NOT p3))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p2 p3)))
Knowledge based reduction with 19 factoid took 235 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-02b-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02b-LTLCardinality-02 finished in 32248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(F(p1)))))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Graph (trivial) has 253 edges and 254 vertex of which 34 / 254 are part of one of the 6 SCC in 2 ms
Free SCC test removed 28 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 155 place count 225 transition count 110
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 158 rules applied. Total rules applied 313 place count 71 transition count 106
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 316 place count 69 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 68 transition count 105
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 317 place count 68 transition count 99
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 329 place count 62 transition count 99
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 336 place count 55 transition count 92
Iterating global reduction 4 with 7 rules applied. Total rules applied 343 place count 55 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 343 place count 55 transition count 90
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 347 place count 53 transition count 90
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 349 place count 51 transition count 85
Iterating global reduction 4 with 2 rules applied. Total rules applied 351 place count 51 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 352 place count 51 transition count 84
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 374 place count 40 transition count 73
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 380 place count 34 transition count 60
Iterating global reduction 5 with 6 rules applied. Total rules applied 386 place count 34 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 390 place count 34 transition count 56
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 391 place count 33 transition count 54
Iterating global reduction 6 with 1 rules applied. Total rules applied 392 place count 33 transition count 54
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 398 place count 30 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 401 place count 30 transition count 52
Applied a total of 401 rules in 27 ms. Remains 30 /254 variables (removed 224) and now considering 52/295 (removed 243) transitions.
[2024-05-29 18:51:49] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
// Phase 1: matrix 48 rows 30 cols
[2024-05-29 18:51:49] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:51:49] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 18:51:49] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
[2024-05-29 18:51:49] [INFO ] Invariant cache hit.
[2024-05-29 18:51:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 18:51:49] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-29 18:51:49] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-29 18:51:49] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
[2024-05-29 18:51:49] [INFO ] Invariant cache hit.
[2024-05-29 18:51:49] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:51:49] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 47/77 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/78 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/78 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 39 constraints, problems are : Problem set: 0 solved, 47 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 30/30 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 47/77 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 47/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 86 constraints, problems are : Problem set: 0 solved, 47 unsolved in 670 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 30/30 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 2/2 constraints]
After SMT, in 1363ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1364ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/254 places, 52/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1547 ms. Remains : 30/254 places, 52/295 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-03 finished in 1637 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' '!((p0 U (G(!p1)&&(G(p1)||X(X(F(!p0)))))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 242 transition count 283
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 242 transition count 283
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 235 transition count 276
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 235 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 233 transition count 274
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 233 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 232 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 232 transition count 273
Applied a total of 44 rules in 34 ms. Remains 232 /254 variables (removed 22) and now considering 273/295 (removed 22) transitions.
// Phase 1: matrix 273 rows 232 cols
[2024-05-29 18:51:50] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 18:51:50] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 18:51:50] [INFO ] Invariant cache hit.
[2024-05-29 18:51:50] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-05-29 18:51:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-29 18:51:53] [INFO ] Deduced a trap composed of 187 places in 68 ms of which 2 ms to minimize.
[2024-05-29 18:51:53] [INFO ] Deduced a trap composed of 164 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:51:54] [INFO ] Deduced a trap composed of 163 places in 59 ms of which 2 ms to minimize.
[2024-05-29 18:51:54] [INFO ] Deduced a trap composed of 163 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:51:54] [INFO ] Deduced a trap composed of 164 places in 78 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-29 18:51:54] [INFO ] Deduced a trap composed of 98 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:51:54] [INFO ] Deduced a trap composed of 162 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 273/505 variables, 232/242 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 242 constraints, problems are : Problem set: 0 solved, 272 unsolved in 13038 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/505 variables, 232/242 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 272/514 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-29 18:52:10] [INFO ] Deduced a trap composed of 162 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/505 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (OVERLAPS) 0/505 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 515 constraints, problems are : Problem set: 0 solved, 272 unsolved in 16710 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 8/8 constraints]
After SMT, in 29779ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 29782ms
Starting structural reductions in LTL mode, iteration 1 : 232/254 places, 273/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30017 ms. Remains : 232/254 places, 273/295 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR p1 p0), true, p1, p0, p1, p0]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-04
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-04 finished in 30244 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)||X(X(F(p1)))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 241 transition count 282
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 241 transition count 282
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 233 transition count 274
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 233 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 231 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 230 transition count 271
Applied a total of 48 rules in 19 ms. Remains 230 /254 variables (removed 24) and now considering 271/295 (removed 24) transitions.
// Phase 1: matrix 271 rows 230 cols
[2024-05-29 18:52:20] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:52:21] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-29 18:52:21] [INFO ] Invariant cache hit.
[2024-05-29 18:52:21] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-29 18:52:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:52:23] [INFO ] Deduced a trap composed of 166 places in 69 ms of which 2 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 165 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 163 places in 63 ms of which 2 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 164 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:52:24] [INFO ] Deduced a trap composed of 164 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/501 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 238 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11218 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 508 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10359 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 5/5 constraints]
After SMT, in 21603ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 21605ms
Starting structural reductions in LTL mode, iteration 1 : 230/254 places, 271/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21906 ms. Remains : 230/254 places, 271/295 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 134 ms.
Product exploration explored 100000 steps with 33333 reset in 104 ms.
Computed a total of 32 stabilizing places and 34 stable transitions
Computed a total of 32 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-02b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02b-LTLCardinality-05 finished in 22315 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&&X(F(p1)))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 241 transition count 282
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 241 transition count 282
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 233 transition count 274
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 233 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 231 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 230 transition count 271
Applied a total of 48 rules in 15 ms. Remains 230 /254 variables (removed 24) and now considering 271/295 (removed 24) transitions.
// Phase 1: matrix 271 rows 230 cols
[2024-05-29 18:52:43] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 18:52:43] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 18:52:43] [INFO ] Invariant cache hit.
[2024-05-29 18:52:43] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-29 18:52:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:52:46] [INFO ] Deduced a trap composed of 166 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:52:46] [INFO ] Deduced a trap composed of 165 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:52:46] [INFO ] Deduced a trap composed of 163 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:52:46] [INFO ] Deduced a trap composed of 166 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:52:46] [INFO ] Deduced a trap composed of 163 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/501 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 238 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11259 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 508 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10790 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 5/5 constraints]
After SMT, in 22077ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 22082ms
Starting structural reductions in LTL mode, iteration 1 : 230/254 places, 271/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22287 ms. Remains : 230/254 places, 271/295 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-02b-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02b-LTLCardinality-07 finished in 22581 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((X(X(F(p0)))||(p1&&F(p2)))))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 242 transition count 283
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 242 transition count 283
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 234 transition count 275
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 234 transition count 275
Applied a total of 40 rules in 5 ms. Remains 234 /254 variables (removed 20) and now considering 275/295 (removed 20) transitions.
// Phase 1: matrix 275 rows 234 cols
[2024-05-29 18:53:05] [INFO ] Computed 3 invariants in 7 ms
[2024-05-29 18:53:05] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 18:53:05] [INFO ] Invariant cache hit.
[2024-05-29 18:53:06] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-05-29 18:53:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-29 18:53:08] [INFO ] Deduced a trap composed of 167 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:53:08] [INFO ] Deduced a trap composed of 168 places in 69 ms of which 2 ms to minimize.
[2024-05-29 18:53:09] [INFO ] Deduced a trap composed of 164 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:53:09] [INFO ] Deduced a trap composed of 166 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:53:09] [INFO ] Deduced a trap composed of 166 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/509 variables, 234/242 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (OVERLAPS) 0/509 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 242 constraints, problems are : Problem set: 0 solved, 274 unsolved in 11693 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/509 variables, 234/242 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 274/516 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-29 18:53:21] [INFO ] Deduced a trap composed of 168 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:53:22] [INFO ] Deduced a trap composed of 168 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 0/509 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 518 constraints, problems are : Problem set: 0 solved, 274 unsolved in 15758 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 7/7 constraints]
After SMT, in 27477ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 27480ms
Starting structural reductions in LTL mode, iteration 1 : 234/254 places, 275/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27651 ms. Remains : 234/254 places, 275/295 transitions.
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-08
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-08 finished in 27968 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((X(p0) U p1)))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 240 transition count 281
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 240 transition count 281
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 231 transition count 272
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 228 transition count 269
Applied a total of 52 rules in 12 ms. Remains 228 /254 variables (removed 26) and now considering 269/295 (removed 26) transitions.
// Phase 1: matrix 269 rows 228 cols
[2024-05-29 18:53:33] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 18:53:33] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 18:53:33] [INFO ] Invariant cache hit.
[2024-05-29 18:53:34] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-29 18:53:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:53:36] [INFO ] Deduced a trap composed of 164 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:53:36] [INFO ] Deduced a trap composed of 164 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:53:37] [INFO ] Deduced a trap composed of 163 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:53:37] [INFO ] Deduced a trap composed of 162 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:53:43] [INFO ] Deduced a trap composed of 162 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/497 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 14554 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11274 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
After SMT, in 25851ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 25854ms
Starting structural reductions in LTL mode, iteration 1 : 228/254 places, 269/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26042 ms. Remains : 228/254 places, 269/295 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-09
Product exploration explored 100000 steps with 94 reset in 66 ms.
Product exploration explored 100000 steps with 323 reset in 69 ms.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (692 resets) in 92 ms. (430 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (143 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2024-05-29 18:54:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 106/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/228 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 269/497 variables, 228/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 106/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/228 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 18:54:00] [INFO ] Deduced a trap composed of 164 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 269/497 variables, 228/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 323ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 143 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Applied a total of 0 rules in 4 ms. Remains 228 /228 variables (removed 0) and now considering 269/269 (removed 0) transitions.
[2024-05-29 18:54:01] [INFO ] Invariant cache hit.
[2024-05-29 18:54:01] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 18:54:01] [INFO ] Invariant cache hit.
[2024-05-29 18:54:01] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-29 18:54:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:54:03] [INFO ] Deduced a trap composed of 164 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:54:03] [INFO ] Deduced a trap composed of 164 places in 58 ms of which 2 ms to minimize.
[2024-05-29 18:54:04] [INFO ] Deduced a trap composed of 163 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:54:04] [INFO ] Deduced a trap composed of 162 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:54:10] [INFO ] Deduced a trap composed of 162 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/497 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 14641 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11215 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
After SMT, in 25881ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 25883ms
Finished structural reductions in LTL mode , in 1 iterations and 26065 ms. Remains : 228/228 places, 269/269 transitions.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 164 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (286 resets) in 73 ms. (540 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (127 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
[2024-05-29 18:54:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 106/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/228 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 269/497 variables, 228/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 106/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/228 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 18:54:27] [INFO ] Deduced a trap composed of 164 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 269/497 variables, 228/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 301ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 485 steps, including 15 resets, run visited all 1 properties in 2 ms. (steps per millisecond=242 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 188 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 1068 reset in 68 ms.
Product exploration explored 100000 steps with 362 reset in 77 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Graph (trivial) has 224 edges and 228 vertex of which 27 / 228 are part of one of the 5 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 134 rules applied. Total rules applied 135 place count 206 transition count 244
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 138 place count 206 transition count 241
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 138 place count 206 transition count 243
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 143 place count 206 transition count 243
Discarding 109 places :
Symmetric choice reduction at 2 with 109 rule applications. Total rules 252 place count 97 transition count 134
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 109 rules applied. Total rules applied 361 place count 97 transition count 134
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 379 place count 97 transition count 134
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 403 place count 73 transition count 100
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 427 place count 73 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 431 place count 73 transition count 96
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 438 place count 66 transition count 88
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 445 place count 66 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 446 place count 65 transition count 87
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 447 place count 65 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 448 place count 65 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 449 place count 64 transition count 86
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 450 place count 64 transition count 86
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 456 place count 64 transition count 103
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 461 place count 59 transition count 93
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 466 place count 59 transition count 93
Deduced a syphon composed of 27 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 474 place count 59 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 475 place count 58 transition count 84
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 476 place count 58 transition count 84
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 476 rules in 45 ms. Remains 58 /228 variables (removed 170) and now considering 84/269 (removed 185) transitions.
[2024-05-29 18:54:28] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-29 18:54:28] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 58 cols
[2024-05-29 18:54:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:54:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 18:54:28] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-29 18:54:29] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-29 18:54:29] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-29 18:54:29] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/6 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 75 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
At refinement iteration 4 (OVERLAPS) 80/138 variables, 58/64 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 7/71 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/71 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 1/139 variables, 1/72 constraints. Problems are: Problem set: 33 solved, 49 unsolved
[2024-05-29 18:54:29] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 1/73 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/73 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/73 constraints. Problems are: Problem set: 33 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 73 constraints, problems are : Problem set: 33 solved, 49 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 33 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 27/58 variables, 2/2 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/7 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 80/138 variables, 58/65 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 7/72 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 49/121 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/121 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/122 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/122 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/122 constraints. Problems are: Problem set: 33 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 122 constraints, problems are : Problem set: 33 solved, 49 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 49/82 constraints, Known Traps: 5/5 constraints]
After SMT, in 2461ms problems are : Problem set: 33 solved, 49 unsolved
Search for dead transitions found 33 dead transitions in 2461ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 58/228 places, 51/269 transitions.
Graph (complete) has 91 edges and 58 vertex of which 32 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 32 /58 variables (removed 26) and now considering 51/51 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/228 places, 51/269 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2520 ms. Remains : 32/228 places, 51/269 transitions.
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Applied a total of 0 rules in 3 ms. Remains 228 /228 variables (removed 0) and now considering 269/269 (removed 0) transitions.
// Phase 1: matrix 269 rows 228 cols
[2024-05-29 18:54:31] [INFO ] Computed 3 invariants in 4 ms
[2024-05-29 18:54:31] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 18:54:31] [INFO ] Invariant cache hit.
[2024-05-29 18:54:31] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-29 18:54:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:54:33] [INFO ] Deduced a trap composed of 164 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:54:34] [INFO ] Deduced a trap composed of 164 places in 62 ms of which 2 ms to minimize.
[2024-05-29 18:54:34] [INFO ] Deduced a trap composed of 163 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:54:34] [INFO ] Deduced a trap composed of 162 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:54:40] [INFO ] Deduced a trap composed of 162 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/497 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 14872 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 10966 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
After SMT, in 25865ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 25867ms
Finished structural reductions in LTL mode , in 1 iterations and 26049 ms. Remains : 228/228 places, 269/269 transitions.
Treatment of property StigmergyElection-PT-02b-LTLCardinality-09 finished in 83463 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)))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Graph (trivial) has 250 edges and 254 vertex of which 39 / 254 are part of one of the 6 SCC in 0 ms
Free SCC test removed 33 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 220 transition count 110
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 151 rules applied. Total rules applied 299 place count 73 transition count 106
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 302 place count 71 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 303 place count 70 transition count 105
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 303 place count 70 transition count 98
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 317 place count 63 transition count 98
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 322 place count 58 transition count 93
Iterating global reduction 4 with 5 rules applied. Total rules applied 327 place count 58 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 327 place count 58 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 329 place count 57 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 330 place count 56 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 331 place count 56 transition count 88
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 355 place count 44 transition count 76
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 360 place count 39 transition count 65
Iterating global reduction 4 with 5 rules applied. Total rules applied 365 place count 39 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 367 place count 39 transition count 63
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 368 place count 38 transition count 61
Iterating global reduction 5 with 1 rules applied. Total rules applied 369 place count 38 transition count 61
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 375 place count 35 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 377 place count 35 transition count 60
Applied a total of 377 rules in 15 ms. Remains 35 /254 variables (removed 219) and now considering 60/295 (removed 235) transitions.
[2024-05-29 18:54:57] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
// Phase 1: matrix 56 rows 35 cols
[2024-05-29 18:54:57] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:54:57] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 18:54:57] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
[2024-05-29 18:54:57] [INFO ] Invariant cache hit.
[2024-05-29 18:54:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 18:54:57] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-29 18:54:57] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-29 18:54:57] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
[2024-05-29 18:54:57] [INFO ] Invariant cache hit.
[2024-05-29 18:54:57] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:54:57] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 55/90 variables, 35/38 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:54:57] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/91 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/91 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 44 constraints, problems are : Problem set: 0 solved, 54 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 55/90 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 54/97 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:54:58] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/91 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/91 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 99 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1085 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 3/3 constraints]
After SMT, in 2018ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2020ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/254 places, 60/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2101 ms. Remains : 35/254 places, 60/295 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-10
Product exploration explored 100000 steps with 8 reset in 76 ms.
Product exploration explored 100000 steps with 62 reset in 66 ms.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 177 steps (22 resets) in 5 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 35 /35 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-29 18:55:00] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
[2024-05-29 18:55:00] [INFO ] Invariant cache hit.
[2024-05-29 18:55:00] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 18:55:00] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
[2024-05-29 18:55:00] [INFO ] Invariant cache hit.
[2024-05-29 18:55:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 18:55:00] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-29 18:55:00] [INFO ] Redundant transitions in 0 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-29 18:55:00] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
[2024-05-29 18:55:00] [INFO ] Invariant cache hit.
[2024-05-29 18:55:00] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:55:00] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 55/90 variables, 35/38 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:55:00] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/91 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/91 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 44 constraints, problems are : Problem set: 0 solved, 54 unsolved in 954 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 55/90 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 54/97 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:55:01] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/91 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/91 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 99 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 3/3 constraints]
After SMT, in 2038ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2039ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2124 ms. Remains : 35/35 places, 60/60 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 191 steps (25 resets) in 7 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 46 ms.
Product exploration explored 100000 steps with 20 reset in 66 ms.
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-29 18:55:02] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
[2024-05-29 18:55:02] [INFO ] Invariant cache hit.
[2024-05-29 18:55:02] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 18:55:02] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
[2024-05-29 18:55:02] [INFO ] Invariant cache hit.
[2024-05-29 18:55:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 18:55:02] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-29 18:55:02] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-29 18:55:02] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
[2024-05-29 18:55:02] [INFO ] Invariant cache hit.
[2024-05-29 18:55:02] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:55:03] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 55/90 variables, 35/38 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:55:03] [INFO ] Deduced a trap composed of 28 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/91 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/91 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 44 constraints, problems are : Problem set: 0 solved, 54 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 55/90 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 54/97 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:55:04] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/91 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/91 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 99 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1092 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 3/3 constraints]
After SMT, in 2016ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2016ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2099 ms. Remains : 35/35 places, 60/60 transitions.
Treatment of property StigmergyElection-PT-02b-LTLCardinality-10 finished in 7668 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((G(p0)||(!p1 U (p2||G(!p1))))))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 240 transition count 281
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 240 transition count 281
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 231 transition count 272
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 228 transition count 269
Applied a total of 52 rules in 12 ms. Remains 228 /254 variables (removed 26) and now considering 269/295 (removed 26) transitions.
// Phase 1: matrix 269 rows 228 cols
[2024-05-29 18:55:04] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:55:05] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 18:55:05] [INFO ] Invariant cache hit.
[2024-05-29 18:55:05] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-29 18:55:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:55:07] [INFO ] Deduced a trap composed of 164 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:55:07] [INFO ] Deduced a trap composed of 164 places in 58 ms of which 2 ms to minimize.
[2024-05-29 18:55:08] [INFO ] Deduced a trap composed of 163 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:55:08] [INFO ] Deduced a trap composed of 162 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:55:14] [INFO ] Deduced a trap composed of 162 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/497 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 14694 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11165 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
After SMT, in 25885ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 25887ms
Starting structural reductions in LTL mode, iteration 1 : 228/254 places, 269/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26114 ms. Remains : 228/254 places, 269/295 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-13
Product exploration explored 100000 steps with 137 reset in 99 ms.
Stack based approach found an accepted trace after 6867 steps with 151 reset with depth 36 and stack size 36 in 10 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-13 finished in 26359 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)))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Graph (trivial) has 257 edges and 254 vertex of which 39 / 254 are part of one of the 6 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 154 place count 220 transition count 104
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 157 rules applied. Total rules applied 311 place count 67 transition count 100
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 314 place count 65 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 64 transition count 99
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 315 place count 64 transition count 93
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 327 place count 58 transition count 93
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 334 place count 51 transition count 86
Iterating global reduction 4 with 7 rules applied. Total rules applied 341 place count 51 transition count 86
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 341 place count 51 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 345 place count 49 transition count 84
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 347 place count 47 transition count 79
Iterating global reduction 4 with 2 rules applied. Total rules applied 349 place count 47 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 350 place count 47 transition count 78
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 372 place count 36 transition count 67
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 379 place count 29 transition count 52
Iterating global reduction 5 with 7 rules applied. Total rules applied 386 place count 29 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 390 place count 29 transition count 48
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 391 place count 28 transition count 46
Iterating global reduction 6 with 1 rules applied. Total rules applied 392 place count 28 transition count 46
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 398 place count 25 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 401 place count 25 transition count 44
Applied a total of 401 rules in 15 ms. Remains 25 /254 variables (removed 229) and now considering 44/295 (removed 251) transitions.
[2024-05-29 18:55:31] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
// Phase 1: matrix 41 rows 25 cols
[2024-05-29 18:55:31] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:55:31] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 18:55:31] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-29 18:55:31] [INFO ] Invariant cache hit.
[2024-05-29 18:55:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 18:55:31] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-29 18:55:31] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-29 18:55:31] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-29 18:55:31] [INFO ] Invariant cache hit.
[2024-05-29 18:55:31] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 18:55:31] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:55:31] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/65 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 34 constraints, problems are : Problem set: 0 solved, 39 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/65 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 39/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 1/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/66 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 73 constraints, problems are : Problem set: 0 solved, 39 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
After SMT, in 988ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 989ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/254 places, 44/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1067 ms. Remains : 25/254 places, 44/295 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-14
Product exploration explored 100000 steps with 1 reset in 85 ms.
Product exploration explored 100000 steps with 49 reset in 66 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 201 steps (27 resets) in 4 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 44/44 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2024-05-29 18:55:33] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-29 18:55:33] [INFO ] Invariant cache hit.
[2024-05-29 18:55:33] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 18:55:33] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-29 18:55:33] [INFO ] Invariant cache hit.
[2024-05-29 18:55:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 18:55:33] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-29 18:55:33] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-29 18:55:33] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-29 18:55:33] [INFO ] Invariant cache hit.
[2024-05-29 18:55:33] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 18:55:33] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:55:33] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/65 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 34 constraints, problems are : Problem set: 0 solved, 39 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/65 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 39/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 1/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/66 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 73 constraints, problems are : Problem set: 0 solved, 39 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
After SMT, in 1043ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1045ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1124 ms. Remains : 25/25 places, 44/44 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 101 steps (14 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13 reset in 45 ms.
Product exploration explored 100000 steps with 11 reset in 70 ms.
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 44/44 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2024-05-29 18:55:34] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-29 18:55:34] [INFO ] Invariant cache hit.
[2024-05-29 18:55:34] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 18:55:34] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-29 18:55:34] [INFO ] Invariant cache hit.
[2024-05-29 18:55:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 18:55:34] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-29 18:55:34] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-29 18:55:34] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-29 18:55:34] [INFO ] Invariant cache hit.
[2024-05-29 18:55:34] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 18:55:34] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:55:35] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/65 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 34 constraints, problems are : Problem set: 0 solved, 39 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/65 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 39/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 1/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/66 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 73 constraints, problems are : Problem set: 0 solved, 39 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
After SMT, in 972ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 973ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1040 ms. Remains : 25/25 places, 44/44 transitions.
Treatment of property StigmergyElection-PT-02b-LTLCardinality-14 finished in 4568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 243 transition count 284
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 243 transition count 284
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 236 transition count 277
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 236 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 235 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 235 transition count 276
Applied a total of 38 rules in 11 ms. Remains 235 /254 variables (removed 19) and now considering 276/295 (removed 19) transitions.
// Phase 1: matrix 276 rows 235 cols
[2024-05-29 18:55:35] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:55:35] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 18:55:35] [INFO ] Invariant cache hit.
[2024-05-29 18:55:36] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2024-05-29 18:55:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-29 18:55:38] [INFO ] Deduced a trap composed of 166 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:55:38] [INFO ] Deduced a trap composed of 169 places in 67 ms of which 2 ms to minimize.
[2024-05-29 18:55:39] [INFO ] Deduced a trap composed of 165 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:55:39] [INFO ] Deduced a trap composed of 167 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:55:39] [INFO ] Deduced a trap composed of 165 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/511 variables, 235/243 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-29 18:55:44] [INFO ] Deduced a trap composed of 168 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/511 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 244 constraints, problems are : Problem set: 0 solved, 275 unsolved in 13886 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/511 variables, 235/244 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 275/519 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-29 18:55:53] [INFO ] Deduced a trap composed of 165 places in 56 ms of which 2 ms to minimize.
[2024-05-29 18:55:55] [INFO ] Deduced a trap composed of 169 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 2/521 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 0/511 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 521 constraints, problems are : Problem set: 0 solved, 275 unsolved in 15182 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 8/8 constraints]
After SMT, in 29095ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 29099ms
Starting structural reductions in LTL mode, iteration 1 : 235/254 places, 276/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29287 ms. Remains : 235/254 places, 276/295 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-15 finished in 29428 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((X(p0) U p1)))'
Found a Lengthening insensitive property : StigmergyElection-PT-02b-LTLCardinality-09
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Graph (trivial) has 250 edges and 254 vertex of which 32 / 254 are part of one of the 5 SCC in 1 ms
Free SCC test removed 27 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 150 place count 226 transition count 115
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 153 rules applied. Total rules applied 303 place count 77 transition count 111
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 309 place count 75 transition count 107
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 315 place count 71 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 316 place count 70 transition count 105
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 316 place count 70 transition count 97
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 332 place count 62 transition count 97
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 339 place count 55 transition count 90
Iterating global reduction 5 with 7 rules applied. Total rules applied 346 place count 55 transition count 90
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 346 place count 55 transition count 88
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 350 place count 53 transition count 88
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 352 place count 51 transition count 83
Iterating global reduction 5 with 2 rules applied. Total rules applied 354 place count 51 transition count 83
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 374 place count 41 transition count 73
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 379 place count 36 transition count 61
Iterating global reduction 5 with 5 rules applied. Total rules applied 384 place count 36 transition count 61
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 388 place count 36 transition count 57
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 389 place count 35 transition count 55
Iterating global reduction 6 with 1 rules applied. Total rules applied 390 place count 35 transition count 55
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 396 place count 32 transition count 56
Applied a total of 396 rules in 22 ms. Remains 32 /254 variables (removed 222) and now considering 56/295 (removed 239) transitions.
[2024-05-29 18:56:05] [INFO ] Flow matrix only has 53 transitions (discarded 3 similar events)
// Phase 1: matrix 53 rows 32 cols
[2024-05-29 18:56:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:56:05] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 18:56:05] [INFO ] Flow matrix only has 53 transitions (discarded 3 similar events)
[2024-05-29 18:56:05] [INFO ] Invariant cache hit.
[2024-05-29 18:56:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 18:56:05] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-05-29 18:56:05] [INFO ] Flow matrix only has 53 transitions (discarded 3 similar events)
[2024-05-29 18:56:05] [INFO ] Invariant cache hit.
[2024-05-29 18:56:05] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-29 18:56:05] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:56:05] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:56:05] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 52/84 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 1/85 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 0/85 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 42 constraints, problems are : Problem set: 0 solved, 50 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 52/84 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 50/91 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 1/85 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/85 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 92 constraints, problems are : Problem set: 0 solved, 50 unsolved in 723 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
After SMT, in 1433ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1434ms
Starting structural reductions in LI_LTL mode, iteration 1 : 32/254 places, 56/295 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1521 ms. Remains : 32/254 places, 56/295 transitions.
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-09
Stuttering criterion allowed to conclude after 20 steps with 2 reset in 0 ms.
Treatment of property StigmergyElection-PT-02b-LTLCardinality-09 finished in 1707 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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)))'
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)))'
[2024-05-29 18:56:07] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:56:07] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-29 18:56:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 254 places, 295 transitions and 660 arcs took 3 ms.
Total runtime 319040 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyElection-PT-02b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 254
TRANSITIONS: 295
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.001s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1741
MODEL NAME: /home/mcc/execution/412/model
254 places, 295 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyElection-PT-02b-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-02b-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-02b-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717008971078

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-02b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is StigmergyElection-PT-02b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690530000259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-02b.tgz
mv StigmergyElection-PT-02b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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