About the Execution of ITS-Tools for StigmergyCommit-PT-03b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 905674.00 | 0.00 | 0.00 | FFFFTFTFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490600028.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 StigmergyCommit-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490600028
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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.7K 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 359K 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 StigmergyCommit-PT-03b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749055709922
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 16:48:32] [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-04 16:48:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 16:48:33] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2025-06-04 16:48:33] [INFO ] Transformed 1231 places.
[2025-06-04 16:48:33] [INFO ] Transformed 1476 transitions.
[2025-06-04 16:48:33] [INFO ] Found NUPN structural information;
[2025-06-04 16:48:33] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 584 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA StigmergyCommit-PT-03b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 1231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 1135 transition count 1380
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 1135 transition count 1380
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 250 place count 1077 transition count 1322
Iterating global reduction 0 with 58 rules applied. Total rules applied 308 place count 1077 transition count 1322
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 341 place count 1044 transition count 1289
Iterating global reduction 0 with 33 rules applied. Total rules applied 374 place count 1044 transition count 1289
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 404 place count 1014 transition count 1259
Iterating global reduction 0 with 30 rules applied. Total rules applied 434 place count 1014 transition count 1259
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 460 place count 988 transition count 1233
Iterating global reduction 0 with 26 rules applied. Total rules applied 486 place count 988 transition count 1233
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 511 place count 963 transition count 1208
Iterating global reduction 0 with 25 rules applied. Total rules applied 536 place count 963 transition count 1208
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 558 place count 941 transition count 1186
Iterating global reduction 0 with 22 rules applied. Total rules applied 580 place count 941 transition count 1186
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 601 place count 920 transition count 1165
Iterating global reduction 0 with 21 rules applied. Total rules applied 622 place count 920 transition count 1165
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 640 place count 902 transition count 1147
Iterating global reduction 0 with 18 rules applied. Total rules applied 658 place count 902 transition count 1147
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 672 place count 888 transition count 1133
Iterating global reduction 0 with 14 rules applied. Total rules applied 686 place count 888 transition count 1133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 690 place count 888 transition count 1129
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 695 place count 883 transition count 1124
Iterating global reduction 1 with 5 rules applied. Total rules applied 700 place count 883 transition count 1124
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 705 place count 878 transition count 1119
Iterating global reduction 1 with 5 rules applied. Total rules applied 710 place count 878 transition count 1119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 712 place count 876 transition count 1117
Iterating global reduction 1 with 2 rules applied. Total rules applied 714 place count 876 transition count 1117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 716 place count 874 transition count 1115
Iterating global reduction 1 with 2 rules applied. Total rules applied 718 place count 874 transition count 1115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 720 place count 872 transition count 1113
Iterating global reduction 1 with 2 rules applied. Total rules applied 722 place count 872 transition count 1113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 724 place count 870 transition count 1111
Iterating global reduction 1 with 2 rules applied. Total rules applied 726 place count 870 transition count 1111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 728 place count 868 transition count 1109
Iterating global reduction 1 with 2 rules applied. Total rules applied 730 place count 868 transition count 1109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 732 place count 866 transition count 1107
Iterating global reduction 1 with 2 rules applied. Total rules applied 734 place count 866 transition count 1107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 736 place count 864 transition count 1105
Iterating global reduction 1 with 2 rules applied. Total rules applied 738 place count 864 transition count 1105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 740 place count 862 transition count 1103
Iterating global reduction 1 with 2 rules applied. Total rules applied 742 place count 862 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 744 place count 860 transition count 1101
Iterating global reduction 1 with 2 rules applied. Total rules applied 746 place count 860 transition count 1101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 748 place count 858 transition count 1099
Iterating global reduction 1 with 2 rules applied. Total rules applied 750 place count 858 transition count 1099
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 752 place count 858 transition count 1097
Applied a total of 752 rules in 2232 ms. Remains 858 /1231 variables (removed 373) and now considering 1097/1476 (removed 379) transitions.
// Phase 1: matrix 1097 rows 858 cols
[2025-06-04 16:48:35] [INFO ] Computed 5 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:48:37] [INFO ] Implicit Places using invariants in 1200 ms returned []
[2025-06-04 16:48:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:48:39] [INFO ] Implicit Places using invariants and state equation in 2043 ms returned []
Implicit Place search using SMT with State Equation took 3301 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2025-06-04 16:48:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 Real declared 857/1955 variables, and 0 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30107 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/858 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 857/1955 variables, and 0 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/858 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60978ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61028ms
Starting structural reductions in LTL mode, iteration 1 : 858/1231 places, 1097/1476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66625 ms. Remains : 858/1231 places, 1097/1476 transitions.
Support contains 41 out of 858 places after structural reductions.
[2025-06-04 16:49:40] [INFO ] Flatten gal took : 231 ms
[2025-06-04 16:49:40] [INFO ] Flatten gal took : 128 ms
[2025-06-04 16:49:41] [INFO ] Input system was already deterministic with 1097 transitions.
RANDOM walk for 40000 steps (515 resets) in 1444 ms. (27 steps per ms) remains 18/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (10 resets) in 43 ms. (90 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 55 ms. (71 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 50 ms. (78 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (10 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (10 resets) in 50 ms. (78 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (9 resets) in 54 ms. (72 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (11 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 51 ms. (77 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
[2025-06-04 16:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 814/844 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:49:43] [INFO ] Deduced a trap composed of 300 places in 562 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:49:43] [INFO ] Deduced a trap composed of 310 places in 613 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:49:44] [INFO ] Deduced a trap composed of 312 places in 408 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:49:45] [INFO ] Deduced a trap composed of 306 places in 670 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:49:45] [INFO ] Deduced a trap composed of 314 places in 583 ms of which 44 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/844 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/844 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 14/858 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 858/1955 variables, and 10 constraints, problems are : Problem set: 1 solved, 17 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/858 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 818/844 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/844 variables, 5/9 constraints. Problems are: Problem set: 2 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:49:47] [INFO ] Deduced a trap composed of 314 places in 349 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:49:48] [INFO ] Deduced a trap composed of 305 places in 613 ms of which 225 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:49:49] [INFO ] Deduced a trap composed of 306 places in 540 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:49:49] [INFO ] Deduced a trap composed of 313 places in 706 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:49:50] [INFO ] Deduced a trap composed of 314 places in 925 ms of which 376 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:49:51] [INFO ] Deduced a trap composed of 304 places in 815 ms of which 242 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/844 variables, 6/15 constraints. Problems are: Problem set: 2 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 844/1955 variables, and 15 constraints, problems are : Problem set: 2 solved, 16 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 0/858 constraints, PredecessorRefiner: 0/18 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10037ms problems are : Problem set: 2 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 858 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 858/858 places, 1097/1097 transitions.
Graph (trivial) has 810 edges and 858 vertex of which 61 / 858 are part of one of the 11 SCC in 9 ms
Free SCC test removed 50 places
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 1272 edges and 808 vertex of which 804 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 566 transitions
Trivial Post-agglo rules discarded 566 transitions
Performed 566 trivial Post agglomeration. Transition count delta: 566
Iterating post reduction 0 with 570 rules applied. Total rules applied 572 place count 804 transition count 459
Reduce places removed 566 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 578 rules applied. Total rules applied 1150 place count 238 transition count 447
Reduce places removed 6 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 13 rules applied. Total rules applied 1163 place count 232 transition count 440
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 11 rules applied. Total rules applied 1174 place count 225 transition count 436
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1176 place count 223 transition count 436
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 50 Pre rules applied. Total rules applied 1176 place count 223 transition count 386
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 1276 place count 173 transition count 386
Performed 31 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1338 place count 142 transition count 354
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1344 place count 142 transition count 348
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1357 place count 129 transition count 274
Iterating global reduction 6 with 13 rules applied. Total rules applied 1370 place count 129 transition count 274
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1375 place count 129 transition count 269
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1381 place count 123 transition count 263
Iterating global reduction 7 with 6 rules applied. Total rules applied 1387 place count 123 transition count 263
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1392 place count 118 transition count 258
Iterating global reduction 7 with 5 rules applied. Total rules applied 1397 place count 118 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1398 place count 118 transition count 257
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 1410 place count 112 transition count 251
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1416 place count 109 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1417 place count 109 transition count 260
Free-agglomeration rule applied 32 times.
Iterating global reduction 9 with 32 rules applied. Total rules applied 1449 place count 109 transition count 228
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 34 rules applied. Total rules applied 1483 place count 77 transition count 226
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1487 place count 73 transition count 222
Iterating global reduction 10 with 4 rules applied. Total rules applied 1491 place count 73 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 10 with 53 rules applied. Total rules applied 1544 place count 73 transition count 169
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 1551 place count 73 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1554 place count 73 transition count 166
Applied a total of 1554 rules in 325 ms. Remains 73 /858 variables (removed 785) and now considering 166/1097 (removed 931) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 73/858 places, 166/1097 transitions.
RANDOM walk for 37361 steps (1971 resets) in 697 ms. (53 steps per ms) remains 0/16 properties
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA StigmergyCommit-PT-03b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 174 stabilizing places and 182 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' '!(X((G((F(X(p0)) U p1))||(X(F(!F(p1))) U p2))))'
Support contains 6 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1097/1097 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 848 transition count 1087
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 848 transition count 1087
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 839 transition count 1078
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 839 transition count 1078
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 830 transition count 1069
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 830 transition count 1069
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 822 transition count 1061
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 822 transition count 1061
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 816 transition count 1055
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 816 transition count 1055
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 811 transition count 1050
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 811 transition count 1050
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 98 place count 807 transition count 1046
Iterating global reduction 0 with 4 rules applied. Total rules applied 102 place count 807 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 804 transition count 1043
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 804 transition count 1043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 803 transition count 1042
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 803 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 802 transition count 1041
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 802 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 801 transition count 1040
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 801 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 800 transition count 1039
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 800 transition count 1039
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 799 transition count 1038
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 799 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 798 transition count 1037
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 798 transition count 1037
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 797 transition count 1036
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 797 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 797 transition count 1035
Applied a total of 123 rules in 799 ms. Remains 797 /858 variables (removed 61) and now considering 1035/1097 (removed 62) transitions.
// Phase 1: matrix 1035 rows 797 cols
[2025-06-04 16:49:53] [INFO ] Computed 5 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:49:54] [INFO ] Implicit Places using invariants in 731 ms returned []
[2025-06-04 16:49:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:49:55] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
Running 1034 sub problems to find dead transitions.
[2025-06-04 16:49:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 Real declared 796/1832 variables, and 0 constraints, problems are : Problem set: 0 solved, 1034 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/797 constraints, PredecessorRefiner: 1034/1034 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1034 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/1832 variables, and 0 constraints, problems are : Problem set: 0 solved, 1034 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/797 constraints, PredecessorRefiner: 0/1034 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60384ms problems are : Problem set: 0 solved, 1034 unsolved
Search for dead transitions found 0 dead transitions in 60390ms
Starting structural reductions in LTL mode, iteration 1 : 797/858 places, 1035/1097 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63152 ms. Remains : 797/858 places, 1035/1097 transitions.
Stuttering acceptance computed with spot in 707 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-00
Product exploration explored 100000 steps with 1290 reset in 551 ms.
Product exploration explored 100000 steps with 1270 reset in 331 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 201 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 13 states, 46 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 707 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), false, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p0)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p0)), false, false, (AND p2 p1 (NOT p0)), false, (AND p1 (NOT p2) (NOT p0)), false]
RANDOM walk for 40000 steps (506 resets) in 1173 ms. (34 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (107 resets) in 193 ms. (206 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (107 resets) in 294 ms. (135 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (104 resets) in 274 ms. (145 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (109 resets) in 237 ms. (168 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (111 resets) in 231 ms. (172 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (106 resets) in 164 ms. (242 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (105 resets) in 191 ms. (208 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (110 resets) in 164 ms. (242 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (108 resets) in 166 ms. (239 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (107 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (109 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (111 resets) in 159 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (106 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (109 resets) in 111 ms. (357 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 252691 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 14
Probabilistic random walk after 252691 steps, saw 53726 distinct states, run finished after 3007 ms. (steps per millisecond=84 ) properties seen :0
[2025-06-04 16:51:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem apf6 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
At refinement iteration 1 (OVERLAPS) 777/783 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:04] [INFO ] Deduced a trap composed of 290 places in 561 ms of which 174 ms to minimize.
Problem apf1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 1/5 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 14/797 variables, 1/6 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/797 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1035/1832 variables, 797/803 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1832 variables, 0/803 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1832/1832 variables, and 803 constraints, problems are : Problem set: 4 solved, 10 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 797/797 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 777/783 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 1/5 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:09] [INFO ] Deduced a trap composed of 290 places in 696 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:10] [INFO ] Deduced a trap composed of 298 places in 768 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:10] [INFO ] Deduced a trap composed of 290 places in 418 ms of which 128 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 3/8 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 14/797 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:12] [INFO ] Deduced a trap composed of 298 places in 805 ms of which 167 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/1832 variables, and 10 constraints, problems are : Problem set: 4 solved, 10 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/797 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10046ms problems are : Problem set: 4 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 789 edges and 797 vertex of which 61 / 797 are part of one of the 11 SCC in 3 ms
Free SCC test removed 50 places
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 1196 edges and 747 vertex of which 743 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 558 rules applied. Total rules applied 560 place count 743 transition count 409
Reduce places removed 554 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 569 rules applied. Total rules applied 1129 place count 189 transition count 394
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1135 place count 183 transition count 394
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1135 place count 183 transition count 348
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1227 place count 137 transition count 348
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1228 place count 137 transition count 347
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1286 place count 108 transition count 318
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1293 place count 108 transition count 311
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1313 place count 88 transition count 223
Iterating global reduction 5 with 20 rules applied. Total rules applied 1333 place count 88 transition count 223
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1342 place count 88 transition count 214
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1353 place count 77 transition count 203
Iterating global reduction 6 with 11 rules applied. Total rules applied 1364 place count 77 transition count 203
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1372 place count 69 transition count 195
Iterating global reduction 6 with 8 rules applied. Total rules applied 1380 place count 69 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1384 place count 69 transition count 191
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1394 place count 64 transition count 186
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1404 place count 59 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1405 place count 59 transition count 206
Free-agglomeration rule applied 26 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1431 place count 59 transition count 173
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 36 rules applied. Total rules applied 1467 place count 33 transition count 163
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1471 place count 29 transition count 159
Iterating global reduction 9 with 4 rules applied. Total rules applied 1475 place count 29 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1476 place count 29 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 10 with 61 rules applied. Total rules applied 1537 place count 29 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1541 place count 27 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 1549 place count 27 transition count 107
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1550 place count 27 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1551 place count 27 transition count 106
Applied a total of 1551 rules in 112 ms. Remains 27 /797 variables (removed 770) and now considering 106/1035 (removed 929) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 27/797 places, 106/1035 transitions.
RANDOM walk for 721 steps (0 resets) in 10 ms. (65 steps per ms) remains 0/10 properties
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p1) p2 (NOT p0))), (G (OR p1 (NOT p2) (NOT p0))), (G (OR (NOT p1) (NOT p2) p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F p1), (F p0), (F (NOT (OR (NOT p1) p0))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2) p0)))]
Knowledge based reduction with 14 factoid took 751 ms. Reduced automaton from 13 states, 46 edges and 3 AP (stutter insensitive) to 16 states, 55 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 936 ms :[(OR (NOT p2) p1), (AND (NOT p1) (NOT p2)), false, (OR (NOT p2) p1), p1, (AND (NOT p0) (NOT p2)), p1, false, false, (AND p2 p1 (NOT p0)), (AND p2 p1 p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) p0), false, false, false]
Stuttering acceptance computed with spot in 942 ms :[(OR (NOT p2) p1), (AND (NOT p1) (NOT p2)), false, (OR (NOT p2) p1), p1, (AND (NOT p0) (NOT p2)), p1, false, false, (AND p2 p1 (NOT p0)), (AND p2 p1 p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) p0), false, false, false]
[2025-06-04 16:51:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 16:51:16] [INFO ] [Real]Absence check using 5 positive place invariants in 65 ms returned sat
[2025-06-04 16:51:21] [INFO ] [Real]Absence check using state equation in 4706 ms returned sat
[2025-06-04 16:51:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 16:51:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 54 ms returned sat
[2025-06-04 16:51:25] [INFO ] [Nat]Absence check using state equation in 3326 ms returned sat
[2025-06-04 16:51:26] [INFO ] Computed and/alt/rep : 1009/1712/1009 causal constraints (skipped 25 transitions) in 111 ms.
Could not prove EG (NOT p2)
Support contains 6 out of 797 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 789 edges and 797 vertex of which 61 / 797 are part of one of the 11 SCC in 3 ms
Free SCC test removed 50 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 548 place count 746 transition count 430
Reduce places removed 547 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 562 rules applied. Total rules applied 1110 place count 199 transition count 415
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1116 place count 193 transition count 415
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 1116 place count 193 transition count 373
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1200 place count 151 transition count 373
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1203 place count 148 transition count 370
Iterating global reduction 3 with 3 rules applied. Total rules applied 1206 place count 148 transition count 370
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 1268 place count 117 transition count 339
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1287 place count 98 transition count 256
Iterating global reduction 3 with 19 rules applied. Total rules applied 1306 place count 98 transition count 256
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1314 place count 98 transition count 248
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1325 place count 87 transition count 234
Iterating global reduction 4 with 11 rules applied. Total rules applied 1336 place count 87 transition count 234
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1347 place count 76 transition count 220
Iterating global reduction 4 with 11 rules applied. Total rules applied 1358 place count 76 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1362 place count 76 transition count 216
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1382 place count 66 transition count 222
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1383 place count 65 transition count 212
Iterating global reduction 5 with 1 rules applied. Total rules applied 1384 place count 65 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1385 place count 65 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1389 place count 65 transition count 207
Applied a total of 1389 rules in 128 ms. Remains 65 /797 variables (removed 732) and now considering 207/1035 (removed 828) transitions.
[2025-06-04 16:51:36] [INFO ] Flow matrix only has 202 transitions (discarded 5 similar events)
// Phase 1: matrix 202 rows 65 cols
[2025-06-04 16:51:36] [INFO ] Computed 2 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:51:36] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-04 16:51:36] [INFO ] Flow matrix only has 202 transitions (discarded 5 similar events)
[2025-06-04 16:51:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:51:37] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 16:51:37] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 16:51:37] [INFO ] Redundant transitions in 16 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-04 16:51:37] [INFO ] Flow matrix only has 202 transitions (discarded 5 similar events)
[2025-06-04 16:51:37] [INFO ] Invariant cache hit.
[2025-06-04 16:51:37] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:38] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:39] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:39] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:39] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:39] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:39] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:40] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:40] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:40] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:40] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:41] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:51:41] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 201/266 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 1/267 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 0/267 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 94 constraints, problems are : Problem set: 0 solved, 190 unsolved in 23655 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 201/266 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 190/283 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 1/267 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 284 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53829ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 53830ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/797 places, 207/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54372 ms. Remains : 65/797 places, 207/1035 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 248 ms. Reduced automaton from 16 states, 55 edges and 3 AP (stutter insensitive) to 16 states, 55 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 891 ms :[(OR (NOT p2) p1), (AND (NOT p1) (NOT p2)), false, (OR (NOT p2) p1), p1, (AND (NOT p0) (NOT p2)), p1, false, false, false, false, false, (AND p2 p1 (NOT p0)), (AND p2 p1 p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) p0)]
RANDOM walk for 40000 steps (5468 resets) in 887 ms. (45 steps per ms) remains 8/13 properties
BEST_FIRST walk for 40002 steps (590 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (597 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (569 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (583 resets) in 63 ms. (625 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (583 resets) in 58 ms. (678 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (598 resets) in 33 ms. (1176 steps per ms) remains 5/5 properties
[2025-06-04 16:52:32] [INFO ] Flow matrix only has 202 transitions (discarded 5 similar events)
[2025-06-04 16:52:32] [INFO ] Invariant cache hit.
[2025-06-04 16:52:32] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf5 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 57/63 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 200/263 variables, 63/64 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 14/78 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/78 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/266 variables, 2/80 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 1/81 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/81 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/267 variables, 1/82 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/82 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/267 variables, 0/82 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 82 constraints, problems are : Problem set: 3 solved, 2 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/63 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:52:33] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:52:33] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:52:33] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:52:33] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 200/263 variables, 63/68 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 14/82 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 2/84 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/266 variables, 2/86 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 1/87 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/267 variables, 1/88 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/88 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/267 variables, 0/88 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 88 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1065 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1434ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 73 ms.
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 207/207 transitions.
Graph (complete) has 273 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 64 transition count 197
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 60 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 59 transition count 206
Free-agglomeration rule applied 26 times with reduction of 7 identical transitions.
Iterating global reduction 1 with 26 rules applied. Total rules applied 46 place count 59 transition count 173
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 41 rules applied. Total rules applied 87 place count 32 transition count 159
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 91 place count 28 transition count 159
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 24 transition count 155
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 24 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 100 place count 24 transition count 154
Performed 8 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
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 116 place count 16 transition count 98
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 4 with 60 rules applied. Total rules applied 176 place count 16 transition count 38
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 182 place count 13 transition count 33
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 187 place count 13 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 188 place count 13 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 12 transition count 26
Applied a total of 189 rules in 39 ms. Remains 12 /65 variables (removed 53) and now considering 26/207 (removed 181) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 12/65 places, 26/207 transitions.
RANDOM walk for 40000 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
// Phase 1: matrix 26 rows 12 cols
[2025-06-04 16:52:34] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 26/38 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/38 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 16 constraints, problems are : Problem set: 0 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:52:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Problem apf1 is UNSAT
After SMT solving in domain Int declared 12/38 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p1) p2 (NOT p0))), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (NOT (OR p1 (NOT p2) p0)))]
Knowledge based reduction with 31 factoid took 617 ms. Reduced automaton from 16 states, 55 edges and 3 AP (stutter insensitive) to 16 states, 55 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 814 ms :[(OR (NOT p2) p1), (AND (NOT p1) (NOT p2)), false, (OR (NOT p2) p1), p1, (AND (NOT p0) (NOT p2)), p1, false, false, (AND p2 p1 (NOT p0)), (AND p2 p1 p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) p0), false, false, false]
Stuttering acceptance computed with spot in 910 ms :[(OR (NOT p2) p1), (AND (NOT p1) (NOT p2)), false, (OR (NOT p2) p1), p1, (AND (NOT p0) (NOT p2)), p1, false, false, (AND p2 p1 (NOT p0)), (AND p2 p1 p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) p0), false, false, false]
[2025-06-04 16:52:36] [INFO ] Flow matrix only has 202 transitions (discarded 5 similar events)
// Phase 1: matrix 202 rows 65 cols
[2025-06-04 16:52:36] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 16:52:36] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-04 16:52:37] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2025-06-04 16:52:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 16:52:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-04 16:52:37] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2025-06-04 16:52:37] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 16:52:37] [INFO ] [Nat]Added 15 Read/Feed constraints in 15 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:52:37] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:52:37] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 4 ms to minimize.
[2025-06-04 16:52:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2025-06-04 16:52:37] [INFO ] Computed and/alt/rep : 141/599/141 causal constraints (skipped 44 transitions) in 40 ms.
[2025-06-04 16:52:37] [INFO ] Added : 14 causal constraints over 4 iterations in 145 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 904 ms :[(OR (NOT p2) p1), (AND (NOT p1) (NOT p2)), false, (OR (NOT p2) p1), p1, (AND (NOT p0) (NOT p2)), p1, false, false, (AND p2 p1 (NOT p0)), (AND p2 p1 p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) p0), false, false, false]
Stuttering criterion allowed to conclude after 61 steps with 8 reset in 1 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-00 finished in 165699 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' '!(((!p0||G(p1)) U X((F(p2) U X(p3)))))'
Support contains 4 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1097/1097 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 849 transition count 1088
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 849 transition count 1088
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 842 transition count 1081
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 842 transition count 1081
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 835 transition count 1074
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 835 transition count 1074
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 829 transition count 1068
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 829 transition count 1068
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 825 transition count 1064
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 825 transition count 1064
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 822 transition count 1061
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 822 transition count 1061
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 820 transition count 1059
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 820 transition count 1059
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 819 transition count 1058
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 819 transition count 1058
Applied a total of 78 rules in 513 ms. Remains 819 /858 variables (removed 39) and now considering 1058/1097 (removed 39) transitions.
// Phase 1: matrix 1058 rows 819 cols
[2025-06-04 16:52:39] [INFO ] Computed 5 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:52:40] [INFO ] Implicit Places using invariants in 825 ms returned []
[2025-06-04 16:52:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:52:41] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 2455 ms to find 0 implicit places.
Running 1057 sub problems to find dead transitions.
[2025-06-04 16:52:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/1877 variables, and 0 constraints, problems are : Problem set: 0 solved, 1057 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/819 constraints, PredecessorRefiner: 1057/1057 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1057 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/1877 variables, and 0 constraints, problems are : Problem set: 0 solved, 1057 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/819 constraints, PredecessorRefiner: 0/1057 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60448ms problems are : Problem set: 0 solved, 1057 unsolved
Search for dead transitions found 0 dead transitions in 60454ms
Starting structural reductions in LTL mode, iteration 1 : 819/858 places, 1058/1097 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63428 ms. Remains : 819/858 places, 1058/1097 transitions.
Stuttering acceptance computed with spot in 694 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-01
Stuttering criterion allowed to conclude after 81 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-01 finished in 64170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 3 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1097/1097 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 847 transition count 1086
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 847 transition count 1086
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 838 transition count 1077
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 838 transition count 1077
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 829 transition count 1068
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 829 transition count 1068
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 821 transition count 1060
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 821 transition count 1060
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 815 transition count 1054
Iterating global reduction 0 with 6 rules applied. Total rules applied 86 place count 815 transition count 1054
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 810 transition count 1049
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 810 transition count 1049
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 100 place count 806 transition count 1045
Iterating global reduction 0 with 4 rules applied. Total rules applied 104 place count 806 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 107 place count 803 transition count 1042
Iterating global reduction 0 with 3 rules applied. Total rules applied 110 place count 803 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 801 transition count 1040
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 801 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 799 transition count 1038
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 799 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 797 transition count 1036
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 797 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 795 transition count 1034
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 793 transition count 1032
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 793 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 132 place count 791 transition count 1030
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 791 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 791 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 790 transition count 1028
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 790 transition count 1028
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 138 place count 790 transition count 1027
Applied a total of 138 rules in 826 ms. Remains 790 /858 variables (removed 68) and now considering 1027/1097 (removed 70) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2025-06-04 16:53:43] [INFO ] Computed 5 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:53:44] [INFO ] Implicit Places using invariants in 758 ms returned []
[2025-06-04 16:53:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:53:46] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned []
Implicit Place search using SMT with State Equation took 2364 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2025-06-04 16:53:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 789/1817 variables, and 0 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 789/1817 variables, and 0 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 0/1026 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60426ms problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 60431ms
Starting structural reductions in LTL mode, iteration 1 : 790/858 places, 1027/1097 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63625 ms. Remains : 790/858 places, 1027/1097 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-02
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-02 finished in 63896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F(p0))))))'
Support contains 1 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1097/1097 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 848 transition count 1087
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 848 transition count 1087
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 840 transition count 1079
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 840 transition count 1079
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 832 transition count 1071
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 832 transition count 1071
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 825 transition count 1064
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 825 transition count 1064
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 819 transition count 1058
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 819 transition count 1058
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 814 transition count 1053
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 814 transition count 1053
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 92 place count 810 transition count 1049
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 810 transition count 1049
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 807 transition count 1046
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 807 transition count 1046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 805 transition count 1044
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 805 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 803 transition count 1042
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 803 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 801 transition count 1040
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 801 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 799 transition count 1038
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 799 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 797 transition count 1036
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 797 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 795 transition count 1034
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 795 transition count 1034
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 127 place count 795 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 794 transition count 1032
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 794 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 130 place count 794 transition count 1031
Applied a total of 130 rules in 819 ms. Remains 794 /858 variables (removed 64) and now considering 1031/1097 (removed 66) transitions.
// Phase 1: matrix 1031 rows 794 cols
[2025-06-04 16:54:47] [INFO ] Computed 5 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:54:48] [INFO ] Implicit Places using invariants in 813 ms returned []
[2025-06-04 16:54:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:54:49] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 2114 ms to find 0 implicit places.
Running 1030 sub problems to find dead transitions.
[2025-06-04 16:54:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 793/1825 variables, and 0 constraints, problems are : Problem set: 0 solved, 1030 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/794 constraints, PredecessorRefiner: 1030/1030 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1030 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 793/1825 variables, and 0 constraints, problems are : Problem set: 0 solved, 1030 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/794 constraints, PredecessorRefiner: 0/1030 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60315ms problems are : Problem set: 0 solved, 1030 unsolved
Search for dead transitions found 0 dead transitions in 60318ms
Starting structural reductions in LTL mode, iteration 1 : 794/858 places, 1031/1097 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63255 ms. Remains : 794/858 places, 1031/1097 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-03 finished in 63531 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 858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 858/858 places, 1097/1097 transitions.
Graph (trivial) has 850 edges and 858 vertex of which 68 / 858 are part of one of the 12 SCC in 2 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 591 transitions
Trivial Post-agglo rules discarded 591 transitions
Performed 591 trivial Post agglomeration. Transition count delta: 591
Iterating post reduction 0 with 591 rules applied. Total rules applied 592 place count 801 transition count 441
Reduce places removed 591 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 604 rules applied. Total rules applied 1196 place count 210 transition count 428
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1202 place count 204 transition count 428
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1202 place count 204 transition count 380
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1298 place count 156 transition count 380
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1307 place count 147 transition count 371
Iterating global reduction 3 with 9 rules applied. Total rules applied 1316 place count 147 transition count 371
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1321 place count 142 transition count 366
Iterating global reduction 3 with 5 rules applied. Total rules applied 1326 place count 142 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1327 place count 142 transition count 365
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1328 place count 141 transition count 364
Iterating global reduction 4 with 1 rules applied. Total rules applied 1329 place count 141 transition count 364
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1330 place count 140 transition count 363
Iterating global reduction 4 with 1 rules applied. Total rules applied 1331 place count 140 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1332 place count 140 transition count 362
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1390 place count 111 transition count 332
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1411 place count 90 transition count 185
Iterating global reduction 5 with 21 rules applied. Total rules applied 1432 place count 90 transition count 185
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1443 place count 90 transition count 174
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1455 place count 78 transition count 158
Iterating global reduction 6 with 12 rules applied. Total rules applied 1467 place count 78 transition count 158
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1479 place count 66 transition count 142
Iterating global reduction 6 with 12 rules applied. Total rules applied 1491 place count 66 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1495 place count 66 transition count 138
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1511 place count 58 transition count 152
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1512 place count 57 transition count 144
Iterating global reduction 7 with 1 rules applied. Total rules applied 1513 place count 57 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1514 place count 57 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1518 place count 57 transition count 139
Applied a total of 1518 rules in 86 ms. Remains 57 /858 variables (removed 801) and now considering 139/1097 (removed 958) transitions.
[2025-06-04 16:55:50] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
// Phase 1: matrix 134 rows 57 cols
[2025-06-04 16:55:50] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:55:50] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-04 16:55:50] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2025-06-04 16:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:55:50] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 16:55:50] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 16:55:50] [INFO ] Redundant transitions in 11 ms returned []
Running 114 sub problems to find dead transitions.
[2025-06-04 16:55:50] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2025-06-04 16:55:50] [INFO ] Invariant cache hit.
[2025-06-04 16:55:50] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:52] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:52] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:52] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:52] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:52] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:52] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:52] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:52] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:53] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:53] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:53] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:54] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:54] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:54] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:54] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:54] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:55:54] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 133/190 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 1/191 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 91 constraints, problems are : Problem set: 0 solved, 114 unsolved in 14392 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 133/190 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 114/204 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 1/191 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 0/191 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 205 constraints, problems are : Problem set: 0 solved, 114 unsolved in 26142 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40577ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 40579ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/858 places, 139/1097 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41002 ms. Remains : 57/858 places, 139/1097 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-04
Product exploration explored 100000 steps with 288 reset in 227 ms.
Product exploration explored 100000 steps with 2460 reset in 157 ms.
Computed a total of 6 stabilizing places and 29 stable transitions
Computed a total of 6 stabilizing places and 29 stable transitions
Detected a total of 6/57 stabilizing places and 29/139 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 467 steps (65 resets) in 6 ms. (66 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 139/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2025-06-04 16:56:32] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2025-06-04 16:56:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:56:32] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-04 16:56:32] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2025-06-04 16:56:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:56:32] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 16:56:32] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 16:56:32] [INFO ] Redundant transitions in 1 ms returned []
Running 114 sub problems to find dead transitions.
[2025-06-04 16:56:32] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2025-06-04 16:56:32] [INFO ] Invariant cache hit.
[2025-06-04 16:56:32] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:33] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:33] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:33] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:33] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:34] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:34] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:34] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:34] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:34] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:34] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:35] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:35] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:35] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:35] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:36] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:36] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:56:36] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 133/190 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 1/191 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 91 constraints, problems are : Problem set: 0 solved, 114 unsolved in 14670 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 133/190 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 114/204 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 1/191 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 0/191 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 205 constraints, problems are : Problem set: 0 solved, 114 unsolved in 25448 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40145ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 40146ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40375 ms. Remains : 57/57 places, 139/139 transitions.
Computed a total of 6 stabilizing places and 29 stable transitions
Computed a total of 6 stabilizing places and 29 stable transitions
Detected a total of 6/57 stabilizing places and 29/139 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 809 steps (111 resets) in 5 ms. (134 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1785 reset in 74 ms.
Product exploration explored 100000 steps with 3840 reset in 523 ms.
Built C files in :
/tmp/ltsmin10752060553204956659
[2025-06-04 16:57:13] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2025-06-04 16:57:13] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 16:57:13] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2025-06-04 16:57:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 16:57:13] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2025-06-04 16:57:13] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 16:57:13] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10752060553204956659
Running compilation step : cd /tmp/ltsmin10752060553204956659;'/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 840 ms.
Running link step : cd /tmp/ltsmin10752060553204956659;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin10752060553204956659;'/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/stateBased9823039431073656633.hoa' '--buchi-type=spotba'
LTSmin run took 1470 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-03b-LTLFireability-04 finished in 85997 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' '!(((p0||G(p1)) U X((p2||F(G(p3))))))'
Support contains 4 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1097/1097 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 848 transition count 1087
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 848 transition count 1087
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 840 transition count 1079
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 840 transition count 1079
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 832 transition count 1071
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 832 transition count 1071
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 825 transition count 1064
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 825 transition count 1064
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 820 transition count 1059
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 820 transition count 1059
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 816 transition count 1055
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 816 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 813 transition count 1052
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 813 transition count 1052
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 810 transition count 1049
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 810 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 808 transition count 1047
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 808 transition count 1047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 806 transition count 1045
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 806 transition count 1045
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 106 place count 804 transition count 1043
Iterating global reduction 0 with 2 rules applied. Total rules applied 108 place count 804 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 802 transition count 1041
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 802 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 800 transition count 1039
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 800 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 798 transition count 1037
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 798 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 121 place count 798 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 797 transition count 1035
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 797 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 124 place count 797 transition count 1034
Applied a total of 124 rules in 519 ms. Remains 797 /858 variables (removed 61) and now considering 1034/1097 (removed 63) transitions.
// Phase 1: matrix 1034 rows 797 cols
[2025-06-04 16:57:16] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:57:17] [INFO ] Implicit Places using invariants in 494 ms returned []
[2025-06-04 16:57:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:57:18] [INFO ] Implicit Places using invariants and state equation in 1435 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
Running 1033 sub problems to find dead transitions.
[2025-06-04 16:57:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 Real declared 796/1831 variables, and 0 constraints, problems are : Problem set: 0 solved, 1033 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/797 constraints, PredecessorRefiner: 1033/1033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1033 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/1831 variables, and 0 constraints, problems are : Problem set: 0 solved, 1033 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/797 constraints, PredecessorRefiner: 0/1033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 1033 unsolved
Search for dead transitions found 0 dead transitions in 60323ms
Starting structural reductions in LTL mode, iteration 1 : 797/858 places, 1034/1097 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62775 ms. Remains : 797/858 places, 1034/1097 transitions.
Stuttering acceptance computed with spot in 347 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-07
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-07 finished in 63150 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((p1 U p2))||F(p1)||p0) U p3))'
Support contains 5 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1097/1097 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 848 transition count 1087
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 848 transition count 1087
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 840 transition count 1079
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 840 transition count 1079
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 832 transition count 1071
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 832 transition count 1071
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 825 transition count 1064
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 825 transition count 1064
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 819 transition count 1058
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 819 transition count 1058
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 814 transition count 1053
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 814 transition count 1053
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 92 place count 810 transition count 1049
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 810 transition count 1049
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 807 transition count 1046
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 807 transition count 1046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 805 transition count 1044
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 805 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 803 transition count 1042
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 803 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 801 transition count 1040
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 801 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 799 transition count 1038
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 799 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 797 transition count 1036
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 797 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 795 transition count 1034
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 795 transition count 1034
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 127 place count 795 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 794 transition count 1032
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 794 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 130 place count 794 transition count 1031
Applied a total of 130 rules in 815 ms. Remains 794 /858 variables (removed 64) and now considering 1031/1097 (removed 66) transitions.
// Phase 1: matrix 1031 rows 794 cols
[2025-06-04 16:58:20] [INFO ] Computed 5 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:58:21] [INFO ] Implicit Places using invariants in 817 ms returned []
[2025-06-04 16:58:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:58:22] [INFO ] Implicit Places using invariants and state equation in 1346 ms returned []
Implicit Place search using SMT with State Equation took 2164 ms to find 0 implicit places.
Running 1030 sub problems to find dead transitions.
[2025-06-04 16:58:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 793/1825 variables, and 0 constraints, problems are : Problem set: 0 solved, 1030 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/794 constraints, PredecessorRefiner: 1030/1030 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1030 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 793/1825 variables, and 0 constraints, problems are : Problem set: 0 solved, 1030 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/794 constraints, PredecessorRefiner: 0/1030 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60302ms problems are : Problem set: 0 solved, 1030 unsolved
Search for dead transitions found 0 dead transitions in 60305ms
Starting structural reductions in LTL mode, iteration 1 : 794/858 places, 1031/1097 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63288 ms. Remains : 794/858 places, 1031/1097 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p3), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-08
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-08 finished in 63529 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 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1097/1097 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 847 transition count 1086
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 847 transition count 1086
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 838 transition count 1077
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 838 transition count 1077
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 829 transition count 1068
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 829 transition count 1068
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 821 transition count 1060
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 821 transition count 1060
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 815 transition count 1054
Iterating global reduction 0 with 6 rules applied. Total rules applied 86 place count 815 transition count 1054
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 810 transition count 1049
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 810 transition count 1049
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 100 place count 806 transition count 1045
Iterating global reduction 0 with 4 rules applied. Total rules applied 104 place count 806 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 107 place count 803 transition count 1042
Iterating global reduction 0 with 3 rules applied. Total rules applied 110 place count 803 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 801 transition count 1040
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 801 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 799 transition count 1038
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 799 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 797 transition count 1036
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 797 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 795 transition count 1034
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 793 transition count 1032
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 793 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 132 place count 791 transition count 1030
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 791 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 791 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 790 transition count 1028
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 790 transition count 1028
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 138 place count 790 transition count 1027
Applied a total of 138 rules in 770 ms. Remains 790 /858 variables (removed 68) and now considering 1027/1097 (removed 70) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2025-06-04 16:59:23] [INFO ] Computed 5 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:59:24] [INFO ] Implicit Places using invariants in 789 ms returned []
[2025-06-04 16:59:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 16:59:26] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 2303 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2025-06-04 16:59:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 Real declared 789/1817 variables, and 0 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 789/1817 variables, and 0 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 0/1026 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60443ms problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 60446ms
Starting structural reductions in LTL mode, iteration 1 : 790/858 places, 1027/1097 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63523 ms. Remains : 790/858 places, 1027/1097 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-09
Product exploration explored 100000 steps with 1286 reset in 212 ms.
Product exploration explored 100000 steps with 1287 reset in 232 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Detected a total of 164/790 stabilizing places and 172/1027 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (507 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (104 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 674626 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 1
Probabilistic random walk after 674626 steps, saw 127998 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
[2025-06-04 17:00:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 196/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 593/790 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/790 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1027/1817 variables, 790/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1817 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1817 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1817/1817 variables, and 795 constraints, problems are : Problem set: 0 solved, 1 unsolved in 988 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 790/790 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 196/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 593/790 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/790 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1027/1817 variables, 790/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1817 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1817 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1817 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1817/1817 variables, and 796 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1122 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2119ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 68 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=68 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-03b-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-03b-LTLFireability-09 finished in 69650 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)))'
Support contains 1 out of 858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 858/858 places, 1097/1097 transitions.
Graph (trivial) has 850 edges and 858 vertex of which 68 / 858 are part of one of the 12 SCC in 2 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 591 transitions
Trivial Post-agglo rules discarded 591 transitions
Performed 591 trivial Post agglomeration. Transition count delta: 591
Iterating post reduction 0 with 591 rules applied. Total rules applied 592 place count 801 transition count 441
Reduce places removed 591 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 604 rules applied. Total rules applied 1196 place count 210 transition count 428
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1202 place count 204 transition count 428
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 1202 place count 204 transition count 379
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1300 place count 155 transition count 379
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1309 place count 146 transition count 370
Iterating global reduction 3 with 9 rules applied. Total rules applied 1318 place count 146 transition count 370
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1324 place count 140 transition count 364
Iterating global reduction 3 with 6 rules applied. Total rules applied 1330 place count 140 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1331 place count 140 transition count 363
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1333 place count 138 transition count 361
Iterating global reduction 4 with 2 rules applied. Total rules applied 1335 place count 138 transition count 361
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1337 place count 136 transition count 359
Iterating global reduction 4 with 2 rules applied. Total rules applied 1339 place count 136 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1340 place count 136 transition count 358
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1396 place count 108 transition count 329
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1416 place count 88 transition count 183
Iterating global reduction 5 with 20 rules applied. Total rules applied 1436 place count 88 transition count 183
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1446 place count 88 transition count 173
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1458 place count 76 transition count 157
Iterating global reduction 6 with 12 rules applied. Total rules applied 1470 place count 76 transition count 157
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1482 place count 64 transition count 141
Iterating global reduction 6 with 12 rules applied. Total rules applied 1494 place count 64 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1499 place count 64 transition count 136
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1515 place count 56 transition count 143
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1516 place count 55 transition count 135
Iterating global reduction 7 with 1 rules applied. Total rules applied 1517 place count 55 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1518 place count 55 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1522 place count 55 transition count 130
Applied a total of 1522 rules in 63 ms. Remains 55 /858 variables (removed 803) and now considering 130/1097 (removed 967) transitions.
[2025-06-04 17:00:32] [INFO ] Flow matrix only has 125 transitions (discarded 5 similar events)
// Phase 1: matrix 125 rows 55 cols
[2025-06-04 17:00:32] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:00:32] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-04 17:00:32] [INFO ] Flow matrix only has 125 transitions (discarded 5 similar events)
[2025-06-04 17:00:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:00:32] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 17:00:33] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 17:00:33] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
[2025-06-04 17:00:33] [INFO ] Flow matrix only has 125 transitions (discarded 5 similar events)
[2025-06-04 17:00:33] [INFO ] Invariant cache hit.
[2025-06-04 17:00:33] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:34] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:34] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:34] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:34] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:34] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:34] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:34] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:35] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:35] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:35] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:35] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:35] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 124/179 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 14/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:37] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 1/180 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 0/180 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 85 constraints, problems are : Problem set: 0 solved, 113 unsolved in 10663 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:44] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:00:45] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 124/179 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 113/199 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 1/180 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (OVERLAPS) 0/180 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 200 constraints, problems are : Problem set: 0 solved, 113 unsolved in 19024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29725ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 29726ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/858 places, 130/1097 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30100 ms. Remains : 55/858 places, 130/1097 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-10
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-10 finished in 30162 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)&&F(G(p1)))))'
Support contains 5 out of 858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 858/858 places, 1097/1097 transitions.
Graph (trivial) has 846 edges and 858 vertex of which 68 / 858 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 588 place count 801 transition count 445
Reduce places removed 587 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 600 rules applied. Total rules applied 1188 place count 214 transition count 432
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1194 place count 208 transition count 432
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1194 place count 208 transition count 384
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1290 place count 160 transition count 384
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1300 place count 150 transition count 374
Iterating global reduction 3 with 10 rules applied. Total rules applied 1310 place count 150 transition count 374
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1316 place count 144 transition count 368
Iterating global reduction 3 with 6 rules applied. Total rules applied 1322 place count 144 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1323 place count 144 transition count 367
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1325 place count 142 transition count 365
Iterating global reduction 4 with 2 rules applied. Total rules applied 1327 place count 142 transition count 365
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1329 place count 140 transition count 363
Iterating global reduction 4 with 2 rules applied. Total rules applied 1331 place count 140 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1332 place count 140 transition count 362
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1388 place count 112 transition count 333
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1407 place count 93 transition count 196
Iterating global reduction 5 with 19 rules applied. Total rules applied 1426 place count 93 transition count 196
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1436 place count 93 transition count 186
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1447 place count 82 transition count 172
Iterating global reduction 6 with 11 rules applied. Total rules applied 1458 place count 82 transition count 172
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1469 place count 71 transition count 158
Iterating global reduction 6 with 11 rules applied. Total rules applied 1480 place count 71 transition count 158
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1485 place count 71 transition count 153
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
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 1503 place count 62 transition count 160
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1504 place count 61 transition count 150
Iterating global reduction 7 with 1 rules applied. Total rules applied 1505 place count 61 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1506 place count 61 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1510 place count 61 transition count 145
Applied a total of 1510 rules in 42 ms. Remains 61 /858 variables (removed 797) and now considering 145/1097 (removed 952) transitions.
[2025-06-04 17:01:02] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
// Phase 1: matrix 139 rows 61 cols
[2025-06-04 17:01:02] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:01:02] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-04 17:01:02] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2025-06-04 17:01:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:01:03] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 17:01:03] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 17:01:03] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2025-06-04 17:01:03] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2025-06-04 17:01:03] [INFO ] Invariant cache hit.
[2025-06-04 17:01:03] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:04] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:04] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:04] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:04] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:04] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:04] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:04] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:04] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:05] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:05] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 138/199 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 1/200 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 88 constraints, problems are : Problem set: 0 solved, 128 unsolved in 12777 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 138/199 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 128/215 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:19] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:21] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 1/200 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:32] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:43] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 5 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/200 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/200 variables, and 220 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42826ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 42826ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/858 places, 145/1097 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43139 ms. Remains : 61/858 places, 145/1097 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-11
Product exploration explored 100000 steps with 95 reset in 119 ms.
Product exploration explored 100000 steps with 5264 reset in 110 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 30547 steps (4145 resets) in 98 ms. (308 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 145/145 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2025-06-04 17:01:46] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2025-06-04 17:01:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:01:47] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 17:01:47] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2025-06-04 17:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:01:47] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 17:01:47] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 17:01:47] [INFO ] Redundant transitions in 2 ms returned []
Running 128 sub problems to find dead transitions.
[2025-06-04 17:01:47] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2025-06-04 17:01:47] [INFO ] Invariant cache hit.
[2025-06-04 17:01:47] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:48] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:48] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:48] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:48] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:48] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:48] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:49] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:49] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:49] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:01:49] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 138/199 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 1/200 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 88 constraints, problems are : Problem set: 0 solved, 128 unsolved in 13533 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 138/199 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 128/215 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:02:04] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:02:05] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 1/200 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:02:16] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:02:27] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 4 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/200 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/200 variables, and 220 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43574ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 43574ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43796 ms. Remains : 61/61 places, 145/145 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (5409 resets) in 111 ms. (357 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (614 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2025-06-04 17:02:31] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2025-06-04 17:02:31] [INFO ] Invariant cache hit.
[2025-06-04 17:02:31] [INFO ] State equation strengthened by 15 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) 55/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/196 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/199 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/200 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/200 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 15/15 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) 55/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/196 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/199 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/200 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 381ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering criterion allowed to conclude after 3638 steps with 509 reset in 9 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-11 finished in 89300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 2 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1097/1097 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 847 transition count 1086
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 847 transition count 1086
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 838 transition count 1077
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 838 transition count 1077
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 829 transition count 1068
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 829 transition count 1068
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 821 transition count 1060
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 821 transition count 1060
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 815 transition count 1054
Iterating global reduction 0 with 6 rules applied. Total rules applied 86 place count 815 transition count 1054
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 810 transition count 1049
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 810 transition count 1049
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 100 place count 806 transition count 1045
Iterating global reduction 0 with 4 rules applied. Total rules applied 104 place count 806 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 107 place count 803 transition count 1042
Iterating global reduction 0 with 3 rules applied. Total rules applied 110 place count 803 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 801 transition count 1040
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 801 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 799 transition count 1038
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 799 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 797 transition count 1036
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 797 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 795 transition count 1034
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 793 transition count 1032
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 793 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 132 place count 791 transition count 1030
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 791 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 791 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 790 transition count 1028
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 790 transition count 1028
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 138 place count 790 transition count 1027
Applied a total of 138 rules in 824 ms. Remains 790 /858 variables (removed 68) and now considering 1027/1097 (removed 70) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2025-06-04 17:02:32] [INFO ] Computed 5 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:02:33] [INFO ] Implicit Places using invariants in 794 ms returned []
[2025-06-04 17:02:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:02:35] [INFO ] Implicit Places using invariants and state equation in 1313 ms returned []
Implicit Place search using SMT with State Equation took 2108 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2025-06-04 17:02:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 789/1817 variables, and 0 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 789/1817 variables, and 0 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 0/1026 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60294ms problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 60295ms
Starting structural reductions in LTL mode, iteration 1 : 790/858 places, 1027/1097 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63231 ms. Remains : 790/858 places, 1027/1097 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-15
Stuttering criterion allowed to conclude after 146 steps with 1 reset in 1 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-15 finished in 63431 ms.
All properties solved by simple procedures.
Total runtime 903017 ms.
BK_STOP 1749056615596
--------------------
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="StigmergyCommit-PT-03b"
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 StigmergyCommit-PT-03b, 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-174903490600028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-03b.tgz
mv StigmergyCommit-PT-03b 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 '
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 ;