About the Execution of ITS-Tools for ErlangenMainframeV0-PT-1105
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 160870.00 | 0.00 | 0.00 | TTTTTFTTTFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339700355.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 ErlangenMainframeV0-PT-1105, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339700355
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 58M
-rw-r--r-- 1 mcc users 7.0K Jun 6 09:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 6 09:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 6 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 6 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 12:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 12:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 12:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 12:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 6 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Jun 6 09:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Jun 6 09:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 12:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 12:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 57M Jun 5 20:08 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 ErlangenMainframeV0-PT-1105-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV0-PT-1105-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749368728459
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1105
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 07:45:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 07:45:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 07:45:31] [INFO ] Load time of PNML (sax parser for PT used): 2074 ms
[2025-06-08 07:45:32] [INFO ] Transformed 287 places.
[2025-06-08 07:45:32] [INFO ] Transformed 46948 transitions.
[2025-06-08 07:45:32] [INFO ] Found NUPN structural information;
[2025-06-08 07:45:32] [INFO ] Parsed PT model containing 287 places and 46948 transitions and 1182750 arcs in 2592 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 46948/46948 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 225 transition count 46886
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 225 transition count 46886
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 148 place count 201 transition count 46862
Iterating global reduction 0 with 24 rules applied. Total rules applied 172 place count 201 transition count 46862
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 182 place count 191 transition count 31437
Ensure Unique test removed 4 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 196 place count 187 transition count 31437
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 205 place count 178 transition count 589
Iterating global reduction 0 with 9 rules applied. Total rules applied 214 place count 178 transition count 589
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 215 place count 177 transition count 587
Iterating global reduction 0 with 1 rules applied. Total rules applied 216 place count 177 transition count 587
Applied a total of 216 rules in 8944 ms. Remains 177 /287 variables (removed 110) and now considering 587/46948 (removed 46361) transitions.
// Phase 1: matrix 587 rows 177 cols
[2025-06-08 07:45:42] [INFO ] Computed 24 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:45:42] [INFO ] Implicit Places using invariants in 614 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 648 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 176/287 places, 587/46948 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 587/587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9609 ms. Remains : 176/287 places, 587/46948 transitions.
Support contains 29 out of 176 places after structural reductions.
[2025-06-08 07:45:42] [INFO ] Flatten gal took : 159 ms
[2025-06-08 07:45:43] [INFO ] Flatten gal took : 90 ms
[2025-06-08 07:45:43] [INFO ] Input system was already deterministic with 587 transitions.
RANDOM walk for 40000 steps (8 resets) in 1261 ms. (31 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
// Phase 1: matrix 587 rows 176 cols
[2025-06-08 07:45:43] [INFO ] Computed 23 invariants in 15 ms
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) 11/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/85 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/176 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 587/763 variables, 176/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/763 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 763/763 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 176/176 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) 11/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/85 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Int declared 176/763 variables, and 23 constraints, problems are : Problem set: 1 solved, 0 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/176 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 513ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 30 stabilizing places and 30 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(p0)||F(G((X(G(p0))||p1)))))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 587/587 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 160 transition count 571
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 160 transition count 571
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 152 transition count 454
Ensure Unique test removed 2 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 150 transition count 454
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 144 transition count 216
Ensure Unique test removed 3 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 65 place count 141 transition count 216
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 70 place count 136 transition count 184
Iterating global reduction 0 with 5 rules applied. Total rules applied 75 place count 136 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 77 place count 134 transition count 180
Iterating global reduction 0 with 2 rules applied. Total rules applied 79 place count 134 transition count 180
Applied a total of 79 rules in 12 ms. Remains 134 /176 variables (removed 42) and now considering 180/587 (removed 407) transitions.
// Phase 1: matrix 180 rows 134 cols
[2025-06-08 07:45:44] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:45:44] [INFO ] Implicit Places using invariants in 62 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/176 places, 180/587 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 133/176 places, 180/587 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 15 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1105-LTLCardinality-00 finished in 653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(F(p1))))))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 587/587 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 158 transition count 569
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 158 transition count 569
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 147 transition count 442
Ensure Unique test removed 3 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 61 place count 144 transition count 442
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 68 place count 137 transition count 195
Ensure Unique test removed 3 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 134 transition count 195
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 130 transition count 179
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 130 transition count 179
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 128 transition count 175
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 128 transition count 175
Applied a total of 90 rules in 10 ms. Remains 128 /176 variables (removed 48) and now considering 175/587 (removed 412) transitions.
// Phase 1: matrix 175 rows 128 cols
[2025-06-08 07:45:45] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:45:45] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-08 07:45:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:45:45] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2025-06-08 07:45:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:46] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:46] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:46] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/303 variables, 128/148 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/303 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 148 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7101 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:52] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/303 variables, 128/149 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 174/323 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:54] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:54] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:54] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:54] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:54] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:54] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:54] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:54] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:55] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:55] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:55] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:55] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:55] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:55] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:55] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:55] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:55] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:55] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:55] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:55] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:56] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:58] [INFO ] Deduced a trap along path composed of 6 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:58] [INFO ] Deduced a trap along path composed of 11 places in 53 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:45:58] [INFO ] Deduced a trap along path composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 0/303 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 347 constraints, problems are : Problem set: 0 solved, 174 unsolved in 19865 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 27005ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 27008ms
Starting structural reductions in LTL mode, iteration 1 : 128/176 places, 175/587 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27171 ms. Remains : 128/176 places, 175/587 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLCardinality-03
Product exploration explored 100000 steps with 25000 reset in 71 ms.
Product exploration explored 100000 steps with 25000 reset in 70 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 25176 steps (5 resets) in 156 ms. (160 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 175/175 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2025-06-08 07:46:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:46:13] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-08 07:46:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:46:13] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2025-06-08 07:46:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:14] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:14] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:15] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/303 variables, 128/148 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/303 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 148 constraints, problems are : Problem set: 0 solved, 174 unsolved in 6810 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:21] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/303 variables, 128/149 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 174/323 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:22] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:22] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:22] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:22] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:22] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:22] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:22] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:22] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:22] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:23] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:23] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:23] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:23] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:23] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:23] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:23] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:23] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:23] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:23] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:23] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:23] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:26] [INFO ] Deduced a trap along path composed of 6 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:26] [INFO ] Deduced a trap along path composed of 11 places in 36 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:26] [INFO ] Deduced a trap along path composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 0/303 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 347 constraints, problems are : Problem set: 0 solved, 174 unsolved in 19163 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 25998ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 25999ms
Finished structural reductions in LTL mode , in 1 iterations and 26152 ms. Remains : 128/128 places, 175/175 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 12966 steps (2 resets) in 62 ms. (205 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 68 ms.
Product exploration explored 100000 steps with 25000 reset in 62 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 175/175 transitions.
Graph (trivial) has 103 edges and 128 vertex of which 6 / 128 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 125 transition count 172
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 11 place count 125 transition count 186
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 24 place count 125 transition count 186
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 119 transition count 180
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 119 transition count 180
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 79 place count 119 transition count 180
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 93 place count 105 transition count 147
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 107 place count 105 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 105 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 102 transition count 141
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 102 transition count 141
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 128 place count 102 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 101 transition count 180
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 101 transition count 180
Deduced a syphon composed of 57 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 2 with 37 rules applied. Total rules applied 167 place count 101 transition count 143
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 177 place count 91 transition count 133
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 187 place count 91 transition count 133
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 187 rules in 59 ms. Remains 91 /128 variables (removed 37) and now considering 133/175 (removed 42) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 07:46:41] [INFO ] Redundant transitions in 14 ms returned []
Running 131 sub problems to find dead transitions.
[2025-06-08 07:46:41] [INFO ] Flow matrix only has 116 transitions (discarded 17 similar events)
// Phase 1: matrix 116 rows 91 cols
[2025-06-08 07:46:41] [INFO ] Computed 17 invariants in 1 ms
[2025-06-08 07:46:41] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:41] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:41] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:42] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:42] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:42] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
Problem TDEAD65 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 17/34 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/34 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 115/206 variables, 91/125 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 16/141 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/141 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 1/207 variables, 1/142 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/142 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/142 constraints. Problems are: Problem set: 66 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 142 constraints, problems are : Problem set: 66 solved, 65 unsolved in 3514 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 91/91 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 48/91 variables, 17/17 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 17/34 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/34 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 115/206 variables, 91/125 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 16/141 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 65/206 constraints. Problems are: Problem set: 66 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:45] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:45] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:45] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:45] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 4/210 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/210 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 1/207 variables, 1/211 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/211 constraints. Problems are: Problem set: 66 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/207 variables, 0/211 constraints. Problems are: Problem set: 66 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 211 constraints, problems are : Problem set: 66 solved, 65 unsolved in 6316 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 91/91 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 65/131 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 9866ms problems are : Problem set: 66 solved, 65 unsolved
Search for dead transitions found 66 dead transitions in 9866ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 91/128 places, 67/175 transitions.
Graph (complete) has 332 edges and 91 vertex of which 44 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.4 ms
Discarding 47 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 44 /91 variables (removed 47) and now considering 67/67 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/128 places, 67/175 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9958 ms. Remains : 44/128 places, 67/175 transitions.
Built C files in :
/tmp/ltsmin14099117811162901605
[2025-06-08 07:46:51] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14099117811162901605
Running compilation step : cd /tmp/ltsmin14099117811162901605;'/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 379 ms.
Running link step : cd /tmp/ltsmin14099117811162901605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14099117811162901605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7978054048659022075.hoa' '--buchi-type=spotba'
LTSmin run took 263 ms.
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV0-PT-1105-LTLCardinality-03 finished in 66753 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 U (p1||X(((p2||X(X(p1))) U (p1&&(p2||X(X(p1)))))))))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 587/587 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 158 transition count 569
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 158 transition count 569
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 148 transition count 443
Ensure Unique test removed 3 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 59 place count 145 transition count 443
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 66 place count 138 transition count 196
Ensure Unique test removed 3 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 76 place count 135 transition count 196
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 131 transition count 180
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 131 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 129 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 129 transition count 176
Applied a total of 88 rules in 19 ms. Remains 129 /176 variables (removed 47) and now considering 176/587 (removed 411) transitions.
// Phase 1: matrix 176 rows 129 cols
[2025-06-08 07:46:51] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:46:51] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-08 07:46:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:46:52] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2025-06-08 07:46:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:53] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:53] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:53] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:53] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/305 variables, 129/150 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:55] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:46:55] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/305 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 152 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7912 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:00] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/305 variables, 129/153 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 175/328 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:02] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:02] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:02] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:02] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:02] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:02] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:02] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:02] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 8/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:05] [INFO ] Deduced a trap along path composed of 6 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:05] [INFO ] Deduced a trap along path composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:13] [INFO ] Deduced a trap along path composed of 6 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:13] [INFO ] Deduced a trap along path composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/305 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:17] [INFO ] Deduced a trap along path composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (OVERLAPS) 0/305 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 341 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 37950ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37951ms
Starting structural reductions in LTL mode, iteration 1 : 129/176 places, 176/587 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38197 ms. Remains : 129/176 places, 176/587 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1105-LTLCardinality-05 finished in 38387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 587/587 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 158 transition count 569
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 158 transition count 569
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 148 transition count 443
Ensure Unique test removed 3 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 59 place count 145 transition count 443
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 66 place count 138 transition count 196
Ensure Unique test removed 3 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 76 place count 135 transition count 196
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 130 transition count 178
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 130 transition count 178
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 128 transition count 174
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 128 transition count 174
Applied a total of 90 rules in 23 ms. Remains 128 /176 variables (removed 48) and now considering 174/587 (removed 413) transitions.
// Phase 1: matrix 174 rows 128 cols
[2025-06-08 07:47:30] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:47:30] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-08 07:47:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:47:30] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2025-06-08 07:47:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:31] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:31] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:31] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/302 variables, 128/148 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 0/302 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 148 constraints, problems are : Problem set: 0 solved, 173 unsolved in 6791 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/302 variables, 128/148 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 173/321 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:38] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:38] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:38] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:39] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:39] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:39] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 6/327 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:41] [INFO ] Deduced a trap along path composed of 6 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:41] [INFO ] Deduced a trap along path composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:47:49] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/302 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (OVERLAPS) 0/302 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 330 constraints, problems are : Problem set: 0 solved, 173 unsolved in 24492 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 31307ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 31308ms
Starting structural reductions in LTL mode, iteration 1 : 128/176 places, 174/587 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31484 ms. Remains : 128/176 places, 174/587 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 57 ms.
Product exploration explored 100000 steps with 33333 reset in 72 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1105-LTLCardinality-08 finished in 31777 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 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 587/587 transitions.
Graph (trivial) has 135 edges and 176 vertex of which 6 / 176 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 172 transition count 565
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 154 transition count 565
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 37 place count 154 transition count 551
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 65 place count 140 transition count 551
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 79 place count 126 transition count 528
Iterating global reduction 2 with 14 rules applied. Total rules applied 93 place count 126 transition count 528
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 126 transition count 527
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 94 place count 126 transition count 522
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 104 place count 121 transition count 522
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 120 transition count 458
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 120 transition count 458
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 119 transition count 330
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 119 transition count 330
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 212 place count 67 transition count 278
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 216 place count 63 transition count 155
Ensure Unique test removed 2 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 222 place count 61 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 224 place count 61 transition count 153
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 226 place count 59 transition count 105
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 59 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 232 place count 57 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 244 place count 57 transition count 100
Applied a total of 244 rules in 111 ms. Remains 57 /176 variables (removed 119) and now considering 100/587 (removed 487) transitions.
[2025-06-08 07:48:02] [INFO ] Flow matrix only has 80 transitions (discarded 20 similar events)
// Phase 1: matrix 80 rows 57 cols
[2025-06-08 07:48:02] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:48:02] [INFO ] Implicit Places using invariants in 63 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/176 places, 100/587 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 56/176 places, 100/587 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLCardinality-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1105-LTLCardinality-09 finished in 289 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 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 587/587 transitions.
Graph (trivial) has 137 edges and 176 vertex of which 6 / 176 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 172 transition count 565
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 154 transition count 565
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 37 place count 154 transition count 552
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 141 transition count 552
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 81 place count 123 transition count 525
Iterating global reduction 2 with 18 rules applied. Total rules applied 99 place count 123 transition count 525
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 123 transition count 524
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 100 place count 123 transition count 518
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 112 place count 117 transition count 518
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 116 place count 113 transition count 398
Ensure Unique test removed 3 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 123 place count 110 transition count 398
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 106 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 106 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 105 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 105 transition count 156
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
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 229 place count 57 transition count 108
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 233 place count 53 transition count 94
Ensure Unique test removed 3 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 240 place count 50 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 241 place count 50 transition count 93
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 244 place count 47 transition count 79
Iterating global reduction 4 with 3 rules applied. Total rules applied 247 place count 47 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 249 place count 46 transition count 78
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 255 place count 43 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 270 place count 43 transition count 74
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 271 place count 43 transition count 74
Applied a total of 271 rules in 61 ms. Remains 43 /176 variables (removed 133) and now considering 74/587 (removed 513) transitions.
[2025-06-08 07:48:02] [INFO ] Flow matrix only has 53 transitions (discarded 21 similar events)
// Phase 1: matrix 53 rows 43 cols
[2025-06-08 07:48:02] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:48:02] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-08 07:48:02] [INFO ] Flow matrix only has 53 transitions (discarded 21 similar events)
[2025-06-08 07:48:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:48:02] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 07:48:02] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 07:48:02] [INFO ] Redundant transitions in 13 ms returned []
Running 72 sub problems to find dead transitions.
[2025-06-08 07:48:02] [INFO ] Flow matrix only has 53 transitions (discarded 21 similar events)
[2025-06-08 07:48:02] [INFO ] Invariant cache hit.
[2025-06-08 07:48:02] [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/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 52/95 variables, 43/60 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 1/96 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 75 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1406 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 43/43 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 52/95 variables, 43/60 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 72/146 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 1/96 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 147 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1958 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 43/43 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3375ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3380ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/176 places, 74/587 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3540 ms. Remains : 43/176 places, 74/587 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLCardinality-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1105-LTLCardinality-10 finished in 3633 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 3 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 587/587 transitions.
Graph (trivial) has 136 edges and 176 vertex of which 6 / 176 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 172 transition count 565
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 154 transition count 565
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 37 place count 154 transition count 551
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 65 place count 140 transition count 551
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 81 place count 124 transition count 526
Iterating global reduction 2 with 16 rules applied. Total rules applied 97 place count 124 transition count 526
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 124 transition count 525
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 98 place count 124 transition count 520
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 108 place count 119 transition count 520
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 116 transition count 408
Ensure Unique test removed 2 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 116 place count 114 transition count 408
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 111 transition count 184
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 111 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 110 transition count 182
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 110 transition count 182
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 222 place count 61 transition count 133
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 225 place count 58 transition count 114
Ensure Unique test removed 2 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 230 place count 56 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 231 place count 56 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 54 transition count 89
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 54 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 241 place count 51 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 255 place count 51 transition count 86
Applied a total of 255 rules in 55 ms. Remains 51 /176 variables (removed 125) and now considering 86/587 (removed 501) transitions.
[2025-06-08 07:48:05] [INFO ] Flow matrix only has 60 transitions (discarded 26 similar events)
// Phase 1: matrix 60 rows 51 cols
[2025-06-08 07:48:05] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:48:05] [INFO ] Implicit Places using invariants in 43 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/176 places, 86/587 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 50/176 places, 86/587 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLCardinality-11
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1105-LTLCardinality-11 finished in 182 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 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 587/587 transitions.
Graph (trivial) has 140 edges and 176 vertex of which 6 / 176 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 172 transition count 564
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 153 transition count 564
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 39 place count 153 transition count 550
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 67 place count 139 transition count 550
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 85 place count 121 transition count 523
Iterating global reduction 2 with 18 rules applied. Total rules applied 103 place count 121 transition count 523
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 121 transition count 522
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 104 place count 121 transition count 516
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 116 place count 115 transition count 516
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 120 place count 111 transition count 396
Ensure Unique test removed 3 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 127 place count 108 transition count 396
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 131 place count 104 transition count 156
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 104 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 103 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 103 transition count 154
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 231 place count 56 transition count 107
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 236 place count 51 transition count 81
Ensure Unique test removed 3 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 244 place count 48 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 246 place count 48 transition count 79
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 249 place count 45 transition count 72
Iterating global reduction 4 with 3 rules applied. Total rules applied 252 place count 45 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 254 place count 44 transition count 71
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 260 place count 41 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 276 place count 41 transition count 62
Applied a total of 276 rules in 51 ms. Remains 41 /176 variables (removed 135) and now considering 62/587 (removed 525) transitions.
[2025-06-08 07:48:06] [INFO ] Flow matrix only has 42 transitions (discarded 20 similar events)
// Phase 1: matrix 42 rows 41 cols
[2025-06-08 07:48:06] [INFO ] Computed 17 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:48:06] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-08 07:48:06] [INFO ] Flow matrix only has 42 transitions (discarded 20 similar events)
[2025-06-08 07:48:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 07:48:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-08 07:48:06] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 07:48:06] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-08 07:48:06] [INFO ] Flow matrix only has 42 transitions (discarded 20 similar events)
[2025-06-08 07:48:06] [INFO ] Invariant cache hit.
[2025-06-08 07:48:06] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/58 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/83 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/83 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 68 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1113 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 41/41 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/58 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 60/127 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:48:07] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 1/83 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/83 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 129 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1920 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 41/41 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3041ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3042ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/176 places, 62/587 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3177 ms. Remains : 41/176 places, 62/587 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1105-LTLCardinality-14
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1105-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1105-LTLCardinality-14 finished in 3218 ms.
All properties solved by simple procedures.
Total runtime 159538 ms.
BK_STOP 1749368889329
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ErlangenMainframeV0-PT-1105"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV0-PT-1105, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339700355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-1105.tgz
mv ErlangenMainframeV0-PT-1105 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;