About the Execution of ITS-Tools for IBMB2S565S3960-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 54181.00 | 0.00 | 0.00 | FFFFFFFTTFFFFFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422500355.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 IBMB2S565S3960-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422500355
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 127K May 29 14:32 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 IBMB2S565S3960-PT-none-LTLCardinality-00
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-01
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-02
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-03
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-04
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-05
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-06
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-07
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-08
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-09
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-10
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-11
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-12
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-13
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-14
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748836111896
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBMB2S565S3960-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 03:48:33] [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-02 03:48:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:48:33] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2025-06-02 03:48:33] [INFO ] Transformed 273 places.
[2025-06-02 03:48:33] [INFO ] Transformed 179 transitions.
[2025-06-02 03:48:33] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 179/179 transitions.
Ensure Unique test removed 89 places
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 175 transition count 178
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 113 place count 161 transition count 164
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 161 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 160 transition count 163
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 160 transition count 163
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 159 transition count 162
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 159 transition count 162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 158 transition count 161
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 158 transition count 161
Applied a total of 133 rules in 77 ms. Remains 158 /273 variables (removed 115) and now considering 161/179 (removed 18) transitions.
// Phase 1: matrix 161 rows 158 cols
[2025-06-02 03:48:33] [INFO ] Computed 8 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:34] [INFO ] Implicit Places using invariants in 237 ms returned [126]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 295 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/273 places, 161/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 392 ms. Remains : 157/273 places, 161/179 transitions.
Support contains 33 out of 157 places after structural reductions.
[2025-06-02 03:48:34] [INFO ] Flatten gal took : 33 ms
[2025-06-02 03:48:34] [INFO ] Flatten gal took : 13 ms
[2025-06-02 03:48:34] [INFO ] Input system was already deterministic with 161 transitions.
RANDOM walk for 40002 steps (164 resets) in 1058 ms. (37 steps per ms) remains 4/28 properties
BEST_FIRST walk for 40004 steps (27 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (35 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (44 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (23 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
// Phase 1: matrix 161 rows 157 cols
[2025-06-02 03:48:35] [INFO ] Computed 7 invariants in 4 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 16/66 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 7 (OVERLAPS) 30/96 variables, 15/52 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/100 variables, 2/54 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 21/121 variables, 12/66 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 17/138 variables, 8/74 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/138 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 21/159 variables, 10/84 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/159 variables, 1/85 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/159 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 25/184 variables, 11/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/184 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 25/209 variables, 12/108 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/209 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 30/239 variables, 15/123 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/239 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 23/262 variables, 12/135 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/262 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 13/275 variables, 8/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/275 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 9/284 variables, 4/147 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/284 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 11/295 variables, 5/152 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/295 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 10/305 variables, 5/157 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/305 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 11/316 variables, 5/162 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/316 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 2/318 variables, 2/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/318 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 0/318 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 164 constraints, problems are : Problem set: 1 solved, 3 unsolved in 427 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/47 variables, 24/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/58 variables, 6/35 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 2/37 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 11/69 variables, 5/42 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 18/87 variables, 6/48 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/87 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 32/119 variables, 16/64 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 5/124 variables, 2/66 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/124 variables, 2/68 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/124 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 28/152 variables, 15/83 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/152 variables, 1/84 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/152 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 29/181 variables, 13/97 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/181 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 26/207 variables, 13/110 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/207 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 31/238 variables, 15/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/238 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 24/262 variables, 13/138 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/262 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 13/275 variables, 8/146 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/275 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 9/284 variables, 4/150 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/284 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 11/295 variables, 5/155 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/295 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 10/305 variables, 5/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/305 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 11/316 variables, 5/165 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 2/318 variables, 2/167 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/318 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 0/318 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 167 constraints, problems are : Problem set: 1 solved, 3 unsolved in 994 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1465ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 319 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=63 )
Parikh walk visited 3 properties in 10 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 68 stabilizing places and 71 stable transitions
Graph (complete) has 185 edges and 157 vertex of which 106 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0 U p1)&&G(p2)))||F(!p1)))'
Support contains 3 out of 157 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 161/161 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 154 transition count 161
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 148 transition count 155
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 148 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 148 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 147 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 147 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 146 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 146 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 145 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 145 transition count 151
Applied a total of 22 rules in 14 ms. Remains 145 /157 variables (removed 12) and now considering 151/161 (removed 10) transitions.
// Phase 1: matrix 151 rows 145 cols
[2025-06-02 03:48:37] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:37] [INFO ] Implicit Places using invariants in 50 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/157 places, 151/161 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 150
Applied a total of 2 rules in 6 ms. Remains 143 /144 variables (removed 1) and now considering 150/151 (removed 1) transitions.
// Phase 1: matrix 150 rows 143 cols
[2025-06-02 03:48:37] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:37] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-02 03:48:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:37] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 143/157 places, 150/161 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 513 ms. Remains : 143/157 places, 150/161 transitions.
Stuttering acceptance computed with spot in 282 ms :[p1, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-00
Stuttering criterion allowed to conclude after 968 steps with 4 reset in 11 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-00 finished in 948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 161/161 transitions.
Graph (trivial) has 135 edges and 157 vertex of which 20 / 157 are part of one of the 1 SCC in 2 ms
Free SCC test removed 19 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 164 edges and 138 vertex of which 87 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 46 output transitions
Drop transitions (Output transitions of discarded places.) removed 46 transitions
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 85 transition count 47
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 38 transition count 47
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 96 place count 38 transition count 36
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 118 place count 27 transition count 36
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 140 place count 15 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 144 place count 15 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 148 place count 13 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 152 place count 11 transition count 21
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 154 place count 11 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 157 place count 11 transition count 16
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 159 place count 10 transition count 15
Applied a total of 159 rules in 26 ms. Remains 10 /157 variables (removed 147) and now considering 15/161 (removed 146) transitions.
// Phase 1: matrix 15 rows 10 cols
[2025-06-02 03:48:37] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:37] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-02 03:48:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:48:37] [INFO ] Implicit Places using invariants and state equation in 26 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/157 places, 13/161 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 74 ms. Remains : 9/157 places, 13/161 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-02
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-02 finished in 132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (p1&&X(F(!p0)))) U p2))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 161/161 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 154 transition count 161
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 146 transition count 153
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 146 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 146 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 145 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 145 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 144 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 143 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 143 transition count 149
Applied a total of 26 rules in 19 ms. Remains 143 /157 variables (removed 14) and now considering 149/161 (removed 12) transitions.
// Phase 1: matrix 149 rows 143 cols
[2025-06-02 03:48:38] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:38] [INFO ] Implicit Places using invariants in 507 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 508 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/157 places, 149/161 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 148
Applied a total of 2 rules in 5 ms. Remains 141 /142 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 141 cols
[2025-06-02 03:48:38] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:38] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 03:48:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:38] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/157 places, 148/161 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 813 ms. Remains : 141/157 places, 148/161 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-04
Stuttering criterion allowed to conclude after 268 steps with 0 reset in 2 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-04 finished in 984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))&&F((G(F(!p2))||(F(!p2)&&X(p3))))))'
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 161/161 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 155 transition count 161
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 149 transition count 155
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 149 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 149 transition count 154
Applied a total of 15 rules in 10 ms. Remains 149 /157 variables (removed 8) and now considering 154/161 (removed 7) transitions.
// Phase 1: matrix 154 rows 149 cols
[2025-06-02 03:48:38] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:39] [INFO ] Implicit Places using invariants in 75 ms returned [137]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 148/157 places, 154/161 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 147 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 147 transition count 153
Applied a total of 2 rules in 4 ms. Remains 147 /148 variables (removed 1) and now considering 153/154 (removed 1) transitions.
// Phase 1: matrix 153 rows 147 cols
[2025-06-02 03:48:39] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:39] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-02 03:48:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:39] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/157 places, 153/161 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 324 ms. Remains : 147/157 places, 153/161 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1)), (AND (NOT p3) p2), p2, (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-05
Stuttering criterion allowed to conclude after 238 steps with 0 reset in 2 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-05 finished in 607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&(p2||X(p0)))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 161/161 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 154 transition count 161
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 147 transition count 154
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 147 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 147 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 146 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 146 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 145 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 145 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 144 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 144 transition count 150
Applied a total of 24 rules in 17 ms. Remains 144 /157 variables (removed 13) and now considering 150/161 (removed 11) transitions.
// Phase 1: matrix 150 rows 144 cols
[2025-06-02 03:48:39] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:39] [INFO ] Implicit Places using invariants in 84 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/157 places, 150/161 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 149
Applied a total of 2 rules in 4 ms. Remains 142 /143 variables (removed 1) and now considering 149/150 (removed 1) transitions.
// Phase 1: matrix 149 rows 142 cols
[2025-06-02 03:48:39] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:39] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 03:48:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:39] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/157 places, 149/161 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 309 ms. Remains : 142/157 places, 149/161 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-06 finished in 499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(p2&&(p0 U (p1||G(p0)))))))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 161/161 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 154 transition count 161
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 147 transition count 154
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 147 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 147 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 146 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 146 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 145 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 145 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 144 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 144 transition count 150
Applied a total of 24 rules in 10 ms. Remains 144 /157 variables (removed 13) and now considering 150/161 (removed 11) transitions.
// Phase 1: matrix 150 rows 144 cols
[2025-06-02 03:48:40] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:40] [INFO ] Implicit Places using invariants in 75 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/157 places, 150/161 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 149
Applied a total of 2 rules in 3 ms. Remains 142 /143 variables (removed 1) and now considering 149/150 (removed 1) transitions.
// Phase 1: matrix 149 rows 142 cols
[2025-06-02 03:48:40] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:40] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-02 03:48:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:40] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/157 places, 149/161 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 292 ms. Remains : 142/157 places, 149/161 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-08
Product exploration explored 100000 steps with 656 reset in 355 ms.
Product exploration explored 100000 steps with 656 reset in 468 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 165 edges and 142 vertex of which 98 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 185 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40005 steps (172 resets) in 559 ms. (71 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (26 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (25 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
[2025-06-02 03:48:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/37 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/67 variables, 13/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 31/98 variables, 15/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/122 variables, 14/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/141 variables, 9/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/141 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/161 variables, 10/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/180 variables, 9/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/180 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/196 variables, 8/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/196 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 14/210 variables, 7/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/210 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 12/222 variables, 7/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/222 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/240 variables, 3/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/240 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 21/261 variables, 20/128 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/261 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 16/277 variables, 8/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/277 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/281 variables, 1/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/281 variables, 1/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/281 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 7/288 variables, 6/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/288 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 3/291 variables, 2/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/291 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/291 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 146 constraints, problems are : Problem set: 1 solved, 1 unsolved in 175 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 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: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/37 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/67 variables, 13/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/98 variables, 15/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/122 variables, 14/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/141 variables, 9/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 20/161 variables, 10/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/161 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 19/180 variables, 9/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/180 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/196 variables, 8/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/196 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 14/210 variables, 7/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/210 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 12/222 variables, 7/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/222 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/240 variables, 3/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/240 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 21/261 variables, 20/129 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/261 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 16/277 variables, 8/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/277 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 4/281 variables, 1/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/281 variables, 1/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/281 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 7/288 variables, 6/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/288 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 3/291 variables, 2/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/291 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 0/291 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 147 constraints, problems are : Problem set: 1 solved, 1 unsolved in 337 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 519ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 181 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=60 )
Parikh walk visited 1 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 15 factoid took 374 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 149/149 transitions.
Graph (complete) has 165 edges and 142 vertex of which 98 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 97 transition count 55
Reduce places removed 53 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 56 rules applied. Total rules applied 110 place count 44 transition count 52
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 113 place count 41 transition count 52
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 113 place count 41 transition count 40
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 137 place count 29 transition count 40
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 153 place count 21 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 155 place count 21 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
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 161 place count 18 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 166 place count 18 transition count 27
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 168 place count 17 transition count 26
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 172 place count 17 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 16 transition count 25
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 174 place count 15 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 175 place count 14 transition count 24
Applied a total of 175 rules in 16 ms. Remains 14 /142 variables (removed 128) and now considering 24/149 (removed 125) transitions.
// Phase 1: matrix 24 rows 14 cols
[2025-06-02 03:48:43] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:43] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-02 03:48:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:43] [INFO ] Implicit Places using invariants and state equation in 32 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/142 places, 24/149 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 74 ms. Remains : 13/142 places, 24/149 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1))))]
Knowledge based reduction with 15 factoid took 351 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40010 steps (1962 resets) in 89 ms. (444 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (352 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (344 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
// Phase 1: matrix 24 rows 13 cols
[2025-06-02 03:48:44] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/33 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/37 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 13 constraints, problems are : Problem set: 1 solved, 1 unsolved in 31 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 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: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/33 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/37 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 14 constraints, problems are : Problem set: 1 solved, 1 unsolved in 48 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 16 factoid took 633 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 15153 reset in 96 ms.
Product exploration explored 100000 steps with 15134 reset in 111 ms.
Built C files in :
/tmp/ltsmin9821111810433299436
[2025-06-02 03:48:46] [INFO ] Computing symmetric may disable matrix : 24 transitions.
[2025-06-02 03:48:46] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:48:46] [INFO ] Computing symmetric may enable matrix : 24 transitions.
[2025-06-02 03:48:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:48:46] [INFO ] Computing Do-Not-Accords matrix : 24 transitions.
[2025-06-02 03:48:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:48:46] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9821111810433299436
Running compilation step : cd /tmp/ltsmin9821111810433299436;'/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 488 ms.
Running link step : cd /tmp/ltsmin9821111810433299436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin9821111810433299436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12532730462830413457.hoa' '--buchi-type=spotba'
LTSmin run took 171 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-08 finished in 6731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(X(X(G(p0)))||(p0 U (p1||G(p0))))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 161/161 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 154 transition count 161
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 147 transition count 154
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 147 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 146 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 146 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 145 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 145 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 144 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 144 transition count 151
Applied a total of 23 rules in 9 ms. Remains 144 /157 variables (removed 13) and now considering 151/161 (removed 10) transitions.
// Phase 1: matrix 151 rows 144 cols
[2025-06-02 03:48:46] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:46] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-02 03:48:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:47] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-02 03:48:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 151/294 variables, 143/148 constraints. Problems are: Problem set: 0 solved, 150 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 1/295 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 149 constraints, problems are : Problem set: 0 solved, 150 unsolved in 6897 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 151/294 variables, 143/148 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 150/298 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 1/295 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 299 constraints, problems are : Problem set: 0 solved, 150 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36963ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 36964ms
Starting structural reductions in LTL mode, iteration 1 : 144/157 places, 151/161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37198 ms. Remains : 144/157 places, 151/161 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-09 finished in 37478 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 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 161/161 transitions.
Graph (trivial) has 135 edges and 157 vertex of which 20 / 157 are part of one of the 1 SCC in 0 ms
Free SCC test removed 19 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 164 edges and 138 vertex of which 87 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.0 ms
Discarding 51 places :
Also discarding 46 output transitions
Drop transitions (Output transitions of discarded places.) removed 46 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 84 transition count 48
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 39 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 38 transition count 47
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 94 place count 38 transition count 35
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 118 place count 26 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 25 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 25 transition count 34
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 132 place count 19 transition count 28
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 135 place count 19 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
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 141 place count 16 transition count 24
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 144 place count 16 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 146 place count 16 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 15 transition count 18
Ensure Unique test removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 149 place count 13 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 151 place count 11 transition count 16
Applied a total of 151 rules in 9 ms. Remains 11 /157 variables (removed 146) and now considering 16/161 (removed 145) transitions.
// Phase 1: matrix 16 rows 11 cols
[2025-06-02 03:49:24] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-02 03:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:49:24] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/157 places, 16/161 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 10/157 places, 16/161 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-10
Stuttering criterion allowed to conclude after 128 steps with 5 reset in 5 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-10 finished in 154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 161/161 transitions.
Graph (trivial) has 137 edges and 157 vertex of which 20 / 157 are part of one of the 1 SCC in 0 ms
Free SCC test removed 19 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 164 edges and 138 vertex of which 87 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.0 ms
Discarding 51 places :
Also discarding 46 output transitions
Drop transitions (Output transitions of discarded places.) removed 46 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 84 transition count 47
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 38 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 37 transition count 46
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 96 place count 37 transition count 35
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 118 place count 26 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 25 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 25 transition count 34
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 136 place count 17 transition count 26
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 139 place count 17 transition count 23
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 145 place count 14 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 148 place count 14 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 156 place count 14 transition count 22
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 5 with 2 rules applied. Total rules applied 158 place count 13 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 159 place count 12 transition count 20
Ensure Unique test removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 161 place count 10 transition count 20
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 9 transition count 14
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 164 place count 8 transition count 13
Applied a total of 164 rules in 15 ms. Remains 8 /157 variables (removed 149) and now considering 13/161 (removed 148) transitions.
// Phase 1: matrix 13 rows 8 cols
[2025-06-02 03:49:24] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-02 03:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:49:24] [INFO ] Implicit Places using invariants and state equation in 23 ms returned [3]
Discarding 1 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/157 places, 11/161 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66 ms. Remains : 7/157 places, 11/161 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-11
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-11 finished in 137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 161/161 transitions.
Graph (complete) has 185 edges and 157 vertex of which 106 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.0 ms
Discarding 51 places :
Also discarding 46 output transitions
Drop transitions (Output transitions of discarded places.) removed 46 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 103 transition count 56
Reduce places removed 58 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 45 transition count 53
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 123 place count 42 transition count 53
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 123 place count 42 transition count 40
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 149 place count 29 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 28 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 28 transition count 39
Performed 9 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 169 place count 19 transition count 29
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 172 place count 19 transition count 26
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 174 place count 18 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 175 place count 18 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 181 place count 15 transition count 24
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 184 place count 15 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 186 place count 14 transition count 19
Ensure Unique test removed 2 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 188 place count 12 transition count 19
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 190 place count 10 transition count 17
Applied a total of 190 rules in 31 ms. Remains 10 /157 variables (removed 147) and now considering 17/161 (removed 144) transitions.
// Phase 1: matrix 17 rows 10 cols
[2025-06-02 03:49:24] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:24] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-02 03:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:24] [INFO ] Implicit Places using invariants and state equation in 31 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/157 places, 16/161 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 15
Applied a total of 1 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 9 cols
[2025-06-02 03:49:24] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:24] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-02 03:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:24] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/157 places, 15/161 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 135 ms. Remains : 9/157 places, 15/161 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-12
Stuttering criterion allowed to conclude after 185 steps with 18 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-12 finished in 222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 161/161 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 154 transition count 161
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 147 transition count 154
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 147 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 146 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 146 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 145 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 145 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 144 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 144 transition count 151
Applied a total of 23 rules in 11 ms. Remains 144 /157 variables (removed 13) and now considering 151/161 (removed 10) transitions.
// Phase 1: matrix 151 rows 144 cols
[2025-06-02 03:49:24] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:24] [INFO ] Implicit Places using invariants in 56 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/157 places, 151/161 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 150
Applied a total of 2 rules in 8 ms. Remains 142 /143 variables (removed 1) and now considering 150/151 (removed 1) transitions.
// Phase 1: matrix 150 rows 142 cols
[2025-06-02 03:49:24] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:24] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-02 03:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:25] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/157 places, 150/161 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 421 ms. Remains : 142/157 places, 150/161 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-13
Stuttering criterion allowed to conclude after 193 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-13 finished in 527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 161/161 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 154 transition count 161
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 146 transition count 153
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 146 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 146 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 145 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 145 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 144 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 143 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 143 transition count 149
Applied a total of 26 rules in 7 ms. Remains 143 /157 variables (removed 14) and now considering 149/161 (removed 12) transitions.
// Phase 1: matrix 149 rows 143 cols
[2025-06-02 03:49:25] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:25] [INFO ] Implicit Places using invariants in 82 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/157 places, 149/161 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 148
Applied a total of 2 rules in 3 ms. Remains 141 /142 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 141 cols
[2025-06-02 03:49:25] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:25] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 03:49:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:25] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/157 places, 148/161 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 401 ms. Remains : 141/157 places, 148/161 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 164 edges and 141 vertex of which 97 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.5 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Detected a total of 61/141 stabilizing places and 65/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-14 finished in 713 ms.
All properties solved by simple procedures.
Total runtime 52659 ms.
BK_STOP 1748836166077
--------------------
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="IBMB2S565S3960-PT-none"
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 IBMB2S565S3960-PT-none, 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 r114-tall-174876422500355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none 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 ;