Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967700467.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is CopsAndRobbers-PT-CRL023X004, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.2K Mar 6 13:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 6 13:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 6 13:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 13:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Mar 15 08:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 08:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 6 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Mar 6 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 6 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 122K Mar 3 18:30 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 CopsAndRobbers-PT-CRL023X004-LTLCardinality-00
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-01
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-02
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-03
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-04
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-05
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-06
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-07
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-08
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-09
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-10
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-11
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-12
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-13
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-14
FORMULA_NAME CopsAndRobbers-PT-CRL023X004-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779530323863

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-CRL023X004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 09:58:45] [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]
[2026-05-23 09:58:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:58:45] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2026-05-23 09:58:45] [INFO ] Transformed 125 places.
[2026-05-23 09:58:45] [INFO ] Transformed 165 transitions.
[2026-05-23 09:58:45] [INFO ] Parsed PT model containing 125 places and 165 transitions and 768 arcs in 145 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.
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 165/165 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 108 transition count 165
Applied a total of 17 rules in 28 ms. Remains 108 /125 variables (removed 17) and now considering 165/165 (removed 0) transitions.
Running 119 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11997331127456483259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14372734927707435137.kers'
[2026-05-23 09:58:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11997331127456483259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14372734927707435137.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 165 rows 85 cols 481 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-23 09:58:45] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14372734927707435137.kers
Total runtime 2 ms.
[2026-05-23 09:58:45] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 165/267 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 6/273 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 273/273 variables, and 181 constraints, problems are : Problem set: 0 solved, 119 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 108/108 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 165/267 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 95/269 constraints. Problems are: Problem set: 0 solved, 119 unsolved
SMT process timed out in 40205ms, After SMT, problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 40222ms
[2026-05-23 09:59:25] [INFO ] Invariant cache hit.
[2026-05-23 09:59:25] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-23 09:59:25] [INFO ] Invariant cache hit.
[2026-05-23 09:59:25] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 09:59:26] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 108/125 places, 165/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40990 ms. Remains : 108/125 places, 165/165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 165/165 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 09:59:26] [INFO ] Invariant cache hit.
[2026-05-23 09:59:26] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-23 09:59:26] [INFO ] Invariant cache hit.
[2026-05-23 09:59:26] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 09:59:26] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 108/108 places, 165/165 transitions.
Support contains 40 out of 108 places after structural reductions.
[2026-05-23 09:59:27] [INFO ] Flatten gal took : 36 ms
[2026-05-23 09:59:27] [INFO ] Flatten gal took : 16 ms
[2026-05-23 09:59:27] [INFO ] Input system was already deterministic with 165 transitions.
RANDOM walk for 40000 steps (8 resets) in 898 ms. (44 steps per ms) remains 11/30 properties
BEST_FIRST walk for 40003 steps (9 resets) in 307 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (9 resets) in 219 ms. (181 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (12 resets) in 179 ms. (222 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (10 resets) in 189 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (9 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 277 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (13 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
[2026-05-23 09:59:28] [INFO ] Invariant cache hit.
[2026-05-23 09:59:28] [INFO ] State equation strengthened by 46 read => feed constraints.
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp18 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 2 (OVERLAPS) 29/44 variables, 10/11 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 4 (OVERLAPS) 16/60 variables, 15/26 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/26 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 126/186 variables, 60/86 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 7/93 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/93 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 85/271 variables, 46/139 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 39/178 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/178 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/273 variables, 2/180 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/180 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/273 variables, 0/180 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 180 constraints, problems are : Problem set: 8 solved, 2 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 108/108 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/3 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 25/59 variables, 24/27 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/27 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 125/184 variables, 59/86 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 6/92 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 2/94 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/94 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 86/270 variables, 46/140 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 40/180 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/180 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/273 variables, 3/183 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 0/183 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/273 variables, 0/183 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 183 constraints, problems are : Problem set: 8 solved, 2 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 108/108 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 847ms problems are : Problem set: 8 solved, 2 unsolved
Parikh walk visited 0 properties in 362 ms.
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 165/165 transitions.
Graph (complete) has 511 edges and 108 vertex of which 105 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 105 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 104 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 103 transition count 163
Applied a total of 5 rules in 24 ms. Remains 103 /108 variables (removed 5) and now considering 163/165 (removed 2) transitions.
Running 117 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-816588527079937720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4291341080410870199.kers'
[2026-05-23 09:59:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-816588527079937720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4291341080410870199.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 163 rows 80 cols 471 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-23 09:59:29] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4291341080410870199.kers
Total runtime 1 ms.
[2026-05-23 09:59:29] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 163/263 variables, 100/126 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 3/266 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/266 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 175 constraints, problems are : Problem set: 0 solved, 117 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 103/103 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 163/263 variables, 100/126 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 105/277 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/266 variables, and 277 constraints, problems are : Problem set: 0 solved, 117 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 100/103 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 105/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40070ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 40072ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40096 ms. Remains : 103/108 places, 163/165 transitions.
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1504267 steps, run timeout after 3001 ms. (steps per millisecond=501 ) properties seen :1 out of 2
Probabilistic random walk after 1504267 steps, saw 523486 distinct states, run finished after 3007 ms. (steps per millisecond=500 ) properties seen :1
[2026-05-23 10:00:12] [INFO ] Invariant cache hit.
[2026-05-23 10:00:12] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/55 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 119/174 variables, 55/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 90/264 variables, 46/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 44/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/266 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/266 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 103/103 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 25/55 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 119/174 variables, 55/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 90/264 variables, 46/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 44/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/266 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/266 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 103/103 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 5 ms.
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 47 stable transitions
Graph (complete) has 695 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(p0 U X(X(G(!p0))))))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 165/165 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 103 transition count 165
Applied a total of 5 rules in 3 ms. Remains 103 /108 variables (removed 5) and now considering 165/165 (removed 0) transitions.
Running 119 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17486175262851388322.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16805471655514529228.kers'
[2026-05-23 10:00:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17486175262851388322.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16805471655514529228.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 165 rows 80 cols 471 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-23 10:00:13] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16805471655514529228.kers
Total runtime 1 ms.
[2026-05-23 10:00:13] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 165/267 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 1/268 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 268/268 variables, and 176 constraints, problems are : Problem set: 0 solved, 119 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 103/103 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 165/267 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 115/289 constraints. Problems are: Problem set: 0 solved, 119 unsolved
SMT process timed out in 40066ms, After SMT, problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 40066ms
[2026-05-23 10:00:53] [INFO ] Invariant cache hit.
[2026-05-23 10:00:53] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 10:00:53] [INFO ] Invariant cache hit.
[2026-05-23 10:00:53] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 10:00:54] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 103/108 places, 165/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41365 ms. Remains : 103/108 places, 165/165 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(p0 U X(X(G(!p0))))))'
Stuttering acceptance computed with spot in 337 ms :[true, p0, (NOT p0), p0, p0, true]
Running random walk in product with property : CopsAndRobbers-PT-CRL023X004-LTLCardinality-00
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 3 ms.
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL023X004-LTLCardinality-00 finished in 41778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(!p0))))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 165/165 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 102 transition count 165
Applied a total of 6 rules in 4 ms. Remains 102 /108 variables (removed 6) and now considering 165/165 (removed 0) transitions.
Running 119 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17561950770464332020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-968675356104281124.kers'
[2026-05-23 10:00:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17561950770464332020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-968675356104281124.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 165 rows 79 cols 469 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-23 10:00:54] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-968675356104281124.kers
Total runtime 0 ms.
[2026-05-23 10:00:54] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 165/267 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 174 constraints, problems are : Problem set: 0 solved, 119 unsolved in 19761 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 165/267 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 119/293 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 293 constraints, problems are : Problem set: 0 solved, 119 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39805ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 39806ms
[2026-05-23 10:01:34] [INFO ] Invariant cache hit.
[2026-05-23 10:01:34] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-23 10:01:34] [INFO ] Invariant cache hit.
[2026-05-23 10:01:34] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 10:01:35] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 102/108 places, 165/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40951 ms. Remains : 102/108 places, 165/165 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(!p0))))'
Stuttering acceptance computed with spot in 113 ms :[true, false, false, p0]
Running random walk in product with property : CopsAndRobbers-PT-CRL023X004-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL023X004-LTLCardinality-01 finished in 41094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 165/165 transitions.
Graph (complete) has 695 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 102 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 100 transition count 163
Applied a total of 5 rules in 21 ms. Remains 100 /108 variables (removed 8) and now considering 163/165 (removed 2) transitions.
Running 117 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3044326627914253646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11290109333572489094.kers'
[2026-05-23 10:01:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3044326627914253646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11290109333572489094.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 163 rows 77 cols 465 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-23 10:01:36] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11290109333572489094.kers
Total runtime 0 ms.
[2026-05-23 10:01:36] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 163/263 variables, 100/126 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/263 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/263 variables, and 173 constraints, problems are : Problem set: 0 solved, 117 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 100/100 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 2/100 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 163/263 variables, 100/127 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 117/290 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 290 constraints, problems are : Problem set: 0 solved, 117 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 100/100 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40056ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 40057ms
[2026-05-23 10:02:16] [INFO ] Invariant cache hit.
[2026-05-23 10:02:16] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-23 10:02:16] [INFO ] Invariant cache hit.
[2026-05-23 10:02:16] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 10:02:17] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1338 ms to find 0 implicit places.
[2026-05-23 10:02:17] [INFO ] Redundant transitions in 8 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/108 places, 163/165 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41433 ms. Remains : 100/108 places, 163/165 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL023X004-LTLCardinality-03
Stuttering criterion allowed to conclude after 127 steps with 1 reset in 1 ms.
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL023X004-LTLCardinality-03 finished in 41509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(F(!p0) U p1)&&F(p2))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 165/165 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 102 transition count 165
Applied a total of 6 rules in 5 ms. Remains 102 /108 variables (removed 6) and now considering 165/165 (removed 0) transitions.
Running 119 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-572522548216114777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10594698656100121353.kers'
[2026-05-23 10:02:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-572522548216114777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10594698656100121353.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 165 rows 79 cols 469 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-23 10:02:17] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10594698656100121353.kers
Total runtime 0 ms.
[2026-05-23 10:02:17] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 165/267 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 174 constraints, problems are : Problem set: 0 solved, 119 unsolved in 19420 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 165/267 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 119/293 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 293 constraints, problems are : Problem set: 0 solved, 119 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39458ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 39458ms
[2026-05-23 10:02:57] [INFO ] Invariant cache hit.
[2026-05-23 10:02:57] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-23 10:02:57] [INFO ] Invariant cache hit.
[2026-05-23 10:02:57] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 10:02:58] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 102/108 places, 165/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40534 ms. Remains : 102/108 places, 165/165 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(F(!p0) U p1)&&F(p2))))'
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), p0, (NOT p1), (NOT p2)]
Running random walk in product with property : CopsAndRobbers-PT-CRL023X004-LTLCardinality-04
Stuttering criterion allowed to conclude after 35 steps with 1 reset in 1 ms.
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL023X004-LTLCardinality-04 finished in 40873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 165/165 transitions.
Graph (complete) has 695 edges and 108 vertex of which 102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 102 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 100 transition count 163
Applied a total of 5 rules in 18 ms. Remains 100 /108 variables (removed 8) and now considering 163/165 (removed 2) transitions.
Running 117 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16527520358259217578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7547814946733027607.kers'
[2026-05-23 10:02:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16527520358259217578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7547814946733027607.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 163 rows 77 cols 465 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-23 10:02:58] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7547814946733027607.kers
Total runtime 1 ms.
[2026-05-23 10:02:58] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 163/263 variables, 100/126 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/263 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/263 variables, and 173 constraints, problems are : Problem set: 0 solved, 117 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 100/100 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 2/100 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 163/263 variables, 100/127 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 117/290 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 290 constraints, problems are : Problem set: 0 solved, 117 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 100/100 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40047ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 40047ms
[2026-05-23 10:03:38] [INFO ] Invariant cache hit.
[2026-05-23 10:03:38] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-23 10:03:38] [INFO ] Invariant cache hit.
[2026-05-23 10:03:38] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 10:03:39] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2026-05-23 10:03:39] [INFO ] Redundant transitions in 8 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/108 places, 163/165 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41211 ms. Remains : 100/108 places, 163/165 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CopsAndRobbers-PT-CRL023X004-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 246 ms.
Stack based approach found an accepted trace after 235 steps with 0 reset with depth 236 and stack size 236 in 2 ms.
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CopsAndRobbers-PT-CRL023X004-LTLCardinality-08 finished in 41615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(p0) U X(X(X(p1)))))))))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 165/165 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 103 transition count 165
Applied a total of 5 rules in 4 ms. Remains 103 /108 variables (removed 5) and now considering 165/165 (removed 0) transitions.
Running 119 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12408763680338072214.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7960187838558141950.kers'
[2026-05-23 10:03:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12408763680338072214.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7960187838558141950.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 165 rows 80 cols 471 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-23 10:03:40] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7960187838558141950.kers
Total runtime 1 ms.
[2026-05-23 10:03:40] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 165/267 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 1/268 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 268/268 variables, and 175 constraints, problems are : Problem set: 0 solved, 119 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 103/103 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 165/267 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 115/289 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/268 variables, and 289 constraints, problems are : Problem set: 0 solved, 119 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/103 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 115/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40054ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 40055ms
[2026-05-23 10:04:20] [INFO ] Invariant cache hit.
[2026-05-23 10:04:20] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-23 10:04:20] [INFO ] Invariant cache hit.
[2026-05-23 10:04:20] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 10:04:21] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 1636 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 103/108 places, 165/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41696 ms. Remains : 103/108 places, 165/165 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(p0) U X(X(X(p1)))))))))'
Stuttering acceptance computed with spot in 596 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL023X004-LTLCardinality-09
Stuttering criterion allowed to conclude after 14843 steps with 1863 reset in 50 ms.
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL023X004-LTLCardinality-09 finished in 42402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 165/165 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 102 transition count 165
Applied a total of 6 rules in 4 ms. Remains 102 /108 variables (removed 6) and now considering 165/165 (removed 0) transitions.
Running 119 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9752720753148191958.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-482592814326519063.kers'
[2026-05-23 10:04:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9752720753148191958.kers, --Pflows, --basisKERS=/tmp/petrispot-output-482592814326519063.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 165 rows 79 cols 469 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-23 10:04:22] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-482592814326519063.kers
Total runtime 1 ms.
[2026-05-23 10:04:22] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 165/267 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 174 constraints, problems are : Problem set: 0 solved, 119 unsolved in 19301 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 165/267 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 119/293 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 293 constraints, problems are : Problem set: 0 solved, 119 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39339ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 39340ms
[2026-05-23 10:05:01] [INFO ] Invariant cache hit.
[2026-05-23 10:05:01] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-23 10:05:01] [INFO ] Invariant cache hit.
[2026-05-23 10:05:01] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 10:05:02] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 102/108 places, 165/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40482 ms. Remains : 102/108 places, 165/165 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL023X004-LTLCardinality-10
Stuttering criterion allowed to conclude after 85 steps with 1 reset in 1 ms.
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL023X004-LTLCardinality-10 finished in 40587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((!p0 U (p1||G(!p0)))||X((p2&&X((p2 U (X(p3)||G(p2))))))))))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 165/165 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 102 transition count 165
Applied a total of 6 rules in 1 ms. Remains 102 /108 variables (removed 6) and now considering 165/165 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:05:03] [INFO ] Invariant cache hit.
[2026-05-23 10:05:03] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-23 10:05:03] [INFO ] Invariant cache hit.
[2026-05-23 10:05:03] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 10:05:04] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 102/108 places, 165/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1276 ms. Remains : 102/108 places, 165/165 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((!p0 U (p1||G(!p0)))||X((p2&&X((p2 U (X(p3)||G(p2))))))))))'
Stuttering acceptance computed with spot in 369 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) p0 p2), (AND (NOT p3) (NOT p2) (NOT p1) p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL023X004-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 140 steps with 28 reset in 1 ms.
FORMULA CopsAndRobbers-PT-CRL023X004-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL023X004-LTLCardinality-12 finished in 1683 ms.
All properties solved by simple procedures.
Total runtime 379692 ms.

BK_STOP 1779530704740

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="CopsAndRobbers-PT-CRL023X004"
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-5973"
echo " Executing tool itstools"
echo " Input is CopsAndRobbers-PT-CRL023X004, 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 r066-tall-177946967700467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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