Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490900172.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-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490900172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 26K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K 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 71K 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-02b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749135259998

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-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 14:54:22] [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 14:54:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 14:54:22] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2025-06-05 14:54:22] [INFO ] Transformed 291 places.
[2025-06-05 14:54:22] [INFO ] Transformed 332 transitions.
[2025-06-05 14:54:22] [INFO ] Found NUPN structural information;
[2025-06-05 14:54:22] [INFO ] Parsed PT model containing 291 places and 332 transitions and 734 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyElection-PT-02b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 332/332 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 262 transition count 303
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 262 transition count 303
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 70 place count 250 transition count 291
Iterating global reduction 0 with 12 rules applied. Total rules applied 82 place count 250 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 248 transition count 289
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 248 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 247 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 247 transition count 288
Applied a total of 88 rules in 123 ms. Remains 247 /291 variables (removed 44) and now considering 288/332 (removed 44) transitions.
// Phase 1: matrix 288 rows 247 cols
[2025-06-05 14:54:23] [INFO ] Computed 3 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:54:23] [INFO ] Implicit Places using invariants in 428 ms returned []
[2025-06-05 14:54:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:54:24] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2025-06-05 14:54:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:54:31] [INFO ] Deduced a trap composed of 171 places in 233 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:54:32] [INFO ] Deduced a trap composed of 171 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 14:54:32] [INFO ] Deduced a trap composed of 97 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:54:32] [INFO ] Deduced a trap composed of 99 places in 213 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:54:32] [INFO ] Deduced a trap composed of 171 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:54:33] [INFO ] Deduced a trap composed of 171 places in 216 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:54:35] [INFO ] Deduced a trap composed of 171 places in 231 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:54:35] [INFO ] Deduced a trap composed of 171 places in 177 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/535 variables, 247/258 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 258 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/535 variables, 247/258 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 287/545 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:55:07] [INFO ] Deduced a trap composed of 202 places in 175 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 546 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in LTL mode, iteration 1 : 247/291 places, 288/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61345 ms. Remains : 247/291 places, 288/332 transitions.
Support contains 37 out of 247 places after structural reductions.
[2025-06-05 14:55:24] [INFO ] Flatten gal took : 94 ms
[2025-06-05 14:55:24] [INFO ] Flatten gal took : 40 ms
[2025-06-05 14:55:24] [INFO ] Input system was already deterministic with 288 transitions.
Support contains 36 out of 247 places (down from 37) after GAL structural reductions.
RANDOM walk for 40000 steps (490 resets) in 1773 ms. (22 steps per ms) remains 4/32 properties
BEST_FIRST walk for 40000 steps (220 resets) in 317 ms. (125 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (220 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (149 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (258 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
[2025-06-05 14:55:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 228/232 variables, 2/2 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 14:55:26] [INFO ] Deduced a trap composed of 171 places in 182 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:55:26] [INFO ] Deduced a trap composed of 171 places in 157 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 15/247 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 288/535 variables, 247/252 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 14:55:26] [INFO ] Deduced a trap composed of 171 places in 220 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/535 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 253 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 228/232 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 3/5 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 14:55:27] [INFO ] Deduced a trap composed of 171 places in 158 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/247 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 288/535 variables, 247/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 257 constraints, problems are : Problem set: 0 solved, 3 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2171ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 66 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 3 properties in 122 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 32 stabilizing places and 34 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)&&X(F(p1))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 288/288 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 235 transition count 276
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 235 transition count 276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 229 transition count 270
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 228 transition count 269
Applied a total of 38 rules in 55 ms. Remains 228 /247 variables (removed 19) and now considering 269/288 (removed 19) transitions.
// Phase 1: matrix 269 rows 228 cols
[2025-06-05 14:55:28] [INFO ] Computed 3 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:55:28] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-05 14:55:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:55:29] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2025-06-05 14:55: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/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:55:36] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:55:37] [INFO ] Deduced a trap composed of 163 places in 225 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:55:37] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:55:38] [INFO ] Deduced a trap composed of 163 places in 225 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:55:38] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
(t43 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 1.0)
(t17 1.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 1.0)
(t31 1.0)
(t32 1.0)
(t33 1.0)
(t34 1.0)
(t35 1.0)
(t36 1.0)
(t37 1.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:56:04] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 269/497 variables, 228/237 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 268/505 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:56:16] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:56:16] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 507 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 228/247 places, 269/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60687 ms. Remains : 228/247 places, 269/288 transitions.
Stuttering acceptance computed with spot in 438 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-00
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-00 finished in 61248 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(F(p0)))'
Support contains 1 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 288/288 transitions.
Graph (trivial) has 250 edges and 247 vertex of which 38 / 247 are part of one of the 6 SCC in 5 ms
Free SCC test removed 32 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 150 place count 214 transition count 102
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 152 rules applied. Total rules applied 302 place count 65 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 303 place count 64 transition count 99
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 303 place count 64 transition count 92
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 317 place count 57 transition count 92
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 322 place count 52 transition count 87
Iterating global reduction 3 with 5 rules applied. Total rules applied 327 place count 52 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 328 place count 51 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 329 place count 51 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 330 place count 51 transition count 83
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 350 place count 41 transition count 73
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 357 place count 34 transition count 60
Iterating global reduction 4 with 7 rules applied. Total rules applied 364 place count 34 transition count 60
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 367 place count 34 transition count 57
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 368 place count 33 transition count 55
Iterating global reduction 5 with 1 rules applied. Total rules applied 369 place count 33 transition count 55
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 370 place count 32 transition count 53
Iterating global reduction 5 with 1 rules applied. Total rules applied 371 place count 32 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 383 place count 26 transition count 53
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 384 place count 25 transition count 48
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 25 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 386 place count 25 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 389 place count 25 transition count 44
Applied a total of 389 rules in 88 ms. Remains 25 /247 variables (removed 222) and now considering 44/288 (removed 244) transitions.
[2025-06-05 14:56:29] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
// Phase 1: matrix 41 rows 25 cols
[2025-06-05 14:56:29] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:56:30] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-05 14:56:30] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2025-06-05 14:56:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:56:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-05 14:56:30] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 14:56:30] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2025-06-05 14:56:30] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2025-06-05 14:56:30] [INFO ] Invariant cache hit.
[2025-06-05 14:56:30] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:56:30] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/65 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 33 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1577 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/65 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 39/71 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:56:32] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 1/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/66 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 73 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2350 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3948ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 3949ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/247 places, 44/288 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4206 ms. Remains : 25/247 places, 44/288 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-01
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-01 finished in 4329 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) U p1) U p2) U (p3||X((X(!p0) U (p3&&X(!p0)))))))'
Support contains 5 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 288/288 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 237 transition count 278
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 237 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 231 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 230 transition count 271
Applied a total of 34 rules in 33 ms. Remains 230 /247 variables (removed 17) and now considering 271/288 (removed 17) transitions.
// Phase 1: matrix 271 rows 230 cols
[2025-06-05 14:56:34] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:56:34] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-05 14:56:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:56:34] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2025-06-05 14:56:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:56:41] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:56:41] [INFO ] Deduced a trap composed of 96 places in 176 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:56:41] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:56:42] [INFO ] Deduced a trap composed of 163 places in 196 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:56:44] [INFO ] Deduced a trap composed of 163 places in 237 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:56:44] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:56:44] [INFO ] Deduced a trap composed of 163 places in 156 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 1.0)
(t18 1.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 1.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 2.0)
(t32 1.0)
(t33 1.0)
(t34 1.0)
(t35 1.0)
(t36 1.0)
(t37 1.0)
(t38 1.0)
(t39 1.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 1.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 1.0)
(t71 1.0)
(t72 1.0)
(t73 1.0)
(t74 1.0)
(t75 1.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/501 variables, and 240 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/510 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:57:14] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 34 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:57:23] [INFO ] Deduced a trap composed of 188 places in 196 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 512 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 230/247 places, 271/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60607 ms. Remains : 230/247 places, 271/288 transitions.
Stuttering acceptance computed with spot in 729 ms :[(NOT p3), (OR (NOT p3) p0), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1))), (AND p0 (NOT p2)), p0, true, false, (AND (NOT p1) p0), (AND p0 (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-02
Product exploration explored 100000 steps with 19 reset in 411 ms.
Entered a terminal (fully accepting) state of product in 71 steps with 2 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-02 finished in 61803 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(F((p0||G(p1)))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 288/288 transitions.
Graph (trivial) has 246 edges and 247 vertex of which 20 / 247 are part of one of the 4 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 159 place count 230 transition count 111
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 163 rules applied. Total rules applied 322 place count 72 transition count 106
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 325 place count 70 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 326 place count 69 transition count 105
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 326 place count 69 transition count 96
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 344 place count 60 transition count 96
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 350 place count 54 transition count 90
Iterating global reduction 4 with 6 rules applied. Total rules applied 356 place count 54 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 358 place count 54 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 359 place count 53 transition count 88
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 360 place count 52 transition count 85
Iterating global reduction 6 with 1 rules applied. Total rules applied 361 place count 52 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 362 place count 52 transition count 84
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 380 place count 43 transition count 75
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 385 place count 38 transition count 66
Iterating global reduction 7 with 5 rules applied. Total rules applied 390 place count 38 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 393 place count 38 transition count 63
Performed 9 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 411 place count 29 transition count 62
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 412 place count 28 transition count 54
Iterating global reduction 8 with 1 rules applied. Total rules applied 413 place count 28 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 414 place count 28 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 416 place count 28 transition count 51
Applied a total of 416 rules in 45 ms. Remains 28 /247 variables (removed 219) and now considering 51/288 (removed 237) transitions.
[2025-06-05 14:57:36] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
// Phase 1: matrix 48 rows 28 cols
[2025-06-05 14:57:36] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:57:36] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-05 14:57:36] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2025-06-05 14:57:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:57:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-05 14:57:36] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 14:57:36] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2025-06-05 14:57:36] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2025-06-05 14:57:36] [INFO ] Invariant cache hit.
[2025-06-05 14:57:36] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:57:36] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:57:36] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:57:36] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 47/75 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:57:37] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/76 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/76 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 39 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2570 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 47/75 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 46/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/76 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:57:40] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 0/76 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 86 constraints, problems are : Problem set: 0 solved, 46 unsolved in 3183 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5774ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 5774ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/247 places, 51/288 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5977 ms. Remains : 28/247 places, 51/288 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-03 finished in 6111 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||X(F(p1)))))&&F((X(p2)&&F(p3)))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 288/288 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 237 transition count 278
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 237 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 231 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 230 transition count 271
Applied a total of 34 rules in 23 ms. Remains 230 /247 variables (removed 17) and now considering 271/288 (removed 17) transitions.
// Phase 1: matrix 271 rows 230 cols
[2025-06-05 14:57:42] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:57:42] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-05 14:57:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:57:42] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2025-06-05 14:57:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:57:50] [INFO ] Deduced a trap composed of 163 places in 215 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:57:50] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:57:51] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:57:52] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:57:52] [INFO ] Deduced a trap composed of 163 places in 176 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/501 variables, and 238 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:58:22] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 36 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:58:34] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:58:38] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 2/511 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 511 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 230/247 places, 271/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60607 ms. Remains : 230/247 places, 271/288 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p3) (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-04
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-04 finished in 60988 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((G((F(!p0)||X(p1))) U X((p2||X(X(p3)))))))'
Support contains 5 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 288/288 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 235 transition count 276
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 235 transition count 276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 229 transition count 270
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 228 transition count 269
Applied a total of 38 rules in 21 ms. Remains 228 /247 variables (removed 19) and now considering 269/288 (removed 19) transitions.
// Phase 1: matrix 269 rows 228 cols
[2025-06-05 14:58:43] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:58:43] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-05 14:58:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:58:43] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2025-06-05 14:58:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:58:51] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:58:51] [INFO ] Deduced a trap composed of 163 places in 209 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:58:52] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:58:52] [INFO ] Deduced a trap composed of 163 places in 212 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:58:53] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 1.0)
(t17 1.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 1.0)
(t31 1.0)
(t32 1.0)
(t33 1.0)
(t34 1.0)
(t35 1.0)
(t36 1.0)
(t37 1.0)
(t38 1.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:59:18] [INFO ] Deduced a trap composed of 164 places in 126 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 269/497 variables, 228/237 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 268/505 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:59:28] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:59:28] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 507 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 228/247 places, 269/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60613 ms. Remains : 228/247 places, 269/288 transitions.
Stuttering acceptance computed with spot in 792 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), false, (AND p0 p1 (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (AND p0 p1 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-05
Product exploration explored 100000 steps with 42 reset in 216 ms.
Product exploration explored 100000 steps with 305 reset in 251 ms.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 277 ms. Reduced automaton from 13 states, 22 edges and 4 AP (stutter sensitive) to 13 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 563 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), false, (AND p0 p1 (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (AND p0 p1 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
RANDOM walk for 40000 steps (242 resets) in 847 ms. (47 steps per ms) remains 3/12 properties
BEST_FIRST walk for 4633 steps (5 resets) in 42 ms. (107 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) p2))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p1 p3))), (F p3), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT p1)), (F (NOT (OR (NOT p0) p3)))]
Knowledge based reduction with 11 factoid took 818 ms. Reduced automaton from 13 states, 22 edges and 4 AP (stutter sensitive) to 13 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 772 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), false, (AND p0 p1 (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (AND p0 p1 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 756 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), false, (AND p0 p1 (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (AND p0 p1 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
[2025-06-05 14:59:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 14:59:48] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-05 14:59:49] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2025-06-05 14:59:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 14:59:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-05 14:59:50] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2025-06-05 14:59:50] [INFO ] Computed and/alt/rep : 266/370/266 causal constraints (skipped 2 transitions) in 22 ms.
[2025-06-05 14:59:52] [INFO ] Added : 233 causal constraints over 47 iterations in 2089 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Applied a total of 0 rules in 5 ms. Remains 228 /228 variables (removed 0) and now considering 269/269 (removed 0) transitions.
[2025-06-05 14:59:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:59:52] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-05 14:59:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:59:52] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2025-06-05 14:59: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/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:00:00] [INFO ] Deduced a trap composed of 162 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:00:00] [INFO ] Deduced a trap composed of 163 places in 150 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:00:01] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:00:01] [INFO ] Deduced a trap composed of 163 places in 131 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:00:01] [INFO ] Deduced a trap composed of 162 places in 109 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 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 1.0)
(s72 0.0)
(s73 0.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 1.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 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:00:27] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 269/497 variables, 228/237 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 268/505 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:00:39] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:00:39] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 507 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in LTL mode , in 1 iterations and 60585 ms. Remains : 228/228 places, 269/269 transitions.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 268 ms. Reduced automaton from 13 states, 22 edges and 4 AP (stutter sensitive) to 13 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 778 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), false, (AND p0 p1 (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (AND p0 p1 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
RANDOM walk for 40000 steps (388 resets) in 229 ms. (173 steps per ms) remains 3/12 properties
BEST_FIRST walk for 3321 steps (15 resets) in 13 ms. (237 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F p2), (F p0), (F (NOT (OR (NOT p0) p1))), (F p3), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT p1)), (F (NOT (OR (NOT p0) p3)))]
Knowledge based reduction with 11 factoid took 809 ms. Reduced automaton from 13 states, 22 edges and 4 AP (stutter sensitive) to 13 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 778 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), false, (AND p0 p1 (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (AND p0 p1 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 758 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), false, (AND p0 p1 (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (AND p0 p1 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
[2025-06-05 15:00:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 15:00:56] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-05 15:00:57] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2025-06-05 15:00:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 15:00:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-05 15:00:57] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2025-06-05 15:00:57] [INFO ] Computed and/alt/rep : 266/370/266 causal constraints (skipped 2 transitions) in 24 ms.
[2025-06-05 15:01:00] [INFO ] Added : 233 causal constraints over 47 iterations in 2229 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 613 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), false, (AND p0 p1 (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (AND p0 p1 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 129 reset in 71 ms.
Product exploration explored 100000 steps with 109 reset in 217 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 541 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), false, (AND p0 p1 (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (AND p0 p1 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Graph (trivial) has 217 edges and 228 vertex of which 31 / 228 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 136 rules applied. Total rules applied 137 place count 202 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 139 place count 202 transition count 237
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 139 place count 202 transition count 239
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 143 place count 202 transition count 239
Discarding 113 places :
Symmetric choice reduction at 2 with 113 rule applications. Total rules 256 place count 89 transition count 126
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 113 rules applied. Total rules applied 369 place count 89 transition count 126
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 42 places in 1 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 384 place count 89 transition count 126
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 406 place count 67 transition count 93
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 428 place count 67 transition count 93
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 433 place count 67 transition count 88
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 442 place count 58 transition count 77
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 451 place count 58 transition count 77
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 453 place count 56 transition count 75
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 455 place count 56 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 461 place count 56 transition count 92
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 467 place count 50 transition count 80
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 473 place count 50 transition count 80
Deduced a syphon composed of 22 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 477 place count 50 transition count 76
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 477 rules in 68 ms. Remains 50 /228 variables (removed 178) and now considering 76/269 (removed 193) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:01:02] [INFO ] Redundant transitions in 2 ms returned []
Running 72 sub problems to find dead transitions.
[2025-06-05 15:01:02] [INFO ] Flow matrix only has 74 transitions (discarded 2 similar events)
// Phase 1: matrix 74 rows 50 cols
[2025-06-05 15:01:02] [INFO ] Computed 3 invariants in 1 ms
[2025-06-05 15:01:02] [INFO ] State equation strengthened by 4 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, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:01:02] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:01:02] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:01:02] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 3 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:01:02] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 3 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 4/7 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 73/123 variables, 50/57 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 3/60 constraints. Problems are: Problem set: 29 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:01:03] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 1/61 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/61 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/62 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/62 constraints. Problems are: Problem set: 29 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 62 constraints, problems are : Problem set: 29 solved, 43 unsolved in 2361 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 50/50 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 29 solved, 43 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 23/50 variables, 3/3 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 5/8 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 73/123 variables, 50/58 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 3/61 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 43/104 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/104 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/105 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/105 constraints. Problems are: Problem set: 29 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/105 constraints. Problems are: Problem set: 29 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 105 constraints, problems are : Problem set: 29 solved, 43 unsolved in 3009 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 50/50 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 43/72 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5385ms problems are : Problem set: 29 solved, 43 unsolved
Search for dead transitions found 29 dead transitions in 5386ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 50/228 places, 47/269 transitions.
Graph (complete) has 83 edges and 50 vertex of which 28 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 28 /50 variables (removed 22) and now considering 47/47 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/228 places, 47/269 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5470 ms. Remains : 28/228 places, 47/269 transitions.
Built C files in :
/tmp/ltsmin11372423338842266295
[2025-06-05 15:01:07] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11372423338842266295
Running compilation step : cd /tmp/ltsmin11372423338842266295;'/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 1180 ms.
Running link step : cd /tmp/ltsmin11372423338842266295;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin11372423338842266295;'/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/stateBased3637587652825264519.hoa' '--buchi-type=spotba'
LTSmin run took 257 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-02b-LTLFireability-05 finished in 145916 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((G(p0) U (G((X(p1) U p2))||F(G(X(X(p1))))))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 288/288 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 235 transition count 276
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 235 transition count 276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 229 transition count 270
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 228 transition count 269
Applied a total of 38 rules in 30 ms. Remains 228 /247 variables (removed 19) and now considering 269/288 (removed 19) transitions.
// Phase 1: matrix 269 rows 228 cols
[2025-06-05 15:01:09] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:01:09] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-05 15:01:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:01:09] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2025-06-05 15:01:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:01:17] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:01:17] [INFO ] Deduced a trap composed of 163 places in 220 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:01:17] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:01:18] [INFO ] Deduced a trap composed of 163 places in 240 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:01:18] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:01:44] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 269/497 variables, 228/237 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 268/505 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:01:56] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:01:56] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 507 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 228/247 places, 269/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60596 ms. Remains : 228/247 places, 269/288 transitions.
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-07
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-07 finished in 60957 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((p0||X(p1))) U ((X((p0||X(p1)))&&G(p2))||X(G((p0||X(p1))))))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 288/288 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 237 transition count 278
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 237 transition count 278
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 232 transition count 273
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 232 transition count 273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 231 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 231 transition count 272
Applied a total of 32 rules in 31 ms. Remains 231 /247 variables (removed 16) and now considering 272/288 (removed 16) transitions.
// Phase 1: matrix 272 rows 231 cols
[2025-06-05 15:02:10] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:02:10] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-05 15:02:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:02:10] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2025-06-05 15:02:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:02:18] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:02:18] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:02:19] [INFO ] Deduced a trap composed of 167 places in 193 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:02:19] [INFO ] Deduced a trap composed of 163 places in 174 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:02:20] [INFO ] Deduced a trap composed of 165 places in 177 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/503 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 1.0)
(t17 1.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 1.0)
(t31 1.0)
(t32 1.0)
(t33 1.0)
(t34 1.0)
(t35 1.0)
(t36 1.0)
(t37 1.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 1.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 1.0)
(t69 1.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 1.0)
(t127 0.0)
(t128 1.0)
(t129 0.0)
(t130 0.0)
(t131 1.0)
(t132 1.0)
(t133 1.0)
(t134 1.0)
(t135 1.0)
(t136 1.0)
(t137 1.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 1.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 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 503/503 variables, and 239 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/503 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 271/510 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:02:58] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:03:09] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 512 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 231/247 places, 272/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60644 ms. Remains : 231/247 places, 272/288 transitions.
Stuttering acceptance computed with spot in 586 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-08
Product exploration explored 100000 steps with 42 reset in 205 ms.
Product exploration explored 100000 steps with 90 reset in 241 ms.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 174 ms. Reduced automaton from 11 states, 39 edges and 3 AP (stutter sensitive) to 11 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 574 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (267 resets) in 347 ms. (114 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40002 steps (207 resets) in 203 ms. (196 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (151 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (209 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (128 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
[2025-06-05 15:03:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf5 is UNSAT
Problem apf9 is UNSAT
Problem apf11 is UNSAT
After SMT solving in domain Real declared 111/503 variables, and 1 constraints, problems are : Problem set: 3 solved, 0 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 0/231 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (G (OR (NOT p0) p2)), (G (OR p2 p1)), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT p1)), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (NOT p2) p1))), (F p0)]
Knowledge based reduction with 11 factoid took 926 ms. Reduced automaton from 11 states, 38 edges and 3 AP (stutter sensitive) to 10 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 549 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 534 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 272/272 transitions.
Applied a total of 0 rules in 5 ms. Remains 231 /231 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2025-06-05 15:03:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:03:15] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-05 15:03:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:03:15] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2025-06-05 15:03:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:03:22] [INFO ] Deduced a trap composed of 162 places in 164 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:03:23] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:03:23] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:03:24] [INFO ] Deduced a trap composed of 163 places in 183 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:03:24] [INFO ] Deduced a trap composed of 165 places in 189 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/503 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/503 variables, and 239 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/503 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 271/510 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:03] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:13] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 512 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Finished structural reductions in LTL mode , in 1 iterations and 60578 ms. Remains : 231/231 places, 272/272 transitions.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 10 states, 27 edges and 3 AP (stutter sensitive) to 10 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 495 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
RANDOM walk for 31390 steps (293 resets) in 97 ms. (320 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p1)), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p2 (NOT p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 491 ms. Reduced automaton from 10 states, 27 edges and 3 AP (stutter sensitive) to 10 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 542 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 551 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 537 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 36 reset in 172 ms.
Product exploration explored 100000 steps with 88 reset in 174 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 539 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 272/272 transitions.
Graph (trivial) has 230 edges and 231 vertex of which 34 / 231 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 203 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 138 place count 203 transition count 238
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 138 place count 203 transition count 240
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 203 transition count 240
Discarding 113 places :
Symmetric choice reduction at 2 with 113 rule applications. Total rules 255 place count 90 transition count 127
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 113 rules applied. Total rules applied 368 place count 90 transition count 127
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 385 place count 90 transition count 127
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 409 place count 66 transition count 92
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 433 place count 66 transition count 92
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 438 place count 66 transition count 87
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 446 place count 58 transition count 78
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 454 place count 58 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 455 place count 57 transition count 77
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 456 place count 57 transition count 77
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 462 place count 57 transition count 94
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 467 place count 52 transition count 84
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 472 place count 52 transition count 84
Deduced a syphon composed of 23 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 478 place count 52 transition count 78
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 478 rules in 45 ms. Remains 52 /231 variables (removed 179) and now considering 78/272 (removed 194) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:04:19] [INFO ] Redundant transitions in 3 ms returned []
Running 76 sub problems to find dead transitions.
[2025-06-05 15:04:19] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 52 cols
[2025-06-05 15:04:19] [INFO ] Computed 2 invariants in 2 ms
[2025-06-05 15:04:19] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:20] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 6 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:20] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:20] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 4 ms to minimize.
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:20] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 4 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 4/6 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 70 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
At refinement iteration 4 (OVERLAPS) 74/126 variables, 52/58 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 6/64 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/64 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 1/127 variables, 1/65 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/65 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/65 constraints. Problems are: Problem set: 31 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 65 constraints, problems are : Problem set: 31 solved, 45 unsolved in 3957 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 45 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 24/52 variables, 2/2 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 4/6 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 74/126 variables, 52/58 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 6/64 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 45/109 constraints. Problems are: Problem set: 31 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:24] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/110 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/110 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/111 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/111 constraints. Problems are: Problem set: 31 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/111 constraints. Problems are: Problem set: 31 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 111 constraints, problems are : Problem set: 31 solved, 45 unsolved in 4535 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 45/76 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8508ms problems are : Problem set: 31 solved, 45 unsolved
Search for dead transitions found 31 dead transitions in 8509ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 52/231 places, 47/272 transitions.
Graph (complete) has 85 edges and 52 vertex of which 29 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 29 /52 variables (removed 23) and now considering 47/47 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/231 places, 47/272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8571 ms. Remains : 29/231 places, 47/272 transitions.
Built C files in :
/tmp/ltsmin15254363958250123654
[2025-06-05 15:04:28] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15254363958250123654
Running compilation step : cd /tmp/ltsmin15254363958250123654;'/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 815 ms.
Running link step : cd /tmp/ltsmin15254363958250123654;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15254363958250123654;'/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/stateBased7332687686958959563.hoa' '--buchi-type=spotba'
LTSmin run took 2717 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-02b-LTLFireability-08 finished in 141739 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)))'
Support contains 1 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 288/288 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 236 transition count 277
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 236 transition count 277
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 231 transition count 272
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 230 transition count 271
Applied a total of 34 rules in 13 ms. Remains 230 /247 variables (removed 17) and now considering 271/288 (removed 17) transitions.
// Phase 1: matrix 271 rows 230 cols
[2025-06-05 15:04:31] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:31] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-05 15:04:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:32] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2025-06-05 15:04:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:39] [INFO ] Deduced a trap composed of 163 places in 187 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:40] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:40] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:41] [INFO ] Deduced a trap composed of 165 places in 193 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:41] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/501 variables, and 238 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:10] [INFO ] Deduced a trap composed of 166 places in 114 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:24] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:27] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 511 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 230/247 places, 271/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60497 ms. Remains : 230/247 places, 271/288 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-09 finished in 60636 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)) U (G(p2)&&p1)))'
Support contains 4 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 288/288 transitions.
Graph (trivial) has 243 edges and 247 vertex of which 29 / 247 are part of one of the 5 SCC in 2 ms
Free SCC test removed 24 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 222 transition count 113
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 151 rules applied. Total rules applied 299 place count 75 transition count 109
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 305 place count 73 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 309 place count 69 transition count 105
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 309 place count 69 transition count 97
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 325 place count 61 transition count 97
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 330 place count 56 transition count 92
Iterating global reduction 4 with 5 rules applied. Total rules applied 335 place count 56 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 336 place count 55 transition count 89
Iterating global reduction 4 with 1 rules applied. Total rules applied 337 place count 55 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 338 place count 55 transition count 88
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 356 place count 46 transition count 79
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 362 place count 40 transition count 68
Iterating global reduction 5 with 6 rules applied. Total rules applied 368 place count 40 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 370 place count 40 transition count 66
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 371 place count 39 transition count 64
Iterating global reduction 6 with 1 rules applied. Total rules applied 372 place count 39 transition count 64
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 373 place count 38 transition count 62
Iterating global reduction 6 with 1 rules applied. Total rules applied 374 place count 38 transition count 62
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 388 place count 31 transition count 62
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 389 place count 30 transition count 56
Iterating global reduction 6 with 1 rules applied. Total rules applied 390 place count 30 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 391 place count 30 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 394 place count 30 transition count 52
Applied a total of 394 rules in 34 ms. Remains 30 /247 variables (removed 217) and now considering 52/288 (removed 236) transitions.
[2025-06-05 15:05:32] [INFO ] Flow matrix only has 49 transitions (discarded 3 similar events)
// Phase 1: matrix 49 rows 30 cols
[2025-06-05 15:05:32] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:32] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-05 15:05:32] [INFO ] Flow matrix only has 49 transitions (discarded 3 similar events)
[2025-06-05 15:05:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-05 15:05:32] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:05:32] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2025-06-05 15:05:32] [INFO ] Flow matrix only has 49 transitions (discarded 3 similar events)
[2025-06-05 15:05:32] [INFO ] Invariant cache hit.
[2025-06-05 15:05:32] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:32] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:33] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 48/78 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/79 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 39 constraints, problems are : Problem set: 0 solved, 47 unsolved in 2265 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 30/30 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 48/78 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 47/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 86 constraints, problems are : Problem set: 0 solved, 47 unsolved in 2834 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 30/30 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5108ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 5108ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/247 places, 52/288 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5293 ms. Remains : 30/247 places, 52/288 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-11 finished in 5497 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(F(p0)))'
Support contains 1 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 288/288 transitions.
Graph (trivial) has 250 edges and 247 vertex of which 38 / 247 are part of one of the 6 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 214 transition count 104
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 151 rules applied. Total rules applied 299 place count 67 transition count 100
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 302 place count 65 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 303 place count 64 transition count 99
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 303 place count 64 transition count 92
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 317 place count 57 transition count 92
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 322 place count 52 transition count 87
Iterating global reduction 4 with 5 rules applied. Total rules applied 327 place count 52 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 51 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 51 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 330 place count 51 transition count 83
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 348 place count 42 transition count 74
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 355 place count 35 transition count 61
Iterating global reduction 5 with 7 rules applied. Total rules applied 362 place count 35 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 364 place count 35 transition count 59
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 366 place count 33 transition count 55
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 33 transition count 55
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 370 place count 31 transition count 51
Iterating global reduction 6 with 2 rules applied. Total rules applied 372 place count 31 transition count 51
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 384 place count 25 transition count 51
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 385 place count 24 transition count 47
Iterating global reduction 6 with 1 rules applied. Total rules applied 386 place count 24 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 387 place count 24 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 389 place count 24 transition count 44
Applied a total of 389 rules in 23 ms. Remains 24 /247 variables (removed 223) and now considering 44/288 (removed 244) transitions.
[2025-06-05 15:05:37] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
// Phase 1: matrix 41 rows 24 cols
[2025-06-05 15:05:37] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:37] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-05 15:05:37] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2025-06-05 15:05:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-05 15:05:38] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:05:38] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2025-06-05 15:05:38] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2025-06-05 15:05:38] [INFO ] Invariant cache hit.
[2025-06-05 15:05:38] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:38] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/64 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:38] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 1/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 33 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1954 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 24/24 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:40] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 40/64 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 39/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 1/65 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:41] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/65 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/65 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 14 (OVERLAPS) 0/65 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 74 constraints, problems are : Problem set: 0 solved, 39 unsolved in 3234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 24/24 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5197ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 5197ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/247 places, 44/288 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5367 ms. Remains : 24/247 places, 44/288 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-13
Stuttering criterion allowed to conclude after 123 steps with 15 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-13 finished in 5484 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)||G(p1))))'
Support contains 4 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 288/288 transitions.
Graph (trivial) has 246 edges and 247 vertex of which 38 / 247 are part of one of the 6 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 147 place count 214 transition count 105
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 150 rules applied. Total rules applied 297 place count 68 transition count 101
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 300 place count 66 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 301 place count 65 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 301 place count 65 transition count 93
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 315 place count 58 transition count 93
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 319 place count 54 transition count 89
Iterating global reduction 4 with 4 rules applied. Total rules applied 323 place count 54 transition count 89
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 341 place count 45 transition count 80
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 347 place count 39 transition count 69
Iterating global reduction 4 with 6 rules applied. Total rules applied 353 place count 39 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 355 place count 39 transition count 67
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 357 place count 37 transition count 63
Iterating global reduction 5 with 2 rules applied. Total rules applied 359 place count 37 transition count 63
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 361 place count 35 transition count 59
Iterating global reduction 5 with 2 rules applied. Total rules applied 363 place count 35 transition count 59
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 373 place count 30 transition count 58
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 374 place count 29 transition count 54
Iterating global reduction 5 with 1 rules applied. Total rules applied 375 place count 29 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 376 place count 29 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 378 place count 29 transition count 51
Applied a total of 378 rules in 19 ms. Remains 29 /247 variables (removed 218) and now considering 51/288 (removed 237) transitions.
[2025-06-05 15:05:43] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
// Phase 1: matrix 48 rows 29 cols
[2025-06-05 15:05:43] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:43] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-05 15:05:43] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2025-06-05 15:05:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-05 15:05:43] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:05:43] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2025-06-05 15:05:43] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2025-06-05 15:05:43] [INFO ] Invariant cache hit.
[2025-06-05 15:05:43] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:43] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:44] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:44] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 47/76 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 38 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2446 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 47/76 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 46/83 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 84 constraints, problems are : Problem set: 0 solved, 46 unsolved in 3005 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5462ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 5463ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/247 places, 51/288 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5652 ms. Remains : 29/247 places, 51/288 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-14
Product exploration explored 100000 steps with 10 reset in 315 ms.
Product exploration explored 100000 steps with 35 reset in 317 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 189 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5661 resets) in 145 ms. (273 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (1125 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
[2025-06-05 15:05:50] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2025-06-05 15:05:50] [INFO ] Invariant cache hit.
[2025-06-05 15:05:50] [INFO ] State equation strengthened by 4 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/73 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/76 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 35 constraints, problems are : Problem set: 0 solved, 1 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:50] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
Problem apf0 is UNSAT
After SMT solving in domain Int declared 27/77 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/29 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 143ms 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), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 508 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2025-06-05 15:05:50] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2025-06-05 15:05:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:50] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-05 15:05:50] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2025-06-05 15:05:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-05 15:05:50] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:05:50] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2025-06-05 15:05:50] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2025-06-05 15:05:50] [INFO ] Invariant cache hit.
[2025-06-05 15:05:50] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:51] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:51] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:51] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 47/76 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 38 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2554 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 47/76 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 46/83 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 84 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2861 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5429ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 5429ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5570 ms. Remains : 29/29 places, 51/51 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 174 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5822 resets) in 146 ms. (272 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (1136 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
[2025-06-05 15:05:56] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2025-06-05 15:05:56] [INFO ] Invariant cache hit.
[2025-06-05 15:05:56] [INFO ] State equation strengthened by 4 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/73 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/76 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 35 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:56] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 8 ms to minimize.
Problem apf0 is UNSAT
After SMT solving in domain Int declared 27/77 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/29 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 276ms 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), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 578 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4 reset in 156 ms.
Product exploration explored 100000 steps with 62 reset in 499 ms.
Built C files in :
/tmp/ltsmin2009852801192795436
[2025-06-05 15:05:58] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2025-06-05 15:05:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:05:58] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2025-06-05 15:05:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:05:58] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2025-06-05 15:05:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:05:58] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2009852801192795436
Running compilation step : cd /tmp/ltsmin2009852801192795436;'/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 183 ms.
Running link step : cd /tmp/ltsmin2009852801192795436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin2009852801192795436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13942154379724029222.hoa' '--buchi-type=spotba'
LTSmin run took 76 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-02b-LTLFireability-14 finished in 15355 ms.
All properties solved by simple procedures.
Total runtime 696280 ms.

BK_STOP 1749135958738

--------------------
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-02b"
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-02b, 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-174903490900172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-02b.tgz
mv StigmergyElection-PT-02b execution
cd execution
if [ "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 ;