Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490900204.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is StigmergyElection-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490900204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 203K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749141862159

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 16:44:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 16:44:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 16:44:25] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2025-06-05 16:44:25] [INFO ] Transformed 563 places.
[2025-06-05 16:44:25] [INFO ] Transformed 780 transitions.
[2025-06-05 16:44:25] [INFO ] Found NUPN structural information;
[2025-06-05 16:44:25] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 636 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyElection-PT-04b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 780/780 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 495 transition count 712
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 495 transition count 712
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 168 place count 463 transition count 680
Iterating global reduction 0 with 32 rules applied. Total rules applied 200 place count 463 transition count 680
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 206 place count 457 transition count 674
Iterating global reduction 0 with 6 rules applied. Total rules applied 212 place count 457 transition count 674
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 215 place count 454 transition count 671
Iterating global reduction 0 with 3 rules applied. Total rules applied 218 place count 454 transition count 671
Applied a total of 218 rules in 344 ms. Remains 454 /563 variables (removed 109) and now considering 671/780 (removed 109) transitions.
// Phase 1: matrix 671 rows 454 cols
[2025-06-05 16:44:26] [INFO ] Computed 5 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:44:27] [INFO ] Implicit Places using invariants in 997 ms returned []
[2025-06-05 16:44:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:44:28] [INFO ] Implicit Places using invariants and state equation in 1566 ms returned []
Implicit Place search using SMT with State Equation took 2680 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2025-06-05 16:44:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/454 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1125 variables, and 5 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/454 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/454 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:21] [INFO ] Deduced a trap composed of 162 places in 590 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:22] [INFO ] Deduced a trap composed of 166 places in 339 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:22] [INFO ] Deduced a trap composed of 169 places in 402 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:23] [INFO ] Deduced a trap composed of 169 places in 432 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:24] [INFO ] Deduced a trap composed of 172 places in 403 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:25] [INFO ] Deduced a trap composed of 163 places in 469 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:26] [INFO ] Deduced a trap composed of 163 places in 519 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:26] [INFO ] Deduced a trap composed of 164 places in 322 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:27] [INFO ] Deduced a trap composed of 165 places in 493 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:28] [INFO ] Deduced a trap composed of 169 places in 501 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:29] [INFO ] Deduced a trap composed of 163 places in 351 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:29] [INFO ] Deduced a trap composed of 167 places in 349 ms of which 58 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1125 variables, and 17 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/454 constraints, PredecessorRefiner: 0/670 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60995ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 61069ms
Starting structural reductions in LTL mode, iteration 1 : 454/563 places, 671/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64193 ms. Remains : 454/563 places, 671/780 transitions.
Support contains 36 out of 454 places after structural reductions.
[2025-06-05 16:45:30] [INFO ] Flatten gal took : 176 ms
[2025-06-05 16:45:30] [INFO ] Flatten gal took : 95 ms
[2025-06-05 16:45:30] [INFO ] Input system was already deterministic with 671 transitions.
RANDOM walk for 40000 steps (546 resets) in 2461 ms. (16 steps per ms) remains 18/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (10 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (10 resets) in 22 ms. (173 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (11 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (9 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
[2025-06-05 16:45:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 430/454 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:32] [INFO ] Deduced a trap composed of 163 places in 362 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:33] [INFO ] Deduced a trap composed of 165 places in 560 ms of which 219 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:33] [INFO ] Deduced a trap composed of 165 places in 473 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:34] [INFO ] Deduced a trap composed of 168 places in 391 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:34] [INFO ] Deduced a trap composed of 167 places in 498 ms of which 122 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:35] [INFO ] Deduced a trap composed of 165 places in 508 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:36] [INFO ] Deduced a trap composed of 166 places in 347 ms of which 58 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:36] [INFO ] Deduced a trap composed of 163 places in 462 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:45:37] [INFO ] Deduced a trap composed of 164 places in 515 ms of which 124 ms to minimize.
SMT process timed out in 5278ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 671/671 transitions.
Graph (trivial) has 429 edges and 454 vertex of which 47 / 454 are part of one of the 9 SCC in 6 ms
Free SCC test removed 38 places
Drop transitions (Empty/Sink Transition effects.) removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 785 edges and 416 vertex of which 412 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 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 264 rules applied. Total rules applied 266 place count 412 transition count 356
Reduce places removed 263 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 273 rules applied. Total rules applied 539 place count 149 transition count 346
Reduce places removed 5 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 10 rules applied. Total rules applied 549 place count 144 transition count 341
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 556 place count 139 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 557 place count 138 transition count 339
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 557 place count 138 transition count 319
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 597 place count 118 transition count 319
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 639 place count 97 transition count 297
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 643 place count 97 transition count 293
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 651 place count 89 transition count 224
Iterating global reduction 6 with 8 rules applied. Total rules applied 659 place count 89 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 663 place count 89 transition count 220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 669 place count 86 transition count 217
Performed 9 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 687 place count 77 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 700 place count 77 transition count 211
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 726 place count 77 transition count 185
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 753 place count 51 transition count 184
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 754 place count 51 transition count 184
Applied a total of 754 rules in 206 ms. Remains 51 /454 variables (removed 403) and now considering 184/671 (removed 487) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 51/454 places, 184/671 transitions.
RANDOM walk for 6812 steps (78 resets) in 227 ms. (29 steps per ms) remains 0/18 properties
FORMULA StigmergyElection-PT-04b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA StigmergyElection-PT-04b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 60 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1)||X(X(X(F(p2)))))))'
Support contains 4 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 671/671 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 449 transition count 666
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 449 transition count 666
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 447 transition count 664
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 447 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 446 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 446 transition count 663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 445 transition count 662
Applied a total of 18 rules in 97 ms. Remains 445 /454 variables (removed 9) and now considering 662/671 (removed 9) transitions.
// Phase 1: matrix 662 rows 445 cols
[2025-06-05 16:45:38] [INFO ] Computed 5 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:45:38] [INFO ] Implicit Places using invariants in 370 ms returned []
[2025-06-05 16:45:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:45:39] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
Running 661 sub problems to find dead transitions.
[2025-06-05 16:45:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:03] [INFO ] Deduced a trap composed of 162 places in 585 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:03] [INFO ] Deduced a trap composed of 164 places in 375 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:04] [INFO ] Deduced a trap composed of 165 places in 407 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:05] [INFO ] Deduced a trap composed of 163 places in 405 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:06] [INFO ] Deduced a trap composed of 163 places in 469 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:07] [INFO ] Deduced a trap composed of 164 places in 465 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:08] [INFO ] Deduced a trap composed of 165 places in 491 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:09] [INFO ] Deduced a trap composed of 165 places in 451 ms of which 105 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1107 variables, and 13 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/445 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:21] [INFO ] Deduced a trap composed of 164 places in 389 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:22] [INFO ] Deduced a trap composed of 165 places in 365 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:23] [INFO ] Deduced a trap composed of 164 places in 410 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:25] [INFO ] Deduced a trap composed of 165 places in 374 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:25] [INFO ] Deduced a trap composed of 166 places in 307 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:29] [INFO ] Deduced a trap composed of 164 places in 325 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:30] [INFO ] Deduced a trap composed of 165 places in 363 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:31] [INFO ] Deduced a trap composed of 163 places in 305 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:32] [INFO ] Deduced a trap composed of 163 places in 250 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:32] [INFO ] Deduced a trap composed of 165 places in 284 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:32] [INFO ] Deduced a trap composed of 164 places in 382 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:33] [INFO ] Deduced a trap composed of 164 places in 409 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:33] [INFO ] Deduced a trap composed of 164 places in 298 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:33] [INFO ] Deduced a trap composed of 164 places in 261 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:37] [INFO ] Deduced a trap composed of 164 places in 301 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:39] [INFO ] Deduced a trap composed of 165 places in 213 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:39] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:46:39] [INFO ] Deduced a trap composed of 165 places in 298 ms of which 67 ms to minimize.
SMT process timed out in 60567ms, After SMT, problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 60572ms
Starting structural reductions in LTL mode, iteration 1 : 445/454 places, 662/671 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61742 ms. Remains : 445/454 places, 662/671 transitions.
Stuttering acceptance computed with spot in 489 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-00
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-00 finished in 62366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F(p1) U X((p2&&F(G(p3)))))))'
Support contains 3 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 671/671 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 449 transition count 666
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 449 transition count 666
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 448 transition count 665
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 448 transition count 665
Applied a total of 12 rules in 52 ms. Remains 448 /454 variables (removed 6) and now considering 665/671 (removed 6) transitions.
// Phase 1: matrix 665 rows 448 cols
[2025-06-05 16:46:40] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:46:40] [INFO ] Implicit Places using invariants in 282 ms returned []
[2025-06-05 16:46:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:46:41] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
Running 664 sub problems to find dead transitions.
[2025-06-05 16:46:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:11] [INFO ] Deduced a trap composed of 162 places in 582 ms of which 109 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/1113 variables, and 6 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 664 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:24] [INFO ] Deduced a trap composed of 164 places in 399 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:25] [INFO ] Deduced a trap composed of 167 places in 360 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:26] [INFO ] Deduced a trap composed of 168 places in 334 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:27] [INFO ] Deduced a trap composed of 163 places in 380 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:28] [INFO ] Deduced a trap composed of 162 places in 573 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:28] [INFO ] Deduced a trap composed of 163 places in 503 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:29] [INFO ] Deduced a trap composed of 163 places in 460 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:29] [INFO ] Deduced a trap composed of 164 places in 436 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:30] [INFO ] Deduced a trap composed of 165 places in 459 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:31] [INFO ] Deduced a trap composed of 168 places in 442 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:32] [INFO ] Deduced a trap composed of 163 places in 449 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:33] [INFO ] Deduced a trap composed of 164 places in 437 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:33] [INFO ] Deduced a trap composed of 164 places in 561 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:34] [INFO ] Deduced a trap composed of 165 places in 476 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:35] [INFO ] Deduced a trap composed of 167 places in 457 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:35] [INFO ] Deduced a trap composed of 168 places in 478 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:37] [INFO ] Deduced a trap composed of 163 places in 506 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:38] [INFO ] Deduced a trap composed of 165 places in 482 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:38] [INFO ] Deduced a trap composed of 165 places in 478 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:39] [INFO ] Deduced a trap composed of 169 places in 471 ms of which 104 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:40] [INFO ] Deduced a trap composed of 164 places in 278 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:40] [INFO ] Deduced a trap composed of 168 places in 362 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:47:41] [INFO ] Deduced a trap composed of 169 places in 346 ms of which 23 ms to minimize.
SMT process timed out in 60366ms, After SMT, problems are : Problem set: 0 solved, 664 unsolved
Search for dead transitions found 0 dead transitions in 60369ms
Starting structural reductions in LTL mode, iteration 1 : 448/454 places, 665/671 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61297 ms. Remains : 448/454 places, 665/671 transitions.
Stuttering acceptance computed with spot in 482 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 661 ms.
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Computed a total of 60 stabilizing places and 64 stable transitions
Computed a total of 60 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 24 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-04b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-04b-LTLFireability-01 finished in 62763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 671/671 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 448 transition count 665
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 448 transition count 665
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 445 transition count 662
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 443 transition count 660
Applied a total of 22 rules in 50 ms. Remains 443 /454 variables (removed 11) and now considering 660/671 (removed 11) transitions.
// Phase 1: matrix 660 rows 443 cols
[2025-06-05 16:47:43] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:47:43] [INFO ] Implicit Places using invariants in 322 ms returned []
[2025-06-05 16:47:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:47:44] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
Running 659 sub problems to find dead transitions.
[2025-06-05 16:47:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:11] [INFO ] Deduced a trap composed of 162 places in 326 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:11] [INFO ] Deduced a trap composed of 163 places in 201 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:12] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:12] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:13] [INFO ] Deduced a trap composed of 164 places in 359 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:14] [INFO ] Deduced a trap composed of 163 places in 454 ms of which 62 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1103 variables, and 11 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/443 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:29] [INFO ] Deduced a trap composed of 164 places in 424 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:29] [INFO ] Deduced a trap composed of 165 places in 429 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:31] [INFO ] Deduced a trap composed of 165 places in 457 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:32] [INFO ] Deduced a trap composed of 162 places in 537 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:32] [INFO ] Deduced a trap composed of 163 places in 280 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:32] [INFO ] Deduced a trap composed of 164 places in 256 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:33] [INFO ] Deduced a trap composed of 164 places in 351 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:34] [INFO ] Deduced a trap composed of 165 places in 551 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:34] [INFO ] Deduced a trap composed of 166 places in 461 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:36] [INFO ] Deduced a trap composed of 165 places in 519 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:36] [INFO ] Deduced a trap composed of 165 places in 455 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:37] [INFO ] Deduced a trap composed of 163 places in 566 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:38] [INFO ] Deduced a trap composed of 163 places in 452 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:38] [INFO ] Deduced a trap composed of 164 places in 479 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:39] [INFO ] Deduced a trap composed of 164 places in 406 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:39] [INFO ] Deduced a trap composed of 163 places in 344 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:39] [INFO ] Deduced a trap composed of 164 places in 285 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:40] [INFO ] Deduced a trap composed of 164 places in 248 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:48:44] [INFO ] Deduced a trap composed of 163 places in 202 ms of which 31 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 1)
(s431 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/1103 variables, and 30 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/443 constraints, PredecessorRefiner: 0/659 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60328ms problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Starting structural reductions in LTL mode, iteration 1 : 443/454 places, 660/671 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61505 ms. Remains : 443/454 places, 660/671 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3037 steps with 40 reset in 11 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-03 finished in 61681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X((p0&&F(p1))))&&F(p2)))))'
Support contains 3 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 671/671 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 447 transition count 664
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 447 transition count 664
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 444 transition count 661
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 442 transition count 659
Applied a total of 24 rules in 74 ms. Remains 442 /454 variables (removed 12) and now considering 659/671 (removed 12) transitions.
// Phase 1: matrix 659 rows 442 cols
[2025-06-05 16:48:45] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:48:45] [INFO ] Implicit Places using invariants in 347 ms returned []
[2025-06-05 16:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:48:45] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2025-06-05 16:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:49:15] [INFO ] Deduced a trap composed of 162 places in 578 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:49:15] [INFO ] Deduced a trap composed of 162 places in 315 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:49:16] [INFO ] Deduced a trap composed of 163 places in 383 ms of which 63 ms to minimize.
SMT process timed out in 30482ms, After SMT, problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 30485ms
Starting structural reductions in LTL mode, iteration 1 : 442/454 places, 659/671 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31465 ms. Remains : 442/454 places, 659/671 transitions.
Stuttering acceptance computed with spot in 500 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-04
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-04 finished in 32000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U p2)))))'
Support contains 3 out of 454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 454/454 places, 671/671 transitions.
Graph (trivial) has 458 edges and 454 vertex of which 62 / 454 are part of one of the 11 SCC in 5 ms
Free SCC test removed 51 places
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 276 place count 402 transition count 337
Reduce places removed 275 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 282 rules applied. Total rules applied 558 place count 127 transition count 330
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 563 place count 124 transition count 328
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 567 place count 122 transition count 326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 568 place count 121 transition count 326
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 568 place count 121 transition count 309
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 602 place count 104 transition count 309
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 606 place count 100 transition count 305
Iterating global reduction 5 with 4 rules applied. Total rules applied 610 place count 100 transition count 305
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 648 place count 81 transition count 286
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 663 place count 66 transition count 146
Iterating global reduction 5 with 15 rules applied. Total rules applied 678 place count 66 transition count 146
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 685 place count 66 transition count 139
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 687 place count 64 transition count 135
Iterating global reduction 6 with 2 rules applied. Total rules applied 689 place count 64 transition count 135
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 691 place count 62 transition count 131
Iterating global reduction 6 with 2 rules applied. Total rules applied 693 place count 62 transition count 131
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 6 with 22 rules applied. Total rules applied 715 place count 51 transition count 154
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 716 place count 50 transition count 143
Iterating global reduction 6 with 1 rules applied. Total rules applied 717 place count 50 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 718 place count 50 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 724 place count 50 transition count 136
Applied a total of 724 rules in 109 ms. Remains 50 /454 variables (removed 404) and now considering 136/671 (removed 535) transitions.
[2025-06-05 16:49:17] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
// Phase 1: matrix 131 rows 50 cols
[2025-06-05 16:49:17] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:49:17] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-05 16:49:17] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2025-06-05 16:49:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:49:17] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 16:49:17] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:49:17] [INFO ] Redundant transitions in 5 ms returned []
Running 119 sub problems to find dead transitions.
[2025-06-05 16:49:17] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2025-06-05 16:49:17] [INFO ] Invariant cache hit.
[2025-06-05 16:49:17] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:49:18] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:49:18] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:49:18] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:49:18] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:49:18] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:49:19] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:49:19] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:49:19] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 130/180 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/181 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:49:24] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/181 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 93 constraints, problems are : Problem set: 0 solved, 119 unsolved in 13503 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 130/180 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 31/92 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 119/211 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/181 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:49:42] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/181 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 213 constraints, problems are : Problem set: 0 solved, 119 unsolved in 23405 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36964ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 36964ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/454 places, 136/671 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37355 ms. Remains : 50/454 places, 136/671 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-05
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-05 finished in 37467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(F(p1)))))))'
Support contains 5 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 671/671 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 448 transition count 665
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 448 transition count 665
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 446 transition count 663
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 446 transition count 663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 444 transition count 661
Applied a total of 20 rules in 53 ms. Remains 444 /454 variables (removed 10) and now considering 661/671 (removed 10) transitions.
// Phase 1: matrix 661 rows 444 cols
[2025-06-05 16:49:54] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:49:54] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-06-05 16:49:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:49:55] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-05 16:49:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:15] [INFO ] Deduced a trap composed of 162 places in 385 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:15] [INFO ] Deduced a trap composed of 162 places in 235 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:15] [INFO ] Deduced a trap composed of 164 places in 257 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:16] [INFO ] Deduced a trap composed of 166 places in 240 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:17] [INFO ] Deduced a trap composed of 163 places in 281 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:17] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:18] [INFO ] Deduced a trap composed of 164 places in 281 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:19] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:19] [INFO ] Deduced a trap composed of 163 places in 271 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:19] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:20] [INFO ] Deduced a trap composed of 165 places in 338 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:21] [INFO ] Deduced a trap composed of 163 places in 297 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:22] [INFO ] Deduced a trap composed of 163 places in 293 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:22] [INFO ] Deduced a trap composed of 165 places in 384 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:22] [INFO ] Deduced a trap composed of 165 places in 326 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:23] [INFO ] Deduced a trap composed of 163 places in 372 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:23] [INFO ] Deduced a trap composed of 166 places in 382 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:24] [INFO ] Deduced a trap composed of 166 places in 349 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:24] [INFO ] Deduced a trap composed of 164 places in 384 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:24] [INFO ] Deduced a trap composed of 164 places in 351 ms of which 68 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/1105 variables, and 25 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/444 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:33] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:34] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:38] [INFO ] Deduced a trap composed of 166 places in 335 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:38] [INFO ] Deduced a trap composed of 164 places in 323 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:38] [INFO ] Deduced a trap composed of 165 places in 292 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:39] [INFO ] Deduced a trap composed of 165 places in 223 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:39] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:50:39] [INFO ] Deduced a trap composed of 165 places in 341 ms of which 79 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/1105 variables, and 33 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/444 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Starting structural reductions in LTL mode, iteration 1 : 444/454 places, 661/671 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61076 ms. Remains : 444/454 places, 661/671 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-07
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-07 finished in 61233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G((p1||X(p1))))))'
Support contains 2 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 671/671 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 447 transition count 664
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 447 transition count 664
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 444 transition count 661
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 442 transition count 659
Applied a total of 24 rules in 50 ms. Remains 442 /454 variables (removed 12) and now considering 659/671 (removed 12) transitions.
// Phase 1: matrix 659 rows 442 cols
[2025-06-05 16:50:55] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:50:55] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-06-05 16:50:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:50:56] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2025-06-05 16:50:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:15] [INFO ] Deduced a trap composed of 162 places in 378 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:16] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:16] [INFO ] Deduced a trap composed of 163 places in 233 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:17] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:17] [INFO ] Deduced a trap composed of 163 places in 233 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:18] [INFO ] Deduced a trap composed of 163 places in 275 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:18] [INFO ] Deduced a trap composed of 163 places in 217 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:19] [INFO ] Deduced a trap composed of 164 places in 280 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:19] [INFO ] Deduced a trap composed of 163 places in 283 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:20] [INFO ] Deduced a trap composed of 162 places in 299 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:20] [INFO ] Deduced a trap composed of 164 places in 279 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:20] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:21] [INFO ] Deduced a trap composed of 164 places in 326 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:21] [INFO ] Deduced a trap composed of 165 places in 315 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:22] [INFO ] Deduced a trap composed of 164 places in 361 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:22] [INFO ] Deduced a trap composed of 166 places in 309 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:23] [INFO ] Deduced a trap composed of 163 places in 302 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:24] [INFO ] Deduced a trap composed of 164 places in 378 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:24] [INFO ] Deduced a trap composed of 163 places in 283 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:24] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/25 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 25 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 20/25 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:36] [INFO ] Deduced a trap composed of 164 places in 299 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:39] [INFO ] Deduced a trap composed of 165 places in 308 ms of which 58 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:43] [INFO ] Deduced a trap composed of 163 places in 293 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:44] [INFO ] Deduced a trap composed of 163 places in 289 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:45] [INFO ] Deduced a trap composed of 164 places in 262 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:45] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:45] [INFO ] Deduced a trap composed of 165 places in 302 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:46] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:47] [INFO ] Deduced a trap composed of 166 places in 265 ms of which 51 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:56] [INFO ] Deduced a trap composed of 165 places in 272 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:51:56] [INFO ] Deduced a trap composed of 164 places in 268 ms of which 41 ms to minimize.
SMT process timed out in 60278ms, After SMT, problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Starting structural reductions in LTL mode, iteration 1 : 442/454 places, 659/671 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61158 ms. Remains : 442/454 places, 659/671 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-08
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-08 finished in 61318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 5 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 671/671 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 447 transition count 664
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 447 transition count 664
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 444 transition count 661
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 442 transition count 659
Applied a total of 24 rules in 55 ms. Remains 442 /454 variables (removed 12) and now considering 659/671 (removed 12) transitions.
[2025-06-05 16:51:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:51:57] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-06-05 16:51:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:51:57] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2025-06-05 16:51:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:17] [INFO ] Deduced a trap composed of 162 places in 361 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:17] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:18] [INFO ] Deduced a trap composed of 163 places in 233 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:18] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:19] [INFO ] Deduced a trap composed of 163 places in 237 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:19] [INFO ] Deduced a trap composed of 163 places in 284 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:20] [INFO ] Deduced a trap composed of 163 places in 220 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:20] [INFO ] Deduced a trap composed of 164 places in 281 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:21] [INFO ] Deduced a trap composed of 163 places in 275 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:22] [INFO ] Deduced a trap composed of 162 places in 288 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:22] [INFO ] Deduced a trap composed of 164 places in 288 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:22] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:23] [INFO ] Deduced a trap composed of 164 places in 361 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:23] [INFO ] Deduced a trap composed of 165 places in 334 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:23] [INFO ] Deduced a trap composed of 164 places in 365 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:24] [INFO ] Deduced a trap composed of 166 places in 316 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:25] [INFO ] Deduced a trap composed of 163 places in 329 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:26] [INFO ] Deduced a trap composed of 164 places in 380 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:26] [INFO ] Deduced a trap composed of 163 places in 305 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:26] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/25 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 25 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 20/25 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:38] [INFO ] Deduced a trap composed of 164 places in 301 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:40] [INFO ] Deduced a trap composed of 165 places in 304 ms of which 58 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:44] [INFO ] Deduced a trap composed of 163 places in 291 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:45] [INFO ] Deduced a trap composed of 163 places in 293 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:46] [INFO ] Deduced a trap composed of 164 places in 266 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:46] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:46] [INFO ] Deduced a trap composed of 165 places in 296 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:48] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:48] [INFO ] Deduced a trap composed of 166 places in 266 ms of which 50 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:57] [INFO ] Deduced a trap composed of 165 places in 265 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:52:58] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 41 ms to minimize.
SMT process timed out in 60246ms, After SMT, problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Starting structural reductions in LTL mode, iteration 1 : 442/454 places, 659/671 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61084 ms. Remains : 442/454 places, 659/671 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-09
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-09 finished in 61242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 2 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 671/671 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 447 transition count 664
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 447 transition count 664
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 444 transition count 661
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 442 transition count 659
Applied a total of 24 rules in 50 ms. Remains 442 /454 variables (removed 12) and now considering 659/671 (removed 12) transitions.
[2025-06-05 16:52:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:52:58] [INFO ] Implicit Places using invariants in 242 ms returned []
[2025-06-05 16:52:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:52:59] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2025-06-05 16:52:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:18] [INFO ] Deduced a trap composed of 162 places in 349 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:18] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:18] [INFO ] Deduced a trap composed of 163 places in 222 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:19] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:20] [INFO ] Deduced a trap composed of 163 places in 225 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:20] [INFO ] Deduced a trap composed of 163 places in 271 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:20] [INFO ] Deduced a trap composed of 163 places in 211 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:21] [INFO ] Deduced a trap composed of 164 places in 287 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:22] [INFO ] Deduced a trap composed of 163 places in 287 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:22] [INFO ] Deduced a trap composed of 162 places in 292 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:23] [INFO ] Deduced a trap composed of 164 places in 281 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:23] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:23] [INFO ] Deduced a trap composed of 164 places in 340 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:24] [INFO ] Deduced a trap composed of 165 places in 314 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:24] [INFO ] Deduced a trap composed of 164 places in 343 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:25] [INFO ] Deduced a trap composed of 166 places in 319 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:26] [INFO ] Deduced a trap composed of 163 places in 326 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:26] [INFO ] Deduced a trap composed of 164 places in 390 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:27] [INFO ] Deduced a trap composed of 163 places in 302 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:27] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/25 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 25 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 20/25 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:39] [INFO ] Deduced a trap composed of 164 places in 282 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:42] [INFO ] Deduced a trap composed of 165 places in 308 ms of which 58 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:45] [INFO ] Deduced a trap composed of 163 places in 298 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:47] [INFO ] Deduced a trap composed of 163 places in 293 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:47] [INFO ] Deduced a trap composed of 164 places in 263 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:47] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:48] [INFO ] Deduced a trap composed of 165 places in 301 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:49] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:49] [INFO ] Deduced a trap composed of 166 places in 272 ms of which 50 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:53:58] [INFO ] Deduced a trap composed of 165 places in 264 ms of which 48 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/1101 variables, and 35 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 0/658 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 442/454 places, 659/671 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61073 ms. Remains : 442/454 places, 659/671 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-11 finished in 61210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 454/454 places, 671/671 transitions.
Graph (trivial) has 460 edges and 454 vertex of which 69 / 454 are part of one of the 12 SCC in 2 ms
Free SCC test removed 57 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 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 272 rules applied. Total rules applied 273 place count 396 transition count 333
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 553 place count 124 transition count 325
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 559 place count 120 transition count 323
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 561 place count 118 transition count 323
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 561 place count 118 transition count 307
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 593 place count 102 transition count 307
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 597 place count 98 transition count 303
Iterating global reduction 4 with 4 rules applied. Total rules applied 601 place count 98 transition count 303
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 637 place count 80 transition count 285
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 653 place count 64 transition count 143
Iterating global reduction 4 with 16 rules applied. Total rules applied 669 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 677 place count 64 transition count 135
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 681 place count 60 transition count 127
Iterating global reduction 5 with 4 rules applied. Total rules applied 685 place count 60 transition count 127
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 688 place count 57 transition count 121
Iterating global reduction 5 with 3 rules applied. Total rules applied 691 place count 57 transition count 121
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -25
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 711 place count 47 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 721 place count 47 transition count 136
Applied a total of 721 rules in 52 ms. Remains 47 /454 variables (removed 407) and now considering 136/671 (removed 535) transitions.
[2025-06-05 16:53:59] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
// Phase 1: matrix 131 rows 47 cols
[2025-06-05 16:53:59] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:53:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-05 16:53:59] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2025-06-05 16:53:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:53:59] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 16:53:59] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:53:59] [INFO ] Redundant transitions in 4 ms returned []
Running 118 sub problems to find dead transitions.
[2025-06-05 16:53:59] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2025-06-05 16:53:59] [INFO ] Invariant cache hit.
[2025-06-05 16:53:59] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:00] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:00] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:00] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:00] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:00] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:00] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:00] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:00] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:01] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:01] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:01] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:01] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 130/177 variables, 47/61 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 31/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 1/178 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 93 constraints, problems are : Problem set: 0 solved, 118 unsolved in 7853 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 130/177 variables, 47/61 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 31/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 118/210 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:14] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:16] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 213 constraints, problems are : Problem set: 0 solved, 118 unsolved in 19810 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27716ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 27717ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/454 places, 136/671 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27973 ms. Remains : 47/454 places, 136/671 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-12
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-12 finished in 28055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)||X((p2 U (p3||G(p2))))))))'
Support contains 3 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 671/671 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 448 transition count 665
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 448 transition count 665
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 445 transition count 662
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 443 transition count 660
Applied a total of 22 rules in 47 ms. Remains 443 /454 variables (removed 11) and now considering 660/671 (removed 11) transitions.
// Phase 1: matrix 660 rows 443 cols
[2025-06-05 16:54:27] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:54:27] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-06-05 16:54:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:54:28] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
Running 659 sub problems to find dead transitions.
[2025-06-05 16:54:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:50] [INFO ] Deduced a trap composed of 162 places in 581 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:51] [INFO ] Deduced a trap composed of 163 places in 322 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:51] [INFO ] Deduced a trap composed of 164 places in 383 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:52] [INFO ] Deduced a trap composed of 164 places in 377 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:53] [INFO ] Deduced a trap composed of 164 places in 371 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:54] [INFO ] Deduced a trap composed of 163 places in 363 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:55] [INFO ] Deduced a trap composed of 163 places in 458 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:55] [INFO ] Deduced a trap composed of 164 places in 429 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:56] [INFO ] Deduced a trap composed of 165 places in 316 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:56] [INFO ] Deduced a trap composed of 164 places in 351 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:54:58] [INFO ] Deduced a trap composed of 163 places in 581 ms of which 152 ms to minimize.
SMT process timed out in 30306ms, After SMT, problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 30307ms
Starting structural reductions in LTL mode, iteration 1 : 443/454 places, 660/671 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31171 ms. Remains : 443/454 places, 660/671 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-13
Product exploration explored 100000 steps with 1365 reset in 262 ms.
Product exploration explored 100000 steps with 1365 reset in 344 ms.
Computed a total of 60 stabilizing places and 64 stable transitions
Computed a total of 60 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 142 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
RANDOM walk for 40000 steps (546 resets) in 478 ms. (83 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (110 resets) in 263 ms. (151 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (108 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (109 resets) in 269 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (111 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
[2025-06-05 16:55:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 214/217 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 226/443 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 660/1103 variables, 443/448 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 0/448 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1103 variables, 0/448 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1103 variables, and 448 constraints, problems are : Problem set: 1 solved, 3 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 215/217 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 226/443 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 660/1103 variables, 443/448 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 3/451 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:01] [INFO ] Deduced a trap composed of 163 places in 342 ms of which 22 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1103 variables, 1/452 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1103 variables, 0/452 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1103 variables, 0/452 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1103/1103 variables, and 452 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1662 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2210ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 332 steps, including 3 resets, run visited all 3 properties in 10 ms. (steps per millisecond=33 )
Parikh walk visited 3 properties in 20 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p1 (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 p2 p3))), (F (NOT p3))]
Knowledge based reduction with 12 factoid took 324 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 660/660 transitions.
Applied a total of 0 rules in 16 ms. Remains 443 /443 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2025-06-05 16:55:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:03] [INFO ] Implicit Places using invariants in 355 ms returned []
[2025-06-05 16:55:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:04] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
Running 659 sub problems to find dead transitions.
[2025-06-05 16:55:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:33] [INFO ] Deduced a trap composed of 162 places in 572 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:34] [INFO ] Deduced a trap composed of 163 places in 358 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:34] [INFO ] Deduced a trap composed of 164 places in 381 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:35] [INFO ] Deduced a trap composed of 164 places in 394 ms of which 62 ms to minimize.
SMT process timed out in 30652ms, After SMT, problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 30653ms
Finished structural reductions in LTL mode , in 1 iterations and 31870 ms. Remains : 443/443 places, 660/660 transitions.
Computed a total of 60 stabilizing places and 64 stable transitions
Computed a total of 60 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 148 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
RANDOM walk for 40000 steps (545 resets) in 185 ms. (215 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (110 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (107 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (111 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
[2025-06-05 16:55:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 215/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 226/443 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 660/1103 variables, 443/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1103 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1103 variables, and 448 constraints, problems are : Problem set: 0 solved, 3 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 215/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 226/443 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 660/1103 variables, 443/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 3/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:37] [INFO ] Deduced a trap composed of 163 places in 342 ms of which 22 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1103 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1103 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1103 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1103/1103 variables, and 452 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1454 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2179ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 806 steps, including 9 resets, run visited all 3 properties in 25 ms. (steps per millisecond=32 )
Parikh walk visited 3 properties in 25 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p2 p3))), (F (NOT p3))]
Knowledge based reduction with 10 factoid took 368 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Product exploration explored 100000 steps with 1364 reset in 123 ms.
Product exploration explored 100000 steps with 1365 reset in 171 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 443 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 443/443 places, 660/660 transitions.
Graph (trivial) has 448 edges and 443 vertex of which 61 / 443 are part of one of the 11 SCC in 2 ms
Free SCC test removed 50 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Performed 263 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 263 rules applied. Total rules applied 264 place count 393 transition count 603
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 270 place count 393 transition count 598
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 270 place count 393 transition count 603
Deduced a syphon composed of 274 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 280 place count 393 transition count 603
Discarding 222 places :
Symmetric choice reduction at 2 with 222 rule applications. Total rules 502 place count 171 transition count 381
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 222 rules applied. Total rules applied 724 place count 171 transition count 381
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 757 place count 171 transition count 381
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 802 place count 126 transition count 204
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 847 place count 126 transition count 204
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 856 place count 126 transition count 195
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 872 place count 110 transition count 176
Deduced a syphon composed of 46 places in 1 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 888 place count 110 transition count 176
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 891 place count 107 transition count 173
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 894 place count 107 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 895 place count 107 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 896 place count 106 transition count 172
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 897 place count 106 transition count 172
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 907 place count 106 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 908 place count 106 transition count 229
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 921 place count 93 transition count 203
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 4 with 13 rules applied. Total rules applied 934 place count 93 transition count 203
Deduced a syphon composed of 43 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 946 place count 93 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 947 place count 93 transition count 204
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 948 place count 92 transition count 202
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 949 place count 92 transition count 202
Deduced a syphon composed of 43 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 953 place count 92 transition count 198
Deduced a syphon composed of 43 places in 0 ms
Applied a total of 953 rules in 98 ms. Remains 92 /443 variables (removed 351) and now considering 198/660 (removed 462) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:55:40] [INFO ] Redundant transitions in 9 ms returned []
Running 194 sub problems to find dead transitions.
[2025-06-05 16:55:40] [INFO ] Flow matrix only has 193 transitions (discarded 5 similar events)
// Phase 1: matrix 193 rows 92 cols
[2025-06-05 16:55:40] [INFO ] Computed 2 invariants in 1 ms
[2025-06-05 16:55:40] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:42] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:42] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:42] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:42] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:42] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:42] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 6 ms to minimize.
Problem TDEAD108 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:43] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:43] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:43] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 11 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 9/11 constraints. Problems are: Problem set: 18 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:44] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/12 constraints. Problems are: Problem set: 18 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 18 solved, 176 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
At refinement iteration 5 (OVERLAPS) 192/284 variables, 92/104 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 35/139 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/139 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 1/285 variables, 1/140 constraints. Problems are: Problem set: 75 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:55:53] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 1/141 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/141 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/285 variables, 0/141 constraints. Problems are: Problem set: 75 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 141 constraints, problems are : Problem set: 75 solved, 119 unsolved in 26166 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 75 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 44/92 variables, 2/2 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 11/13 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 192/284 variables, 92/105 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 35/140 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 119/259 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/259 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 1/285 variables, 1/260 constraints. Problems are: Problem set: 75 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:56:21] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 1/261 constraints. Problems are: Problem set: 75 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:56:24] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 1/262 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 0/262 constraints. Problems are: Problem set: 75 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 262 constraints, problems are : Problem set: 75 solved, 119 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 119/194 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56231ms problems are : Problem set: 75 solved, 119 unsolved
Search for dead transitions found 75 dead transitions in 56233ms
Found 75 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 75 transitions
Dead transitions reduction (with SMT) removed 75 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 92/443 places, 123/660 transitions.
Graph (complete) has 256 edges and 92 vertex of which 49 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.0 ms
Discarding 43 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 49 /92 variables (removed 43) and now considering 123/123 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/443 places, 123/660 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56355 ms. Remains : 49/443 places, 123/660 transitions.
Built C files in :
/tmp/ltsmin4928975384941036831
[2025-06-05 16:56:36] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4928975384941036831
Running compilation step : cd /tmp/ltsmin4928975384941036831;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2029 ms.
Running link step : cd /tmp/ltsmin4928975384941036831;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin4928975384941036831;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6883531850322920884.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 660/660 transitions.
Applied a total of 0 rules in 14 ms. Remains 443 /443 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 443 cols
[2025-06-05 16:56:51] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:56:51] [INFO ] Implicit Places using invariants in 334 ms returned []
[2025-06-05 16:56:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:56:52] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
Running 659 sub problems to find dead transitions.
[2025-06-05 16:56:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1103 variables, and 5 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/443 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:57:43] [INFO ] Deduced a trap composed of 162 places in 569 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:57:44] [INFO ] Deduced a trap composed of 163 places in 317 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:57:44] [INFO ] Deduced a trap composed of 164 places in 390 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:57:45] [INFO ] Deduced a trap composed of 164 places in 374 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:57:46] [INFO ] Deduced a trap composed of 164 places in 382 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:57:47] [INFO ] Deduced a trap composed of 163 places in 457 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:57:48] [INFO ] Deduced a trap composed of 162 places in 434 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:57:48] [INFO ] Deduced a trap composed of 163 places in 300 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:57:49] [INFO ] Deduced a trap composed of 164 places in 429 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:57:50] [INFO ] Deduced a trap composed of 165 places in 367 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:57:50] [INFO ] Deduced a trap composed of 165 places in 422 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:57:51] [INFO ] Deduced a trap composed of 164 places in 440 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:57:52] [INFO ] Deduced a trap composed of 164 places in 337 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:57:52] [INFO ] Deduced a trap composed of 165 places in 507 ms of which 128 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/1103 variables, and 19 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/443 constraints, PredecessorRefiner: 0/659 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60356ms problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 60358ms
Finished structural reductions in LTL mode , in 1 iterations and 61549 ms. Remains : 443/443 places, 660/660 transitions.
Built C files in :
/tmp/ltsmin11702212351526862266
[2025-06-05 16:57:52] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11702212351526862266
Running compilation step : cd /tmp/ltsmin11702212351526862266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1969 ms.
Running link step : cd /tmp/ltsmin11702212351526862266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11702212351526862266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11092967313810212740.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 16:58:08] [INFO ] Flatten gal took : 44 ms
[2025-06-05 16:58:08] [INFO ] Flatten gal took : 43 ms
[2025-06-05 16:58:08] [INFO ] Time to serialize gal into /tmp/LTL9897733794877501587.gal : 11 ms
[2025-06-05 16:58:08] [INFO ] Time to serialize properties into /tmp/LTL9091029411300203029.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9897733794877501587.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13397283212324183371.hoa' '-atoms' '/tmp/LTL9091029411300203029.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9091029411300203029.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13397283212324183371.hoa
Detected timeout of ITS tools.
[2025-06-05 16:58:23] [INFO ] Flatten gal took : 65 ms
[2025-06-05 16:58:23] [INFO ] Flatten gal took : 58 ms
[2025-06-05 16:58:23] [INFO ] Time to serialize gal into /tmp/LTL9148648516736629862.gal : 14 ms
[2025-06-05 16:58:23] [INFO ] Time to serialize properties into /tmp/LTL10878690116846916184.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9148648516736629862.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10878690116846916184.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((("(p210==0)")||(F("(p283==0)")))||(X(("(p210!=1)")U(("((p305!=1)&&(p210!=1))")||(G("(p210!=1)")))))))))
Formula 0 simplified : XF(!"(p210==0)" & G!"(p283==0)" & X(!"(p210!=1)" M !"((p305!=1)&&(p210!=1))"))
Detected timeout of ITS tools.
[2025-06-05 16:58:38] [INFO ] Flatten gal took : 28 ms
[2025-06-05 16:58:38] [INFO ] Applying decomposition
[2025-06-05 16:58:38] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8983520205849353022.txt' '-o' '/tmp/graph8983520205849353022.bin' '-w' '/tmp/graph8983520205849353022.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8983520205849353022.bin' '-l' '-1' '-v' '-w' '/tmp/graph8983520205849353022.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:58:38] [INFO ] Decomposing Gal with order
[2025-06-05 16:58:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:58:39] [INFO ] Removed a total of 793 redundant transitions.
[2025-06-05 16:58:39] [INFO ] Flatten gal took : 187 ms
[2025-06-05 16:58:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 27 ms.
[2025-06-05 16:58:39] [INFO ] Time to serialize gal into /tmp/LTL10730847176824331626.gal : 19 ms
[2025-06-05 16:58:39] [INFO ] Time to serialize properties into /tmp/LTL12760492521667862736.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10730847176824331626.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12760492521667862736.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G((("(i11.u69.p210==0)")||(F("(i19.u93.p283==0)")))||(X(("(i11.u69.p210!=1)")U(("((i15.u99.p305!=1)&&(i11.u69.p210!=1))")||(G("(i...180
Formula 0 simplified : XF(!"(i11.u69.p210==0)" & G!"(i19.u93.p283==0)" & X(!"(i11.u69.p210!=1)" M !"((i15.u99.p305!=1)&&(i11.u69.p210!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t59, t111, t145, t147, t164, t247, t249, t266, t345, t347, t363, t408, t442, t444, t465, t467...469
Computing Next relation with stutter on 11256 deadlock states
Detected timeout of ITS tools.
Treatment of property StigmergyElection-PT-04b-LTLFireability-13 finished in 266876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)||X((p2 U (p3||G(p2))))))))'
Found a Lengthening insensitive property : StigmergyElection-PT-04b-LTLFireability-13
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 454 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 454/454 places, 671/671 transitions.
Graph (trivial) has 459 edges and 454 vertex of which 62 / 454 are part of one of the 11 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 273 rules applied. Total rules applied 274 place count 402 transition count 339
Reduce places removed 273 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 284 rules applied. Total rules applied 558 place count 129 transition count 328
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 565 place count 123 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 566 place count 122 transition count 327
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 566 place count 122 transition count 310
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 600 place count 105 transition count 310
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 604 place count 101 transition count 306
Iterating global reduction 4 with 4 rules applied. Total rules applied 608 place count 101 transition count 306
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 644 place count 83 transition count 288
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 659 place count 68 transition count 148
Iterating global reduction 4 with 15 rules applied. Total rules applied 674 place count 68 transition count 148
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 682 place count 68 transition count 140
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 685 place count 65 transition count 134
Iterating global reduction 5 with 3 rules applied. Total rules applied 688 place count 65 transition count 134
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 691 place count 62 transition count 128
Iterating global reduction 5 with 3 rules applied. Total rules applied 694 place count 62 transition count 128
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 718 place count 50 transition count 150
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 719 place count 49 transition count 140
Iterating global reduction 5 with 1 rules applied. Total rules applied 720 place count 49 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 721 place count 49 transition count 139
Applied a total of 721 rules in 33 ms. Remains 49 /454 variables (removed 405) and now considering 139/671 (removed 532) transitions.
[2025-06-05 16:58:54] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
// Phase 1: matrix 134 rows 49 cols
[2025-06-05 16:58:54] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:58:54] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-05 16:58:54] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2025-06-05 16:58:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:58:54] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 16:58:55] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2025-06-05 16:58:55] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2025-06-05 16:58:55] [INFO ] Invariant cache hit.
[2025-06-05 16:58:55] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:58:56] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:58:56] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:58:56] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:58:56] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:58:57] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:58:57] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 133/182 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:58:59] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:58:59] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:00] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 92 constraints, problems are : Problem set: 0 solved, 122 unsolved in 13114 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 133/182 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 122/213 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:22] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 6 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/183 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:27] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/183 variables, and 216 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43179ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 43180ms
Starting structural reductions in LI_LTL mode, iteration 1 : 49/454 places, 139/671 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 43597 ms. Remains : 49/454 places, 139/671 transitions.
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-13
Product exploration explored 100000 steps with 32 reset in 182 ms.
Product exploration explored 100000 steps with 101 reset in 212 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 161 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
RANDOM walk for 40000 steps (5171 resets) in 812 ms. (49 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (585 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (582 resets) in 22 ms. (1739 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (586 resets) in 29 ms. (1333 steps per ms) remains 1/3 properties
[2025-06-05 16:59:39] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2025-06-05 16:59:39] [INFO ] Invariant cache hit.
[2025-06-05 16:59:39] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 179/183 variables, and 48 constraints, problems are : Problem set: 1 solved, 0 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 47/49 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p1 (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 p2 p3))), (F (NOT p3))]
Knowledge based reduction with 12 factoid took 297 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 139/139 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2025-06-05 16:59:40] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2025-06-05 16:59:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:59:40] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-05 16:59:40] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2025-06-05 16:59:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:59:40] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 16:59:40] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2025-06-05 16:59:40] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2025-06-05 16:59:40] [INFO ] Invariant cache hit.
[2025-06-05 16:59:40] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:41] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:41] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:41] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:42] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:42] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:42] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 133/182 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:44] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:44] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:44] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 92 constraints, problems are : Problem set: 0 solved, 122 unsolved in 11428 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 133/182 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 122/213 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:00:06] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/183 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:00:11] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/183 variables, and 216 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41506ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 41506ms
Finished structural reductions in LTL mode , in 1 iterations and 41788 ms. Remains : 49/49 places, 139/139 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 135 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
RANDOM walk for 40000 steps (5226 resets) in 166 ms. (239 steps per ms) remains 2/6 properties
BEST_FIRST walk for 32958 steps (473 resets) in 27 ms. (1177 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p2 p3))), (F (NOT p3))]
Knowledge based reduction with 10 factoid took 362 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Product exploration explored 100000 steps with 152 reset in 113 ms.
Product exploration explored 100000 steps with 159 reset in 437 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 139/139 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 49 transition count 135
Applied a total of 4 rules in 6 ms. Remains 49 /49 variables (removed 0) and now considering 135/139 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:00:24] [INFO ] Redundant transitions in 2 ms returned []
Running 118 sub problems to find dead transitions.
[2025-06-05 17:00:24] [INFO ] Flow matrix only has 130 transitions (discarded 5 similar events)
// Phase 1: matrix 130 rows 49 cols
[2025-06-05 17:00:24] [INFO ] Computed 2 invariants in 1 ms
[2025-06-05 17:00:24] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:00:25] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:00:25] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:00:25] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:00:25] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:00:25] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:00:25] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:00:26] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 129/178 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 31/89 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 1/179 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:00:33] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/179 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (OVERLAPS) 0/179 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 91 constraints, problems are : Problem set: 0 solved, 118 unsolved in 13570 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: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 8/10 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 129/178 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 31/90 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 118/208 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 1/179 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:00:46] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:00:48] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:00:48] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (OVERLAPS) 0/179 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 212 constraints, problems are : Problem set: 0 solved, 118 unsolved in 22927 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: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36540ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 36540ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/49 places, 135/139 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36566 ms. Remains : 49/49 places, 135/139 transitions.
Built C files in :
/tmp/ltsmin8716375727700198183
[2025-06-05 17:01:00] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8716375727700198183
Running compilation step : cd /tmp/ltsmin8716375727700198183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 542 ms.
Running link step : cd /tmp/ltsmin8716375727700198183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin8716375727700198183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1594742256697443847.hoa' '--buchi-type=spotba'
LTSmin run took 481 ms.
Treatment of property StigmergyElection-PT-04b-LTLFireability-13 finished in 127589 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-06-05 17:01:01] [INFO ] Flatten gal took : 38 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 997196 ms.

BK_STOP 1749142862037

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903490900204"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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