Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422500347.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 IBM703-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-174876422500347
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K 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 109K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 203K 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 IBM703-PT-none-LTLCardinality-00
FORMULA_NAME IBM703-PT-none-LTLCardinality-01
FORMULA_NAME IBM703-PT-none-LTLCardinality-02
FORMULA_NAME IBM703-PT-none-LTLCardinality-03
FORMULA_NAME IBM703-PT-none-LTLCardinality-04
FORMULA_NAME IBM703-PT-none-LTLCardinality-05
FORMULA_NAME IBM703-PT-none-LTLCardinality-06
FORMULA_NAME IBM703-PT-none-LTLCardinality-07
FORMULA_NAME IBM703-PT-none-LTLCardinality-08
FORMULA_NAME IBM703-PT-none-LTLCardinality-09
FORMULA_NAME IBM703-PT-none-LTLCardinality-10
FORMULA_NAME IBM703-PT-none-LTLCardinality-11
FORMULA_NAME IBM703-PT-none-LTLCardinality-12
FORMULA_NAME IBM703-PT-none-LTLCardinality-13
FORMULA_NAME IBM703-PT-none-LTLCardinality-14
FORMULA_NAME IBM703-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748835655527

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM703-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 03:40:57] [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:40:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:40:57] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2025-06-02 03:40:57] [INFO ] Transformed 262 places.
[2025-06-02 03:40:57] [INFO ] Transformed 284 transitions.
[2025-06-02 03:40:57] [INFO ] Found NUPN structural information;
[2025-06-02 03:40:57] [INFO ] Parsed PT model containing 262 places and 284 transitions and 572 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA IBM703-PT-none-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 256 transition count 284
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 33 place count 229 transition count 257
Iterating global reduction 1 with 27 rules applied. Total rules applied 60 place count 229 transition count 257
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 70 place count 219 transition count 247
Iterating global reduction 1 with 10 rules applied. Total rules applied 80 place count 219 transition count 247
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 87 place count 212 transition count 240
Iterating global reduction 1 with 7 rules applied. Total rules applied 94 place count 212 transition count 240
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 97 place count 209 transition count 237
Iterating global reduction 1 with 3 rules applied. Total rules applied 100 place count 209 transition count 237
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 206 transition count 234
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 206 transition count 234
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 203 transition count 231
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 203 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 201 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 201 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 200 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 200 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 199 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 199 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 198 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 198 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 197 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 197 transition count 225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 196 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 196 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 127 place count 196 transition count 223
Applied a total of 127 rules in 135 ms. Remains 196 /262 variables (removed 66) and now considering 223/284 (removed 61) transitions.
// Phase 1: matrix 223 rows 196 cols
[2025-06-02 03:40:57] [INFO ] Computed 0 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:57] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-02 03:40:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:57] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2025-06-02 03:40:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 223/418 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 1/419 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 0/419 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 196 constraints, problems are : Problem set: 0 solved, 222 unsolved in 23771 ms.
Refiners :[State Equation: 196/196 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 223/418 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 222/417 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 1/419 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/419 variables, and 418 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30025 ms.
Refiners :[State Equation: 196/196 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53860ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 53872ms
Starting structural reductions in LTL mode, iteration 1 : 196/262 places, 223/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54393 ms. Remains : 196/262 places, 223/284 transitions.
Support contains 21 out of 196 places after structural reductions.
[2025-06-02 03:41:52] [INFO ] Flatten gal took : 38 ms
[2025-06-02 03:41:52] [INFO ] Flatten gal took : 14 ms
[2025-06-02 03:41:52] [INFO ] Input system was already deterministic with 223 transitions.
RANDOM walk for 13145 steps (233 resets) in 306 ms. (42 steps per ms) remains 0/12 properties
FORMULA IBM703-PT-none-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 196 stabilizing places and 223 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 196 transition count 223
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(X(!p0)))&&F(p1))||X(X(X(G(!p0))))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 223/223 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 189 transition count 216
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 189 transition count 216
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 182 transition count 209
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 182 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 182 transition count 208
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 176 transition count 202
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 176 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 176 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 173 transition count 197
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 173 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 171 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 171 transition count 195
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 169 transition count 193
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 169 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 168 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 168 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 167 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 167 transition count 191
Applied a total of 61 rules in 33 ms. Remains 167 /196 variables (removed 29) and now considering 191/223 (removed 32) transitions.
// Phase 1: matrix 191 rows 167 cols
[2025-06-02 03:41:52] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:41:52] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-02 03:41:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:41:52] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2025-06-02 03:41:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 191/357 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 1/358 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/358 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 167 constraints, problems are : Problem set: 0 solved, 190 unsolved in 24536 ms.
Refiners :[State Equation: 167/167 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 191/357 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 190/356 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 1/358 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/358 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 357 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30032 ms.
Refiners :[State Equation: 167/167 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54585ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 54588ms
Starting structural reductions in LTL mode, iteration 1 : 167/196 places, 191/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54896 ms. Remains : 167/196 places, 191/223 transitions.
Stuttering acceptance computed with spot in 453 ms :[p0, p0, (AND (NOT p1) p0), p0, (AND (NOT p1) p0), p0, (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA IBM703-PT-none-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-01 finished in 55427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(p1)))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 223/223 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 189 transition count 216
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 189 transition count 216
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 184 transition count 211
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 184 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 184 transition count 210
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 179 transition count 205
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 179 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 179 transition count 204
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 176 transition count 201
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 176 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 174 transition count 199
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 174 transition count 199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 172 transition count 197
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 172 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 171 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 170 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 170 transition count 195
Applied a total of 54 rules in 37 ms. Remains 170 /196 variables (removed 26) and now considering 195/223 (removed 28) transitions.
// Phase 1: matrix 195 rows 170 cols
[2025-06-02 03:42:47] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:42:47] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-02 03:42:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:42:48] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-06-02 03:42:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 195/364 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 1/365 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 0/365 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 170 constraints, problems are : Problem set: 0 solved, 194 unsolved in 26695 ms.
Refiners :[State Equation: 170/170 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 195/364 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 194/363 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 1/365 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 364 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30014 ms.
Refiners :[State Equation: 170/170 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56721ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 56721ms
Starting structural reductions in LTL mode, iteration 1 : 170/196 places, 195/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56899 ms. Remains : 170/196 places, 195/223 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-03
Product exploration explored 100000 steps with 4205 reset in 258 ms.
Product exploration explored 100000 steps with 4452 reset in 152 ms.
Computed a total of 170 stabilizing places and 195 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 170 transition count 195
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 1142 steps (21 resets) in 26 ms. (42 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F p1)]
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 195/195 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2025-06-02 03:43:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:43:46] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-02 03:43:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:43:46] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-06-02 03:43:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 195/364 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 1/365 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 0/365 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 170 constraints, problems are : Problem set: 0 solved, 194 unsolved in 26936 ms.
Refiners :[State Equation: 170/170 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 195/364 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 194/363 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 1/365 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 364 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30016 ms.
Refiners :[State Equation: 170/170 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56978ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 56979ms
Finished structural reductions in LTL mode , in 1 iterations and 57106 ms. Remains : 170/170 places, 195/195 transitions.
Computed a total of 170 stabilizing places and 195 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 170 transition count 195
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 1013 steps (17 resets) in 20 ms. (48 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F p1)]
Knowledge based reduction with 7 factoid took 257 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4340 reset in 120 ms.
Product exploration explored 100000 steps with 4322 reset in 169 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 195/195 transitions.
Graph (complete) has 196 edges and 170 vertex of which 147 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.4 ms
Discarding 23 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 147 transition count 171
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 71 place count 147 transition count 176
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 91 place count 147 transition count 176
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 133 place count 105 transition count 134
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 175 place count 105 transition count 134
Performed 31 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 206 place count 105 transition count 134
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 217 place count 105 transition count 123
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 277 place count 45 transition count 62
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 337 place count 45 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 338 place count 45 transition count 61
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 342 place count 41 transition count 57
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 346 place count 41 transition count 57
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 347 place count 40 transition count 56
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 348 place count 40 transition count 56
Performed 6 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 354 place count 40 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 355 place count 40 transition count 52
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 368 place count 27 transition count 39
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 4 with 13 rules applied. Total rules applied 381 place count 27 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 382 place count 27 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 383 place count 27 transition count 38
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 385 place count 25 transition count 36
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 387 place count 25 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 388 place count 25 transition count 36
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 390 place count 23 transition count 34
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 392 place count 23 transition count 34
Performed 4 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 396 place count 23 transition count 61
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 403 place count 23 transition count 54
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 408 place count 18 transition count 38
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 6 with 5 rules applied. Total rules applied 413 place count 18 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 414 place count 18 transition count 48
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 422 place count 18 transition count 40
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 425 place count 15 transition count 31
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 428 place count 15 transition count 31
Deduced a syphon composed of 6 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 436 place count 15 transition count 23
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 437 place count 14 transition count 22
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 438 place count 14 transition count 22
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 438 rules in 55 ms. Remains 14 /170 variables (removed 156) and now considering 22/195 (removed 173) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:44:45] [INFO ] Redundant transitions in 1 ms returned []
Running 19 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 14 cols
[2025-06-02 03:44:45] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
At refinement iteration 1 (OVERLAPS) 22/35 variables, 13/13 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/36 variables, 1/14 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/36 variables, 0/14 constraints. Problems are: Problem set: 8 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 14 constraints, problems are : Problem set: 8 solved, 11 unsolved in 148 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 21/29 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 11/19 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/19 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 7/36 variables, 6/25 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 25 constraints, problems are : Problem set: 8 solved, 11 unsolved in 121 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 11/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 284ms problems are : Problem set: 8 solved, 11 unsolved
Search for dead transitions found 8 dead transitions in 284ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 14/170 places, 14/195 transitions.
Graph (complete) has 11 edges and 14 vertex of which 9 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 9 /14 variables (removed 5) and now considering 14/14 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/170 places, 14/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 346 ms. Remains : 9/170 places, 14/195 transitions.
Built C files in :
/tmp/ltsmin16930496081049104222
[2025-06-02 03:44:45] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16930496081049104222
Running compilation step : cd /tmp/ltsmin16930496081049104222;'/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 426 ms.
Running link step : cd /tmp/ltsmin16930496081049104222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin16930496081049104222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3574013392222574074.hoa' '--buchi-type=spotba'
LTSmin run took 234 ms.
FORMULA IBM703-PT-none-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IBM703-PT-none-LTLCardinality-03 finished in 118366 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) U X(X(X(X((X(p2)||!p1)))))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 223/223 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 190 transition count 217
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 190 transition count 217
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 185 transition count 212
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 185 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 185 transition count 211
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 181 transition count 207
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 181 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 181 transition count 205
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 179 transition count 203
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 179 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 178 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 178 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 177 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 177 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 176 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 176 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 175 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 175 transition count 199
Applied a total of 45 rules in 35 ms. Remains 175 /196 variables (removed 21) and now considering 199/223 (removed 24) transitions.
// Phase 1: matrix 199 rows 175 cols
[2025-06-02 03:44:46] [INFO ] Computed 0 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:44:46] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-02 03:44:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:44:46] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-02 03:44:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/373 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/374 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/374 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 175 constraints, problems are : Problem set: 0 solved, 198 unsolved in 25484 ms.
Refiners :[State Equation: 175/175 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/373 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 198/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/374 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 373 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30022 ms.
Refiners :[State Equation: 175/175 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55520ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 55521ms
Starting structural reductions in LTL mode, iteration 1 : 175/196 places, 199/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55686 ms. Remains : 175/196 places, 199/223 transitions.
Stuttering acceptance computed with spot in 1118 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-05
Product exploration explored 100000 steps with 16666 reset in 91 ms.
Product exploration explored 100000 steps with 16666 reset in 95 ms.
Computed a total of 175 stabilizing places and 199 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 175 transition count 199
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0 p2), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0)), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 296 ms. Reduced automaton from 27 states, 47 edges and 3 AP (stutter sensitive) to 10 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 408 ms :[false, (NOT p2), (AND (NOT p2) p1 (NOT p0)), false, (AND (NOT p2) p1), false, (AND (NOT p2) p1), (AND (NOT p2) p1), true, false]
RANDOM walk for 1589 steps (36 resets) in 27 ms. (56 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0 p2), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0)), (F (G p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 741 ms. Reduced automaton from 10 states, 10 edges and 3 AP (stutter sensitive) to 10 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[false, (NOT p2), (AND (NOT p2) p1 (NOT p0)), false, (AND (NOT p2) p1), false, (AND (NOT p2) p1), (AND (NOT p2) p1), true, false]
Stuttering acceptance computed with spot in 391 ms :[false, (NOT p2), (AND (NOT p2) p1 (NOT p0)), false, (AND (NOT p2) p1), false, (AND (NOT p2) p1), (AND (NOT p2) p1), true, false]
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 199/199 transitions.
Applied a total of 0 rules in 11 ms. Remains 175 /175 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2025-06-02 03:45:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:45:45] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-02 03:45:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:45:45] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-02 03:45:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/373 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/374 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/374 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 175 constraints, problems are : Problem set: 0 solved, 198 unsolved in 25772 ms.
Refiners :[State Equation: 175/175 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/373 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 198/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/374 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 373 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30015 ms.
Refiners :[State Equation: 175/175 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55795ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 55796ms
Finished structural reductions in LTL mode , in 1 iterations and 55924 ms. Remains : 175/175 places, 199/199 transitions.
Computed a total of 175 stabilizing places and 199 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 175 transition count 199
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p2 p0), (F (G p1)), (F (G p2)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 10 states, 10 edges and 3 AP (stutter sensitive) to 10 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[false, (NOT p2), (AND (NOT p2) p1 (NOT p0)), false, (AND (NOT p2) p1), false, (AND (NOT p2) p1), (AND (NOT p2) p1), true, false]
RANDOM walk for 1010 steps (15 resets) in 14 ms. (67 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p2 p0), (F (G p1)), (F (G p2)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p0))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 247 ms. Reduced automaton from 10 states, 10 edges and 3 AP (stutter sensitive) to 10 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[false, (NOT p2), (AND (NOT p2) p1 (NOT p0)), false, (AND (NOT p2) p1), false, (AND (NOT p2) p1), (AND (NOT p2) p1), true, false]
Stuttering acceptance computed with spot in 372 ms :[false, (NOT p2), (AND (NOT p2) p1 (NOT p0)), false, (AND (NOT p2) p1), false, (AND (NOT p2) p1), (AND (NOT p2) p1), true, false]
Stuttering acceptance computed with spot in 383 ms :[false, (NOT p2), (AND (NOT p2) p1 (NOT p0)), false, (AND (NOT p2) p1), false, (AND (NOT p2) p1), (AND (NOT p2) p1), true, false]
Product exploration explored 100000 steps with 25000 reset in 82 ms.
Product exploration explored 100000 steps with 25000 reset in 83 ms.
Applying partial POR strategy [false, true, false, false, false, false, false, false, true, false]
Stuttering acceptance computed with spot in 391 ms :[false, (NOT p2), (AND (NOT p2) p1 (NOT p0)), false, (AND (NOT p2) p1), false, (AND (NOT p2) p1), (AND (NOT p2) p1), true, false]
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 199/199 transitions.
Graph (complete) has 200 edges and 175 vertex of which 119 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.2 ms
Discarding 56 places :
Also discarding 61 output transitions
Drop transitions (Output transitions of discarded places.) removed 61 transitions
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 119 transition count 138
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 57 place count 119 transition count 143
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 77 place count 119 transition count 143
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 118 place count 78 transition count 101
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 159 place count 78 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 160 place count 77 transition count 100
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 161 place count 77 transition count 100
Performed 21 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 56 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 182 place count 77 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 77 transition count 95
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 223 place count 40 transition count 57
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 260 place count 40 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 261 place count 40 transition count 56
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 262 place count 39 transition count 55
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 263 place count 39 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 265 place count 39 transition count 55
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 269 place count 35 transition count 51
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 273 place count 35 transition count 51
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 281 place count 35 transition count 92
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 302 place count 35 transition count 71
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 315 place count 22 transition count 41
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 4 with 13 rules applied. Total rules applied 328 place count 22 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 22 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 331 place count 22 transition count 49
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 333 place count 20 transition count 43
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 335 place count 20 transition count 43
Deduced a syphon composed of 11 places in 0 ms
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 343 place count 20 transition count 35
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 343 rules in 25 ms. Remains 20 /175 variables (removed 155) and now considering 35/199 (removed 164) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:46:44] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
// Phase 1: matrix 35 rows 20 cols
[2025-06-02 03:46:44] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 1 (OVERLAPS) 35/54 variables, 19/19 constraints. Problems are: Problem set: 20 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 20 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/20 constraints. Problems are: Problem set: 20 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/20 constraints. Problems are: Problem set: 20 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/55 variables, 0/20 constraints. Problems are: Problem set: 20 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 20 constraints, problems are : Problem set: 20 solved, 12 unsolved in 186 ms.
Refiners :[State Equation: 20/20 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 20 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 12/20 constraints. Problems are: Problem set: 20 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/20 constraints. Problems are: Problem set: 20 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 16/55 variables, 12/32 constraints. Problems are: Problem set: 20 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/32 constraints. Problems are: Problem set: 20 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/55 variables, 0/32 constraints. Problems are: Problem set: 20 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 32 constraints, problems are : Problem set: 20 solved, 12 unsolved in 163 ms.
Refiners :[State Equation: 20/20 constraints, PredecessorRefiner: 12/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 352ms problems are : Problem set: 20 solved, 12 unsolved
Search for dead transitions found 20 dead transitions in 352ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 20/175 places, 15/199 transitions.
Graph (complete) has 11 edges and 20 vertex of which 9 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 9 /20 variables (removed 11) and now considering 15/15 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/175 places, 15/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 390 ms. Remains : 9/175 places, 15/199 transitions.
Built C files in :
/tmp/ltsmin10769374120813082488
[2025-06-02 03:46:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10769374120813082488
Running compilation step : cd /tmp/ltsmin10769374120813082488;'/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 271 ms.
Running link step : cd /tmp/ltsmin10769374120813082488;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10769374120813082488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16527848695061456459.hoa' '--buchi-type=spotba'
LTSmin run took 1622 ms.
FORMULA IBM703-PT-none-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IBM703-PT-none-LTLCardinality-05 finished in 120171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 223/223 transitions.
Graph (complete) has 223 edges and 196 vertex of which 92 are kept as prefixes of interest. Removing 104 places using SCC suffix rule.2 ms
Discarding 104 places :
Also discarding 115 output transitions
Drop transitions (Output transitions of discarded places.) removed 115 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 91 transition count 41
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 74 rules applied. Total rules applied 141 place count 26 transition count 32
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 148 place count 20 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 149 place count 19 transition count 31
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 149 place count 19 transition count 27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 157 place count 15 transition count 27
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 169 place count 9 transition count 19
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 173 place count 9 transition count 15
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 175 place count 8 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 176 place count 8 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 178 place count 7 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 179 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 180 place count 7 transition count 11
Applied a total of 180 rules in 10 ms. Remains 7 /196 variables (removed 189) and now considering 11/223 (removed 212) transitions.
// Phase 1: matrix 11 rows 7 cols
[2025-06-02 03:46:46] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:46:46] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-02 03:46:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:46:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:46:46] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-02 03:46:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/18 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 65 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/18 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 70 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/196 places, 11/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 7/196 places, 11/223 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-08
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-08 finished in 312 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(X(F(p0)))))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 223/223 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 189 transition count 216
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 189 transition count 216
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 183 transition count 210
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 183 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 183 transition count 209
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 178 transition count 204
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 178 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 178 transition count 202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 176 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 176 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 175 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 175 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 174 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 174 transition count 198
Applied a total of 47 rules in 12 ms. Remains 174 /196 variables (removed 22) and now considering 198/223 (removed 25) transitions.
// Phase 1: matrix 198 rows 174 cols
[2025-06-02 03:46:46] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:46:46] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-02 03:46:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:46:46] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2025-06-02 03:46:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 198/371 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 1/372 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 0/372 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 174 constraints, problems are : Problem set: 0 solved, 197 unsolved in 23273 ms.
Refiners :[State Equation: 174/174 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 198/371 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 197/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 1/372 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 371 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30019 ms.
Refiners :[State Equation: 174/174 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53305ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 53305ms
Starting structural reductions in LTL mode, iteration 1 : 174/196 places, 198/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53430 ms. Remains : 174/196 places, 198/223 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-09
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-09 finished in 53589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 223/223 transitions.
Graph (complete) has 223 edges and 196 vertex of which 67 are kept as prefixes of interest. Removing 129 places using SCC suffix rule.1 ms
Discarding 129 places :
Also discarding 144 output transitions
Drop transitions (Output transitions of discarded places.) removed 144 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 66 transition count 28
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 18 transition count 25
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 16 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 15 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 106 place count 15 transition count 21
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 112 place count 12 transition count 21
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 10 transition count 18
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 10 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 10 transition count 17
Performed 4 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 125 place count 6 transition count 12
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 128 place count 6 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 130 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 131 place count 5 transition count 8
Applied a total of 131 rules in 8 ms. Remains 5 /196 variables (removed 191) and now considering 8/223 (removed 215) transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 03:47:40] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:47:40] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-02 03:47:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:47:40] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:47:40] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 03:47:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 50 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 98ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/196 places, 8/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 5/196 places, 8/223 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-15
Product exploration explored 100000 steps with 27360 reset in 162 ms.
Product exploration explored 100000 steps with 27129 reset in 102 ms.
Computed a total of 5 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 10 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBM703-PT-none-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLCardinality-15 finished in 508 ms.
All properties solved by simple procedures.
Total runtime 403807 ms.

BK_STOP 1748836061189

--------------------
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="IBM703-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 IBM703-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-174876422500347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBM703-PT-none.tgz
mv IBM703-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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;