Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028400427.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 CO4-PT-07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028400427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 98K 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 CO4-PT-07-LTLCardinality-00
FORMULA_NAME CO4-PT-07-LTLCardinality-01
FORMULA_NAME CO4-PT-07-LTLCardinality-02
FORMULA_NAME CO4-PT-07-LTLCardinality-03
FORMULA_NAME CO4-PT-07-LTLCardinality-04
FORMULA_NAME CO4-PT-07-LTLCardinality-05
FORMULA_NAME CO4-PT-07-LTLCardinality-06
FORMULA_NAME CO4-PT-07-LTLCardinality-07
FORMULA_NAME CO4-PT-07-LTLCardinality-08
FORMULA_NAME CO4-PT-07-LTLCardinality-09
FORMULA_NAME CO4-PT-07-LTLCardinality-10
FORMULA_NAME CO4-PT-07-LTLCardinality-11
FORMULA_NAME CO4-PT-07-LTLCardinality-12
FORMULA_NAME CO4-PT-07-LTLCardinality-13
FORMULA_NAME CO4-PT-07-LTLCardinality-14
FORMULA_NAME CO4-PT-07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748605749412

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 11:49:10] [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-05-30 11:49:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:49:10] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2025-05-30 11:49:10] [INFO ] Transformed 384 places.
[2025-05-30 11:49:10] [INFO ] Transformed 456 transitions.
[2025-05-30 11:49:10] [INFO ] Found NUPN structural information;
[2025-05-30 11:49:10] [INFO ] Parsed PT model containing 384 places and 456 transitions and 1022 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 100 places in 5 ms
Reduce places removed 100 places and 120 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-07-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 336/336 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 274 transition count 335
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 67 place count 218 transition count 277
Iterating global reduction 1 with 56 rules applied. Total rules applied 123 place count 218 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 125 place count 218 transition count 275
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 152 place count 191 transition count 248
Iterating global reduction 2 with 27 rules applied. Total rules applied 179 place count 191 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 180 place count 191 transition count 247
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 183 place count 188 transition count 243
Iterating global reduction 3 with 3 rules applied. Total rules applied 186 place count 188 transition count 243
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 187 transition count 242
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 187 transition count 242
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 189 place count 186 transition count 241
Iterating global reduction 3 with 1 rules applied. Total rules applied 190 place count 186 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 186 transition count 240
Applied a total of 191 rules in 77 ms. Remains 186 /284 variables (removed 98) and now considering 240/336 (removed 96) transitions.
// Phase 1: matrix 240 rows 186 cols
[2025-05-30 11:49:11] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:49:11] [INFO ] Implicit Places using invariants in 232 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 263 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/284 places, 240/336 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 356 ms. Remains : 185/284 places, 240/336 transitions.
Support contains 18 out of 185 places after structural reductions.
[2025-05-30 11:49:11] [INFO ] Flatten gal took : 49 ms
[2025-05-30 11:49:11] [INFO ] Flatten gal took : 24 ms
[2025-05-30 11:49:11] [INFO ] Input system was already deterministic with 240 transitions.
RANDOM walk for 40000 steps (76 resets) in 1062 ms. (37 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40000 steps (35 resets) in 404 ms. (98 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (33 resets) in 526 ms. (75 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (40 resets) in 215 ms. (185 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (175 resets) in 223 ms. (178 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40000 steps (53 resets) in 215 ms. (185 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (20 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (37 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (23 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
// Phase 1: matrix 240 rows 185 cols
[2025-05-30 11:49:13] [INFO ] Computed 3 invariants in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 21/31 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 80/111 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 146/257 variables, 62/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 119/376 variables, 63/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 9/385 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 34/419 variables, 24/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 6/425 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/425 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 188 constraints, problems are : Problem set: 0 solved, 6 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 21/31 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 80/111 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 146/257 variables, 62/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 119/376 variables, 63/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 9/385 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 34/419 variables, 24/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 6/425 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/425 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/425 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 194 constraints, problems are : Problem set: 0 solved, 6 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1485ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 3 properties in 292 ms.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 240/240 transitions.
Graph (trivial) has 188 edges and 185 vertex of which 2 / 185 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 306 edges and 184 vertex of which 168 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 168 transition count 151
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 137 place count 107 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 106 transition count 149
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 138 place count 106 transition count 134
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 168 place count 91 transition count 134
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 87 transition count 130
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 87 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 87 transition count 129
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 177 place count 87 transition count 127
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 181 place count 85 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 182 place count 84 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 183 place count 84 transition count 126
Performed 28 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 239 place count 56 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 241 place count 56 transition count 90
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 243 place count 54 transition count 88
Iterating global reduction 5 with 2 rules applied. Total rules applied 245 place count 54 transition count 88
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 247 place count 53 transition count 87
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 269 place count 42 transition count 88
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 276 place count 42 transition count 81
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 286 place count 32 transition count 61
Iterating global reduction 6 with 10 rules applied. Total rules applied 296 place count 32 transition count 61
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 303 place count 32 transition count 54
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 305 place count 30 transition count 48
Iterating global reduction 7 with 2 rules applied. Total rules applied 307 place count 30 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 308 place count 30 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 314 place count 30 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 316 place count 29 transition count 51
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 320 place count 29 transition count 47
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 324 place count 25 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 325 place count 25 transition count 47
Graph (complete) has 70 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 1 rules applied. Total rules applied 326 place count 24 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 327 place count 24 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 328 place count 24 transition count 46
Graph (complete) has 67 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 1 rules applied. Total rules applied 329 place count 23 transition count 46
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 330 place count 23 transition count 45
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 331 place count 23 transition count 45
Graph (complete) has 64 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 332 place count 22 transition count 45
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 333 place count 22 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 334 place count 22 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 335 place count 21 transition count 43
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t56.t222.t53 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 337 place count 18 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 16 with 6 rules applied. Total rules applied 343 place count 18 transition count 35
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 345 place count 16 transition count 31
Iterating global reduction 16 with 2 rules applied. Total rules applied 347 place count 16 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 349 place count 16 transition count 29
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 350 place count 15 transition count 27
Iterating global reduction 17 with 1 rules applied. Total rules applied 351 place count 15 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 352 place count 15 transition count 26
Free-agglomeration rule applied 2 times.
Iterating global reduction 18 with 2 rules applied. Total rules applied 354 place count 15 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 356 place count 13 transition count 24
Applied a total of 356 rules in 70 ms. Remains 13 /185 variables (removed 172) and now considering 24/240 (removed 216) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 13/185 places, 24/240 transitions.
RANDOM walk for 16719 steps (5 resets) in 134 ms. (123 steps per ms) remains 0/3 properties
Computed a total of 12 stabilizing places and 15 stable transitions
Graph (complete) has 308 edges and 185 vertex of which 180 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(p1))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 177 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 177 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 177 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 174 transition count 226
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 174 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 171 transition count 222
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 171 transition count 222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 169 transition count 220
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 169 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 169 transition count 219
Applied a total of 35 rules in 16 ms. Remains 169 /185 variables (removed 16) and now considering 219/240 (removed 21) transitions.
// Phase 1: matrix 219 rows 169 cols
[2025-05-30 11:49:15] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:49:15] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-30 11:49:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:49:15] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-30 11:49:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/388 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:49:20] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:49:20] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 174 constraints, problems are : Problem set: 0 solved, 218 unsolved in 14371 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/388 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 218/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:49:34] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/388 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 393 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44437ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 44438ms
Starting structural reductions in LTL mode, iteration 1 : 169/185 places, 219/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44617 ms. Remains : 169/185 places, 219/240 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-07-LTLCardinality-04
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 2 ms.
FORMULA CO4-PT-07-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLCardinality-04 finished in 44919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(!p0)||X(X(p1)))) U X(p1)))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 177 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 177 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 177 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 174 transition count 226
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 174 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 171 transition count 222
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 171 transition count 222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 169 transition count 220
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 169 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 169 transition count 219
Applied a total of 35 rules in 16 ms. Remains 169 /185 variables (removed 16) and now considering 219/240 (removed 21) transitions.
// Phase 1: matrix 219 rows 169 cols
[2025-05-30 11:50:00] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:00] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-05-30 11:50:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:00] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-30 11:50:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/388 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:04] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:04] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 174 constraints, problems are : Problem set: 0 solved, 218 unsolved in 13880 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/388 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 218/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:27] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/388 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 393 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43924ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 43925ms
Starting structural reductions in LTL mode, iteration 1 : 169/185 places, 219/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44086 ms. Remains : 169/185 places, 219/240 transitions.
Stuttering acceptance computed with spot in 394 ms :[true, (NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p1)), p0, (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-07-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 286 edges and 169 vertex of which 166 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 10 states, 26 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-07-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-07-LTLCardinality-05 finished in 44852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 240/240 transitions.
Graph (trivial) has 196 edges and 185 vertex of which 2 / 185 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 307 edges and 184 vertex of which 180 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 179 transition count 169
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 115 transition count 168
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 131 place count 115 transition count 151
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 165 place count 98 transition count 151
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 168 place count 95 transition count 148
Iterating global reduction 2 with 3 rules applied. Total rules applied 171 place count 95 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 171 place count 95 transition count 146
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 93 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 92 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 92 transition count 145
Performed 31 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 239 place count 61 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 242 place count 61 transition count 100
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 244 place count 59 transition count 98
Iterating global reduction 3 with 2 rules applied. Total rules applied 246 place count 59 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 250 place count 57 transition count 96
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 278 place count 43 transition count 97
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 286 place count 43 transition count 89
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 297 place count 32 transition count 67
Iterating global reduction 4 with 11 rules applied. Total rules applied 308 place count 32 transition count 67
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 315 place count 32 transition count 60
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 318 place count 29 transition count 51
Iterating global reduction 5 with 3 rules applied. Total rules applied 321 place count 29 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 323 place count 29 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 329 place count 29 transition count 43
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 331 place count 29 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 333 place count 27 transition count 41
Applied a total of 333 rules in 38 ms. Remains 27 /185 variables (removed 158) and now considering 41/240 (removed 199) transitions.
[2025-05-30 11:50:45] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
// Phase 1: matrix 38 rows 27 cols
[2025-05-30 11:50:45] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-30 11:50:45] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
[2025-05-30 11:50:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:50:45] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:50:45] [INFO ] Redundant transitions in 1 ms returned []
Running 31 sub problems to find dead transitions.
[2025-05-30 11:50:45] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
[2025-05-30 11:50:45] [INFO ] Invariant cache hit.
[2025-05-30 11:50:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 37/64 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 31 constraints, problems are : Problem set: 0 solved, 31 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 37/64 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 31/61 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 1/65 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 62 constraints, problems are : Problem set: 0 solved, 31 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 949ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 949ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/185 places, 41/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1063 ms. Remains : 27/185 places, 41/240 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-07-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 140 ms.
Product exploration explored 100000 steps with 1 reset in 66 ms.
Computed a total of 7 stabilizing places and 12 stable transitions
Graph (complete) has 77 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 583 steps (82 resets) in 13 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2025-05-30 11:50:47] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
[2025-05-30 11:50:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:47] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-30 11:50:47] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
[2025-05-30 11:50:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:50:47] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:50:47] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2025-05-30 11:50:47] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
[2025-05-30 11:50:47] [INFO ] Invariant cache hit.
[2025-05-30 11:50:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 37/64 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 31 constraints, problems are : Problem set: 0 solved, 31 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 37/64 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 31/61 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 1/65 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 62 constraints, problems are : Problem set: 0 solved, 31 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 963ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 963ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1039 ms. Remains : 27/27 places, 41/41 transitions.
Computed a total of 7 stabilizing places and 12 stable transitions
Graph (complete) has 77 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 799 steps (112 resets) in 12 ms. (61 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7 reset in 70 ms.
Product exploration explored 100000 steps with 7 reset in 66 ms.
Built C files in :
/tmp/ltsmin1240024322783603894
[2025-05-30 11:50:48] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2025-05-30 11:50:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:50:48] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2025-05-30 11:50:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:50:48] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2025-05-30 11:50:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:50:48] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1240024322783603894
Running compilation step : cd /tmp/ltsmin1240024322783603894;'/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 249 ms.
Running link step : cd /tmp/ltsmin1240024322783603894;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1240024322783603894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2363670478630159285.hoa' '--buchi-type=spotba'
LTSmin run took 83 ms.
FORMULA CO4-PT-07-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-07-LTLCardinality-07 finished in 4005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 240/240 transitions.
Graph (trivial) has 195 edges and 185 vertex of which 2 / 185 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 307 edges and 184 vertex of which 182 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 181 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 117 transition count 171
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 131 place count 117 transition count 154
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 165 place count 100 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 167 place count 98 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 169 place count 98 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 169 place count 98 transition count 150
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 173 place count 96 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 95 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 95 transition count 149
Performed 32 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 239 place count 63 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 242 place count 63 transition count 102
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 244 place count 61 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 246 place count 61 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 250 place count 59 transition count 98
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 278 place count 45 transition count 99
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 286 place count 45 transition count 91
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 296 place count 35 transition count 71
Iterating global reduction 4 with 10 rules applied. Total rules applied 306 place count 35 transition count 71
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 314 place count 35 transition count 63
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 316 place count 33 transition count 57
Iterating global reduction 5 with 2 rules applied. Total rules applied 318 place count 33 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 33 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 324 place count 33 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 326 place count 31 transition count 49
Applied a total of 326 rules in 31 ms. Remains 31 /185 variables (removed 154) and now considering 49/240 (removed 191) transitions.
[2025-05-30 11:50:49] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
// Phase 1: matrix 45 rows 31 cols
[2025-05-30 11:50:49] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:49] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-05-30 11:50:49] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
[2025-05-30 11:50:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:50:49] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:50:49] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2025-05-30 11:50:49] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
[2025-05-30 11:50:49] [INFO ] Invariant cache hit.
[2025-05-30 11:50:49] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/76 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/76 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 35 constraints, problems are : Problem set: 0 solved, 39 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 39/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 1/76 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/76 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 74 constraints, problems are : Problem set: 0 solved, 39 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1362ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1363ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/185 places, 49/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1471 ms. Remains : 31/185 places, 49/240 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : CO4-PT-07-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 61 ms.
Product exploration explored 100000 steps with 2 reset in 90 ms.
Computed a total of 8 stabilizing places and 12 stable transitions
Graph (complete) has 93 edges and 31 vertex of which 29 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 8 stabilizing places and 12 stable transitions
Detected a total of 8/31 stabilizing places and 12/49 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 11 factoid took 368 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), true, (NOT p1)]
RANDOM walk for 35375 steps (5055 resets) in 136 ms. (258 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 11 factoid took 402 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-07-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-07-LTLCardinality-08 finished in 2658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 179 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 179 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 179 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 177 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 177 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 175 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 175 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 174 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 174 transition count 226
Applied a total of 24 rules in 12 ms. Remains 174 /185 variables (removed 11) and now considering 226/240 (removed 14) transitions.
// Phase 1: matrix 226 rows 174 cols
[2025-05-30 11:50:51] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:51] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-05-30 11:50:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:52] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2025-05-30 11:50: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/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 226/400 variables, 174/177 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:56] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:56] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 0/400 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 179 constraints, problems are : Problem set: 0 solved, 225 unsolved in 14815 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 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, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 226/400 variables, 174/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 225/404 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:22] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/400 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/400 variables, and 405 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44865ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 44865ms
Starting structural reductions in LTL mode, iteration 1 : 174/185 places, 226/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45032 ms. Remains : 174/185 places, 226/240 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-07-LTLCardinality-14
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA CO4-PT-07-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLCardinality-14 finished in 45177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(((p0&&(G(p0)||F(!p1)))||G(F(!p1))))))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 240/240 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 178 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 178 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 178 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 177 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 177 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 176 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 176 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 175 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 175 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 175 transition count 227
Applied a total of 22 rules in 10 ms. Remains 175 /185 variables (removed 10) and now considering 227/240 (removed 13) transitions.
// Phase 1: matrix 227 rows 175 cols
[2025-05-30 11:51:37] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:51:37] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-30 11:51:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:51:37] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2025-05-30 11:51:37] [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, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 227/402 variables, 175/178 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:41] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:41] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 180 constraints, problems are : Problem set: 0 solved, 226 unsolved in 14799 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 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, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 227/402 variables, 175/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 226/406 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:57] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 407 constraints, problems are : Problem set: 0 solved, 226 unsolved in 29103 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43940ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 43940ms
Starting structural reductions in LTL mode, iteration 1 : 175/185 places, 227/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44105 ms. Remains : 175/185 places, 227/240 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CO4-PT-07-LTLCardinality-15
Product exploration explored 100000 steps with 4 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 74 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 296 edges and 175 vertex of which 172 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (73 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (90 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (60 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (50 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (75 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 12992 steps, run visited all 4 properties in 68 ms. (steps per millisecond=191 )
Probabilistic random walk after 12992 steps, saw 3023 distinct states, run finished after 71 ms. (steps per millisecond=182 ) properties seen :4
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 4 factoid took 138 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 159 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 227/227 transitions.
Applied a total of 0 rules in 2 ms. Remains 175 /175 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2025-05-30 11:52:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:52:22] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-30 11:52:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:52:22] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2025-05-30 11:52:22] [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, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 227/402 variables, 175/178 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:52:27] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:52:27] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 180 constraints, problems are : Problem set: 0 solved, 226 unsolved in 14976 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 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, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 227/402 variables, 175/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 226/406 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:52:43] [INFO ] Deduced a trap along path composed of 2 places in 14 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 407 constraints, problems are : Problem set: 0 solved, 226 unsolved in 29118 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44120ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 44122ms
Finished structural reductions in LTL mode , in 1 iterations and 44267 ms. Remains : 175/175 places, 227/227 transitions.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 296 edges and 175 vertex of which 172 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 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 :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (35 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (30 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (65 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (90 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (35 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 12992 steps, run visited all 4 properties in 57 ms. (steps per millisecond=227 )
Probabilistic random walk after 12992 steps, saw 3023 distinct states, run finished after 57 ms. (steps per millisecond=227 ) properties seen :4
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 190 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 169 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 7 reset in 108 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 227/227 transitions.
Graph (trivial) has 182 edges and 175 vertex of which 2 / 175 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 295 edges and 174 vertex of which 171 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 171 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 171 transition count 222
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 60 place count 171 transition count 241
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 79 place count 171 transition count 241
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 159 transition count 229
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 159 transition count 229
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 124 place count 159 transition count 251
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 159 transition count 248
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 137 place count 149 transition count 236
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 147 place count 149 transition count 236
Performed 25 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 3 with 25 rules applied. Total rules applied 172 place count 149 transition count 342
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 196 place count 149 transition count 318
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 244 place count 101 transition count 208
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 4 with 48 rules applied. Total rules applied 292 place count 101 transition count 208
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 309 place count 101 transition count 191
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 337 place count 73 transition count 140
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 5 with 28 rules applied. Total rules applied 365 place count 73 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 367 place count 73 transition count 138
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 371 place count 69 transition count 130
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 375 place count 69 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 376 place count 69 transition count 144
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 377 place count 68 transition count 142
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 378 place count 68 transition count 142
Deduced a syphon composed of 35 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 404 place count 68 transition count 116
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 405 place count 67 transition count 115
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 406 place count 67 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 407 place count 67 transition count 139
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 408 place count 66 transition count 132
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 409 place count 66 transition count 132
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 409 rules in 35 ms. Remains 66 /175 variables (removed 109) and now considering 132/227 (removed 95) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:53:08] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-30 11:53:08] [INFO ] Flow matrix only has 130 transitions (discarded 2 similar events)
// Phase 1: matrix 130 rows 66 cols
[2025-05-30 11:53:08] [INFO ] Computed 3 invariants in 1 ms
[2025-05-30 11:53:08] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:53:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:53:09] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:53:09] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 3/6 constraints. Problems are: Problem set: 9 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 122 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 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 TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (OVERLAPS) 129/195 variables, 66/72 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 5/77 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/77 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 1/196 variables, 1/78 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/78 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/78 constraints. Problems are: Problem set: 80 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 78 constraints, problems are : Problem set: 80 solved, 51 unsolved in 2693 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 80 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 8/39 variables, 3/3 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 3/6 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 122/161 variables, 39/45 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 5/50 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 51/101 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/101 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 34/195 variables, 27/128 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/128 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 1/196 variables, 1/129 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/129 constraints. Problems are: Problem set: 80 solved, 51 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/129 constraints. Problems are: Problem set: 80 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 129 constraints, problems are : Problem set: 80 solved, 51 unsolved in 2815 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 51/131 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5530ms problems are : Problem set: 80 solved, 51 unsolved
Search for dead transitions found 80 dead transitions in 5530ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 66/175 places, 52/227 transitions.
Graph (complete) has 97 edges and 66 vertex of which 32 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 32 /66 variables (removed 34) and now considering 52/52 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/175 places, 52/227 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5582 ms. Remains : 32/175 places, 52/227 transitions.
Built C files in :
/tmp/ltsmin2974294827466930131
[2025-05-30 11:53:13] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2974294827466930131
Running compilation step : cd /tmp/ltsmin2974294827466930131;'/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 317 ms.
Running link step : cd /tmp/ltsmin2974294827466930131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2974294827466930131;'/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/stateBased7052875122436389399.hoa' '--buchi-type=spotba'
LTSmin run took 4105 ms.
FORMULA CO4-PT-07-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-07-LTLCardinality-15 finished in 101381 ms.
All properties solved by simple procedures.
Total runtime 247863 ms.

BK_STOP 1748605998496

--------------------
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="CO4-PT-07"
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 CO4-PT-07, 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 r044-tall-174854028400427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-07.tgz
mv CO4-PT-07 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 ;