Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.0K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 207K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-00
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-01
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-02
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-03
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-04
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-05
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-06
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-07
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-08
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-09
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-10
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-11
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-12
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-13
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-14
FORMULA_NAME Vasy2003-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749285570484

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Vasy2003-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 08:39:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 08:39:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 08:39:32] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2025-06-07 08:39:32] [INFO ] Transformed 485 places.
[2025-06-07 08:39:32] [INFO ] Transformed 776 transitions.
[2025-06-07 08:39:32] [INFO ] Found NUPN structural information;
[2025-06-07 08:39:32] [INFO ] Parsed PT model containing 485 places and 776 transitions and 2809 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Vasy2003-PT-none-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 752/752 transitions.
Discarding 133 places :
Symmetric choice reduction at 0 with 133 rule applications. Total rules 133 place count 352 transition count 619
Iterating global reduction 0 with 133 rules applied. Total rules applied 266 place count 352 transition count 619
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 300 place count 352 transition count 585
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 370 place count 282 transition count 495
Iterating global reduction 1 with 70 rules applied. Total rules applied 440 place count 282 transition count 495
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 483 place count 282 transition count 452
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 522 place count 243 transition count 393
Iterating global reduction 2 with 39 rules applied. Total rules applied 561 place count 243 transition count 393
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 589 place count 243 transition count 365
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 604 place count 228 transition count 341
Iterating global reduction 3 with 15 rules applied. Total rules applied 619 place count 228 transition count 341
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 628 place count 228 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 629 place count 228 transition count 331
Applied a total of 629 rules in 106 ms. Remains 228 /485 variables (removed 257) and now considering 331/752 (removed 421) transitions.
[2025-06-07 08:39:32] [INFO ] Flow matrix only has 302 transitions (discarded 29 similar events)
// Phase 1: matrix 302 rows 228 cols
[2025-06-07 08:39:32] [INFO ] Computed 66 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:39:32] [INFO ] Implicit Places using invariants in 380 ms returned [93, 96, 99, 102, 103, 104, 105, 106, 107, 205]
Discarding 10 places :
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT only with invariants took 420 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/485 places, 327/752 transitions.
Applied a total of 0 rules in 6 ms. Remains 218 /218 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 545 ms. Remains : 218/485 places, 327/752 transitions.
Support contains 34 out of 218 places after structural reductions.
[2025-06-07 08:39:33] [INFO ] Flatten gal took : 56 ms
[2025-06-07 08:39:33] [INFO ] Flatten gal took : 26 ms
[2025-06-07 08:39:33] [INFO ] Input system was already deterministic with 327 transitions.
Support contains 28 out of 218 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1597 ms. (25 steps per ms) remains 3/18 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
[2025-06-07 08:39:33] [INFO ] Flow matrix only has 302 transitions (discarded 25 similar events)
// Phase 1: matrix 302 rows 218 cols
[2025-06-07 08:39:33] [INFO ] Computed 56 invariants in 8 ms
[2025-06-07 08:39:33] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 122/214 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/218 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 301/519 variables, 218/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 36/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/519 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/520 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/520 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 311 constraints, problems are : Problem set: 0 solved, 3 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 218/218 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 122/214 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/218 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 301/519 variables, 218/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 36/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/519 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/519 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/520 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/520 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 314 constraints, problems are : Problem set: 0 solved, 3 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 218/218 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1085ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 3730 steps, including 89 resets, run visited all 3 properties in 29 ms. (steps per millisecond=128 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 33 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((!p0&&X((!p0 U (X(!p1)||G(!p0))))) U (G((!p0&&X((!p0 U (X(!p1)||G(!p0))))))||(X((!p0 U (X(!p1)||G(!p0))))&&p2)))))))'
Support contains 5 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 327/327 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 198 transition count 305
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 198 transition count 305
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 54 place count 198 transition count 291
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 66 place count 186 transition count 275
Iterating global reduction 1 with 12 rules applied. Total rules applied 78 place count 186 transition count 275
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 90 place count 186 transition count 263
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 182 transition count 256
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 182 transition count 256
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 103 place count 182 transition count 251
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 180 transition count 239
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 180 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 180 transition count 238
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 179 transition count 237
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 179 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 112 place count 179 transition count 235
Applied a total of 112 rules in 23 ms. Remains 179 /218 variables (removed 39) and now considering 235/327 (removed 92) transitions.
[2025-06-07 08:39:35] [INFO ] Flow matrix only has 214 transitions (discarded 21 similar events)
// Phase 1: matrix 214 rows 179 cols
[2025-06-07 08:39:35] [INFO ] Computed 56 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:39:35] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-07 08:39:35] [INFO ] Flow matrix only has 214 transitions (discarded 21 similar events)
[2025-06-07 08:39:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:39:35] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-07 08:39:35] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2025-06-07 08:39:35] [INFO ] Flow matrix only has 214 transitions (discarded 21 similar events)
[2025-06-07 08:39:35] [INFO ] Invariant cache hit.
[2025-06-07 08:39:35] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:39:38] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:39:38] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:39:38] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 213/392 variables, 179/238 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 32/270 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 1/393 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (OVERLAPS) 0/393 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 271 constraints, problems are : Problem set: 0 solved, 234 unsolved in 14984 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 179/179 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 213/392 variables, 179/238 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 32/270 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 234/504 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (OVERLAPS) 1/393 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 12 (OVERLAPS) 0/393 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 505 constraints, problems are : Problem set: 0 solved, 234 unsolved in 22082 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 179/179 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37163ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 37171ms
Starting structural reductions in LTL mode, iteration 1 : 179/218 places, 235/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37552 ms. Remains : 179/218 places, 235/327 transitions.
Stuttering acceptance computed with spot in 488 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), true, (AND p1 p0), p1, (AND p0 p1)]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA Vasy2003-PT-none-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Vasy2003-PT-none-LTLCardinality-02 finished in 38118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 327/327 transitions.
Graph (trivial) has 52 edges and 218 vertex of which 4 / 218 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 215 transition count 316
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 207 transition count 316
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 17 place count 207 transition count 307
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 42 place count 191 transition count 307
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 47 edges and 191 vertex of which 4 / 191 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 189 transition count 304
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 48 place count 189 transition count 302
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 48 place count 189 transition count 301
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 51 place count 187 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 51 place count 187 transition count 300
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 185 transition count 300
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 74 place count 165 transition count 276
Iterating global reduction 4 with 20 rules applied. Total rules applied 94 place count 165 transition count 276
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 107 place count 165 transition count 263
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 119 place count 153 transition count 248
Iterating global reduction 5 with 12 rules applied. Total rules applied 131 place count 153 transition count 248
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 144 place count 153 transition count 235
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 148 place count 149 transition count 228
Iterating global reduction 6 with 4 rules applied. Total rules applied 152 place count 149 transition count 228
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 157 place count 149 transition count 223
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 158 place count 148 transition count 217
Iterating global reduction 7 with 1 rules applied. Total rules applied 159 place count 148 transition count 217
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 37 rules applied. Total rules applied 196 place count 127 transition count 201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 7 with 13 rules applied. Total rules applied 209 place count 127 transition count 188
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 213 place count 123 transition count 188
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 16 Pre rules applied. Total rules applied 213 place count 123 transition count 172
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 9 with 44 rules applied. Total rules applied 257 place count 95 transition count 172
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 257 place count 95 transition count 160
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 293 place count 71 transition count 160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 302 place count 71 transition count 151
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 305 place count 68 transition count 147
Iterating global reduction 10 with 3 rules applied. Total rules applied 308 place count 68 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 311 place count 68 transition count 144
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 11 with 4 rules applied. Total rules applied 315 place count 66 transition count 142
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 323 place count 66 transition count 134
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 324 place count 65 transition count 132
Iterating global reduction 12 with 1 rules applied. Total rules applied 325 place count 65 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 329 place count 65 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 348 place count 65 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 348 place count 65 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 351 place count 63 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 351 place count 63 transition count 107
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 353 place count 62 transition count 107
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 2 places and 0 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 356 place count 60 transition count 106
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 13 with 3 rules applied. Total rules applied 359 place count 60 transition count 103
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 12 rules applied. Total rules applied 371 place count 54 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 373 place count 53 transition count 99
Applied a total of 373 rules in 91 ms. Remains 53 /218 variables (removed 165) and now considering 99/327 (removed 228) transitions.
[2025-06-07 08:40:13] [INFO ] Flow matrix only has 91 transitions (discarded 8 similar events)
// Phase 1: matrix 91 rows 53 cols
[2025-06-07 08:40:13] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:40:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 08:40:13] [INFO ] Flow matrix only has 91 transitions (discarded 8 similar events)
[2025-06-07 08:40:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:40:13] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 08:40:13] [INFO ] Redundant transitions in 14 ms returned []
Running 84 sub problems to find dead transitions.
[2025-06-07 08:40:13] [INFO ] Flow matrix only has 91 transitions (discarded 8 similar events)
[2025-06-07 08:40:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 90/143 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 0/143 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/144 variables, and 66 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 90/143 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 84/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/144 variables, and 150 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4073ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 4073ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/218 places, 99/327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4294 ms. Remains : 53/218 places, 99/327 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Vasy2003-PT-none-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Vasy2003-PT-none-LTLCardinality-04 finished in 4350 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))'
Support contains 1 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 327/327 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 196 transition count 301
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 196 transition count 301
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 59 place count 196 transition count 286
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 71 place count 184 transition count 270
Iterating global reduction 1 with 12 rules applied. Total rules applied 83 place count 184 transition count 270
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 97 place count 184 transition count 256
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 181 transition count 251
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 181 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 107 place count 181 transition count 247
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 179 transition count 235
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 179 transition count 235
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 178 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 178 transition count 233
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 177 transition count 231
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 177 transition count 231
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 176 transition count 228
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 176 transition count 228
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 175 transition count 225
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 175 transition count 225
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 174 transition count 223
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 174 transition count 223
Applied a total of 121 rules in 39 ms. Remains 174 /218 variables (removed 44) and now considering 223/327 (removed 104) transitions.
[2025-06-07 08:40:17] [INFO ] Flow matrix only has 203 transitions (discarded 20 similar events)
// Phase 1: matrix 203 rows 174 cols
[2025-06-07 08:40:17] [INFO ] Computed 56 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:40:17] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-07 08:40:17] [INFO ] Flow matrix only has 203 transitions (discarded 20 similar events)
[2025-06-07 08:40:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:40:17] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-07 08:40:17] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2025-06-07 08:40:17] [INFO ] Flow matrix only has 203 transitions (discarded 20 similar events)
[2025-06-07 08:40:17] [INFO ] Invariant cache hit.
[2025-06-07 08:40:17] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:40:20] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:40:20] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:40:21] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 202/376 variables, 174/233 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 31/264 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (OVERLAPS) 1/377 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 12 (OVERLAPS) 0/377 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 265 constraints, problems are : Problem set: 0 solved, 222 unsolved in 15122 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 174/174 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 202/376 variables, 174/233 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 31/264 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 222/486 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (OVERLAPS) 1/377 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 12 (OVERLAPS) 0/377 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 487 constraints, problems are : Problem set: 0 solved, 222 unsolved in 26105 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 174/174 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41265ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 41266ms
Starting structural reductions in LTL mode, iteration 1 : 174/218 places, 223/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41599 ms. Remains : 174/218 places, 223/327 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 592 ms.
Product exploration explored 100000 steps with 50000 reset in 579 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 32 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Vasy2003-PT-none-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Vasy2003-PT-none-LTLCardinality-06 finished in 42900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 327/327 transitions.
Graph (trivial) has 50 edges and 218 vertex of which 4 / 218 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 216 transition count 317
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 208 transition count 317
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 17 place count 208 transition count 309
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 33 place count 200 transition count 309
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 57 place count 176 transition count 281
Iterating global reduction 2 with 24 rules applied. Total rules applied 81 place count 176 transition count 281
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 96 place count 176 transition count 266
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 109 place count 163 transition count 249
Iterating global reduction 3 with 13 rules applied. Total rules applied 122 place count 163 transition count 249
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 136 place count 163 transition count 235
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 140 place count 159 transition count 228
Iterating global reduction 4 with 4 rules applied. Total rules applied 144 place count 159 transition count 228
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 149 place count 159 transition count 223
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 152 place count 156 transition count 205
Iterating global reduction 5 with 3 rules applied. Total rules applied 155 place count 156 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 156 place count 156 transition count 204
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 158 place count 154 transition count 201
Iterating global reduction 6 with 2 rules applied. Total rules applied 160 place count 154 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 162 place count 154 transition count 199
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 163 place count 153 transition count 197
Iterating global reduction 7 with 1 rules applied. Total rules applied 164 place count 153 transition count 197
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 165 place count 152 transition count 194
Iterating global reduction 7 with 1 rules applied. Total rules applied 166 place count 152 transition count 194
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 167 place count 151 transition count 191
Iterating global reduction 7 with 1 rules applied. Total rules applied 168 place count 151 transition count 191
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 169 place count 150 transition count 189
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 150 transition count 189
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 200 place count 135 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 201 place count 135 transition count 173
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 203 place count 133 transition count 170
Iterating global reduction 8 with 2 rules applied. Total rules applied 205 place count 133 transition count 170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 208 place count 133 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 214 place count 133 transition count 161
Applied a total of 214 rules in 75 ms. Remains 133 /218 variables (removed 85) and now considering 161/327 (removed 166) transitions.
[2025-06-07 08:41:00] [INFO ] Flow matrix only has 141 transitions (discarded 20 similar events)
// Phase 1: matrix 141 rows 133 cols
[2025-06-07 08:41:00] [INFO ] Computed 54 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:41:00] [INFO ] Implicit Places using invariants in 139 ms returned [52, 77, 78, 79, 80, 81, 82, 115, 120]
[2025-06-07 08:41:00] [INFO ] Actually due to overlaps returned [78, 79, 80, 82, 120, 52, 81, 115]
Discarding 8 places :
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Implicit Place search using SMT only with invariants took 143 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/218 places, 155/327 transitions.
Graph (trivial) has 47 edges and 125 vertex of which 4 / 125 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 123 transition count 149
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 119 transition count 149
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 9 place count 119 transition count 134
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 39 place count 104 transition count 134
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 103 transition count 133
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 103 transition count 133
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 2 with 4 rules applied. Total rules applied 45 place count 101 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 49 place count 101 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 100 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 100 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 53 place count 100 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 99 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 99 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 98 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 98 transition count 119
Applied a total of 61 rules in 25 ms. Remains 98 /125 variables (removed 27) and now considering 119/155 (removed 36) transitions.
[2025-06-07 08:41:00] [INFO ] Flow matrix only has 106 transitions (discarded 13 similar events)
// Phase 1: matrix 106 rows 98 cols
[2025-06-07 08:41:00] [INFO ] Computed 46 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:41:00] [INFO ] Implicit Places using invariants in 74 ms returned [25, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 75 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/218 places, 119/327 transitions.
Graph (trivial) has 35 edges and 85 vertex of which 6 / 85 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 1 place count 82 transition count 104
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 70 transition count 104
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 34 place count 61 transition count 95
Iterating global reduction 0 with 9 rules applied. Total rules applied 43 place count 61 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 61 transition count 92
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 58 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 55 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 55 transition count 89
Applied a total of 55 rules in 11 ms. Remains 55 /85 variables (removed 30) and now considering 89/119 (removed 30) transitions.
[2025-06-07 08:41:00] [INFO ] Flow matrix only has 76 transitions (discarded 13 similar events)
// Phase 1: matrix 76 rows 55 cols
[2025-06-07 08:41:00] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:41:00] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 08:41:00] [INFO ] Flow matrix only has 76 transitions (discarded 13 similar events)
[2025-06-07 08:41:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:41:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-07 08:41:00] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 55/218 places, 89/327 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 446 ms. Remains : 55/218 places, 89/327 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA Vasy2003-PT-none-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Vasy2003-PT-none-LTLCardinality-07 finished in 508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((G(!p0)||(!p0&&F(p1)&&F(p2))) U X(p3))))))'
Support contains 5 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 327/327 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 199 transition count 305
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 199 transition count 305
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 51 place count 199 transition count 292
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 188 transition count 278
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 188 transition count 278
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 84 place count 188 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 184 transition count 260
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 184 transition count 260
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 97 place count 184 transition count 255
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 183 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 183 transition count 249
Applied a total of 99 rules in 10 ms. Remains 183 /218 variables (removed 35) and now considering 249/327 (removed 78) transitions.
[2025-06-07 08:41:01] [INFO ] Flow matrix only has 227 transitions (discarded 22 similar events)
// Phase 1: matrix 227 rows 183 cols
[2025-06-07 08:41:01] [INFO ] Computed 56 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:41:01] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-07 08:41:01] [INFO ] Flow matrix only has 227 transitions (discarded 22 similar events)
[2025-06-07 08:41:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:41:01] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-07 08:41:01] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2025-06-07 08:41:01] [INFO ] Flow matrix only has 227 transitions (discarded 22 similar events)
[2025-06-07 08:41:01] [INFO ] Invariant cache hit.
[2025-06-07 08:41:01] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:41:04] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:41:04] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 226/409 variables, 183/241 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 33/274 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (OVERLAPS) 1/410 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (OVERLAPS) 0/410 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 275 constraints, problems are : Problem set: 0 solved, 248 unsolved in 16270 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 183/183 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 226/409 variables, 183/241 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 33/274 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 248/522 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:41:23] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (OVERLAPS) 1/410 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/410 variables, and 524 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 183/183 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46340ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 46341ms
Starting structural reductions in LTL mode, iteration 1 : 183/218 places, 249/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46656 ms. Remains : 183/218 places, 249/327 transitions.
Stuttering acceptance computed with spot in 523 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (NOT p3), true, (NOT p1), (AND (NOT p1) p0), (NOT p2), (AND (NOT p2) p0)]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Vasy2003-PT-none-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Vasy2003-PT-none-LTLCardinality-08 finished in 47214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(X(p1))))||G(F(p2))))'
Support contains 5 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 327/327 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 199 transition count 305
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 199 transition count 305
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 51 place count 199 transition count 292
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 188 transition count 278
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 188 transition count 278
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 84 place count 188 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 184 transition count 260
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 184 transition count 260
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 97 place count 184 transition count 255
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 183 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 183 transition count 249
Applied a total of 99 rules in 11 ms. Remains 183 /218 variables (removed 35) and now considering 249/327 (removed 78) transitions.
[2025-06-07 08:41:48] [INFO ] Flow matrix only has 226 transitions (discarded 23 similar events)
// Phase 1: matrix 226 rows 183 cols
[2025-06-07 08:41:48] [INFO ] Computed 56 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:41:48] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-07 08:41:48] [INFO ] Flow matrix only has 226 transitions (discarded 23 similar events)
[2025-06-07 08:41:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:41:48] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-07 08:41:48] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2025-06-07 08:41:48] [INFO ] Flow matrix only has 226 transitions (discarded 23 similar events)
[2025-06-07 08:41:48] [INFO ] Invariant cache hit.
[2025-06-07 08:41:48] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:41:51] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:41:51] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 225/408 variables, 183/241 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 34/275 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (OVERLAPS) 1/409 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (OVERLAPS) 0/409 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 276 constraints, problems are : Problem set: 0 solved, 248 unsolved in 18678 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 225/408 variables, 183/241 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 34/275 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 248/523 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:42:13] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/409 variables, and 525 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48729ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 48730ms
Starting structural reductions in LTL mode, iteration 1 : 183/218 places, 249/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49081 ms. Remains : 183/218 places, 249/327 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 351 ms.
Product exploration explored 100000 steps with 0 reset in 505 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 585 ms. (68 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1203714 steps, run timeout after 3001 ms. (steps per millisecond=401 ) properties seen :0 out of 1
Probabilistic random walk after 1203714 steps, saw 947355 distinct states, run finished after 3006 ms. (steps per millisecond=400 ) properties seen :0
[2025-06-07 08:42:41] [INFO ] Flow matrix only has 226 transitions (discarded 23 similar events)
[2025-06-07 08:42:41] [INFO ] Invariant cache hit.
[2025-06-07 08:42:41] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/179 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/183 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 225/408 variables, 183/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 34/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/409 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/409 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 274 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/179 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/183 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 225/408 variables, 183/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 34/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/409 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 326ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 9 factoid took 131 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 63 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
Support contains 2 out of 183 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 249/249 transitions.
Graph (trivial) has 41 edges and 183 vertex of which 4 / 183 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 180 transition count 239
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 173 transition count 239
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 15 place count 173 transition count 230
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 40 place count 157 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 36 edges and 157 vertex of which 4 / 157 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 44 place count 155 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 155 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 46 place count 155 transition count 224
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 49 place count 153 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 49 place count 153 transition count 223
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 52 place count 151 transition count 223
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 150 transition count 221
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 150 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 56 place count 150 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 57 place count 149 transition count 219
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 33 rules applied. Total rules applied 90 place count 130 transition count 205
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 12 rules applied. Total rules applied 102 place count 130 transition count 193
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 106 place count 126 transition count 193
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 16 Pre rules applied. Total rules applied 106 place count 126 transition count 177
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 150 place count 98 transition count 177
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 150 place count 98 transition count 165
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 186 place count 74 transition count 165
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 195 place count 74 transition count 156
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 197 place count 72 transition count 154
Iterating global reduction 9 with 2 rules applied. Total rules applied 199 place count 72 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 201 place count 72 transition count 152
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 10 with 4 rules applied. Total rules applied 205 place count 70 transition count 150
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 213 place count 70 transition count 142
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 214 place count 69 transition count 140
Iterating global reduction 11 with 1 rules applied. Total rules applied 215 place count 69 transition count 140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 219 place count 69 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 12 with 18 rules applied. Total rules applied 237 place count 69 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 237 place count 69 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 240 place count 67 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 240 place count 67 transition count 116
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 242 place count 66 transition count 116
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 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 245 place count 64 transition count 115
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 12 with 3 rules applied. Total rules applied 248 place count 64 transition count 112
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 258 place count 59 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 260 place count 58 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 261 place count 58 transition count 108
Applied a total of 261 rules in 43 ms. Remains 58 /183 variables (removed 125) and now considering 108/249 (removed 141) transitions.
[2025-06-07 08:42:42] [INFO ] Flow matrix only has 98 transitions (discarded 10 similar events)
// Phase 1: matrix 98 rows 58 cols
[2025-06-07 08:42:42] [INFO ] Computed 14 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:42:42] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-07 08:42:42] [INFO ] Flow matrix only has 98 transitions (discarded 10 similar events)
[2025-06-07 08:42:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:42:42] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 08:42:42] [INFO ] Redundant transitions in 13 ms returned []
Running 90 sub problems to find dead transitions.
[2025-06-07 08:42:42] [INFO ] Flow matrix only has 98 transitions (discarded 10 similar events)
[2025-06-07 08:42:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 1/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 97/155 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/156 variables, and 72 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2242 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 1/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 97/155 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 90/162 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/155 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/156 variables, and 162 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2393 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4667ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 4667ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/183 places, 108/249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4854 ms. Remains : 58/183 places, 108/249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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 p2), (NOT p2)]
RANDOM walk for 14588 steps (2 resets) in 68 ms. (211 steps per ms) remains 0/1 properties
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 106 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 71 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p2)]
Stuttering criterion allowed to conclude after 2749 steps with 0 reset in 8 ms.
FORMULA Vasy2003-PT-none-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Vasy2003-PT-none-LTLCardinality-12 finished in 59582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(G(p1)))))'
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 327/327 transitions.
Graph (trivial) has 50 edges and 218 vertex of which 4 / 218 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 215 transition count 316
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 207 transition count 316
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 17 place count 207 transition count 307
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 42 place count 191 transition count 307
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 45 edges and 191 vertex of which 4 / 191 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 189 transition count 304
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 48 place count 189 transition count 302
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 48 place count 189 transition count 301
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 51 place count 187 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 51 place count 187 transition count 300
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 185 transition count 300
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 73 place count 166 transition count 277
Iterating global reduction 4 with 19 rules applied. Total rules applied 92 place count 166 transition count 277
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 104 place count 166 transition count 265
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 116 place count 154 transition count 249
Iterating global reduction 5 with 12 rules applied. Total rules applied 128 place count 154 transition count 249
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 142 place count 154 transition count 235
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 145 place count 151 transition count 229
Iterating global reduction 6 with 3 rules applied. Total rules applied 148 place count 151 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 151 place count 151 transition count 226
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 152 place count 150 transition count 220
Iterating global reduction 7 with 1 rules applied. Total rules applied 153 place count 150 transition count 220
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 187 place count 131 transition count 205
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 7 rules applied. Total rules applied 194 place count 131 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 196 place count 129 transition count 198
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 196 place count 129 transition count 187
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 226 place count 110 transition count 187
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 8 Pre rules applied. Total rules applied 226 place count 110 transition count 179
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 250 place count 94 transition count 179
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 256 place count 94 transition count 173
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 259 place count 91 transition count 169
Iterating global reduction 10 with 3 rules applied. Total rules applied 262 place count 91 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 265 place count 91 transition count 166
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 11 with 4 rules applied. Total rules applied 269 place count 89 transition count 164
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 277 place count 89 transition count 156
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 278 place count 88 transition count 154
Iterating global reduction 12 with 1 rules applied. Total rules applied 279 place count 88 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 283 place count 88 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 303 place count 88 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 303 place count 88 transition count 129
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 306 place count 86 transition count 129
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 306 place count 86 transition count 128
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 308 place count 85 transition count 128
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 3 places and 0 transitions.
Iterating global reduction 13 with 5 rules applied. Total rules applied 313 place count 82 transition count 126
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 13 with 3 rules applied. Total rules applied 316 place count 82 transition count 123
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 326 place count 77 transition count 118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 338 place count 69 transition count 114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 350 place count 61 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 353 place count 61 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 355 place count 61 transition count 105
Applied a total of 355 rules in 36 ms. Remains 61 /218 variables (removed 157) and now considering 105/327 (removed 222) transitions.
[2025-06-07 08:42:47] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
// Phase 1: matrix 97 rows 61 cols
[2025-06-07 08:42:47] [INFO ] Computed 15 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:42:47] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-07 08:42:47] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2025-06-07 08:42:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:42:47] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 08:42:48] [INFO ] Redundant transitions in 17 ms returned []
Running 89 sub problems to find dead transitions.
[2025-06-07 08:42:48] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2025-06-07 08:42:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 3/60 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:42:48] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 96/157 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/157 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/158 variables, and 77 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2408 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 3/60 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 96/157 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 89/166 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/158 variables, and 166 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2340 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4762ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4763ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/218 places, 105/327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4939 ms. Remains : 61/218 places, 105/327 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Vasy2003-PT-none-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Vasy2003-PT-none-LTLCardinality-13 finished in 5083 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))'
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 327/327 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 196 transition count 301
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 196 transition count 301
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 60 place count 196 transition count 285
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 184 transition count 269
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 184 transition count 269
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 96 place count 184 transition count 257
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 100 place count 180 transition count 250
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 180 transition count 250
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 109 place count 180 transition count 245
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 177 transition count 227
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 177 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 177 transition count 226
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 175 transition count 223
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 175 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 175 transition count 221
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 123 place count 174 transition count 219
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 174 transition count 219
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 125 place count 173 transition count 216
Iterating global reduction 5 with 1 rules applied. Total rules applied 126 place count 173 transition count 216
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 127 place count 172 transition count 213
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 172 transition count 213
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 129 place count 171 transition count 211
Iterating global reduction 5 with 1 rules applied. Total rules applied 130 place count 171 transition count 211
Applied a total of 130 rules in 15 ms. Remains 171 /218 variables (removed 47) and now considering 211/327 (removed 116) transitions.
[2025-06-07 08:42:52] [INFO ] Flow matrix only has 192 transitions (discarded 19 similar events)
// Phase 1: matrix 192 rows 171 cols
[2025-06-07 08:42:52] [INFO ] Computed 56 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:42:53] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-07 08:42:53] [INFO ] Flow matrix only has 192 transitions (discarded 19 similar events)
[2025-06-07 08:42:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:42:53] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-07 08:42:53] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2025-06-07 08:42:53] [INFO ] Flow matrix only has 192 transitions (discarded 19 similar events)
[2025-06-07 08:42:53] [INFO ] Invariant cache hit.
[2025-06-07 08:42:53] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:42:55] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:42:55] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 08:42:55] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 191/362 variables, 171/230 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 30/260 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 1/363 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 11 (OVERLAPS) 0/363 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 261 constraints, problems are : Problem set: 0 solved, 210 unsolved in 10695 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 171/171 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 191/362 variables, 171/230 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 30/260 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 210/470 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 1/363 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (OVERLAPS) 0/363 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 471 constraints, problems are : Problem set: 0 solved, 210 unsolved in 18768 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 171/171 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29495ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 29496ms
Starting structural reductions in LTL mode, iteration 1 : 171/218 places, 211/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29819 ms. Remains : 171/218 places, 211/327 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 403 ms.
Product exploration explored 100000 steps with 50000 reset in 421 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Vasy2003-PT-none-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Vasy2003-PT-none-LTLCardinality-14 finished in 30757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 327/327 transitions.
Graph (trivial) has 51 edges and 218 vertex of which 4 / 218 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 216 transition count 318
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 209 transition count 318
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 15 place count 209 transition count 309
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 33 place count 200 transition count 309
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 57 place count 176 transition count 281
Iterating global reduction 2 with 24 rules applied. Total rules applied 81 place count 176 transition count 281
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 96 place count 176 transition count 266
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 108 place count 164 transition count 250
Iterating global reduction 3 with 12 rules applied. Total rules applied 120 place count 164 transition count 250
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 134 place count 164 transition count 236
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 137 place count 161 transition count 231
Iterating global reduction 4 with 3 rules applied. Total rules applied 140 place count 161 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 144 place count 161 transition count 227
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 146 place count 159 transition count 215
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 159 transition count 215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 158 transition count 213
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 158 transition count 213
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 157 transition count 211
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 157 transition count 211
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 153 place count 156 transition count 208
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 156 transition count 208
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 155 transition count 205
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 155 transition count 205
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 157 place count 154 transition count 203
Iterating global reduction 5 with 1 rules applied. Total rules applied 158 place count 154 transition count 203
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 190 place count 138 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 191 place count 138 transition count 186
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 193 place count 136 transition count 183
Iterating global reduction 6 with 2 rules applied. Total rules applied 195 place count 136 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 198 place count 136 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 206 place count 136 transition count 172
Applied a total of 206 rules in 33 ms. Remains 136 /218 variables (removed 82) and now considering 172/327 (removed 155) transitions.
[2025-06-07 08:43:23] [INFO ] Flow matrix only has 152 transitions (discarded 20 similar events)
// Phase 1: matrix 152 rows 136 cols
[2025-06-07 08:43:23] [INFO ] Computed 53 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:43:23] [INFO ] Implicit Places using invariants in 110 ms returned [50, 75, 76, 78, 79, 80, 118, 123]
[2025-06-07 08:43:23] [INFO ] Actually due to overlaps returned [80, 76, 78, 79, 123, 50, 118]
Discarding 7 places :
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Implicit Place search using SMT only with invariants took 112 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/218 places, 169/327 transitions.
Graph (trivial) has 46 edges and 129 vertex of which 4 / 129 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 1 place count 127 transition count 154
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 27 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 113 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 113 transition count 153
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 35 place count 110 transition count 150
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 41 place count 110 transition count 144
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 109 transition count 142
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 109 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 109 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 109 transition count 135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 109 transition count 134
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 108 transition count 134
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 2 with 2 rules applied. Total rules applied 54 place count 107 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 107 transition count 130
Applied a total of 57 rules in 12 ms. Remains 107 /129 variables (removed 22) and now considering 130/169 (removed 39) transitions.
[2025-06-07 08:43:23] [INFO ] Flow matrix only has 117 transitions (discarded 13 similar events)
// Phase 1: matrix 117 rows 107 cols
[2025-06-07 08:43:23] [INFO ] Computed 46 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:43:23] [INFO ] Implicit Places using invariants in 67 ms returned [25, 41, 48, 49, 50, 51, 60, 61, 62, 63]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 68 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/218 places, 130/327 transitions.
Graph (trivial) has 34 edges and 97 vertex of which 6 / 97 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 94 transition count 118
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 85 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 25 place count 79 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 31 place count 79 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 33 place count 79 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 35 place count 77 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 75 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 75 transition count 108
Applied a total of 39 rules in 7 ms. Remains 75 /97 variables (removed 22) and now considering 108/130 (removed 22) transitions.
[2025-06-07 08:43:23] [INFO ] Flow matrix only has 93 transitions (discarded 15 similar events)
// Phase 1: matrix 93 rows 75 cols
[2025-06-07 08:43:23] [INFO ] Computed 26 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:43:23] [INFO ] Implicit Places using invariants in 44 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 74/218 places, 108/327 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 285 ms. Remains : 74/218 places, 108/327 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Vasy2003-PT-none-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Vasy2003-PT-none-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Vasy2003-PT-none-LTLCardinality-15 finished in 793 ms.
All properties solved by simple procedures.
Total runtime 232561 ms.

BK_STOP 1749285804506

--------------------
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="Vasy2003-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Vasy2003-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r240-tall-174915590700907"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Vasy2003-PT-none.tgz
mv Vasy2003-PT-none execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;