MCC'2024- Execution of r400-tall-171690532200379

About the Execution of ITS-Tools for StigmergyElection-PT-10a

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2775.300	144773.00	202217.00	580.00	TFFTFTTFFTTFFFFT	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-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.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 19:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 19:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 19:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 50M 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-10a-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717016572318

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 21:02:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 21:02:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 21:02:55] [INFO ] Load time of PNML (sax parser for PT used): 2141 ms
[2024-05-29 21:02:55] [INFO ] Transformed 142 places.
[2024-05-29 21:02:56] [INFO ] Transformed 50162 transitions.
[2024-05-29 21:02:56] [INFO ] Found NUPN structural information;
[2024-05-29 21:02:56] [INFO ] Parsed PT model containing 142 places and 50162 transitions and 999212 arcs in 2651 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-10a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-10a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 2238/2238 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 128 transition count 2215
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 128 transition count 2215
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 121 transition count 2201
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 121 transition count 2201
Applied a total of 42 rules in 145 ms. Remains 121 /142 variables (removed 21) and now considering 2201/2238 (removed 37) transitions.
[2024-05-29 21:02:56] [INFO ] Flow matrix only has 2185 transitions (discarded 16 similar events)
// Phase 1: matrix 2185 rows 121 cols
[2024-05-29 21:02:56] [INFO ] Computed 6 invariants in 43 ms
[2024-05-29 21:02:57] [INFO ] Implicit Places using invariants in 1164 ms returned []
[2024-05-29 21:02:57] [INFO ] Flow matrix only has 2185 transitions (discarded 16 similar events)
[2024-05-29 21:02:57] [INFO ] Invariant cache hit.
[2024-05-29 21:02:58] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-05-29 21:02:59] [INFO ] Implicit Places using invariants and state equation in 1934 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3150 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/142 places, 2201/2238 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 109 transition count 2190
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 109 transition count 2190
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 104 transition count 2185
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 104 transition count 2185
Applied a total of 32 rules in 38 ms. Remains 104 /120 variables (removed 16) and now considering 2185/2201 (removed 16) transitions.
[2024-05-29 21:02:59] [INFO ] Flow matrix only has 2169 transitions (discarded 16 similar events)
// Phase 1: matrix 2169 rows 104 cols
[2024-05-29 21:02:59] [INFO ] Computed 5 invariants in 24 ms
[2024-05-29 21:03:00] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-05-29 21:03:00] [INFO ] Flow matrix only has 2169 transitions (discarded 16 similar events)
[2024-05-29 21:03:00] [INFO ] Invariant cache hit.
[2024-05-29 21:03:01] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:03:01] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/142 places, 2185/2238 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5412 ms. Remains : 104/142 places, 2185/2238 transitions.
Support contains 18 out of 104 places after structural reductions.
[2024-05-29 21:03:02] [INFO ] Flatten gal took : 312 ms
[2024-05-29 21:03:02] [INFO ] Flatten gal took : 176 ms
[2024-05-29 21:03:03] [INFO ] Input system was already deterministic with 2185 transitions.
RANDOM walk for 40000 steps (12 resets) in 6588 ms. (6 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (9 resets) in 129 ms. (307 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
[2024-05-29 21:03:04] [INFO ] Flow matrix only has 2169 transitions (discarded 16 similar events)
[2024-05-29 21:03:04] [INFO ] Invariant cache hit.
[2024-05-29 21:03:05] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 21:03:05] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 80/104 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 21:03:06] [INFO ] Deduced a trap composed of 9 places in 531 ms of which 4 ms to minimize.
[2024-05-29 21:03:06] [INFO ] Deduced a trap composed of 14 places in 496 ms of which 1 ms to minimize.
[2024-05-29 21:03:06] [INFO ] Deduced a trap composed of 11 places in 410 ms of which 1 ms to minimize.
[2024-05-29 21:03:07] [INFO ] Deduced a trap composed of 12 places in 419 ms of which 1 ms to minimize.
[2024-05-29 21:03:07] [INFO ] Deduced a trap composed of 9 places in 472 ms of which 1 ms to minimize.
[2024-05-29 21:03:08] [INFO ] Deduced a trap composed of 12 places in 445 ms of which 2 ms to minimize.
[2024-05-29 21:03:08] [INFO ] Deduced a trap composed of 9 places in 398 ms of which 1 ms to minimize.
[2024-05-29 21:03:09] [INFO ] Deduced a trap composed of 10 places in 396 ms of which 1 ms to minimize.
[2024-05-29 21:03:09] [INFO ] Deduced a trap composed of 11 places in 385 ms of which 0 ms to minimize.
[2024-05-29 21:03:09] [INFO ] Deduced a trap composed of 11 places in 314 ms of which 1 ms to minimize.
[2024-05-29 21:03:10] [INFO ] Deduced a trap composed of 11 places in 299 ms of which 1 ms to minimize.
[2024-05-29 21:03:10] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 1 ms to minimize.
SMT process timed out in 5527ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2185/2185 transitions.
Graph (complete) has 421 edges and 104 vertex of which 100 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.23 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 100 transition count 2127
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 48 rules applied. Total rules applied 103 place count 68 transition count 2111
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 110 place count 61 transition count 2111
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 110 place count 61 transition count 2105
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 122 place count 55 transition count 2105
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 140 place count 37 transition count 2085
Iterating global reduction 3 with 18 rules applied. Total rules applied 158 place count 37 transition count 2085
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 177 place count 37 transition count 2066
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 180 place count 34 transition count 2063
Iterating global reduction 4 with 3 rules applied. Total rules applied 183 place count 34 transition count 2063
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 186 place count 34 transition count 2060
Performed 18 Post agglomeration using F-continuation condition with reduction of 1944 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 228 place count 10 transition count 98
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 5 with 84 rules applied. Total rules applied 312 place count 10 transition count 14
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 317 place count 7 transition count 10
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 321 place count 7 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 322 place count 7 transition count 6
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 323 place count 7 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 324 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 325 place count 5 transition count 4
Applied a total of 325 rules in 205 ms. Remains 5 /104 variables (removed 99) and now considering 4/2185 (removed 2181) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 5/104 places, 4/2185 transitions.
RANDOM walk for 14 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/2 properties
FORMULA StigmergyElection-PT-10a-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA StigmergyElection-PT-10a-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 10 stabilizing places and 10 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' '!((X(p0)||G(p1)))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 2185/2185 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 93 transition count 2171
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 93 transition count 2171
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 87 transition count 2164
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 87 transition count 2164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 86 transition count 2163
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 86 transition count 2163
Applied a total of 36 rules in 41 ms. Remains 86 /104 variables (removed 18) and now considering 2163/2185 (removed 22) transitions.
[2024-05-29 21:03:10] [INFO ] Flow matrix only has 2151 transitions (discarded 12 similar events)
// Phase 1: matrix 2151 rows 86 cols
[2024-05-29 21:03:10] [INFO ] Computed 2 invariants in 23 ms
[2024-05-29 21:03:11] [INFO ] Implicit Places using invariants in 669 ms returned []
[2024-05-29 21:03:11] [INFO ] Flow matrix only has 2151 transitions (discarded 12 similar events)
[2024-05-29 21:03:11] [INFO ] Invariant cache hit.
[2024-05-29 21:03:12] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:03:12] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1953 ms to find 0 implicit places.
Running 2162 sub problems to find dead transitions.
[2024-05-29 21:03:12] [INFO ] Flow matrix only has 2151 transitions (discarded 12 similar events)
[2024-05-29 21:03:12] [INFO ] Invariant cache hit.
[2024-05-29 21:03:13] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2162 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2162 unsolved
[2024-05-29 21:03:57] [INFO ] Deduced a trap composed of 9 places in 574 ms of which 1 ms to minimize.
[2024-05-29 21:03:58] [INFO ] Deduced a trap composed of 9 places in 475 ms of which 0 ms to minimize.
[2024-05-29 21:03:58] [INFO ] Deduced a trap composed of 9 places in 520 ms of which 0 ms to minimize.
[2024-05-29 21:03:59] [INFO ] Deduced a trap composed of 9 places in 516 ms of which 2 ms to minimize.
[2024-05-29 21:04:00] [INFO ] Deduced a trap composed of 9 places in 553 ms of which 1 ms to minimize.
[2024-05-29 21:04:00] [INFO ] Deduced a trap composed of 9 places in 477 ms of which 1 ms to minimize.
[2024-05-29 21:04:01] [INFO ] Deduced a trap composed of 10 places in 575 ms of which 5 ms to minimize.
[2024-05-29 21:04:01] [INFO ] Deduced a trap composed of 9 places in 631 ms of which 0 ms to minimize.
[2024-05-29 21:04:02] [INFO ] Deduced a trap composed of 11 places in 620 ms of which 2 ms to minimize.
[2024-05-29 21:04:02] [INFO ] Deduced a trap composed of 9 places in 607 ms of which 1 ms to minimize.
[2024-05-29 21:04:03] [INFO ] Deduced a trap composed of 9 places in 626 ms of which 1 ms to minimize.
[2024-05-29 21:04:04] [INFO ] Deduced a trap composed of 13 places in 531 ms of which 1 ms to minimize.
[2024-05-29 21:04:04] [INFO ] Deduced a trap composed of 9 places in 529 ms of which 1 ms to minimize.
[2024-05-29 21:04:05] [INFO ] Deduced a trap composed of 11 places in 551 ms of which 0 ms to minimize.
[2024-05-29 21:04:05] [INFO ] Deduced a trap composed of 9 places in 467 ms of which 1 ms to minimize.
[2024-05-29 21:04:06] [INFO ] Deduced a trap composed of 9 places in 625 ms of which 1 ms to minimize.
[2024-05-29 21:04:06] [INFO ] Deduced a trap composed of 9 places in 530 ms of which 1 ms to minimize.
[2024-05-29 21:04:07] [INFO ] Deduced a trap composed of 9 places in 457 ms of which 1 ms to minimize.
[2024-05-29 21:04:07] [INFO ] Deduced a trap composed of 10 places in 523 ms of which 1 ms to minimize.
[2024-05-29 21:04:08] [INFO ] Deduced a trap composed of 10 places in 458 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 2162 unsolved
[2024-05-29 21:04:09] [INFO ] Deduced a trap composed of 9 places in 359 ms of which 1 ms to minimize.
[2024-05-29 21:04:09] [INFO ] Deduced a trap composed of 9 places in 291 ms of which 3 ms to minimize.
[2024-05-29 21:04:09] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 1 ms to minimize.
[2024-05-29 21:04:10] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 1 ms to minimize.
[2024-05-29 21:04:10] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 0 ms to minimize.
[2024-05-29 21:04:10] [INFO ] Deduced a trap composed of 9 places in 531 ms of which 1 ms to minimize.
[2024-05-29 21:04:11] [INFO ] Deduced a trap composed of 9 places in 538 ms of which 2 ms to minimize.
[2024-05-29 21:04:11] [INFO ] Deduced a trap composed of 9 places in 411 ms of which 1 ms to minimize.
[2024-05-29 21:04:12] [INFO ] Deduced a trap composed of 9 places in 367 ms of which 0 ms to minimize.
[2024-05-29 21:04:12] [INFO ] Deduced a trap composed of 9 places in 324 ms of which 1 ms to minimize.
[2024-05-29 21:04:13] [INFO ] Deduced a trap composed of 9 places in 418 ms of which 1 ms to minimize.
[2024-05-29 21:04:13] [INFO ] Deduced a trap composed of 9 places in 356 ms of which 1 ms to minimize.
[2024-05-29 21:04:13] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 0 ms to minimize.
[2024-05-29 21:04:14] [INFO ] Deduced a trap composed of 9 places in 331 ms of which 1 ms to minimize.
[2024-05-29 21:04:14] [INFO ] Deduced a trap composed of 9 places in 279 ms of which 1 ms to minimize.
[2024-05-29 21:04:14] [INFO ] Deduced a trap composed of 9 places in 422 ms of which 0 ms to minimize.
[2024-05-29 21:04:15] [INFO ] Deduced a trap composed of 9 places in 379 ms of which 1 ms to minimize.
[2024-05-29 21:04:15] [INFO ] Deduced a trap composed of 9 places in 329 ms of which 1 ms to minimize.
[2024-05-29 21:04:15] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 1 ms to minimize.
[2024-05-29 21:04:16] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2162 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 86/2237 variables, and 42 constraints, problems are : Problem set: 0 solved, 2162 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/86 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2162/105 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2162 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 2162 unsolved
[2024-05-29 21:04:24] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 0 ms to minimize.
[2024-05-29 21:04:24] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 1 ms to minimize.
[2024-05-29 21:04:24] [INFO ] Deduced a trap composed of 10 places in 338 ms of which 3 ms to minimize.
[2024-05-29 21:04:24] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 4 ms to minimize.
[2024-05-29 21:04:25] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 0 ms to minimize.
[2024-05-29 21:04:25] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 1 ms to minimize.
[2024-05-29 21:04:25] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
[2024-05-29 21:04:25] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2024-05-29 21:04:25] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2024-05-29 21:04:26] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 1 ms to minimize.
[2024-05-29 21:04:26] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 1 ms to minimize.
[2024-05-29 21:04:26] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 0 ms to minimize.
[2024-05-29 21:04:26] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 1 ms to minimize.
[2024-05-29 21:04:27] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 1 ms to minimize.
[2024-05-29 21:04:27] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 0 ms to minimize.
[2024-05-29 21:04:27] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 0 ms to minimize.
[2024-05-29 21:04:27] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 1 ms to minimize.
[2024-05-29 21:04:28] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 1 ms to minimize.
[2024-05-29 21:04:28] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2024-05-29 21:04:28] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2162 unsolved
[2024-05-29 21:04:29] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 1 ms to minimize.
[2024-05-29 21:04:29] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 1 ms to minimize.
[2024-05-29 21:04:29] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2024-05-29 21:04:29] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 0 ms to minimize.
[2024-05-29 21:04:30] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2024-05-29 21:04:30] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
[2024-05-29 21:04:30] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 0 ms to minimize.
[2024-05-29 21:04:30] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2024-05-29 21:04:30] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2024-05-29 21:04:31] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 1 ms to minimize.
[2024-05-29 21:04:31] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2024-05-29 21:04:31] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 1 ms to minimize.
[2024-05-29 21:04:31] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-29 21:04:31] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2024-05-29 21:04:31] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2024-05-29 21:04:31] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 1 ms to minimize.
[2024-05-29 21:04:32] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2024-05-29 21:04:32] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2024-05-29 21:04:32] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-05-29 21:04:32] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 2162 unsolved
[2024-05-29 21:04:33] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-05-29 21:04:34] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2024-05-29 21:04:34] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-29 21:04:34] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2024-05-29 21:04:34] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2024-05-29 21:04:34] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-29 21:04:34] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2024-05-29 21:04:34] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2024-05-29 21:04:35] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-29 21:04:35] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-29 21:04:35] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2024-05-29 21:04:35] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2024-05-29 21:04:35] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-29 21:04:35] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2024-05-29 21:04:36] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2024-05-29 21:04:36] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2024-05-29 21:04:36] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 21:04:36] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-29 21:04:36] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2024-05-29 21:04:37] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 2162 unsolved
[2024-05-29 21:04:40] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2024-05-29 21:04:40] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 0 ms to minimize.
[2024-05-29 21:04:40] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2024-05-29 21:04:40] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2024-05-29 21:04:41] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2024-05-29 21:04:41] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 1 ms to minimize.
[2024-05-29 21:04:41] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 0 ms to minimize.
[2024-05-29 21:04:42] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 0 ms to minimize.
[2024-05-29 21:04:42] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 0 ms to minimize.
[2024-05-29 21:04:42] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2024-05-29 21:04:42] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2024-05-29 21:04:42] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-29 21:04:42] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2024-05-29 21:04:43] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2024-05-29 21:04:43] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2024-05-29 21:04:43] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-29 21:04:43] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)timeout

