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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K 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 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 18:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 11 18:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 11 18:56 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 203K 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-04b-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-04b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717007160218

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-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 18:26:01] [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:26:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:26:01] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-29 18:26:01] [INFO ] Transformed 563 places.
[2024-05-29 18:26:01] [INFO ] Transformed 780 transitions.
[2024-05-29 18:26:01] [INFO ] Found NUPN structural information;
[2024-05-29 18:26:01] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 208 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 5 formulas.
FORMULA StigmergyElection-PT-04b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 780/780 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 497 transition count 714
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 497 transition count 714
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 168 place count 461 transition count 678
Iterating global reduction 0 with 36 rules applied. Total rules applied 204 place count 461 transition count 678
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 212 place count 453 transition count 670
Iterating global reduction 0 with 8 rules applied. Total rules applied 220 place count 453 transition count 670
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 223 place count 450 transition count 667
Iterating global reduction 0 with 3 rules applied. Total rules applied 226 place count 450 transition count 667
Applied a total of 226 rules in 143 ms. Remains 450 /563 variables (removed 113) and now considering 667/780 (removed 113) transitions.
// Phase 1: matrix 667 rows 450 cols
[2024-05-29 18:26:01] [INFO ] Computed 5 invariants in 27 ms
[2024-05-29 18:26:02] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-29 18:26:02] [INFO ] Invariant cache hit.
[2024-05-29 18:26:02] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Running 666 sub problems to find dead transitions.
[2024-05-29 18:26:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (OVERLAPS) 1/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-29 18:26:12] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 28 ms to minimize.
[2024-05-29 18:26:12] [INFO ] Deduced a trap composed of 166 places in 168 ms of which 3 ms to minimize.
[2024-05-29 18:26:12] [INFO ] Deduced a trap composed of 163 places in 183 ms of which 3 ms to minimize.
[2024-05-29 18:26:13] [INFO ] Deduced a trap composed of 167 places in 118 ms of which 3 ms to minimize.
[2024-05-29 18:26:13] [INFO ] Deduced a trap composed of 169 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:26:14] [INFO ] Deduced a trap composed of 167 places in 130 ms of which 3 ms to minimize.
[2024-05-29 18:26:14] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:26:14] [INFO ] Deduced a trap composed of 163 places in 141 ms of which 3 ms to minimize.
[2024-05-29 18:26:14] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:26:15] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 2 ms to minimize.
[2024-05-29 18:26:15] [INFO ] Deduced a trap composed of 165 places in 137 ms of which 2 ms to minimize.
[2024-05-29 18:26:15] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 3 ms to minimize.
[2024-05-29 18:26:15] [INFO ] Deduced a trap composed of 167 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:26:16] [INFO ] Deduced a trap composed of 163 places in 153 ms of which 2 ms to minimize.
[2024-05-29 18:26:16] [INFO ] Deduced a trap composed of 169 places in 148 ms of which 3 ms to minimize.
[2024-05-29 18:26:16] [INFO ] Deduced a trap composed of 168 places in 137 ms of which 2 ms to minimize.
[2024-05-29 18:26:16] [INFO ] Deduced a trap composed of 166 places in 111 ms of which 2 ms to minimize.
[2024-05-29 18:26:16] [INFO ] Deduced a trap composed of 169 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:26:17] [INFO ] Deduced a trap composed of 167 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:26:17] [INFO ] Deduced a trap composed of 165 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-29 18:26:17] [INFO ] Deduced a trap composed of 165 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:26:18] [INFO ] Deduced a trap composed of 167 places in 133 ms of which 4 ms to minimize.
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 169 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 2 ms to minimize.
[2024-05-29 18:26:20] [INFO ] Deduced a trap composed of 164 places in 129 ms of which 3 ms to minimize.
[2024-05-29 18:26:20] [INFO ] Deduced a trap composed of 219 places in 137 ms of which 2 ms to minimize.
[2024-05-29 18:26:21] [INFO ] Deduced a trap composed of 221 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:26:21] [INFO ] Deduced a trap composed of 169 places in 130 ms of which 3 ms to minimize.
[2024-05-29 18:26:23] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-29 18:26:30] [INFO ] Deduced a trap composed of 164 places in 113 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/1117 variables, and 35 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/450 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (OVERLAPS) 1/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-29 18:26:38] [INFO ] Deduced a trap composed of 168 places in 135 ms of which 3 ms to minimize.
[2024-05-29 18:26:38] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:26:38] [INFO ] Deduced a trap composed of 164 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:26:39] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-29 18:26:49] [INFO ] Deduced a trap composed of 167 places in 148 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-29 18:26:56] [INFO ] Deduced a trap composed of 166 places in 127 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-29 18:27:02] [INFO ] Deduced a trap composed of 220 places in 138 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/1117 variables, and 42 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/450 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 37/37 constraints]
After SMT, in 60493ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60532ms
Starting structural reductions in LTL mode, iteration 1 : 450/563 places, 667/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61409 ms. Remains : 450/563 places, 667/780 transitions.
Support contains 31 out of 450 places after structural reductions.
[2024-05-29 18:27:03] [INFO ] Flatten gal took : 105 ms
[2024-05-29 18:27:03] [INFO ] Flatten gal took : 38 ms
[2024-05-29 18:27:03] [INFO ] Input system was already deterministic with 667 transitions.
RANDOM walk for 40000 steps (538 resets) in 1097 ms. (36 steps per ms) remains 6/15 properties
BEST_FIRST walk for 40002 steps (109 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (105 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (110 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (109 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (109 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (111 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
[2024-05-29 18:27:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 435/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 667/1117 variables, 450/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1117 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/1117 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1117/1117 variables, and 455 constraints, problems are : Problem set: 0 solved, 6 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 435/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 18:27:05] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 3 ms to minimize.
[2024-05-29 18:27:05] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 3 ms to minimize.
[2024-05-29 18:27:05] [INFO ] Deduced a trap composed of 166 places in 187 ms of which 34 ms to minimize.
[2024-05-29 18:27:06] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:27:06] [INFO ] Deduced a trap composed of 164 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:27:06] [INFO ] Deduced a trap composed of 163 places in 124 ms of which 3 ms to minimize.
[2024-05-29 18:27:06] [INFO ] Deduced a trap composed of 166 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 667/1117 variables, 450/462 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1117 variables, 6/468 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 18:27:06] [INFO ] Deduced a trap composed of 167 places in 145 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1117 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1117 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1117 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1117/1117 variables, and 469 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2323 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 3059ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 5 properties in 446 ms.
Support contains 2 out of 450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 450/450 places, 667/667 transitions.
Graph (trivial) has 457 edges and 450 vertex of which 71 / 450 are part of one of the 12 SCC in 3 ms
Free SCC test removed 59 places
Drop transitions (Empty/Sink Transition effects.) removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Graph (complete) has 753 edges and 391 vertex of which 386 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 276 rules applied. Total rules applied 278 place count 386 transition count 311
Reduce places removed 272 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 280 rules applied. Total rules applied 558 place count 114 transition count 303
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 563 place count 110 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 564 place count 109 transition count 302
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 564 place count 109 transition count 283
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 602 place count 90 transition count 283
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 605 place count 87 transition count 279
Iterating global reduction 4 with 3 rules applied. Total rules applied 608 place count 87 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 608 place count 87 transition count 278
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 610 place count 86 transition count 278
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 611 place count 85 transition count 276
Iterating global reduction 4 with 1 rules applied. Total rules applied 612 place count 85 transition count 276
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 652 place count 65 transition count 256
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 660 place count 65 transition count 248
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 675 place count 50 transition count 105
Iterating global reduction 5 with 15 rules applied. Total rules applied 690 place count 50 transition count 105
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 698 place count 50 transition count 97
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 701 place count 47 transition count 94
Iterating global reduction 6 with 3 rules applied. Total rules applied 704 place count 47 transition count 94
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 712 place count 43 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
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 718 place count 40 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 726 place count 40 transition count 90
Free-agglomeration rule applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 747 place count 40 transition count 69
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 777 place count 19 transition count 60
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 781 place count 15 transition count 56
Iterating global reduction 7 with 4 rules applied. Total rules applied 785 place count 15 transition count 56
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 792 place count 15 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 807 place count 15 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 808 place count 14 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 809 place count 13 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 809 place count 13 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 811 place count 12 transition count 32
Performed 4 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 821 place count 6 transition count 13
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 828 place count 6 transition count 6
Applied a total of 828 rules in 84 ms. Remains 6 /450 variables (removed 444) and now considering 6/667 (removed 661) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 6/450 places, 6/667 transitions.
RANDOM walk for 48 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Computed a total of 61 stabilizing places and 65 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 667/667 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 443 transition count 660
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 442 transition count 659
Applied a total of 16 rules in 20 ms. Remains 442 /450 variables (removed 8) and now considering 659/667 (removed 8) transitions.
// Phase 1: matrix 659 rows 442 cols
[2024-05-29 18:27:08] [INFO ] Computed 5 invariants in 5 ms
[2024-05-29 18:27:08] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-29 18:27:08] [INFO ] Invariant cache hit.
[2024-05-29 18:27:08] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2024-05-29 18:27:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:27:18] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 3 ms to minimize.
[2024-05-29 18:27:18] [INFO ] Deduced a trap composed of 163 places in 114 ms of which 3 ms to minimize.
[2024-05-29 18:27:18] [INFO ] Deduced a trap composed of 162 places in 113 ms of which 2 ms to minimize.
[2024-05-29 18:27:19] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:27:19] [INFO ] Deduced a trap composed of 165 places in 116 ms of which 2 ms to minimize.
[2024-05-29 18:27:20] [INFO ] Deduced a trap composed of 163 places in 107 ms of which 3 ms to minimize.
[2024-05-29 18:27:20] [INFO ] Deduced a trap composed of 219 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:27:20] [INFO ] Deduced a trap composed of 162 places in 125 ms of which 3 ms to minimize.
[2024-05-29 18:27:20] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:27:20] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:27:20] [INFO ] Deduced a trap composed of 163 places in 104 ms of which 2 ms to minimize.
[2024-05-29 18:27:21] [INFO ] Deduced a trap composed of 165 places in 137 ms of which 7 ms to minimize.
[2024-05-29 18:27:21] [INFO ] Deduced a trap composed of 164 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:27:22] [INFO ] Deduced a trap composed of 165 places in 127 ms of which 3 ms to minimize.
[2024-05-29 18:27:22] [INFO ] Deduced a trap composed of 165 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:27:22] [INFO ] Deduced a trap composed of 166 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:27:22] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:27:22] [INFO ] Deduced a trap composed of 163 places in 106 ms of which 2 ms to minimize.
[2024-05-29 18:27:23] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 3 ms to minimize.
[2024-05-29 18:27:23] [INFO ] Deduced a trap composed of 163 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:27:24] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 3 ms to minimize.
[2024-05-29 18:27:24] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:27:24] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:27:24] [INFO ] Deduced a trap composed of 163 places in 106 ms of which 2 ms to minimize.
[2024-05-29 18:27:24] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:27:25] [INFO ] Deduced a trap composed of 164 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:27:26] [INFO ] Deduced a trap composed of 166 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:27:26] [INFO ] Deduced a trap composed of 165 places in 109 ms of which 2 ms to minimize.
[2024-05-29 18:27:26] [INFO ] Deduced a trap composed of 164 places in 111 ms of which 2 ms to minimize.
[2024-05-29 18:27:27] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:27:28] [INFO ] Deduced a trap composed of 166 places in 114 ms of which 1 ms to minimize.
[2024-05-29 18:27:29] [INFO ] Deduced a trap composed of 192 places in 131 ms of which 3 ms to minimize.
[2024-05-29 18:27:30] [INFO ] Deduced a trap composed of 163 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:27:30] [INFO ] Deduced a trap composed of 166 places in 114 ms of which 2 ms to minimize.
[2024-05-29 18:27:30] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:27:39] [INFO ] Deduced a trap composed of 164 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 30431ms, After SMT, problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 30440ms
Starting structural reductions in LTL mode, iteration 1 : 442/450 places, 659/667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30899 ms. Remains : 442/450 places, 659/667 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-04b-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLCardinality-02 finished in 31153 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) U (!p1||X(!p1))))'
Support contains 4 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 667/667 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 444 transition count 661
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 443 transition count 660
Applied a total of 14 rules in 21 ms. Remains 443 /450 variables (removed 7) and now considering 660/667 (removed 7) transitions.
// Phase 1: matrix 660 rows 443 cols
[2024-05-29 18:27:39] [INFO ] Computed 5 invariants in 3 ms
[2024-05-29 18:27:39] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-29 18:27:39] [INFO ] Invariant cache hit.
[2024-05-29 18:27:39] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 659 sub problems to find dead transitions.
[2024-05-29 18:27:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 18:27:49] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 2 ms to minimize.
[2024-05-29 18:27:50] [INFO ] Deduced a trap composed of 164 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:27:50] [INFO ] Deduced a trap composed of 166 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:27:51] [INFO ] Deduced a trap composed of 165 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:27:52] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 163 places in 120 ms of which 3 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 166 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 2 ms to minimize.
[2024-05-29 18:27:54] [INFO ] Deduced a trap composed of 165 places in 132 ms of which 3 ms to minimize.
[2024-05-29 18:27:54] [INFO ] Deduced a trap composed of 164 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:27:54] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 3 ms to minimize.
[2024-05-29 18:27:54] [INFO ] Deduced a trap composed of 166 places in 137 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 18:27:57] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:27:57] [INFO ] Deduced a trap composed of 165 places in 102 ms of which 2 ms to minimize.
[2024-05-29 18:27:58] [INFO ] Deduced a trap composed of 166 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:27:59] [INFO ] Deduced a trap composed of 165 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:28:00] [INFO ] Deduced a trap composed of 166 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:28:01] [INFO ] Deduced a trap composed of 165 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 18:28:10] [INFO ] Deduced a trap composed of 164 places in 124 ms of which 2 ms to minimize.
SMT process timed out in 30283ms, After SMT, problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 30292ms
Starting structural reductions in LTL mode, iteration 1 : 443/450 places, 660/667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30717 ms. Remains : 443/450 places, 660/667 transitions.
Stuttering acceptance computed with spot in 119 ms :[p1, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLCardinality-04
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLCardinality-04 finished in 30857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 667/667 transitions.
Graph (trivial) has 459 edges and 450 vertex of which 71 / 450 are part of one of the 12 SCC in 1 ms
Free SCC test removed 59 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 266 rules applied. Total rules applied 267 place count 390 transition count 333
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 274 rules applied. Total rules applied 541 place count 124 transition count 325
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 546 place count 120 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 547 place count 119 transition count 324
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 547 place count 119 transition count 309
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 577 place count 104 transition count 309
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 583 place count 98 transition count 302
Iterating global reduction 4 with 6 rules applied. Total rules applied 589 place count 98 transition count 302
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 589 place count 98 transition count 301
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 591 place count 97 transition count 301
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 592 place count 96 transition count 299
Iterating global reduction 4 with 1 rules applied. Total rules applied 593 place count 96 transition count 299
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 594 place count 95 transition count 297
Iterating global reduction 4 with 1 rules applied. Total rules applied 595 place count 95 transition count 297
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 635 place count 75 transition count 277
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 650 place count 60 transition count 137
Iterating global reduction 4 with 15 rules applied. Total rules applied 665 place count 60 transition count 137
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 673 place count 60 transition count 129
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 676 place count 57 transition count 123
Iterating global reduction 5 with 3 rules applied. Total rules applied 679 place count 57 transition count 123
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 682 place count 54 transition count 117
Iterating global reduction 5 with 3 rules applied. Total rules applied 685 place count 54 transition count 117
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 703 place count 45 transition count 134
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 704 place count 44 transition count 126
Iterating global reduction 5 with 1 rules applied. Total rules applied 705 place count 44 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 706 place count 44 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 710 place count 44 transition count 121
Applied a total of 710 rules in 109 ms. Remains 44 /450 variables (removed 406) and now considering 121/667 (removed 546) transitions.
[2024-05-29 18:28:10] [INFO ] Flow matrix only has 116 transitions (discarded 5 similar events)
// Phase 1: matrix 116 rows 44 cols
[2024-05-29 18:28:10] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 18:28:10] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 18:28:10] [INFO ] Flow matrix only has 116 transitions (discarded 5 similar events)
[2024-05-29 18:28:10] [INFO ] Invariant cache hit.
[2024-05-29 18:28:10] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 18:28:10] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-29 18:28:10] [INFO ] Redundant transitions in 4 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-29 18:28:10] [INFO ] Flow matrix only has 116 transitions (discarded 5 similar events)
[2024-05-29 18:28:10] [INFO ] Invariant cache hit.
[2024-05-29 18:28:10] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 18:28:10] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:28:10] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:28:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:28:11] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:28:11] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:28:11] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:28:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:28:11] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:28:11] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:28:11] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 115/159 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 31/87 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 1/160 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 88 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2957 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 18:28:13] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 115/159 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 112/200 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 18:28:15] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:28:15] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:28:15] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 1/160 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/160 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 204 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5768 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 14/14 constraints]
After SMT, in 8800ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 8803ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/450 places, 121/667 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9044 ms. Remains : 44/450 places, 121/667 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLCardinality-06
Product exploration explored 100000 steps with 1567 reset in 184 ms.
Product exploration explored 100000 steps with 854 reset in 99 ms.
Computed a total of 3 stabilizing places and 11 stable transitions
Computed a total of 3 stabilizing places and 11 stable transitions
Detected a total of 3/44 stabilizing places and 11/121 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 1 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 121/121 transitions.
Applied a total of 0 rules in 6 ms. Remains 44 /44 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-05-29 18:28:20] [INFO ] Flow matrix only has 116 transitions (discarded 5 similar events)
[2024-05-29 18:28:20] [INFO ] Invariant cache hit.
[2024-05-29 18:28:20] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 18:28:20] [INFO ] Flow matrix only has 116 transitions (discarded 5 similar events)
[2024-05-29 18:28:20] [INFO ] Invariant cache hit.
[2024-05-29 18:28:20] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 18:28:20] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-29 18:28:20] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-29 18:28:20] [INFO ] Flow matrix only has 116 transitions (discarded 5 similar events)
[2024-05-29 18:28:20] [INFO ] Invariant cache hit.
[2024-05-29 18:28:20] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 18:28:20] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:28:20] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:28:20] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:28:20] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:28:20] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:28:20] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:28:20] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:28:20] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:28:20] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:28:20] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 115/159 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 31/87 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 1/160 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 88 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2872 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 18:28:23] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 115/159 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 112/200 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 18:28:24] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:28:24] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:28:24] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 1/160 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/160 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 204 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5854 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 14/14 constraints]
After SMT, in 8784ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 8786ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8912 ms. Remains : 44/44 places, 121/121 transitions.
Computed a total of 3 stabilizing places and 11 stable transitions
Computed a total of 3 stabilizing places and 11 stable transitions
Detected a total of 3/44 stabilizing places and 11/121 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 457 reset in 38 ms.
Product exploration explored 100000 steps with 963 reset in 156 ms.
Built C files in :
/tmp/ltsmin8813627150584041353
[2024-05-29 18:28:29] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2024-05-29 18:28:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:28:29] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2024-05-29 18:28:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:28:29] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2024-05-29 18:28:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:28:29] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8813627150584041353
Running compilation step : cd /tmp/ltsmin8813627150584041353;'/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 400 ms.
Running link step : cd /tmp/ltsmin8813627150584041353;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8813627150584041353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15595509657862062547.hoa' '--buchi-type=spotba'
LTSmin run took 523 ms.
FORMULA StigmergyElection-PT-04b-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-04b-LTLCardinality-06 finished in 20404 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 1 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 667/667 transitions.
Graph (trivial) has 458 edges and 450 vertex of which 71 / 450 are part of one of the 12 SCC in 1 ms
Free SCC test removed 59 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 268 rules applied. Total rules applied 269 place count 390 transition count 331
Reduce places removed 268 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 276 rules applied. Total rules applied 545 place count 122 transition count 323
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 549 place count 118 transition count 323
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 549 place count 118 transition count 308
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 579 place count 103 transition count 308
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 585 place count 97 transition count 301
Iterating global reduction 3 with 6 rules applied. Total rules applied 591 place count 97 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 591 place count 97 transition count 300
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 593 place count 96 transition count 300
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 594 place count 95 transition count 298
Iterating global reduction 3 with 1 rules applied. Total rules applied 595 place count 95 transition count 298
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 596 place count 94 transition count 296
Iterating global reduction 3 with 1 rules applied. Total rules applied 597 place count 94 transition count 296
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 635 place count 75 transition count 277
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 650 place count 60 transition count 137
Iterating global reduction 3 with 15 rules applied. Total rules applied 665 place count 60 transition count 137
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 673 place count 60 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 675 place count 58 transition count 125
Iterating global reduction 4 with 2 rules applied. Total rules applied 677 place count 58 transition count 125
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 679 place count 56 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 681 place count 56 transition count 121
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 701 place count 46 transition count 144
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 702 place count 45 transition count 135
Iterating global reduction 4 with 1 rules applied. Total rules applied 703 place count 45 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 704 place count 45 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 709 place count 45 transition count 129
Applied a total of 709 rules in 59 ms. Remains 45 /450 variables (removed 405) and now considering 129/667 (removed 538) transitions.
[2024-05-29 18:28:30] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
// Phase 1: matrix 124 rows 45 cols
[2024-05-29 18:28:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:28:30] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 18:28:30] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
[2024-05-29 18:28:30] [INFO ] Invariant cache hit.
[2024-05-29 18:28:30] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 18:28:30] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-29 18:28:30] [INFO ] Redundant transitions in 2 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-29 18:28:30] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
[2024-05-29 18:28:30] [INFO ] Invariant cache hit.
[2024-05-29 18:28:30] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 123/168 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 31/89 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 1/169 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-29 18:28:33] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/169 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (OVERLAPS) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 91 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4154 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 123/168 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 31/90 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 112/202 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 1/169 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/169 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 203 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4476 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 12/12 constraints]
After SMT, in 8689ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 8690ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/450 places, 129/667 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8873 ms. Remains : 45/450 places, 129/667 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLCardinality-07
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLCardinality-07 finished in 8960 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 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 667/667 transitions.
Graph (trivial) has 457 edges and 450 vertex of which 71 / 450 are part of one of the 12 SCC in 1 ms
Free SCC test removed 59 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 263 rules applied. Total rules applied 264 place count 390 transition count 336
Reduce places removed 263 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 271 rules applied. Total rules applied 535 place count 127 transition count 328
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 541 place count 123 transition count 326
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 543 place count 121 transition count 326
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 543 place count 121 transition count 311
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 573 place count 106 transition count 311
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 579 place count 100 transition count 304
Iterating global reduction 4 with 6 rules applied. Total rules applied 585 place count 100 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 585 place count 100 transition count 303
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 587 place count 99 transition count 303
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 588 place count 98 transition count 301
Iterating global reduction 4 with 1 rules applied. Total rules applied 589 place count 98 transition count 301
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 590 place count 97 transition count 299
Iterating global reduction 4 with 1 rules applied. Total rules applied 591 place count 97 transition count 299
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 629 place count 78 transition count 280
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 644 place count 63 transition count 140
Iterating global reduction 4 with 15 rules applied. Total rules applied 659 place count 63 transition count 140
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 667 place count 63 transition count 132
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 670 place count 60 transition count 126
Iterating global reduction 5 with 3 rules applied. Total rules applied 673 place count 60 transition count 126
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 676 place count 57 transition count 120
Iterating global reduction 5 with 3 rules applied. Total rules applied 679 place count 57 transition count 120
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 699 place count 47 transition count 143
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 700 place count 46 transition count 135
Iterating global reduction 5 with 1 rules applied. Total rules applied 701 place count 46 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 705 place count 46 transition count 131
Applied a total of 705 rules in 46 ms. Remains 46 /450 variables (removed 404) and now considering 131/667 (removed 536) transitions.
[2024-05-29 18:28:39] [INFO ] Flow matrix only has 126 transitions (discarded 5 similar events)
// Phase 1: matrix 126 rows 46 cols
[2024-05-29 18:28:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:28:39] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 18:28:39] [INFO ] Flow matrix only has 126 transitions (discarded 5 similar events)
[2024-05-29 18:28:39] [INFO ] Invariant cache hit.
[2024-05-29 18:28:39] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 18:28:39] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-29 18:28:39] [INFO ] Redundant transitions in 3 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-29 18:28:39] [INFO ] Flow matrix only has 126 transitions (discarded 5 similar events)
[2024-05-29 18:28:39] [INFO ] Invariant cache hit.
[2024-05-29 18:28:39] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 18:28:40] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:28:40] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:28:40] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:28:40] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:28:40] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:28:40] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:28:40] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 125/171 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 31/86 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 18:28:41] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/172 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/172 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 88 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3199 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 18:28:43] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 125/171 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 113/201 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 18:28:44] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 18:28:45] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 1/172 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (OVERLAPS) 0/172 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 204 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6502 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 11/11 constraints]
After SMT, in 9774ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 9775ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/450 places, 131/667 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9955 ms. Remains : 46/450 places, 131/667 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLCardinality-08
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLCardinality-08 finished in 10050 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((F(p1)||p0))))'
Support contains 8 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 667/667 transitions.
Graph (trivial) has 447 edges and 450 vertex of which 71 / 450 are part of one of the 12 SCC in 0 ms
Free SCC test removed 59 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 256 transitions
Trivial Post-agglo rules discarded 256 transitions
Performed 256 trivial Post agglomeration. Transition count delta: 256
Iterating post reduction 0 with 256 rules applied. Total rules applied 257 place count 390 transition count 343
Reduce places removed 256 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 264 rules applied. Total rules applied 521 place count 134 transition count 335
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 528 place count 130 transition count 332
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 531 place count 127 transition count 332
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 531 place count 127 transition count 317
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 561 place count 112 transition count 317
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 565 place count 108 transition count 313
Iterating global reduction 4 with 4 rules applied. Total rules applied 569 place count 108 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 569 place count 108 transition count 312
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 571 place count 107 transition count 312
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 609 place count 88 transition count 293
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 623 place count 74 transition count 154
Iterating global reduction 4 with 14 rules applied. Total rules applied 637 place count 74 transition count 154
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 645 place count 74 transition count 146
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 647 place count 72 transition count 142
Iterating global reduction 5 with 2 rules applied. Total rules applied 649 place count 72 transition count 142
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 651 place count 70 transition count 138
Iterating global reduction 5 with 2 rules applied. Total rules applied 653 place count 70 transition count 138
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -23
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 675 place count 59 transition count 161
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 676 place count 58 transition count 150
Iterating global reduction 5 with 1 rules applied. Total rules applied 677 place count 58 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 678 place count 58 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 682 place count 58 transition count 145
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 683 place count 58 transition count 145
Applied a total of 683 rules in 28 ms. Remains 58 /450 variables (removed 392) and now considering 145/667 (removed 522) transitions.
[2024-05-29 18:28:49] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
// Phase 1: matrix 139 rows 58 cols
[2024-05-29 18:28:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:28:49] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 18:28:49] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2024-05-29 18:28:49] [INFO ] Invariant cache hit.
[2024-05-29 18:28:49] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 18:28:49] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-29 18:28:49] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-29 18:28:49] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2024-05-29 18:28:49] [INFO ] Invariant cache hit.
[2024-05-29 18:28:49] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:28:50] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 18:28:51] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:28:51] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:28:51] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 18:28:51] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 138/196 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 31/109 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 1/197 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/197 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 110 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4979 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 18:28:55] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 138/196 variables, 58/79 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 31/110 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 128/238 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-29 18:28:57] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:28:57] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (OVERLAPS) 1/197 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 13 (OVERLAPS) 0/197 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 241 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8900 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 21/21 constraints]
After SMT, in 13948ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 13949ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/450 places, 145/667 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14110 ms. Remains : 58/450 places, 145/667 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLCardinality-09
Product exploration explored 100000 steps with 237 reset in 89 ms.
Product exploration explored 100000 steps with 413 reset in 70 ms.
Computed a total of 3 stabilizing places and 18 stable transitions
Computed a total of 3 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 88 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4903 resets) in 245 ms. (162 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (588 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (597 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (590 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (591 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
Probably explored full state space saw : 42522 states, properties seen :3
Probabilistic random walk after 220311 steps, saw 42522 distinct states, run finished after 366 ms. (steps per millisecond=601 ) properties seen :3
Explored full state space saw : 42522 states, properties seen :0
Exhaustive walk after 220311 steps, saw 42522 distinct states, run finished after 134 ms. (steps per millisecond=1644 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 18 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-04b-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-04b-LTLCardinality-09 finished in 15316 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(F((G(p1)||p0))))'
Support contains 3 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 667/667 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 443 transition count 660
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 442 transition count 659
Applied a total of 16 rules in 17 ms. Remains 442 /450 variables (removed 8) and now considering 659/667 (removed 8) transitions.
// Phase 1: matrix 659 rows 442 cols
[2024-05-29 18:29:04] [INFO ] Computed 5 invariants in 4 ms
[2024-05-29 18:29:05] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-29 18:29:05] [INFO ] Invariant cache hit.
[2024-05-29 18:29:05] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2024-05-29 18:29:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:29:15] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 3 ms to minimize.
[2024-05-29 18:29:15] [INFO ] Deduced a trap composed of 163 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:29:15] [INFO ] Deduced a trap composed of 162 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:29:15] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:29:16] [INFO ] Deduced a trap composed of 165 places in 106 ms of which 2 ms to minimize.
[2024-05-29 18:29:16] [INFO ] Deduced a trap composed of 163 places in 110 ms of which 3 ms to minimize.
[2024-05-29 18:29:17] [INFO ] Deduced a trap composed of 219 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:29:17] [INFO ] Deduced a trap composed of 162 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:29:17] [INFO ] Deduced a trap composed of 164 places in 116 ms of which 3 ms to minimize.
[2024-05-29 18:29:17] [INFO ] Deduced a trap composed of 164 places in 116 ms of which 3 ms to minimize.
[2024-05-29 18:29:17] [INFO ] Deduced a trap composed of 163 places in 101 ms of which 2 ms to minimize.
[2024-05-29 18:29:17] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 2 ms to minimize.
[2024-05-29 18:29:18] [INFO ] Deduced a trap composed of 164 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:29:18] [INFO ] Deduced a trap composed of 165 places in 113 ms of which 2 ms to minimize.
[2024-05-29 18:29:19] [INFO ] Deduced a trap composed of 165 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:29:19] [INFO ] Deduced a trap composed of 166 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:29:19] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:29:19] [INFO ] Deduced a trap composed of 163 places in 95 ms of which 1 ms to minimize.
[2024-05-29 18:29:20] [INFO ] Deduced a trap composed of 164 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:29:20] [INFO ] Deduced a trap composed of 163 places in 119 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:29:20] [INFO ] Deduced a trap composed of 164 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:29:21] [INFO ] Deduced a trap composed of 164 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:29:21] [INFO ] Deduced a trap composed of 165 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:29:21] [INFO ] Deduced a trap composed of 163 places in 103 ms of which 2 ms to minimize.
[2024-05-29 18:29:21] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:29:22] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:29:23] [INFO ] Deduced a trap composed of 166 places in 126 ms of which 3 ms to minimize.
[2024-05-29 18:29:23] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:29:23] [INFO ] Deduced a trap composed of 164 places in 114 ms of which 2 ms to minimize.
[2024-05-29 18:29:24] [INFO ] Deduced a trap composed of 165 places in 105 ms of which 2 ms to minimize.
[2024-05-29 18:29:25] [INFO ] Deduced a trap composed of 166 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:29:26] [INFO ] Deduced a trap composed of 192 places in 146 ms of which 3 ms to minimize.
[2024-05-29 18:29:26] [INFO ] Deduced a trap composed of 163 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:29:27] [INFO ] Deduced a trap composed of 166 places in 106 ms of which 2 ms to minimize.
[2024-05-29 18:29:27] [INFO ] Deduced a trap composed of 164 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1101 variables, and 40 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:29:44] [INFO ] Deduced a trap composed of 164 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:29:52] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:29:54] [INFO ] Deduced a trap composed of 164 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:29:55] [INFO ] Deduced a trap composed of 164 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/1101 variables, and 44 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 0/658 constraints, Known Traps: 39/39 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60325ms
Starting structural reductions in LTL mode, iteration 1 : 442/450 places, 659/667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60778 ms. Remains : 442/450 places, 659/667 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLCardinality-10
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLCardinality-10 finished in 60856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 667/667 transitions.
Graph (trivial) has 449 edges and 450 vertex of which 67 / 450 are part of one of the 11 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 260 rules applied. Total rules applied 261 place count 393 transition count 343
Reduce places removed 260 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 268 rules applied. Total rules applied 529 place count 133 transition count 335
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 537 place count 129 transition count 331
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 541 place count 125 transition count 331
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 541 place count 125 transition count 316
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 571 place count 110 transition count 316
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 576 place count 105 transition count 310
Iterating global reduction 4 with 5 rules applied. Total rules applied 581 place count 105 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 581 place count 105 transition count 309
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 583 place count 104 transition count 309
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 584 place count 103 transition count 307
Iterating global reduction 4 with 1 rules applied. Total rules applied 585 place count 103 transition count 307
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 586 place count 102 transition count 305
Iterating global reduction 4 with 1 rules applied. Total rules applied 587 place count 102 transition count 305
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 623 place count 84 transition count 287
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 636 place count 71 transition count 150
Iterating global reduction 4 with 13 rules applied. Total rules applied 649 place count 71 transition count 150
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 657 place count 71 transition count 142
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 659 place count 69 transition count 138
Iterating global reduction 5 with 2 rules applied. Total rules applied 661 place count 69 transition count 138
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 663 place count 67 transition count 134
Iterating global reduction 5 with 2 rules applied. Total rules applied 665 place count 67 transition count 134
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -23
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 687 place count 56 transition count 157
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 688 place count 55 transition count 147
Iterating global reduction 5 with 1 rules applied. Total rules applied 689 place count 55 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 690 place count 55 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 695 place count 55 transition count 141
Applied a total of 695 rules in 38 ms. Remains 55 /450 variables (removed 395) and now considering 141/667 (removed 526) transitions.
[2024-05-29 18:30:05] [INFO ] Flow matrix only has 135 transitions (discarded 6 similar events)
// Phase 1: matrix 135 rows 55 cols
[2024-05-29 18:30:05] [INFO ] Computed 3 invariants in 0 ms
[2024-05-29 18:30:05] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 18:30:05] [INFO ] Flow matrix only has 135 transitions (discarded 6 similar events)
[2024-05-29 18:30:05] [INFO ] Invariant cache hit.
[2024-05-29 18:30:05] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 18:30:05] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-29 18:30:05] [INFO ] Redundant transitions in 1 ms returned []
Running 124 sub problems to find dead transitions.
[2024-05-29 18:30:05] [INFO ] Flow matrix only has 135 transitions (discarded 6 similar events)
[2024-05-29 18:30:05] [INFO ] Invariant cache hit.
[2024-05-29 18:30:05] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 18:30:06] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:30:06] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:30:06] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:30:06] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:30:06] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:30:06] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:30:06] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:30:06] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:30:06] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:30:06] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:30:06] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 18:30:08] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:30:08] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:30:08] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 134/189 variables, 55/81 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 31/112 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 1/190 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 113 constraints, problems are : Problem set: 0 solved, 124 unsolved in 4897 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 134/189 variables, 55/81 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 31/112 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 124/236 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-29 18:30:12] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 1/190 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 238 constraints, problems are : Problem set: 0 solved, 124 unsolved in 7629 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 24/24 constraints]
After SMT, in 12597ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 12598ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/450 places, 141/667 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12766 ms. Remains : 55/450 places, 141/667 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLCardinality-11
Product exploration explored 100000 steps with 757 reset in 80 ms.
Stack based approach found an accepted trace after 1307 steps with 163 reset with depth 19 and stack size 19 in 3 ms.
FORMULA StigmergyElection-PT-04b-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyElection-PT-04b-LTLCardinality-11 finished in 12905 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 U (p1||G(!p0))))))'
Support contains 3 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 667/667 transitions.
Graph (trivial) has 456 edges and 450 vertex of which 69 / 450 are part of one of the 12 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 266 rules applied. Total rules applied 267 place count 392 transition count 336
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 274 rules applied. Total rules applied 541 place count 126 transition count 328
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 546 place count 122 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 547 place count 121 transition count 327
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 547 place count 121 transition count 313
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 575 place count 107 transition count 313
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 581 place count 101 transition count 306
Iterating global reduction 4 with 6 rules applied. Total rules applied 587 place count 101 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 587 place count 101 transition count 305
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 589 place count 100 transition count 305
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 590 place count 99 transition count 303
Iterating global reduction 4 with 1 rules applied. Total rules applied 591 place count 99 transition count 303
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 592 place count 98 transition count 301
Iterating global reduction 4 with 1 rules applied. Total rules applied 593 place count 98 transition count 301
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 633 place count 78 transition count 281
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 647 place count 64 transition count 143
Iterating global reduction 4 with 14 rules applied. Total rules applied 661 place count 64 transition count 143
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 669 place count 64 transition count 135
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 671 place count 62 transition count 131
Iterating global reduction 5 with 2 rules applied. Total rules applied 673 place count 62 transition count 131
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 675 place count 60 transition count 127
Iterating global reduction 5 with 2 rules applied. Total rules applied 677 place count 60 transition count 127
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 697 place count 50 transition count 150
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 698 place count 49 transition count 141
Iterating global reduction 5 with 1 rules applied. Total rules applied 699 place count 49 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 700 place count 49 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 705 place count 49 transition count 135
Applied a total of 705 rules in 37 ms. Remains 49 /450 variables (removed 401) and now considering 135/667 (removed 532) transitions.
[2024-05-29 18:30:18] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 49 cols
[2024-05-29 18:30:18] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:30:18] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-29 18:30:18] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2024-05-29 18:30:18] [INFO ] Invariant cache hit.
[2024-05-29 18:30:18] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 18:30:18] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-29 18:30:18] [INFO ] Redundant transitions in 1 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-29 18:30:18] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2024-05-29 18:30:18] [INFO ] Invariant cache hit.
[2024-05-29 18:30:18] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-29 18:30:19] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:30:19] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:30:19] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:30:19] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:30:19] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:30:19] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:30:19] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:30:19] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:30:19] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:30:19] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:30:19] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 128/177 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 31/93 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 1/178 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-29 18:30:21] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 95 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3836 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 128/177 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 31/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 118/212 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-29 18:30:24] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:30:24] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-29 18:30:25] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 1/178 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (OVERLAPS) 0/178 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 216 constraints, problems are : Problem set: 0 solved, 118 unsolved in 7777 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 15/15 constraints]
After SMT, in 11686ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 11687ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/450 places, 135/667 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11910 ms. Remains : 49/450 places, 135/667 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLCardinality-13
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLCardinality-13 finished in 11995 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(F(p0)) U G(!p1)))'
Support contains 3 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 667/667 transitions.
Graph (trivial) has 456 edges and 450 vertex of which 71 / 450 are part of one of the 12 SCC in 1 ms
Free SCC test removed 59 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 262 rules applied. Total rules applied 263 place count 390 transition count 337
Reduce places removed 262 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 270 rules applied. Total rules applied 533 place count 128 transition count 329
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 539 place count 124 transition count 327
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 541 place count 122 transition count 327
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 541 place count 122 transition count 312
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 571 place count 107 transition count 312
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 577 place count 101 transition count 305
Iterating global reduction 4 with 6 rules applied. Total rules applied 583 place count 101 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 583 place count 101 transition count 304
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 585 place count 100 transition count 304
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 586 place count 99 transition count 302
Iterating global reduction 4 with 1 rules applied. Total rules applied 587 place count 99 transition count 302
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 588 place count 98 transition count 300
Iterating global reduction 4 with 1 rules applied. Total rules applied 589 place count 98 transition count 300
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 627 place count 79 transition count 281
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 641 place count 65 transition count 149
Iterating global reduction 4 with 14 rules applied. Total rules applied 655 place count 65 transition count 149
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 662 place count 65 transition count 142
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 665 place count 62 transition count 136
Iterating global reduction 5 with 3 rules applied. Total rules applied 668 place count 62 transition count 136
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 671 place count 59 transition count 130
Iterating global reduction 5 with 3 rules applied. Total rules applied 674 place count 59 transition count 130
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 694 place count 49 transition count 153
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 695 place count 48 transition count 145
Iterating global reduction 5 with 1 rules applied. Total rules applied 696 place count 48 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 697 place count 48 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 701 place count 48 transition count 140
Applied a total of 701 rules in 31 ms. Remains 48 /450 variables (removed 402) and now considering 140/667 (removed 527) transitions.
[2024-05-29 18:30:30] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
// Phase 1: matrix 135 rows 48 cols
[2024-05-29 18:30:30] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 18:30:30] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-29 18:30:30] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
[2024-05-29 18:30:30] [INFO ] Invariant cache hit.
[2024-05-29 18:30:31] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 18:30:31] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-29 18:30:31] [INFO ] Redundant transitions in 1 ms returned []
Running 123 sub problems to find dead transitions.
[2024-05-29 18:30:31] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
[2024-05-29 18:30:31] [INFO ] Invariant cache hit.
[2024-05-29 18:30:31] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-29 18:30:31] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:30:31] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:30:31] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:30:31] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 6 ms to minimize.
[2024-05-29 18:30:31] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:30:31] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:30:31] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:30:31] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:30:31] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:30:31] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:30:31] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:30:32] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 134/182 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 31/93 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 1/183 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 94 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3554 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 134/182 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 31/93 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 123/216 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-29 18:30:38] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/183 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 218 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 13/13 constraints]
After SMT, in 10675ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 10676ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/450 places, 140/667 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11036 ms. Remains : 48/450 places, 140/667 transitions.
Stuttering acceptance computed with spot in 77 ms :[p1, (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLCardinality-14
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLCardinality-14 finished in 11130 ms.
All properties solved by simple procedures.
Total runtime 280496 ms.

BK_STOP 1717007441880

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-04b"
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-04b, 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-171690532000291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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