fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r044-tall-174854028600539
Last Updated
June 24, 2025

About the Execution of ITS-Tools for CO4-PT-21

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 245545.00 0.00 0.00 FFFFFFTFFTFFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028600539.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is CO4-PT-21, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028600539
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 344K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748613009164

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 13:50:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 13:50:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 13:50:10] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2025-05-30 13:50:10] [INFO ] Transformed 1400 places.
[2025-05-30 13:50:10] [INFO ] Transformed 1583 transitions.
[2025-05-30 13:50:10] [INFO ] Found NUPN structural information;
[2025-05-30 13:50:10] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 307 places in 16 ms
Reduce places removed 307 places and 347 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-21-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 1236/1236 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1070 transition count 1231
Discarding 168 places :
Symmetric choice reduction at 1 with 168 rule applications. Total rules 196 place count 902 transition count 1063
Iterating global reduction 1 with 168 rules applied. Total rules applied 364 place count 902 transition count 1063
Discarding 151 places :
Symmetric choice reduction at 1 with 151 rule applications. Total rules 515 place count 751 transition count 911
Iterating global reduction 1 with 151 rules applied. Total rules applied 666 place count 751 transition count 911
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 669 place count 751 transition count 908
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 740 place count 680 transition count 837
Iterating global reduction 2 with 71 rules applied. Total rules applied 811 place count 680 transition count 837
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 862 place count 629 transition count 786
Iterating global reduction 2 with 51 rules applied. Total rules applied 913 place count 629 transition count 786
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 916 place count 629 transition count 783
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 942 place count 603 transition count 757
Iterating global reduction 3 with 26 rules applied. Total rules applied 968 place count 603 transition count 757
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 970 place count 603 transition count 755
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 978 place count 595 transition count 747
Iterating global reduction 4 with 8 rules applied. Total rules applied 986 place count 595 transition count 747
Applied a total of 986 rules in 353 ms. Remains 595 /1093 variables (removed 498) and now considering 747/1236 (removed 489) transitions.
// Phase 1: matrix 747 rows 595 cols
[2025-05-30 13:50:11] [INFO ] Computed 5 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:50:11] [INFO ] Implicit Places using invariants in 321 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 352 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 594/1093 places, 747/1236 transitions.
Applied a total of 0 rules in 22 ms. Remains 594 /594 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 741 ms. Remains : 594/1093 places, 747/1236 transitions.
Support contains 11 out of 594 places after structural reductions.
[2025-05-30 13:50:11] [INFO ] Flatten gal took : 67 ms
[2025-05-30 13:50:11] [INFO ] Flatten gal took : 36 ms
[2025-05-30 13:50:11] [INFO ] Input system was already deterministic with 747 transitions.
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (79 resets) in 1485 ms. (26 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40001 steps (61 resets) in 371 ms. (107 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (100 resets) in 152 ms. (261 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40000 steps (61 resets) in 212 ms. (187 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (31 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (110 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (45 resets) in 120 ms. (330 steps per ms) remains 3/5 properties
// Phase 1: matrix 747 rows 594 cols
[2025-05-30 13:50:12] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 68/80 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 265/345 variables, 82/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/357 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 17/374 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 465/839 variables, 222/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/839 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 337/1176 variables, 172/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1176 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 128/1304 variables, 78/574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1304 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 25/1329 variables, 16/590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1329 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 10/1339 variables, 6/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1339 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/1341 variables, 2/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1341 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1341 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1341/1341 variables, and 598 constraints, problems are : Problem set: 0 solved, 3 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 594/594 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) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 68/80 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 265/345 variables, 82/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/357 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 17/374 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 465/839 variables, 222/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/839 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 337/1176 variables, 172/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1176 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 128/1304 variables, 78/577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1304 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 25/1329 variables, 16/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1329 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 10/1339 variables, 6/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1339 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/1341 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1341 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/1341 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1341/1341 variables, and 601 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1456 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 594/594 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2425ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 61 ms.
Support contains 1 out of 594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 747/747 transitions.
Graph (trivial) has 644 edges and 594 vertex of which 3 / 594 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 938 edges and 592 vertex of which 576 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 296 rules applied. Total rules applied 298 place count 576 transition count 437
Reduce places removed 271 places and 0 transitions.
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 1 with 273 rules applied. Total rules applied 571 place count 305 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 572 place count 304 transition count 435
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 572 place count 304 transition count 371
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 700 place count 240 transition count 371
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 703 place count 237 transition count 368
Iterating global reduction 3 with 3 rules applied. Total rules applied 706 place count 237 transition count 368
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 706 place count 237 transition count 367
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 708 place count 236 transition count 367
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 709 place count 235 transition count 366
Iterating global reduction 3 with 1 rules applied. Total rules applied 710 place count 235 transition count 366
Performed 91 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 892 place count 144 transition count 255
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 898 place count 144 transition count 249
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 907 place count 135 transition count 240
Iterating global reduction 4 with 9 rules applied. Total rules applied 916 place count 135 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 917 place count 135 transition count 239
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 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 925 place count 131 transition count 235
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 929 place count 131 transition count 231
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 933 place count 127 transition count 227
Iterating global reduction 6 with 4 rules applied. Total rules applied 937 place count 127 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 938 place count 127 transition count 226
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 7 with 6 rules applied. Total rules applied 944 place count 124 transition count 223
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 947 place count 124 transition count 220
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 950 place count 121 transition count 217
Iterating global reduction 8 with 3 rules applied. Total rules applied 953 place count 121 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 955 place count 121 transition count 215
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 956 place count 120 transition count 214
Iterating global reduction 9 with 1 rules applied. Total rules applied 957 place count 120 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 958 place count 120 transition count 213
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 10 with 80 rules applied. Total rules applied 1038 place count 80 transition count 216
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 10 with 43 rules applied. Total rules applied 1081 place count 80 transition count 173
Discarding 35 places :
Symmetric choice reduction at 11 with 35 rule applications. Total rules 1116 place count 45 transition count 116
Iterating global reduction 11 with 35 rules applied. Total rules applied 1151 place count 45 transition count 116
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 11 with 27 rules applied. Total rules applied 1178 place count 45 transition count 89
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 1185 place count 38 transition count 69
Iterating global reduction 12 with 7 rules applied. Total rules applied 1192 place count 38 transition count 69
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1197 place count 38 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1198 place count 38 transition count 63
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1199 place count 37 transition count 62
Iterating global reduction 13 with 1 rules applied. Total rules applied 1200 place count 37 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1201 place count 37 transition count 61
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 1207 place count 37 transition count 55
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 1216 place count 31 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1217 place count 31 transition count 51
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1218 place count 31 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1219 place count 30 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1220 place count 30 transition count 49
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1222 place count 30 transition count 49
Graph (complete) has 97 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 1223 place count 29 transition count 49
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1224 place count 29 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1225 place count 29 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1226 place count 29 transition count 47
Graph (complete) has 93 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 18 with 1 rules applied. Total rules applied 1227 place count 28 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1228 place count 28 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 1229 place count 28 transition count 46
Graph (complete) has 90 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 1 rules applied. Total rules applied 1230 place count 27 transition count 46
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 1231 place count 27 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 1232 place count 26 transition count 44
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t62.t66.t658.t717 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 20 edges and 22 vertex of which 3 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 22 with 3 rules applied. Total rules applied 1235 place count 20 transition count 42
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t59.t644.t42.t43.t44.t45.t46.t47.t48.t49.t58.t31.t717.t157.t158.t159.t725.t16.t162 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 16 edges and 18 vertex of which 3 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 23 with 8 rules applied. Total rules applied 1243 place count 16 transition count 35
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 1247 place count 16 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 25 with 6 rules applied. Total rules applied 1253 place count 16 transition count 25
Discarding 4 places :
Symmetric choice reduction at 25 with 4 rule applications. Total rules 1257 place count 12 transition count 21
Iterating global reduction 25 with 4 rules applied. Total rules applied 1261 place count 12 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 1265 place count 12 transition count 17
Discarding 2 places :
Symmetric choice reduction at 26 with 2 rule applications. Total rules 1267 place count 10 transition count 15
Iterating global reduction 26 with 2 rules applied. Total rules applied 1269 place count 10 transition count 15
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 1271 place count 10 transition count 13
Free-agglomeration rule applied 2 times.
Iterating global reduction 27 with 2 rules applied. Total rules applied 1273 place count 10 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 1275 place count 8 transition count 11
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 28 with 2 rules applied. Total rules applied 1277 place count 8 transition count 11
Applied a total of 1277 rules in 159 ms. Remains 8 /594 variables (removed 586) and now considering 11/747 (removed 736) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 8/594 places, 11/747 transitions.
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 941 edges and 594 vertex of which 589 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.16 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(p1)||p0) U G(!p1)))'
Support contains 2 out of 594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 594/594 places, 747/747 transitions.
Graph (trivial) has 641 edges and 594 vertex of which 3 / 594 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 939 edges and 592 vertex of which 587 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 261 rules applied. Total rules applied 263 place count 586 transition count 477
Reduce places removed 260 places and 0 transitions.
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 1 with 262 rules applied. Total rules applied 525 place count 326 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 526 place count 325 transition count 475
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 526 place count 325 transition count 410
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 656 place count 260 transition count 410
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 658 place count 258 transition count 408
Iterating global reduction 3 with 2 rules applied. Total rules applied 660 place count 258 transition count 408
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 660 place count 258 transition count 407
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 662 place count 257 transition count 407
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 663 place count 256 transition count 406
Iterating global reduction 3 with 1 rules applied. Total rules applied 664 place count 256 transition count 406
Performed 97 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 858 place count 159 transition count 283
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 864 place count 159 transition count 277
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 873 place count 150 transition count 268
Iterating global reduction 4 with 9 rules applied. Total rules applied 882 place count 150 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 883 place count 150 transition count 267
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 5 with 6 rules applied. Total rules applied 889 place count 147 transition count 264
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 979 place count 102 transition count 267
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 1007 place count 102 transition count 239
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 1047 place count 62 transition count 159
Iterating global reduction 6 with 40 rules applied. Total rules applied 1087 place count 62 transition count 159
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 1111 place count 62 transition count 135
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1121 place count 52 transition count 106
Iterating global reduction 7 with 10 rules applied. Total rules applied 1131 place count 52 transition count 106
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1138 place count 52 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1140 place count 51 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 1153 place count 51 transition count 94
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1154 place count 51 transition count 94
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1156 place count 49 transition count 92
Applied a total of 1156 rules in 86 ms. Remains 49 /594 variables (removed 545) and now considering 92/747 (removed 655) transitions.
[2025-05-30 13:50:15] [INFO ] Flow matrix only has 84 transitions (discarded 8 similar events)
// Phase 1: matrix 84 rows 49 cols
[2025-05-30 13:50:15] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:50:15] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-05-30 13:50:15] [INFO ] Flow matrix only has 84 transitions (discarded 8 similar events)
[2025-05-30 13:50:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:50:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 13:50:15] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:50:15] [INFO ] Redundant transitions in 3 ms returned []
Running 79 sub problems to find dead transitions.
[2025-05-30 13:50:15] [INFO ] Flow matrix only has 84 transitions (discarded 8 similar events)
[2025-05-30 13:50:15] [INFO ] Invariant cache hit.
[2025-05-30 13:50:15] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 83/132 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 1/133 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 55 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1737 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 83/132 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 79/133 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 134 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2525 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4300ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4301ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/594 places, 92/747 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4494 ms. Remains : 49/594 places, 92/747 transitions.
Stuttering acceptance computed with spot in 255 ms :[p1, (NOT p1), p1, true]
Running random walk in product with property : CO4-PT-21-LTLCardinality-00
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 3 ms.
FORMULA CO4-PT-21-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLCardinality-00 finished in 4806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 594/594 places, 747/747 transitions.
Graph (trivial) has 642 edges and 594 vertex of which 3 / 594 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 939 edges and 592 vertex of which 587 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 260 rules applied. Total rules applied 262 place count 586 transition count 478
Reduce places removed 259 places and 0 transitions.
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 1 with 261 rules applied. Total rules applied 523 place count 327 transition count 476
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 524 place count 326 transition count 476
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 524 place count 326 transition count 411
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 654 place count 261 transition count 411
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 655 place count 260 transition count 410
Iterating global reduction 3 with 1 rules applied. Total rules applied 656 place count 260 transition count 410
Performed 99 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 854 place count 161 transition count 284
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 860 place count 161 transition count 278
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 869 place count 152 transition count 269
Iterating global reduction 4 with 9 rules applied. Total rules applied 878 place count 152 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 879 place count 152 transition count 268
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 5 with 6 rules applied. Total rules applied 885 place count 149 transition count 265
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 977 place count 103 transition count 269
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1006 place count 103 transition count 240
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 1045 place count 64 transition count 162
Iterating global reduction 6 with 39 rules applied. Total rules applied 1084 place count 64 transition count 162
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 1110 place count 64 transition count 136
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1119 place count 55 transition count 110
Iterating global reduction 7 with 9 rules applied. Total rules applied 1128 place count 55 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1134 place count 55 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1136 place count 55 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1138 place count 53 transition count 100
Applied a total of 1138 rules in 53 ms. Remains 53 /594 variables (removed 541) and now considering 100/747 (removed 647) transitions.
[2025-05-30 13:50:20] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
// Phase 1: matrix 92 rows 53 cols
[2025-05-30 13:50:20] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:50:20] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-30 13:50:20] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-05-30 13:50:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:50:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 13:50:20] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:50:20] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2025-05-30 13:50:20] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-05-30 13:50:20] [INFO ] Invariant cache hit.
[2025-05-30 13:50:20] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 1/145 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 60 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2042 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 87/146 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/145 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 147 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3167 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5234ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 5234ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/594 places, 100/747 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5402 ms. Remains : 53/594 places, 100/747 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-02
Product exploration explored 100000 steps with 14 reset in 135 ms.
Product exploration explored 100000 steps with 16 reset in 70 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3724 resets) in 285 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (447 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 561853 steps, run visited all 1 properties in 529 ms. (steps per millisecond=1062 )
Probabilistic random walk after 561853 steps, saw 109272 distinct states, run finished after 532 ms. (steps per millisecond=1056 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 53 /53 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2025-05-30 13:50:27] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-05-30 13:50:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:50:27] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-05-30 13:50:27] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-05-30 13:50:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:50:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 13:50:27] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:50:27] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2025-05-30 13:50:27] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-05-30 13:50:27] [INFO ] Invariant cache hit.
[2025-05-30 13:50:27] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 1/145 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 60 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2092 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 87/146 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/145 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 147 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2991 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5111ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 5112ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5245 ms. Remains : 53/53 places, 100/100 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 91 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3737 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (429 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 561853 steps, run visited all 1 properties in 559 ms. (steps per millisecond=1005 )
Probabilistic random walk after 561853 steps, saw 109272 distinct states, run finished after 560 ms. (steps per millisecond=1003 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 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 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 129 ms.
Product exploration explored 100000 steps with 4 reset in 78 ms.
Built C files in :
/tmp/ltsmin2730632563612104924
[2025-05-30 13:50:33] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2025-05-30 13:50:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:50:33] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2025-05-30 13:50:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:50:33] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2025-05-30 13:50:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:50:33] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2730632563612104924
Running compilation step : cd /tmp/ltsmin2730632563612104924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 307 ms.
Running link step : cd /tmp/ltsmin2730632563612104924;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin2730632563612104924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8772229534946656153.hoa' '--buchi-type=spotba'
LTSmin run took 633 ms.
FORMULA CO4-PT-21-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-21-LTLCardinality-02 finished in 14565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 747/747 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 589 transition count 742
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 589 transition count 742
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 586 transition count 739
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 586 transition count 739
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 584 transition count 737
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 584 transition count 737
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 583 transition count 736
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 583 transition count 736
Applied a total of 22 rules in 57 ms. Remains 583 /594 variables (removed 11) and now considering 736/747 (removed 11) transitions.
// Phase 1: matrix 736 rows 583 cols
[2025-05-30 13:50:34] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:50:35] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-05-30 13:50:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:50:35] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2025-05-30 13:50:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1319/1319 variables, and 587 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1319 variables, 735/1322 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1319/1319 variables, and 1322 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Starting structural reductions in LTL mode, iteration 1 : 583/594 places, 736/747 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60719 ms. Remains : 583/594 places, 736/747 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CO4-PT-21-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLCardinality-04 finished in 60875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 747/747 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 590 transition count 743
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 590 transition count 743
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 587 transition count 740
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 587 transition count 740
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 585 transition count 738
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 585 transition count 738
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 584 transition count 737
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 584 transition count 737
Applied a total of 20 rules in 57 ms. Remains 584 /594 variables (removed 10) and now considering 737/747 (removed 10) transitions.
// Phase 1: matrix 737 rows 584 cols
[2025-05-30 13:51:35] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:51:36] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-05-30 13:51:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:51:36] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 736 sub problems to find dead transitions.
[2025-05-30 13:51:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/583 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 1 (OVERLAPS) 1/584 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 3 (OVERLAPS) 737/1321 variables, 584/588 constraints. Problems are: Problem set: 0 solved, 736 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1321/1321 variables, and 588 constraints, problems are : Problem set: 0 solved, 736 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 736/736 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 736 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/583 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 1 (OVERLAPS) 1/584 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 3 (OVERLAPS) 737/1321 variables, 584/588 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1321 variables, 736/1324 constraints. Problems are: Problem set: 0 solved, 736 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:52:35] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1321/1321 variables, and 1325 constraints, problems are : Problem set: 0 solved, 736 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 736/736 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 736 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Starting structural reductions in LTL mode, iteration 1 : 584/594 places, 737/747 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60798 ms. Remains : 584/594 places, 737/747 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 929 edges and 584 vertex of which 579 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 15 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-21-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-21-LTLCardinality-06 finished in 61408 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((X(p0)||(p0&&G(p1))))||F(G(p1))))'
Support contains 2 out of 594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 747/747 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 589 transition count 742
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 589 transition count 742
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 586 transition count 739
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 586 transition count 739
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 584 transition count 737
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 584 transition count 737
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 583 transition count 736
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 583 transition count 736
Applied a total of 22 rules in 89 ms. Remains 583 /594 variables (removed 11) and now considering 736/747 (removed 11) transitions.
// Phase 1: matrix 736 rows 583 cols
[2025-05-30 13:52:37] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:52:37] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-05-30 13:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:52:37] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2025-05-30 13:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1319/1319 variables, and 587 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1319 variables, 735/1322 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1319/1319 variables, and 1322 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 583/594 places, 736/747 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60900 ms. Remains : 583/594 places, 736/747 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-08
Product exploration explored 100000 steps with 2 reset in 88 ms.
Product exploration explored 100000 steps with 21 reset in 94 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 927 edges and 583 vertex of which 578 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 15 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
RANDOM walk for 40000 steps (136 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (64 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8484 steps, run visited all 1 properties in 27 ms. (steps per millisecond=314 )
Probabilistic random walk after 8484 steps, saw 2257 distinct states, run finished after 27 ms. (steps per millisecond=314 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Support contains 1 out of 583 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 : 583/583 places, 736/736 transitions.
Graph (trivial) has 635 edges and 583 vertex of which 3 / 583 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 925 edges and 581 vertex of which 576 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 254 rules applied. Total rules applied 256 place count 575 transition count 473
Reduce places removed 253 places and 0 transitions.
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 1 with 255 rules applied. Total rules applied 511 place count 322 transition count 471
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 512 place count 321 transition count 471
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 512 place count 321 transition count 404
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 646 place count 254 transition count 404
Performed 97 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 840 place count 157 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 846 place count 157 transition count 274
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 854 place count 149 transition count 266
Iterating global reduction 4 with 8 rules applied. Total rules applied 862 place count 149 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 863 place count 149 transition count 265
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 5 with 4 rules applied. Total rules applied 867 place count 147 transition count 263
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 959 place count 101 transition count 267
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 988 place count 101 transition count 238
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 1027 place count 62 transition count 160
Iterating global reduction 6 with 39 rules applied. Total rules applied 1066 place count 62 transition count 160
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 1092 place count 62 transition count 134
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1101 place count 53 transition count 108
Iterating global reduction 7 with 9 rules applied. Total rules applied 1110 place count 53 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1114 place count 53 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1120 place count 53 transition count 98
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 1127 place count 53 transition count 98
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1129 place count 51 transition count 96
Applied a total of 1129 rules in 54 ms. Remains 51 /583 variables (removed 532) and now considering 96/736 (removed 640) transitions.
[2025-05-30 13:53:38] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
// Phase 1: matrix 88 rows 51 cols
[2025-05-30 13:53:38] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:53:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-05-30 13:53:38] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2025-05-30 13:53:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:53:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 13:53:38] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:53:38] [INFO ] Redundant transitions in 1 ms returned []
Running 83 sub problems to find dead transitions.
[2025-05-30 13:53:38] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2025-05-30 13:53:38] [INFO ] Invariant cache hit.
[2025-05-30 13:53:38] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 87/138 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 1/139 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 58 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1940 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 87/138 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 83/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/139 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 141 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2769 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4727ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 4728ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/583 places, 96/736 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4877 ms. Remains : 51/583 places, 96/736 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
RANDOM walk for 792 steps (71 resets) in 6 ms. (113 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 11 reset in 28 ms.
Stuttering criterion allowed to conclude after 100 steps with 9 reset in 0 ms.
FORMULA CO4-PT-21-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLCardinality-08 finished in 66845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 2 out of 594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 594/594 places, 747/747 transitions.
Graph (trivial) has 641 edges and 594 vertex of which 3 / 594 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 939 edges and 592 vertex of which 587 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 258 transitions
Trivial Post-agglo rules discarded 258 transitions
Performed 258 trivial Post agglomeration. Transition count delta: 258
Iterating post reduction 0 with 259 rules applied. Total rules applied 261 place count 586 transition count 479
Reduce places removed 258 places and 0 transitions.
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 1 with 260 rules applied. Total rules applied 521 place count 328 transition count 477
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 523 place count 327 transition count 476
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 524 place count 326 transition count 476
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 524 place count 326 transition count 411
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 654 place count 261 transition count 411
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 656 place count 259 transition count 409
Iterating global reduction 4 with 2 rules applied. Total rules applied 658 place count 259 transition count 409
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 658 place count 259 transition count 408
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 660 place count 258 transition count 408
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 661 place count 257 transition count 407
Iterating global reduction 4 with 1 rules applied. Total rules applied 662 place count 257 transition count 407
Performed 99 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 860 place count 158 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 866 place count 158 transition count 275
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 875 place count 149 transition count 266
Iterating global reduction 5 with 9 rules applied. Total rules applied 884 place count 149 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 885 place count 149 transition count 265
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 6 with 6 rules applied. Total rules applied 891 place count 146 transition count 262
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 981 place count 101 transition count 265
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1010 place count 101 transition count 236
Discarding 39 places :
Symmetric choice reduction at 7 with 39 rule applications. Total rules 1049 place count 62 transition count 158
Iterating global reduction 7 with 39 rules applied. Total rules applied 1088 place count 62 transition count 158
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 1114 place count 62 transition count 132
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1124 place count 52 transition count 103
Iterating global reduction 8 with 10 rules applied. Total rules applied 1134 place count 52 transition count 103
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1141 place count 52 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1143 place count 51 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 1157 place count 51 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1159 place count 49 transition count 90
Applied a total of 1159 rules in 51 ms. Remains 49 /594 variables (removed 545) and now considering 90/747 (removed 657) transitions.
[2025-05-30 13:53:44] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
// Phase 1: matrix 81 rows 49 cols
[2025-05-30 13:53:44] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:53:44] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-30 13:53:44] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2025-05-30 13:53:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:53:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 13:53:44] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:53:44] [INFO ] Redundant transitions in 2 ms returned []
Running 78 sub problems to find dead transitions.
[2025-05-30 13:53:44] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2025-05-30 13:53:44] [INFO ] Invariant cache hit.
[2025-05-30 13:53:44] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 80/129 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/130 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 55 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1984 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 80/129 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 78/132 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 133 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2647 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4655ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 4656ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/594 places, 90/747 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4802 ms. Remains : 49/594 places, 90/747 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-10
Product exploration explored 100000 steps with 16 reset in 80 ms.
Product exploration explored 100000 steps with 1 reset in 66 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
RANDOM walk for 10421 steps (892 resets) in 23 ms. (434 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 217 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 90/90 transitions.
Applied a total of 0 rules in 6 ms. Remains 49 /49 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2025-05-30 13:53:49] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2025-05-30 13:53:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:53:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-30 13:53:49] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2025-05-30 13:53:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:53:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 13:53:49] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:53:50] [INFO ] Redundant transitions in 2 ms returned []
Running 78 sub problems to find dead transitions.
[2025-05-30 13:53:50] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2025-05-30 13:53:50] [INFO ] Invariant cache hit.
[2025-05-30 13:53:50] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 80/129 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/130 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 55 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1958 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 80/129 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 78/132 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 133 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2636 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4606ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 4606ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4707 ms. Remains : 49/49 places, 90/90 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
RANDOM walk for 8701 steps (750 resets) in 23 ms. (362 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 254 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Product exploration explored 100000 steps with 21 reset in 40 ms.
Product exploration explored 100000 steps with 9 reset in 149 ms.
Built C files in :
/tmp/ltsmin13316909055247996159
[2025-05-30 13:53:55] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2025-05-30 13:53:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:53:55] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2025-05-30 13:53:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:53:55] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2025-05-30 13:53:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:53:55] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13316909055247996159
Running compilation step : cd /tmp/ltsmin13316909055247996159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 195 ms.
Running link step : cd /tmp/ltsmin13316909055247996159;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13316909055247996159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11303319151145335397.hoa' '--buchi-type=spotba'
LTSmin run took 74 ms.
FORMULA CO4-PT-21-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-21-LTLCardinality-10 finished in 12068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 594/594 places, 747/747 transitions.
Graph (trivial) has 644 edges and 594 vertex of which 3 / 594 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 939 edges and 592 vertex of which 587 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 0 with 262 rules applied. Total rules applied 264 place count 586 transition count 476
Reduce places removed 261 places and 0 transitions.
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 1 with 263 rules applied. Total rules applied 527 place count 325 transition count 474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 528 place count 324 transition count 474
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 528 place count 324 transition count 409
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 658 place count 259 transition count 409
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 660 place count 257 transition count 407
Iterating global reduction 3 with 2 rules applied. Total rules applied 662 place count 257 transition count 407
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 662 place count 257 transition count 406
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 664 place count 256 transition count 406
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 665 place count 255 transition count 405
Iterating global reduction 3 with 1 rules applied. Total rules applied 666 place count 255 transition count 405
Performed 99 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 864 place count 156 transition count 279
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 870 place count 156 transition count 273
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 879 place count 147 transition count 264
Iterating global reduction 4 with 9 rules applied. Total rules applied 888 place count 147 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 889 place count 147 transition count 263
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 5 with 6 rules applied. Total rules applied 895 place count 144 transition count 260
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 983 place count 100 transition count 263
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1012 place count 100 transition count 234
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 1051 place count 61 transition count 156
Iterating global reduction 6 with 39 rules applied. Total rules applied 1090 place count 61 transition count 156
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 1116 place count 61 transition count 130
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1126 place count 51 transition count 101
Iterating global reduction 7 with 10 rules applied. Total rules applied 1136 place count 51 transition count 101
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1143 place count 51 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1145 place count 50 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 1158 place count 50 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1160 place count 48 transition count 87
Applied a total of 1160 rules in 40 ms. Remains 48 /594 variables (removed 546) and now considering 87/747 (removed 660) transitions.
[2025-05-30 13:53:56] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
// Phase 1: matrix 80 rows 48 cols
[2025-05-30 13:53:56] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:53:56] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-30 13:53:56] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
[2025-05-30 13:53:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:53:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 13:53:56] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:53:56] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2025-05-30 13:53:56] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
[2025-05-30 13:53:56] [INFO ] Invariant cache hit.
[2025-05-30 13:53:56] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 79/127 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 1/128 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 54 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1524 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 79/127 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 74/127 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 128 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2337 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3878ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3878ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/594 places, 87/747 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4010 ms. Remains : 48/594 places, 87/747 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-11
Product exploration explored 100000 steps with 25 reset in 35 ms.
Product exploration explored 100000 steps with 53 reset in 36 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1369 steps (125 resets) in 7 ms. (171 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2025-05-30 13:54:00] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
[2025-05-30 13:54:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:54:00] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-05-30 13:54:00] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
[2025-05-30 13:54:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:54:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 13:54:00] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:54:00] [INFO ] Redundant transitions in 0 ms returned []
Running 74 sub problems to find dead transitions.
[2025-05-30 13:54:00] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
[2025-05-30 13:54:00] [INFO ] Invariant cache hit.
[2025-05-30 13:54:00] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 79/127 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 1/128 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 54 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 79/127 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 74/127 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 128 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2373 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3896ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3897ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3999 ms. Remains : 48/48 places, 87/87 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1895 steps (172 resets) in 10 ms. (172 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10 reset in 36 ms.
Product exploration explored 100000 steps with 17 reset in 32 ms.
Built C files in :
/tmp/ltsmin7710649320089404951
[2025-05-30 13:54:05] [INFO ] Computing symmetric may disable matrix : 87 transitions.
[2025-05-30 13:54:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:54:05] [INFO ] Computing symmetric may enable matrix : 87 transitions.
[2025-05-30 13:54:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:54:05] [INFO ] Computing Do-Not-Accords matrix : 87 transitions.
[2025-05-30 13:54:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:54:05] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7710649320089404951
Running compilation step : cd /tmp/ltsmin7710649320089404951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 186 ms.
Running link step : cd /tmp/ltsmin7710649320089404951;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7710649320089404951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17014383023367667493.hoa' '--buchi-type=spotba'
LTSmin run took 86 ms.
FORMULA CO4-PT-21-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-21-LTLCardinality-11 finished in 9600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 594/594 places, 747/747 transitions.
Graph (trivial) has 645 edges and 594 vertex of which 3 / 594 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 939 edges and 592 vertex of which 587 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 263 rules applied. Total rules applied 265 place count 586 transition count 475
Reduce places removed 262 places and 0 transitions.
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 1 with 264 rules applied. Total rules applied 529 place count 324 transition count 473
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 530 place count 323 transition count 473
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 530 place count 323 transition count 408
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 660 place count 258 transition count 408
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 662 place count 256 transition count 406
Iterating global reduction 3 with 2 rules applied. Total rules applied 664 place count 256 transition count 406
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 664 place count 256 transition count 405
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 666 place count 255 transition count 405
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 667 place count 254 transition count 404
Iterating global reduction 3 with 1 rules applied. Total rules applied 668 place count 254 transition count 404
Performed 98 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 864 place count 156 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 870 place count 156 transition count 274
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 878 place count 148 transition count 266
Iterating global reduction 4 with 8 rules applied. Total rules applied 886 place count 148 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 887 place count 148 transition count 265
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 5 with 4 rules applied. Total rules applied 891 place count 146 transition count 263
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 983 place count 100 transition count 267
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1012 place count 100 transition count 238
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 1052 place count 60 transition count 158
Iterating global reduction 6 with 40 rules applied. Total rules applied 1092 place count 60 transition count 158
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 1118 place count 60 transition count 132
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1128 place count 50 transition count 103
Iterating global reduction 7 with 10 rules applied. Total rules applied 1138 place count 50 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1143 place count 50 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1145 place count 49 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 1161 place count 49 transition count 90
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1167 place count 49 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1169 place count 47 transition count 88
Applied a total of 1169 rules in 42 ms. Remains 47 /594 variables (removed 547) and now considering 88/747 (removed 659) transitions.
[2025-05-30 13:54:05] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
// Phase 1: matrix 80 rows 47 cols
[2025-05-30 13:54:05] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:54:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-30 13:54:05] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2025-05-30 13:54:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:54:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 13:54:05] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:54:05] [INFO ] Redundant transitions in 0 ms returned []
Running 75 sub problems to find dead transitions.
[2025-05-30 13:54:05] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2025-05-30 13:54:05] [INFO ] Invariant cache hit.
[2025-05-30 13:54:05] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 79/126 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 1/127 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 53 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1604 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 79/126 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 75/127 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/127 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 128 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2258 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3875ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3875ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/594 places, 88/747 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4010 ms. Remains : 47/594 places, 88/747 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-13
Product exploration explored 100000 steps with 7 reset in 39 ms.
Product exploration explored 100000 steps with 1 reset in 33 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 1767 steps (164 resets) in 10 ms. (160 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 47 /47 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2025-05-30 13:54:10] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2025-05-30 13:54:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:54:10] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-30 13:54:10] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2025-05-30 13:54:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:54:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 13:54:10] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:54:10] [INFO ] Redundant transitions in 0 ms returned []
Running 75 sub problems to find dead transitions.
[2025-05-30 13:54:10] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2025-05-30 13:54:10] [INFO ] Invariant cache hit.
[2025-05-30 13:54:10] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 79/126 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 1/127 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 53 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1628 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 79/126 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 75/127 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/127 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 128 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2333 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3973ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3973ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4066 ms. Remains : 47/47 places, 88/88 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 1047 steps (95 resets) in 6 ms. (149 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 95 steps with 8 reset in 1 ms.
FORMULA CO4-PT-21-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLCardinality-13 finished in 8942 ms.
All properties solved by simple procedures.
Total runtime 244280 ms.

BK_STOP 1748613254709

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-21"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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