(s66 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 86/2237 variables, and 119 constraints, problems are : Problem set: 0 solved, 2162 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/86 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2057/105 constraints, Known Traps: 117/117 constraints]
After SMT, in 94286ms problems are : Problem set: 0 solved, 2162 unsolved
Search for dead transitions found 0 dead transitions in 94322ms
Starting structural reductions in LTL mode, iteration 1 : 86/104 places, 2163/2185 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96336 ms. Remains : 86/104 places, 2163/2185 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 290 ms.
Product exploration explored 100000 steps with 50000 reset in 236 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-10a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-10a-LTLCardinality-05 finished in 97263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2185/2185 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 103 transition count 2162
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 81 transition count 2162
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 44 place count 81 transition count 2151
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 66 place count 70 transition count 2151
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 63 transition count 2143
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 63 transition count 2143
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 87 place count 63 transition count 2136
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 87 place count 63 transition count 2134
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 61 transition count 2134
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 123 place count 45 transition count 2118
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Iterating post reduction 3 with 253 rules applied. Total rules applied 376 place count 45 transition count 1865
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 386 place count 40 transition count 1860
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 391 place count 40 transition count 1855
Drop transitions (Redundant composition of simpler transitions.) removed 1769 transitions
Redundant transition composition rules discarded 1769 transitions
Iterating global reduction 5 with 1769 rules applied. Total rules applied 2160 place count 40 transition count 86
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 2180 place count 30 transition count 76
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 2185 place count 25 transition count 71
Applied a total of 2185 rules in 855 ms. Remains 25 /104 variables (removed 79) and now considering 71/2185 (removed 2114) transitions.
[2024-05-29 21:04:48] [INFO ] Flow matrix only has 60 transitions (discarded 11 similar events)
// Phase 1: matrix 60 rows 25 cols
[2024-05-29 21:04:48] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 21:04:49] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 21:04:49] [INFO ] Flow matrix only has 60 transitions (discarded 11 similar events)
[2024-05-29 21:04:49] [INFO ] Invariant cache hit.
[2024-05-29 21:04:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 21:04:49] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-29 21:04:49] [INFO ] Redundant transitions in 2 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-29 21:04:49] [INFO ] Flow matrix only has 60 transitions (discarded 11 similar events)
[2024-05-29 21:04:49] [INFO ] Invariant cache hit.
[2024-05-29 21:04:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 10/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 21:04:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 59/84 variables, 25/56 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 1/85 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 21:04:50] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/85 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/85 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/85 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/85 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/85 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:04:51] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/85 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/85 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/85 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/85 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/85 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:04:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/85 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:04:53] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-29 21:04:53] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-29 21:04:53] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/85 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:04:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/85 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:53] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/85 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/85 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/85 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/85 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 31 (OVERLAPS) 0/85 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 115 constraints, problems are : Problem set: 0 solved, 27 unsolved in 4654 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 10/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 88/89 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 21:04:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 59/84 variables, 25/115 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 27/142 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/85 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/85 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 143 constraints, problems are : Problem set: 0 solved, 27 unsolved in 980 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 89/89 constraints]
After SMT, in 5652ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 5652ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/104 places, 71/2185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6625 ms. Remains : 25/104 places, 71/2185 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-07 finished in 6679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2185/2185 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 103 transition count 2161
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 80 transition count 2161
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 46 place count 80 transition count 2150
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 68 place count 69 transition count 2150
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 76 place count 61 transition count 2139
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 61 transition count 2139
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 99 place count 61 transition count 2124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 99 place count 61 transition count 2122
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 59 transition count 2122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 58 transition count 2120
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 58 transition count 2120
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 121 place count 58 transition count 2104
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 151 place count 43 transition count 2089
Ensure Unique test removed 997 transitions
Reduce isomorphic transitions removed 997 transitions.
Iterating post reduction 4 with 997 rules applied. Total rules applied 1148 place count 43 transition count 1092
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1158 place count 38 transition count 1087
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1162 place count 38 transition count 1083
Drop transitions (Redundant composition of simpler transitions.) removed 1026 transitions
Redundant transition composition rules discarded 1026 transitions
Iterating global reduction 6 with 1026 rules applied. Total rules applied 2188 place count 38 transition count 57
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 6 with 20 rules applied. Total rules applied 2208 place count 28 transition count 47
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2209 place count 28 transition count 47
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 2214 place count 23 transition count 42
Applied a total of 2214 rules in 293 ms. Remains 23 /104 variables (removed 81) and now considering 42/2185 (removed 2143) transitions.
[2024-05-29 21:04:55] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 23 cols
[2024-05-29 21:04:55] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 21:04:55] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-29 21:04:55] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-29 21:04:55] [INFO ] Invariant cache hit.
[2024-05-29 21:04:55] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-05-29 21:04:55] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-05-29 21:04:55] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-29 21:04:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 10/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 29/52 variables, 23/58 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 69 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1337 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 10/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:04:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 29/52 variables, 23/100 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 23/123 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/52 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/52 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 123 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1394 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 75/75 constraints]
After SMT, in 2743ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 2743ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/104 places, 42/2185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3483 ms. Remains : 23/104 places, 42/2185 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 145 ms.
Product exploration explored 100000 steps with 0 reset in 80 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 360 steps (37 resets) in 11 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 23 /23 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-29 21:04:58] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-29 21:04:58] [INFO ] Invariant cache hit.
[2024-05-29 21:04:59] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 21:04:59] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-29 21:04:59] [INFO ] Invariant cache hit.
[2024-05-29 21:04:59] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-29 21:04:59] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-05-29 21:04:59] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-05-29 21:04:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 10/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:04:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 29/52 variables, 23/58 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 69 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1453 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 10/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:05:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 21:05:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 29/52 variables, 23/100 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 23/123 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/52 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/52 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 123 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 75/75 constraints]
After SMT, in 2821ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 2821ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2911 ms. Remains : 23/23 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 134 steps (8 resets) in 4 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 57 ms.
Product exploration explored 100000 steps with 0 reset in 173 ms.
Built C files in :
/tmp/ltsmin2003960462270211833
[2024-05-29 21:05:02] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2024-05-29 21:05:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:05:02] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2024-05-29 21:05:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:05:02] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2024-05-29 21:05:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:05:02] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2003960462270211833
Running compilation step : cd /tmp/ltsmin2003960462270211833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 279 ms.
Running link step : cd /tmp/ltsmin2003960462270211833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin2003960462270211833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18318080523639018163.hoa' '--buchi-type=spotba'
LTSmin run took 216 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-10a-LTLCardinality-08 finished in 8437 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 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2185/2185 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 103 transition count 2163
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 82 transition count 2163
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 42 place count 82 transition count 2152
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 64 place count 71 transition count 2152
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 64 transition count 2142
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 64 transition count 2142
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 93 place count 64 transition count 2127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 93 place count 64 transition count 2125
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 62 transition count 2125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 61 transition count 2123
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 61 transition count 2123
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 115 place count 61 transition count 2107
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 141 place count 48 transition count 2094
Ensure Unique test removed 995 transitions
Reduce isomorphic transitions removed 995 transitions.
Iterating post reduction 4 with 995 rules applied. Total rules applied 1136 place count 48 transition count 1099
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1146 place count 43 transition count 1094
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1150 place count 43 transition count 1090
Drop transitions (Redundant composition of simpler transitions.) removed 1026 transitions
Redundant transition composition rules discarded 1026 transitions
Iterating global reduction 6 with 1026 rules applied. Total rules applied 2176 place count 43 transition count 64
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 6 with 20 rules applied. Total rules applied 2196 place count 33 transition count 54
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 2199 place count 33 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2200 place count 33 transition count 53
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 2204 place count 29 transition count 49
Applied a total of 2204 rules in 236 ms. Remains 29 /104 variables (removed 75) and now considering 49/2185 (removed 2136) transitions.
[2024-05-29 21:05:03] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
// Phase 1: matrix 36 rows 29 cols
[2024-05-29 21:05:03] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 21:05:03] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 21:05:03] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
[2024-05-29 21:05:03] [INFO ] Invariant cache hit.
[2024-05-29 21:05:03] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 21:05:03] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-29 21:05:03] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-29 21:05:03] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
[2024-05-29 21:05:03] [INFO ] Invariant cache hit.
[2024-05-29 21:05:03] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 21:05:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:05:03] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 21:05:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 21:05:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:05:03] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 21:05:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2024-05-29 21:05:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:05:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:05:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:05:03] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:05:04] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 35/64 variables, 29/93 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:05:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/64 variables, 7/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/64 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 1/65 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/65 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 15 (OVERLAPS) 0/65 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 115 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2733 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 29/29 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1/29 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:05:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 21:05:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:05:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:05:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 35/64 variables, 29/119 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 14/133 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 48/181 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/64 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 1/65 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/65 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 14 (OVERLAPS) 0/65 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 182 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2061 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 29/29 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 87/87 constraints]
After SMT, in 4814ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 4815ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/104 places, 49/2185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5140 ms. Remains : 29/104 places, 49/2185 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-12
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-12 finished in 5242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2185/2185 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 104 transition count 2165
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 84 transition count 2164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 83 transition count 2164
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 42 place count 83 transition count 2153
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 64 place count 72 transition count 2153
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 72 place count 64 transition count 2143
Iterating global reduction 3 with 8 rules applied. Total rules applied 80 place count 64 transition count 2143
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 87 place count 64 transition count 2136
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 87 place count 64 transition count 2134
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 91 place count 62 transition count 2134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 61 transition count 2132
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 61 transition count 2132
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 101 place count 61 transition count 2124
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 149 place count 37 transition count 2100
Ensure Unique test removed 506 transitions
Reduce isomorphic transitions removed 506 transitions.
Iterating post reduction 5 with 506 rules applied. Total rules applied 655 place count 37 transition count 1594
Drop transitions (Redundant composition of simpler transitions.) removed 1511 transitions
Redundant transition composition rules discarded 1511 transitions
Iterating global reduction 6 with 1511 rules applied. Total rules applied 2166 place count 37 transition count 83
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 2186 place count 27 transition count 73
Applied a total of 2186 rules in 302 ms. Remains 27 /104 variables (removed 77) and now considering 73/2185 (removed 2112) transitions.
[2024-05-29 21:05:08] [INFO ] Flow matrix only has 63 transitions (discarded 10 similar events)
// Phase 1: matrix 63 rows 27 cols
[2024-05-29 21:05:08] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 21:05:08] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 21:05:08] [INFO ] Flow matrix only has 63 transitions (discarded 10 similar events)
[2024-05-29 21:05:08] [INFO ] Invariant cache hit.
[2024-05-29 21:05:08] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-29 21:05:08] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-29 21:05:08] [INFO ] Redundant transitions in 2 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 21:05:08] [INFO ] Flow matrix only has 63 transitions (discarded 10 similar events)
[2024-05-29 21:05:08] [INFO ] Invariant cache hit.
[2024-05-29 21:05:08] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:05:09] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 62/89 variables, 27/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 44/102 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/90 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/90 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 103 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2434 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 62/89 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 44/144 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 72/216 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 1/90 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 13 (OVERLAPS) 0/90 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 217 constraints, problems are : Problem set: 0 solved, 72 unsolved in 5433 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 72/72 constraints]
After SMT, in 7936ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 7937ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/104 places, 73/2185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8367 ms. Remains : 27/104 places, 73/2185 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-14
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-14 finished in 8525 ms.
All properties solved by simple procedures.
Total runtime 143518 ms.

BK_STOP 1717016717091

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-10a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532200379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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