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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717006302162

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-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 18:11:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:11:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:11:43] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-29 18:11:43] [INFO ] Transformed 291 places.
[2024-05-29 18:11:43] [INFO ] Transformed 332 transitions.
[2024-05-29 18:11:43] [INFO ] Found NUPN structural information;
[2024-05-29 18:11:43] [INFO ] Parsed PT model containing 291 places and 332 transitions and 734 arcs in 174 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 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-02b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 332/332 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 265 transition count 306
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 265 transition count 306
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 255 transition count 296
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 255 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 254 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 254 transition count 295
Applied a total of 74 rules in 75 ms. Remains 254 /291 variables (removed 37) and now considering 295/332 (removed 37) transitions.
// Phase 1: matrix 295 rows 254 cols
[2024-05-29 18:11:43] [INFO ] Computed 3 invariants in 22 ms
[2024-05-29 18:11:43] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-29 18:11:43] [INFO ] Invariant cache hit.
[2024-05-29 18:11:44] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-29 18:11:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/254 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 18:11:47] [INFO ] Deduced a trap composed of 176 places in 112 ms of which 22 ms to minimize.
[2024-05-29 18:11:47] [INFO ] Deduced a trap composed of 168 places in 121 ms of which 6 ms to minimize.
[2024-05-29 18:11:47] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:11:47] [INFO ] Deduced a trap composed of 196 places in 113 ms of which 2 ms to minimize.
[2024-05-29 18:11:47] [INFO ] Deduced a trap composed of 209 places in 126 ms of which 6 ms to minimize.
[2024-05-29 18:11:48] [INFO ] Deduced a trap composed of 175 places in 138 ms of which 6 ms to minimize.
[2024-05-29 18:11:48] [INFO ] Deduced a trap composed of 173 places in 93 ms of which 12 ms to minimize.
[2024-05-29 18:11:48] [INFO ] Deduced a trap composed of 172 places in 67 ms of which 6 ms to minimize.
[2024-05-29 18:11:48] [INFO ] Deduced a trap composed of 176 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 295/549 variables, 254/266 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 0/549 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 266 constraints, problems are : Problem set: 0 solved, 294 unsolved in 14843 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/254 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 295/549 variables, 254/266 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 294/560 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/549 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 560 constraints, problems are : Problem set: 0 solved, 294 unsolved in 11597 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 9/9 constraints]
After SMT, in 26519ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 26545ms
Starting structural reductions in LTL mode, iteration 1 : 254/291 places, 295/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27097 ms. Remains : 254/291 places, 295/332 transitions.
Support contains 45 out of 254 places after structural reductions.
[2024-05-29 18:12:10] [INFO ] Flatten gal took : 73 ms
[2024-05-29 18:12:10] [INFO ] Flatten gal took : 18 ms
[2024-05-29 18:12:11] [INFO ] Input system was already deterministic with 295 transitions.
Support contains 44 out of 254 places (down from 45) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (377 resets) in 1816 ms. (22 steps per ms) remains 6/24 properties
BEST_FIRST walk for 40001 steps (227 resets) in 283 ms. (140 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (232 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (267 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (227 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
[2024-05-29 18:12:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 226/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/254 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 295/549 variables, 254/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/549 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 257 constraints, problems are : Problem set: 0 solved, 4 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 226/236 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-29 18:12:12] [INFO ] Deduced a trap composed of 168 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 18/254 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 295/549 variables, 254/258 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 3/261 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/549 variables, 0/261 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/549 variables, 0/261 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 261 constraints, problems are : Problem set: 1 solved, 3 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 511ms problems are : Problem set: 1 solved, 3 unsolved
Finished Parikh walk after 97 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=48 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 91 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA StigmergyElection-PT-02b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35 stabilizing places and 37 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)||p0))&&(G(p2) U G(p3))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 241 transition count 282
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 241 transition count 282
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 232 transition count 273
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 232 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 230 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 229 transition count 270
Applied a total of 50 rules in 22 ms. Remains 229 /254 variables (removed 25) and now considering 270/295 (removed 25) transitions.
// Phase 1: matrix 270 rows 229 cols
[2024-05-29 18:12:12] [INFO ] Computed 3 invariants in 7 ms
[2024-05-29 18:12:12] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 18:12:12] [INFO ] Invariant cache hit.
[2024-05-29 18:12:12] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-05-29 18:12:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-29 18:12:15] [INFO ] Deduced a trap composed of 163 places in 61 ms of which 2 ms to minimize.
[2024-05-29 18:12:15] [INFO ] Deduced a trap composed of 164 places in 57 ms of which 2 ms to minimize.
[2024-05-29 18:12:15] [INFO ] Deduced a trap composed of 164 places in 64 ms of which 2 ms to minimize.
[2024-05-29 18:12:16] [INFO ] Deduced a trap composed of 164 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:12:16] [INFO ] Deduced a trap composed of 163 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/499 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (OVERLAPS) 0/499 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 237 constraints, problems are : Problem set: 0 solved, 269 unsolved in 11290 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/499 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 269/506 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-29 18:12:31] [INFO ] Deduced a trap composed of 163 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/499 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/499 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 507 constraints, problems are : Problem set: 0 solved, 269 unsolved in 18738 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 6/6 constraints]
After SMT, in 30058ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 30061ms
Starting structural reductions in LTL mode, iteration 1 : 229/254 places, 270/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30269 ms. Remains : 229/254 places, 270/295 transitions.
Stuttering acceptance computed with spot in 480 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND p3 (NOT p2)), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-02
Product exploration explored 100000 steps with 34 reset in 206 ms.
Product exploration explored 100000 steps with 182 reset in 125 ms.
Computed a total of 31 stabilizing places and 33 stable transitions
Computed a total of 31 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p3 p2 p0 (NOT p1)), (X p2), (X p3), (X (AND p3 p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (AND p3 p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 133 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p3), true, (AND (NOT p2) p3), (NOT p3)]
RANDOM walk for 40000 steps (492 resets) in 290 ms. (137 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (217 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (252 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (173 resets) in 220 ms. (181 steps per ms) remains 3/3 properties
[2024-05-29 18:12:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/229 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 270/499 variables, 229/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 232 constraints, problems are : Problem set: 0 solved, 3 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/229 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 270/499 variables, 229/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/499 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 235 constraints, problems are : Problem set: 0 solved, 3 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 369ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 201 ms.
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 270/270 transitions.
Graph (trivial) has 227 edges and 229 vertex of which 34 / 229 are part of one of the 6 SCC in 5 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (complete) has 295 edges and 201 vertex of which 199 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 135 rules applied. Total rules applied 137 place count 199 transition count 97
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 137 rules applied. Total rules applied 274 place count 66 transition count 93
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 278 place count 64 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 280 place count 62 transition count 91
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 280 place count 62 transition count 80
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 302 place count 51 transition count 80
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 303 place count 51 transition count 79
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 325 place count 40 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 329 place count 40 transition count 64
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 337 place count 32 transition count 47
Iterating global reduction 6 with 8 rules applied. Total rules applied 345 place count 32 transition count 47
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 350 place count 32 transition count 42
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 352 place count 30 transition count 40
Iterating global reduction 7 with 2 rules applied. Total rules applied 354 place count 30 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 358 place count 28 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 360 place count 27 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 362 place count 27 transition count 36
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 373 place count 27 transition count 25
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 387 place count 16 transition count 22
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 390 place count 13 transition count 18
Iterating global reduction 8 with 3 rules applied. Total rules applied 393 place count 13 transition count 18
Applied a total of 393 rules in 60 ms. Remains 13 /229 variables (removed 216) and now considering 18/270 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 13/229 places, 18/270 transitions.
RANDOM walk for 16681 steps (4 resets) in 114 ms. (145 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p3 p2 p0 (NOT p1)), (X p2), (X p3), (X (AND p3 p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (AND p3 p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (OR p2 p3))), (F (NOT (OR p2 (NOT p3)))), (F (NOT p2)), (F (NOT p3)), (F (NOT (AND p2 p3)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p2 p3)))
Knowledge based reduction with 19 factoid took 146 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-02b-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02b-LTLCardinality-02 finished in 32677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(F(p1)))))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Graph (trivial) has 253 edges and 254 vertex of which 34 / 254 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 155 place count 225 transition count 110
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 158 rules applied. Total rules applied 313 place count 71 transition count 106
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 316 place count 69 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 68 transition count 105
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 317 place count 68 transition count 99
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 329 place count 62 transition count 99
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 336 place count 55 transition count 92
Iterating global reduction 4 with 7 rules applied. Total rules applied 343 place count 55 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 343 place count 55 transition count 90
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 347 place count 53 transition count 90
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 349 place count 51 transition count 85
Iterating global reduction 4 with 2 rules applied. Total rules applied 351 place count 51 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 352 place count 51 transition count 84
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 374 place count 40 transition count 73
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 380 place count 34 transition count 60
Iterating global reduction 5 with 6 rules applied. Total rules applied 386 place count 34 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 390 place count 34 transition count 56
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 391 place count 33 transition count 54
Iterating global reduction 6 with 1 rules applied. Total rules applied 392 place count 33 transition count 54
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 398 place count 30 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 401 place count 30 transition count 52
Applied a total of 401 rules in 37 ms. Remains 30 /254 variables (removed 224) and now considering 52/295 (removed 243) transitions.
[2024-05-29 18:12:45] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
// Phase 1: matrix 48 rows 30 cols
[2024-05-29 18:12:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:12:45] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 18:12:45] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
[2024-05-29 18:12:45] [INFO ] Invariant cache hit.
[2024-05-29 18:12:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 18:12:45] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-29 18:12:45] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-29 18:12:45] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
[2024-05-29 18:12:45] [INFO ] Invariant cache hit.
[2024-05-29 18:12:45] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-29 18:12:45] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:12:45] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 47/77 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/78 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/78 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 39 constraints, problems are : Problem set: 0 solved, 47 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 30/30 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 47/77 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 47/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 86 constraints, problems are : Problem set: 0 solved, 47 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 30/30 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 2/2 constraints]
After SMT, in 1321ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1321ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/254 places, 52/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1441 ms. Remains : 30/254 places, 52/295 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-03
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-03 finished in 1529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(!p1)&&(G(p1)||X(X(F(!p0)))))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 242 transition count 283
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 242 transition count 283
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 235 transition count 276
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 235 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 233 transition count 274
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 233 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 232 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 232 transition count 273
Applied a total of 44 rules in 11 ms. Remains 232 /254 variables (removed 22) and now considering 273/295 (removed 22) transitions.
// Phase 1: matrix 273 rows 232 cols
[2024-05-29 18:12:46] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 18:12:46] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 18:12:46] [INFO ] Invariant cache hit.
[2024-05-29 18:12:47] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-05-29 18:12:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-29 18:12:49] [INFO ] Deduced a trap composed of 187 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:12:49] [INFO ] Deduced a trap composed of 164 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:12:50] [INFO ] Deduced a trap composed of 163 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:12:50] [INFO ] Deduced a trap composed of 163 places in 68 ms of which 2 ms to minimize.
[2024-05-29 18:12:50] [INFO ] Deduced a trap composed of 164 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-29 18:12:50] [INFO ] Deduced a trap composed of 98 places in 61 ms of which 2 ms to minimize.
[2024-05-29 18:12:50] [INFO ] Deduced a trap composed of 162 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 273/505 variables, 232/242 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/505 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 242 constraints, problems are : Problem set: 0 solved, 272 unsolved in 12820 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/505 variables, 232/242 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 272/514 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-29 18:13:06] [INFO ] Deduced a trap composed of 162 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/505 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (OVERLAPS) 0/505 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 515 constraints, problems are : Problem set: 0 solved, 272 unsolved in 17204 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 8/8 constraints]
After SMT, in 30052ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 30055ms
Starting structural reductions in LTL mode, iteration 1 : 232/254 places, 273/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30240 ms. Remains : 232/254 places, 273/295 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR p1 p0), true, p1, p0, p1, p0]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-04
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-04 finished in 30473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(F(p1)))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 241 transition count 282
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 241 transition count 282
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 233 transition count 274
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 233 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 231 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 230 transition count 271
Applied a total of 48 rules in 13 ms. Remains 230 /254 variables (removed 24) and now considering 271/295 (removed 24) transitions.
// Phase 1: matrix 271 rows 230 cols
[2024-05-29 18:13:17] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 18:13:17] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 18:13:17] [INFO ] Invariant cache hit.
[2024-05-29 18:13:17] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-29 18:13:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:13:20] [INFO ] Deduced a trap composed of 166 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:13:20] [INFO ] Deduced a trap composed of 165 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:13:20] [INFO ] Deduced a trap composed of 163 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:13:20] [INFO ] Deduced a trap composed of 164 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:13:20] [INFO ] Deduced a trap composed of 164 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/501 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 238 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 508 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10226 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 5/5 constraints]
After SMT, in 21271ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 21273ms
Starting structural reductions in LTL mode, iteration 1 : 230/254 places, 271/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21465 ms. Remains : 230/254 places, 271/295 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 379 ms.
Product exploration explored 100000 steps with 33333 reset in 161 ms.
Computed a total of 32 stabilizing places and 34 stable transitions
Computed a total of 32 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-02b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02b-LTLCardinality-05 finished in 22157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 241 transition count 282
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 241 transition count 282
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 233 transition count 274
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 233 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 231 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 230 transition count 271
Applied a total of 48 rules in 14 ms. Remains 230 /254 variables (removed 24) and now considering 271/295 (removed 24) transitions.
// Phase 1: matrix 271 rows 230 cols
[2024-05-29 18:13:39] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 18:13:39] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 18:13:39] [INFO ] Invariant cache hit.
[2024-05-29 18:13:39] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-29 18:13:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:13:42] [INFO ] Deduced a trap composed of 166 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:13:42] [INFO ] Deduced a trap composed of 165 places in 59 ms of which 2 ms to minimize.
[2024-05-29 18:13:42] [INFO ] Deduced a trap composed of 163 places in 67 ms of which 2 ms to minimize.
[2024-05-29 18:13:42] [INFO ] Deduced a trap composed of 166 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:13:43] [INFO ] Deduced a trap composed of 163 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/501 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 238 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11319 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 508 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11110 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 5/5 constraints]
After SMT, in 22454ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 22457ms
Starting structural reductions in LTL mode, iteration 1 : 230/254 places, 271/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22645 ms. Remains : 230/254 places, 271/295 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 12 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-02b-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02b-LTLCardinality-07 finished in 22975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(X(F(p0)))||(p1&&F(p2)))))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 242 transition count 283
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 242 transition count 283
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 234 transition count 275
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 234 transition count 275
Applied a total of 40 rules in 7 ms. Remains 234 /254 variables (removed 20) and now considering 275/295 (removed 20) transitions.
// Phase 1: matrix 275 rows 234 cols
[2024-05-29 18:14:02] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:14:02] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 18:14:02] [INFO ] Invariant cache hit.
[2024-05-29 18:14:02] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-05-29 18:14:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-29 18:14:05] [INFO ] Deduced a trap composed of 167 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:14:05] [INFO ] Deduced a trap composed of 168 places in 68 ms of which 2 ms to minimize.
[2024-05-29 18:14:05] [INFO ] Deduced a trap composed of 164 places in 75 ms of which 1 ms to minimize.
[2024-05-29 18:14:06] [INFO ] Deduced a trap composed of 166 places in 60 ms of which 2 ms to minimize.
[2024-05-29 18:14:06] [INFO ] Deduced a trap composed of 166 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/509 variables, 234/242 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (OVERLAPS) 0/509 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 242 constraints, problems are : Problem set: 0 solved, 274 unsolved in 11444 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/509 variables, 234/242 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 274/516 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-29 18:14:17] [INFO ] Deduced a trap composed of 168 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:14:19] [INFO ] Deduced a trap composed of 168 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 0/509 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 518 constraints, problems are : Problem set: 0 solved, 274 unsolved in 15933 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 7/7 constraints]
After SMT, in 27405ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 27408ms
Starting structural reductions in LTL mode, iteration 1 : 234/254 places, 275/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27594 ms. Remains : 234/254 places, 275/295 transitions.
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-08
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-08 finished in 27884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U p1)))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 240 transition count 281
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 240 transition count 281
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 231 transition count 272
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 228 transition count 269
Applied a total of 52 rules in 12 ms. Remains 228 /254 variables (removed 26) and now considering 269/295 (removed 26) transitions.
// Phase 1: matrix 269 rows 228 cols
[2024-05-29 18:14:30] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 18:14:30] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 18:14:30] [INFO ] Invariant cache hit.
[2024-05-29 18:14:30] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-29 18:14:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:14:33] [INFO ] Deduced a trap composed of 164 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:14:33] [INFO ] Deduced a trap composed of 164 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:14:33] [INFO ] Deduced a trap composed of 163 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:14:33] [INFO ] Deduced a trap composed of 162 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:14:39] [INFO ] Deduced a trap composed of 162 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/497 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 14779 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11350 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
After SMT, in 26156ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 26159ms
Starting structural reductions in LTL mode, iteration 1 : 228/254 places, 269/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26328 ms. Remains : 228/254 places, 269/295 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-09
Product exploration explored 100000 steps with 15 reset in 58 ms.
Product exploration explored 100000 steps with 334 reset in 65 ms.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 85 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (177 resets) in 72 ms. (547 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (195 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
[2024-05-29 18:14:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 106/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/228 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 269/497 variables, 228/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 106/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/228 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 18:14:57] [INFO ] Deduced a trap composed of 164 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 269/497 variables, 228/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 307ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 144 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Applied a total of 0 rules in 4 ms. Remains 228 /228 variables (removed 0) and now considering 269/269 (removed 0) transitions.
[2024-05-29 18:14:57] [INFO ] Invariant cache hit.
[2024-05-29 18:14:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 18:14:57] [INFO ] Invariant cache hit.
[2024-05-29 18:14:57] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-29 18:14:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:15:00] [INFO ] Deduced a trap composed of 164 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:15:00] [INFO ] Deduced a trap composed of 164 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:15:01] [INFO ] Deduced a trap composed of 163 places in 67 ms of which 2 ms to minimize.
[2024-05-29 18:15:01] [INFO ] Deduced a trap composed of 162 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:15:07] [INFO ] Deduced a trap composed of 162 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/497 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 14816 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11139 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
After SMT, in 25981ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 25984ms
Finished structural reductions in LTL mode , in 1 iterations and 26162 ms. Remains : 228/228 places, 269/269 transitions.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 118 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (259 resets) in 54 ms. (727 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (206 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
[2024-05-29 18:15:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 106/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/228 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 269/497 variables, 228/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 106/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/228 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 18:15:24] [INFO ] Deduced a trap composed of 164 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 269/497 variables, 228/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 317ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 214 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=214 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 202 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 92 reset in 63 ms.
Product exploration explored 100000 steps with 20 reset in 64 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Graph (trivial) has 224 edges and 228 vertex of which 27 / 228 are part of one of the 5 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 134 rules applied. Total rules applied 135 place count 206 transition count 244
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 138 place count 206 transition count 241
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 138 place count 206 transition count 243
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 143 place count 206 transition count 243
Discarding 109 places :
Symmetric choice reduction at 2 with 109 rule applications. Total rules 252 place count 97 transition count 134
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 109 rules applied. Total rules applied 361 place count 97 transition count 134
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 379 place count 97 transition count 134
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 403 place count 73 transition count 100
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 427 place count 73 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 431 place count 73 transition count 96
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 438 place count 66 transition count 88
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 445 place count 66 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 446 place count 65 transition count 87
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 447 place count 65 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 27 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 448 place count 65 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 449 place count 64 transition count 86
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 450 place count 64 transition count 86
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 456 place count 64 transition count 103
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 461 place count 59 transition count 93
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 466 place count 59 transition count 93
Deduced a syphon composed of 27 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 474 place count 59 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 475 place count 58 transition count 84
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 476 place count 58 transition count 84
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 476 rules in 40 ms. Remains 58 /228 variables (removed 170) and now considering 84/269 (removed 185) transitions.
[2024-05-29 18:15:25] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-29 18:15:25] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 58 cols
[2024-05-29 18:15:25] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:15:25] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-29 18:15:25] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-29 18:15:25] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-29 18:15:25] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-29 18:15:25] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/6 constraints. Problems are: Problem set: 7 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 75 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
At refinement iteration 4 (OVERLAPS) 80/138 variables, 58/64 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 7/71 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/71 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 1/139 variables, 1/72 constraints. Problems are: Problem set: 33 solved, 49 unsolved
[2024-05-29 18:15:26] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 1/73 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/73 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/73 constraints. Problems are: Problem set: 33 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 73 constraints, problems are : Problem set: 33 solved, 49 unsolved in 1409 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 33 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 27/58 variables, 2/2 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/7 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 80/138 variables, 58/65 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 7/72 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 49/121 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/121 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/122 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/122 constraints. Problems are: Problem set: 33 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/122 constraints. Problems are: Problem set: 33 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 122 constraints, problems are : Problem set: 33 solved, 49 unsolved in 1015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 49/82 constraints, Known Traps: 5/5 constraints]
After SMT, in 2437ms problems are : Problem set: 33 solved, 49 unsolved
Search for dead transitions found 33 dead transitions in 2438ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 58/228 places, 51/269 transitions.
Graph (complete) has 91 edges and 58 vertex of which 32 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 32 /58 variables (removed 26) and now considering 51/51 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/228 places, 51/269 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2491 ms. Remains : 32/228 places, 51/269 transitions.
Built C files in :
/tmp/ltsmin7232075906015084929
[2024-05-29 18:15:27] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7232075906015084929
Running compilation step : cd /tmp/ltsmin7232075906015084929;'/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 528 ms.
Running link step : cd /tmp/ltsmin7232075906015084929;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7232075906015084929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased374543216232324911.hoa' '--buchi-type=spotba'
LTSmin run took 185 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-02b-LTLCardinality-09 finished in 58348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Graph (trivial) has 250 edges and 254 vertex of which 39 / 254 are part of one of the 6 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 220 transition count 110
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 151 rules applied. Total rules applied 299 place count 73 transition count 106
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 302 place count 71 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 303 place count 70 transition count 105
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 303 place count 70 transition count 98
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 317 place count 63 transition count 98
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 322 place count 58 transition count 93
Iterating global reduction 4 with 5 rules applied. Total rules applied 327 place count 58 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 327 place count 58 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 329 place count 57 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 330 place count 56 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 331 place count 56 transition count 88
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 355 place count 44 transition count 76
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 360 place count 39 transition count 65
Iterating global reduction 4 with 5 rules applied. Total rules applied 365 place count 39 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 367 place count 39 transition count 63
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 368 place count 38 transition count 61
Iterating global reduction 5 with 1 rules applied. Total rules applied 369 place count 38 transition count 61
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 375 place count 35 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 377 place count 35 transition count 60
Applied a total of 377 rules in 19 ms. Remains 35 /254 variables (removed 219) and now considering 60/295 (removed 235) transitions.
[2024-05-29 18:15:28] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
// Phase 1: matrix 56 rows 35 cols
[2024-05-29 18:15:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:15:28] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 18:15:28] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
[2024-05-29 18:15:28] [INFO ] Invariant cache hit.
[2024-05-29 18:15:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 18:15:28] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-29 18:15:28] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-29 18:15:28] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
[2024-05-29 18:15:28] [INFO ] Invariant cache hit.
[2024-05-29 18:15:28] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:15:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 55/90 variables, 35/38 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:15:29] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/91 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/91 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 44 constraints, problems are : Problem set: 0 solved, 54 unsolved in 906 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 55/90 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 54/97 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 18:15:29] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/91 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/91 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 99 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1092 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 3/3 constraints]
After SMT, in 2008ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2010ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/254 places, 60/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2095 ms. Remains : 35/254 places, 60/295 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-10
Stuttering criterion allowed to conclude after 198 steps with 29 reset in 2 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-10 finished in 2185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(!p1 U (p2||G(!p1))))))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 240 transition count 281
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 240 transition count 281
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 231 transition count 272
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 228 transition count 269
Applied a total of 52 rules in 24 ms. Remains 228 /254 variables (removed 26) and now considering 269/295 (removed 26) transitions.
// Phase 1: matrix 269 rows 228 cols
[2024-05-29 18:15:30] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 18:15:30] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 18:15:30] [INFO ] Invariant cache hit.
[2024-05-29 18:15:31] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-29 18:15:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:15:33] [INFO ] Deduced a trap composed of 164 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:15:33] [INFO ] Deduced a trap composed of 164 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:15:34] [INFO ] Deduced a trap composed of 163 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:15:34] [INFO ] Deduced a trap composed of 162 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:15:40] [INFO ] Deduced a trap composed of 162 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/497 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 15001 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11172 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
After SMT, in 26198ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 26201ms
Starting structural reductions in LTL mode, iteration 1 : 228/254 places, 269/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26404 ms. Remains : 228/254 places, 269/295 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-13
Product exploration explored 100000 steps with 159 reset in 142 ms.
Product exploration explored 100000 steps with 75 reset in 140 ms.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 92 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (325 resets) in 118 ms. (336 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (256 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
[2024-05-29 18:15:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 214/497 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X p0)), (X (X p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p0) p2 p1)))]
Knowledge based reduction with 9 factoid took 344 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Applied a total of 0 rules in 8 ms. Remains 228 /228 variables (removed 0) and now considering 269/269 (removed 0) transitions.
[2024-05-29 18:15:58] [INFO ] Invariant cache hit.
[2024-05-29 18:15:58] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 18:15:58] [INFO ] Invariant cache hit.
[2024-05-29 18:15:58] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-29 18:15:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:16:01] [INFO ] Deduced a trap composed of 164 places in 61 ms of which 2 ms to minimize.
[2024-05-29 18:16:01] [INFO ] Deduced a trap composed of 164 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:16:01] [INFO ] Deduced a trap composed of 163 places in 69 ms of which 2 ms to minimize.
[2024-05-29 18:16:02] [INFO ] Deduced a trap composed of 162 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:16:08] [INFO ] Deduced a trap composed of 162 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/497 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 14730 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11309 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
After SMT, in 26062ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 26065ms
Finished structural reductions in LTL mode , in 1 iterations and 26233 ms. Remains : 228/228 places, 269/269 transitions.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 1452 steps (30 resets) in 17 ms. (80 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p2)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 41 reset in 78 ms.
Product exploration explored 100000 steps with 27 reset in 82 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Graph (trivial) has 225 edges and 228 vertex of which 34 / 228 are part of one of the 6 SCC in 0 ms
Free SCC test removed 28 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 200 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 134 place count 200 transition count 235
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 134 place count 200 transition count 237
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 200 transition count 237
Discarding 109 places :
Symmetric choice reduction at 2 with 109 rule applications. Total rules 247 place count 91 transition count 128
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 109 rules applied. Total rules applied 356 place count 91 transition count 128
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 373 place count 91 transition count 128
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 396 place count 68 transition count 95
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 419 place count 68 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 421 place count 68 transition count 93
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 429 place count 60 transition count 83
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 437 place count 60 transition count 83
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 439 place count 58 transition count 81
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 441 place count 58 transition count 81
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 447 place count 58 transition count 98
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 453 place count 52 transition count 86
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 459 place count 52 transition count 86
Deduced a syphon composed of 23 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 465 place count 52 transition count 80
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 465 rules in 23 ms. Remains 52 /228 variables (removed 176) and now considering 80/269 (removed 189) transitions.
[2024-05-29 18:16:26] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-05-29 18:16:26] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 52 cols
[2024-05-29 18:16:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:16:26] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-29 18:16:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:16:26] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:16:26] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:16:26] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-29 18:16:26] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:16:26] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 6/8 constraints. Problems are: Problem set: 6 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 72 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
At refinement iteration 4 (OVERLAPS) 76/128 variables, 52/60 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 6/66 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/66 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 1/129 variables, 1/67 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/67 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/67 constraints. Problems are: Problem set: 30 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 67 constraints, problems are : Problem set: 30 solved, 48 unsolved in 1148 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 30 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 24/52 variables, 2/2 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 6/8 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 76/128 variables, 52/60 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 6/66 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 48/114 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/114 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/129 variables, 1/115 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/115 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/115 constraints. Problems are: Problem set: 30 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 115 constraints, problems are : Problem set: 30 solved, 48 unsolved in 933 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 48/78 constraints, Known Traps: 6/6 constraints]
After SMT, in 2095ms problems are : Problem set: 30 solved, 48 unsolved
Search for dead transitions found 30 dead transitions in 2096ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 52/228 places, 50/269 transitions.
Graph (complete) has 87 edges and 52 vertex of which 29 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 29 /52 variables (removed 23) and now considering 50/50 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/228 places, 50/269 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2131 ms. Remains : 29/228 places, 50/269 transitions.
Built C files in :
/tmp/ltsmin11860078806147468731
[2024-05-29 18:16:28] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11860078806147468731
Running compilation step : cd /tmp/ltsmin11860078806147468731;'/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 404 ms.
Running link step : cd /tmp/ltsmin11860078806147468731;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11860078806147468731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2216072690410707746.hoa' '--buchi-type=spotba'
LTSmin run took 179 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-02b-LTLCardinality-13 finished in 57904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Graph (trivial) has 257 edges and 254 vertex of which 39 / 254 are part of one of the 6 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 154 place count 220 transition count 104
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 157 rules applied. Total rules applied 311 place count 67 transition count 100
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 314 place count 65 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 64 transition count 99
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 315 place count 64 transition count 93
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 327 place count 58 transition count 93
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 334 place count 51 transition count 86
Iterating global reduction 4 with 7 rules applied. Total rules applied 341 place count 51 transition count 86
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 341 place count 51 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 345 place count 49 transition count 84
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 347 place count 47 transition count 79
Iterating global reduction 4 with 2 rules applied. Total rules applied 349 place count 47 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 350 place count 47 transition count 78
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 372 place count 36 transition count 67
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 379 place count 29 transition count 52
Iterating global reduction 5 with 7 rules applied. Total rules applied 386 place count 29 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 390 place count 29 transition count 48
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 391 place count 28 transition count 46
Iterating global reduction 6 with 1 rules applied. Total rules applied 392 place count 28 transition count 46
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 398 place count 25 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 401 place count 25 transition count 44
Applied a total of 401 rules in 14 ms. Remains 25 /254 variables (removed 229) and now considering 44/295 (removed 251) transitions.
[2024-05-29 18:16:28] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
// Phase 1: matrix 41 rows 25 cols
[2024-05-29 18:16:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:16:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 18:16:28] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-29 18:16:28] [INFO ] Invariant cache hit.
[2024-05-29 18:16:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 18:16:28] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-29 18:16:28] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-29 18:16:28] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-29 18:16:28] [INFO ] Invariant cache hit.
[2024-05-29 18:16:28] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 18:16:28] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:16:29] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/65 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 34 constraints, problems are : Problem set: 0 solved, 39 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/65 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 39/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 1/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/66 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 73 constraints, problems are : Problem set: 0 solved, 39 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
After SMT, in 946ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 947ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/254 places, 44/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1028 ms. Remains : 25/254 places, 44/295 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-14
Stuttering criterion allowed to conclude after 90 steps with 12 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-14 finished in 1107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 243 transition count 284
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 243 transition count 284
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 236 transition count 277
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 236 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 235 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 235 transition count 276
Applied a total of 38 rules in 13 ms. Remains 235 /254 variables (removed 19) and now considering 276/295 (removed 19) transitions.
// Phase 1: matrix 276 rows 235 cols
[2024-05-29 18:16:29] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 18:16:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 18:16:29] [INFO ] Invariant cache hit.
[2024-05-29 18:16:30] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2024-05-29 18:16:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-29 18:16:32] [INFO ] Deduced a trap composed of 166 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:16:32] [INFO ] Deduced a trap composed of 169 places in 62 ms of which 2 ms to minimize.
[2024-05-29 18:16:33] [INFO ] Deduced a trap composed of 165 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:16:33] [INFO ] Deduced a trap composed of 167 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:16:33] [INFO ] Deduced a trap composed of 165 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/511 variables, 235/243 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-29 18:16:38] [INFO ] Deduced a trap composed of 168 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/511 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 244 constraints, problems are : Problem set: 0 solved, 275 unsolved in 13878 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/511 variables, 235/244 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 275/519 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-29 18:16:47] [INFO ] Deduced a trap composed of 165 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:16:49] [INFO ] Deduced a trap composed of 169 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 2/521 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 0/511 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 521 constraints, problems are : Problem set: 0 solved, 275 unsolved in 15458 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 8/8 constraints]
After SMT, in 29360ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 29363ms
Starting structural reductions in LTL mode, iteration 1 : 235/254 places, 276/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29554 ms. Remains : 235/254 places, 276/295 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-15 finished in 29702 ms.
All properties solved by simple procedures.
Total runtime 316303 ms.

BK_STOP 1717006619606

--------------------
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-02b"
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-02b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531900259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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