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-177946967700449.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-CRL005X001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700449
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 9.8K Mar 6 13:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 6 13:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 13:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 15 08:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 08:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 6 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 6 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 6 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 08:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:34 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 29K 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-CRL005X001-CTLCardinality-2024-00
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-01
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-02
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-03
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-04
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-05
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-06
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-07
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-08
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-09
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-10
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-11
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-12
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-13
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-14
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779529697956

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-CRL005X001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 09:48:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 09:48:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:48:19] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2026-05-23 09:48:19] [INFO ] Transformed 35 places.
[2026-05-23 09:48:19] [INFO ] Transformed 39 transitions.
[2026-05-23 09:48:19] [INFO ] Parsed PT model containing 35 places and 39 transitions and 174 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 39/39 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 39
Applied a total of 1 rules in 15 ms. Remains 34 /35 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2187267783769639485.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13355839633404604994.kers'
[2026-05-23 09:48:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2187267783769639485.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13355839633404604994.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 29 cols 117 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-23 09:48:19] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13355839633404604994.kers
Total runtime 1 ms.
[2026-05-23 09:48:19] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-23 09:48:19] [INFO ] Invariant cache hit.
[2026-05-23 09:48:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:48:19] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-05-23 09:48:19] [INFO ] Invariant cache hit.
[2026-05-23 09:48:19] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 4/73 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/73 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 58 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1417 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 34/34 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 4/73 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/73 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/73 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 73/73 variables, and 88 constraints, problems are : Problem set: 0 solved, 29 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 34/34 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31470ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 31480ms
Starting structural reductions in LTL mode, iteration 1 : 34/35 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31797 ms. Remains : 34/35 places, 39/39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2026-05-23 09:48:51] [INFO ] Invariant cache hit.
[2026-05-23 09:48:51] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-23 09:48:51] [INFO ] Invariant cache hit.
[2026-05-23 09:48:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:48:51] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 34/34 places, 39/39 transitions.
Support contains 33 out of 34 places after structural reductions.
[2026-05-23 09:48:51] [INFO ] Flatten gal took : 18 ms
[2026-05-23 09:48:51] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:48:51] [INFO ] Input system was already deterministic with 39 transitions.
RANDOM walk for 40000 steps (12 resets) in 1321 ms. (30 steps per ms) remains 15/50 properties
BEST_FIRST walk for 4000 steps (9 resets) in 139 ms. (28 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4000 steps (13 resets) in 144 ms. (27 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (10 resets) in 53 ms. (74 steps per ms) remains 12/14 properties
BEST_FIRST walk for 4000 steps (9 resets) in 58 ms. (67 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000 steps (14 resets) in 58 ms. (67 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000 steps (10 resets) in 31 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000 steps (16 resets) in 19 ms. (200 steps per ms) remains 10/12 properties
BEST_FIRST walk for 4000 steps (10 resets) in 24 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000 steps (9 resets) in 18 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000 steps (11 resets) in 12 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000 steps (9 resets) in 24 ms. (160 steps per ms) remains 10/10 properties
[2026-05-23 09:48:52] [INFO ] Invariant cache hit.
[2026-05-23 09:48:52] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
At refinement iteration 1 (OVERLAPS) 10/25 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 35/60 variables, 25/33 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 6/39 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/39 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp44 is UNSAT
At refinement iteration 6 (OVERLAPS) 13/73 variables, 9/48 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 4/52 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/52 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/52 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 52 constraints, problems are : Problem set: 9 solved, 1 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 34/34 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/4 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 1 unsolved
Problem AtomicPropp46 is UNSAT
After SMT solving in domain Int declared 21/73 variables, and 9 constraints, problems are : Problem set: 10 solved, 0 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/34 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
[2026-05-23 09:48:52] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:48:52] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:48:52] [INFO ] Input system was already deterministic with 39 transitions.
Computed a total of 4 stabilizing places and 11 stable transitions
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 39
Applied a total of 4 rules in 1 ms. Remains 30 /34 variables (removed 4) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10201548397416139679.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6033727374336178277.kers'
[2026-05-23 09:48:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10201548397416139679.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6033727374336178277.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 25 cols 109 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-23 09:48:52] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6033727374336178277.kers
Total runtime 0 ms.
[2026-05-23 09:48:52] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 09:48:52] [INFO ] Invariant cache hit.
[2026-05-23 09:48:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:48:52] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-05-23 09:48:52] [INFO ] Invariant cache hit.
[2026-05-23 09:48:52] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 7346 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8110ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 8111ms
Starting structural reductions in LTL mode, iteration 1 : 30/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8210 ms. Remains : 30/34 places, 39/39 transitions.
[2026-05-23 09:49:00] [INFO ] Flatten gal took : 6 ms
[2026-05-23 09:49:00] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:49:00] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-23 09:49:00] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:49:00] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:49:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality9070996820116794298.gal : 2 ms
[2026-05-23 09:49:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality15079588329805642722.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9070996820116794298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15079588329805642722.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,166,0.027797,4200,2,359,5,1468,6,0,160,1524,0


Converting to forward existential form...Done !
original formula: (EG((pl_incoming_cops_n3<1)) * AG(A(A((pl_init_robber<=0) U (AG((pl_cops_n3>=1)) * (pl_init_cops>0))) U EX(TRUE))))
=> equivalent forward existential formula: ([(Init * !(EG((pl_incoming_cops_n3<1))))] = FALSE * ([((FwdU(FwdU(Init,TRUE),!(EX(TRUE))) * !(!((E(!((!(E(TRUE ...422
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
(forward)formula 0,0,0.058656,5828,1,0,101,8667,99,37,1164,7121,97
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 39
Applied a total of 3 rules in 0 ms. Remains 31 /34 variables (removed 3) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11743774255778563152.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1005354861556524352.kers'
[2026-05-23 09:49:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11743774255778563152.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1005354861556524352.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 26 cols 111 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-23 09:49:00] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1005354861556524352.kers
Total runtime 0 ms.
[2026-05-23 09:49:00] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-23 09:49:00] [INFO ] Invariant cache hit.
[2026-05-23 09:49:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:49:00] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-05-23 09:49:00] [INFO ] Invariant cache hit.
[2026-05-23 09:49:00] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/70 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/70 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 55 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1388 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 31/31 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 25/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 1/70 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/70 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 70/70 variables, and 86 constraints, problems are : Problem set: 0 solved, 29 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 31/31 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31409ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 31413ms
Starting structural reductions in LTL mode, iteration 1 : 31/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31547 ms. Remains : 31/34 places, 39/39 transitions.
[2026-05-23 09:49:32] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:49:32] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:49:32] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-23 09:49:32] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:49:32] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:49:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality1027832651997656759.gal : 1 ms
[2026-05-23 09:49:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality12704323446731240064.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1027832651997656759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12704323446731240064.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,166,0.01178,4312,2,394,5,1543,6,0,161,1496,0


Converting to forward existential form...Done !
original formula: (AF((EF((pl_cops_n3>=1)) * A((pl_robber_absent_n5<1) U (pl_cops_n5>0)))) + AX(!(E(AG((pl_end_n5<=pl_robber_here_n4)) U (pl_robber_here_n3...162
=> equivalent forward existential formula: [(FwdU(EY((Init * !(!(EG(!((E(TRUE U (pl_cops_n3>=1)) * !((E(!((pl_cops_n5>0)) U (!((pl_robber_absent_n5<1)) * !...288
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,0.133155,9948,1,0,366,28930,124,208,1242,23586,470
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 39
Applied a total of 4 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4951679810922913030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9148193796890928805.kers'
[2026-05-23 09:49:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4951679810922913030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9148193796890928805.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 25 cols 109 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-23 09:49:32] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9148193796890928805.kers
Total runtime 1 ms.
[2026-05-23 09:49:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-23 09:49:32] [INFO ] Invariant cache hit.
[2026-05-23 09:49:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:49:32] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-05-23 09:49:32] [INFO ] Invariant cache hit.
[2026-05-23 09:49:32] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 7269 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8006ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 8008ms
Starting structural reductions in LTL mode, iteration 1 : 30/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8112 ms. Remains : 30/34 places, 39/39 transitions.
[2026-05-23 09:49:40] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:49:40] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:49:40] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-23 09:49:40] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:49:40] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:49:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality14625190163688997508.gal : 1 ms
[2026-05-23 09:49:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality9167238943528135506.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14625190163688997508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9167238943528135506.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,166,0.011337,4308,2,359,5,1468,6,0,160,1524,0


Converting to forward existential form...Done !
original formula: AX(((AF((pl_moved_robber>=1)) + EX((pl_cops_n2<=pl_cops_n1))) + (pl_incoming_cops_n2>pl_robber_here_n3)))
=> equivalent forward existential formula: [FwdG(((EY(Init) * !((pl_incoming_cops_n2>pl_robber_here_n3))) * !(EX((pl_cops_n2<=pl_cops_n1)))),!((pl_moved_ro...174
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
Hit Full ! (commute/partial/dont) 33/0/6
(forward)formula 0,0,0.04779,6232,1,0,110,10255,107,41,1213,8496,100
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 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 30 transition count 38
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 29 transition count 38
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 28 transition count 37
Applied a total of 5 rules in 13 ms. Remains 28 /34 variables (removed 6) and now considering 37/39 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10150147612791155598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10608790076204214760.kers'
[2026-05-23 09:49:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10150147612791155598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10608790076204214760.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 37 rows 23 cols 105 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-23 09:49:40] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10608790076204214760.kers
Total runtime 0 ms.
[2026-05-23 09:49:40] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-23 09:49:40] [INFO ] Invariant cache hit.
[2026-05-23 09:49:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:49:40] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2026-05-23 09:49:40] [INFO ] Redundant transitions in 1 ms returned []
Running 27 sub problems to find dead transitions.
[2026-05-23 09:49:40] [INFO ] Invariant cache hit.
[2026-05-23 09:49:40] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 37/65 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 51 constraints, problems are : Problem set: 0 solved, 27 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 28/28 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 37/65 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 27/77 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 65/65 variables, and 78 constraints, problems are : Problem set: 0 solved, 27 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 28/28 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30854ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 30854ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/34 places, 37/39 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30992 ms. Remains : 28/34 places, 37/39 transitions.
[2026-05-23 09:50:11] [INFO ] Flatten gal took : 6 ms
[2026-05-23 09:50:11] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:50:11] [INFO ] Input system was already deterministic with 37 transitions.
[2026-05-23 09:50:11] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:50:11] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:50:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality9864986747404524277.gal : 1 ms
[2026-05-23 09:50:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality10726414863912181223.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9864986747404524277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10726414863912181223.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,136,0.010682,4204,2,288,5,1169,6,0,150,1144,0


Converting to forward existential form...Done !
original formula: EG((pl_awaiting<=pl_robber_absent_n5))
=> equivalent forward existential formula: [FwdG(Init,(pl_awaiting<=pl_robber_absent_n5))] != FALSE
Hit Full ! (commute/partial/dont) 27/0/10
(forward)formula 0,1,0.034608,5456,1,0,17,6404,19,3,873,4819,15
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 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 30 transition count 38
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 29 transition count 38
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 28 transition count 37
Applied a total of 5 rules in 6 ms. Remains 28 /34 variables (removed 6) and now considering 37/39 (removed 2) transitions.
[2026-05-23 09:50:11] [INFO ] Invariant cache hit.
[2026-05-23 09:50:11] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-23 09:50:11] [INFO ] Invariant cache hit.
[2026-05-23 09:50:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:11] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2026-05-23 09:50:11] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 28/34 places, 37/39 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 96 ms. Remains : 28/34 places, 37/39 transitions.
[2026-05-23 09:50:11] [INFO ] Flatten gal took : 1 ms
[2026-05-23 09:50:11] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:50:11] [INFO ] Input system was already deterministic with 37 transitions.
[2026-05-23 09:50:11] [INFO ] Flatten gal took : 1 ms
[2026-05-23 09:50:11] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:50:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality15745122838171140938.gal : 0 ms
[2026-05-23 09:50:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality8752198517673244099.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15745122838171140938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8752198517673244099.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,136,0.010883,4212,2,288,5,1169,6,0,150,1144,0


Converting to forward existential form...Done !
original formula: EG(((AG(AF((pl_finalizing<=0))) * (pl_cops_n5<=1)) * (pl_finalizing<=0)))
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !(!(EG(!((pl_finalizing<=0))))))) * (pl_cops_n5<=1)) * (pl_finalizing<=0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t7, t8, t10, t12, t13, t15, t17, t18, t20, t22, t23, t25, t32, t33, t34, t35, t36...255
(forward)formula 0,0,0.044717,5940,1,0,118,9402,107,48,1121,7004,124
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 39
Applied a total of 2 rules in 2 ms. Remains 32 /34 variables (removed 2) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-565586135571422031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16757720676740496439.kers'
[2026-05-23 09:50:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-565586135571422031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16757720676740496439.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 27 cols 113 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-23 09:50:11] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16757720676740496439.kers
Total runtime 0 ms.
[2026-05-23 09:50:11] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-23 09:50:11] [INFO ] Invariant cache hit.
[2026-05-23 09:50:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:11] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-05-23 09:50:11] [INFO ] Invariant cache hit.
[2026-05-23 09:50:11] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 2/71 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/71 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 55 constraints, problems are : Problem set: 0 solved, 29 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 21/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 2/71 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/71 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (OVERLAPS) 0/71 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 89 constraints, problems are : Problem set: 0 solved, 29 unsolved in 28895 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29796ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 29796ms
Starting structural reductions in LTL mode, iteration 1 : 32/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29879 ms. Remains : 32/34 places, 39/39 transitions.
[2026-05-23 09:50:41] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:50:41] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:50:41] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-23 09:50:41] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:50:41] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:50:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality3372463853180985992.gal : 1 ms
[2026-05-23 09:50:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality16522519992096183514.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3372463853180985992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16522519992096183514.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,166,0.012855,4324,2,419,5,1620,6,0,162,1574,0


Converting to forward existential form...Done !
original formula: AG(((pl_robber_here_n4<=pl_end_n4) + E(!(EF((pl_robber_absent_n2<=0))) U !((AX((pl_incoming_cops_n4<=pl_end_n3)) + (pl_robber_absent_n3>p...173
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((pl_robber_here_n4<=pl_end_n4))) * !(E(!(E(TRUE U (pl_robber_absent_n2<=0))) U !((!(EX(!(...242
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
(forward)formula 0,0,0.07003,7256,1,0,119,14798,107,49,1221,10435,113
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 30 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 28 transition count 37
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 7 place count 27 transition count 36
Applied a total of 7 rules in 9 ms. Remains 27 /34 variables (removed 7) and now considering 36/39 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7467540539650912683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11890610222868410380.kers'
[2026-05-23 09:50:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7467540539650912683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11890610222868410380.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 36 rows 22 cols 103 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-23 09:50:41] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11890610222868410380.kers
Total runtime 0 ms.
[2026-05-23 09:50:41] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-23 09:50:41] [INFO ] Invariant cache hit.
[2026-05-23 09:50:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:41] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 83 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 26/34 places, 36/39 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 97 ms. Remains : 26/34 places, 36/39 transitions.
[2026-05-23 09:50:41] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:50:41] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:50:41] [INFO ] Input system was already deterministic with 36 transitions.
[2026-05-23 09:50:41] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 67 steps (3 resets) in 8 ms. (7 steps per ms) remains 0/1 properties
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-23 09:50:41] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:50:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8296953696344564900.gal : 1 ms
[2026-05-23 09:50:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4721758347883901343.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8296953696344564900.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4721758347883901343.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 39
Applied a total of 1 rules in 0 ms. Remains 33 /34 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6312242682466243527.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4844091477604521247.kers'
[2026-05-23 09:50:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6312242682466243527.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4844091477604521247.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 28 cols 115 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-05-23 09:50:41] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4844091477604521247.kers
Total runtime 0 ms.
[2026-05-23 09:50:41] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-23 09:50:41] [INFO ] Invariant cache hit.
[2026-05-23 09:50:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:41] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-05-23 09:50:41] [INFO ] Invariant cache hit.
[2026-05-23 09:50:41] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 3/72 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 56 constraints, problems are : Problem set: 0 solved, 29 unsolved in 883 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 3/72 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/72 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/72 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 0/72 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/72 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 17 (OVERLAPS) 0/72 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 91 constraints, problems are : Problem set: 0 solved, 29 unsolved in 26923 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27817ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 27817ms
Starting structural reductions in LTL mode, iteration 1 : 33/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27886 ms. Remains : 33/34 places, 39/39 transitions.
[2026-05-23 09:51:09] [INFO ] Flatten gal took : 6 ms
[2026-05-23 09:51:09] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:51:09] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-23 09:51:09] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:51:09] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:51:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality10834868528349527923.gal : 1 ms
[2026-05-23 09:51:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality11611808740870032140.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10834868528349527923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11611808740870032140.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,166,0.013854,4336,2,433,5,1593,6,0,163,1549,0


Converting to forward existential form...Done !
original formula: EF(((EX((EX(TRUE) + E((pl_end_n3>0) U ((pl_start_cops<=pl_cops_n1)||(pl_incoming_cops_n1>=1))))) * ((AG((pl_finished_moving>pl_robber_abs...407
=> equivalent forward existential formula: ((([((FwdU((FwdU(Init,TRUE) * (EX((EX(TRUE) + E((pl_end_n3>0) U ((pl_start_cops<=pl_cops_n1)||(pl_incoming_cops_...1539
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
Hit Full ! (commute/partial/dont) 34/0/5
(forward)formula 0,1,0.076083,7532,1,0,153,16187,123,69,1301,13265,148
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 30 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 28 transition count 37
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 7 place count 27 transition count 36
Applied a total of 7 rules in 3 ms. Remains 27 /34 variables (removed 7) and now considering 36/39 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6620152887809245002.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14576817381981327045.kers'
[2026-05-23 09:51:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6620152887809245002.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14576817381981327045.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 36 rows 22 cols 103 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-23 09:51:09] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14576817381981327045.kers
Total runtime 0 ms.
[2026-05-23 09:51:09] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-23 09:51:09] [INFO ] Invariant cache hit.
[2026-05-23 09:51:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:51:09] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 83 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 26/34 places, 36/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 89 ms. Remains : 26/34 places, 36/39 transitions.
[2026-05-23 09:51:09] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:51:09] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:51:09] [INFO ] Input system was already deterministic with 36 transitions.
RANDOM walk for 33 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-23 09:51:09] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:51:09] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:51:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14057210120473013065.gal : 1 ms
[2026-05-23 09:51:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1498058967997723058.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14057210120473013065.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1498058967997723058.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 39
Applied a total of 4 rules in 3 ms. Remains 30 /34 variables (removed 4) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11178828949243652106.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13086442725873548690.kers'
[2026-05-23 09:51:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11178828949243652106.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13086442725873548690.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 25 cols 109 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-23 09:51:10] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13086442725873548690.kers
Total runtime 0 ms.
[2026-05-23 09:51:10] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-23 09:51:10] [INFO ] Invariant cache hit.
[2026-05-23 09:51:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:51:10] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-05-23 09:51:10] [INFO ] Invariant cache hit.
[2026-05-23 09:51:10] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 7183 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7909ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 7909ms
Starting structural reductions in LTL mode, iteration 1 : 30/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7984 ms. Remains : 30/34 places, 39/39 transitions.
[2026-05-23 09:51:17] [INFO ] Flatten gal took : 1 ms
[2026-05-23 09:51:17] [INFO ] Flatten gal took : 1 ms
[2026-05-23 09:51:17] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-23 09:51:17] [INFO ] Flatten gal took : 1 ms
[2026-05-23 09:51:17] [INFO ] Flatten gal took : 1 ms
[2026-05-23 09:51:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality11696382423379489524.gal : 0 ms
[2026-05-23 09:51:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality1570223509020153622.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11696382423379489524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1570223509020153622.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,166,0.014731,4296,2,359,5,1468,6,0,160,1524,0


Converting to forward existential form...Done !
original formula: EG(EX((pl_wait_robber>0)))
=> equivalent forward existential formula: [FwdG(Init,EX((pl_wait_robber>0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
(forward)formula 0,0,0.045388,5836,1,0,107,8445,100,43,1155,6556,102
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 39
Applied a total of 2 rules in 1 ms. Remains 32 /34 variables (removed 2) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11262375199779638227.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-936089886633414583.kers'
[2026-05-23 09:51:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11262375199779638227.kers, --Pflows, --basisKERS=/tmp/petrispot-output-936089886633414583.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 27 cols 113 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-23 09:51:18] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-936089886633414583.kers
Total runtime 0 ms.
[2026-05-23 09:51:18] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-23 09:51:18] [INFO ] Invariant cache hit.
[2026-05-23 09:51:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:51:18] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-05-23 09:51:18] [INFO ] Invariant cache hit.
[2026-05-23 09:51:18] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 2/71 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/71 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 56 constraints, problems are : Problem set: 0 solved, 29 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 21/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 2/71 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/71 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (OVERLAPS) 0/71 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/71 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 18 (OVERLAPS) 0/71 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 89 constraints, problems are : Problem set: 0 solved, 29 unsolved in 19671 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20628ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 20629ms
Starting structural reductions in LTL mode, iteration 1 : 32/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20728 ms. Remains : 32/34 places, 39/39 transitions.
[2026-05-23 09:51:38] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:51:38] [INFO ] Flatten gal took : 6 ms
[2026-05-23 09:51:38] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-23 09:51:38] [INFO ] Flatten gal took : 1 ms
[2026-05-23 09:51:38] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:51:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality9107973395361596232.gal : 0 ms
[2026-05-23 09:51:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality16929314205906041157.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9107973395361596232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16929314205906041157.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,166,0.015792,4304,2,406,5,1550,6,0,162,1493,0


Converting to forward existential form...Done !
original formula: EF(AX(E((pl_end_n2>pl_awaiting) U (pl_finalizing>pl_end_n5))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E((pl_end_n2>pl_awaiting) U (pl_finalizing>pl_end_n5))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
(forward)formula 0,1,0.048211,6108,1,0,105,9891,98,41,1184,6458,93
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 39
Applied a total of 3 rules in 1 ms. Remains 31 /34 variables (removed 3) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16839988160733674194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15741924527030416380.kers'
[2026-05-23 09:51:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16839988160733674194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15741924527030416380.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 26 cols 111 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-23 09:51:38] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15741924527030416380.kers
Total runtime 0 ms.
[2026-05-23 09:51:38] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-23 09:51:38] [INFO ] Invariant cache hit.
[2026-05-23 09:51:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:51:38] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-05-23 09:51:38] [INFO ] Invariant cache hit.
[2026-05-23 09:51:38] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/70 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/70 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 54 constraints, problems are : Problem set: 0 solved, 29 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 31/31 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 25/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 1/70 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/70 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 0/70 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 86 constraints, problems are : Problem set: 0 solved, 29 unsolved in 16934 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 31/31 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 17769ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 17769ms
Starting structural reductions in LTL mode, iteration 1 : 31/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17850 ms. Remains : 31/34 places, 39/39 transitions.
[2026-05-23 09:51:56] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:51:56] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:51:56] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-23 09:51:56] [INFO ] Flatten gal took : 1 ms
[2026-05-23 09:51:56] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:51:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality9015603007079092648.gal : 1 ms
[2026-05-23 09:51:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality17009400407000698552.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9015603007079092648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17009400407000698552.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,166,0.016497,4320,2,378,5,1537,6,0,161,1610,0


Converting to forward existential form...Done !
original formula: (AX(AG(EF((pl_cops_n1>pl_end_n2)))) + AG(AF(EG((pl_robber_absent_n5>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!(EX(!(!(E(TRUE U !(E(TRUE U (pl_cops_n1>pl_end_n2)))))))))),TRUE),!(EG((pl_robber_absent_n...172
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
(forward)formula 0,0,0.105111,9300,1,0,260,24855,111,120,1247,20229,326
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 39
Applied a total of 4 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15331949350101737534.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12908107133448552824.kers'
[2026-05-23 09:51:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15331949350101737534.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12908107133448552824.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 25 cols 109 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-23 09:51:56] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12908107133448552824.kers
Total runtime 1 ms.
[2026-05-23 09:51:56] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-23 09:51:56] [INFO ] Invariant cache hit.
[2026-05-23 09:51:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:51:56] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-05-23 09:51:56] [INFO ] Invariant cache hit.
[2026-05-23 09:51:56] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 7315 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8029ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 8030ms
Starting structural reductions in LTL mode, iteration 1 : 30/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8110 ms. Remains : 30/34 places, 39/39 transitions.
[2026-05-23 09:52:04] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:52:04] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:52:04] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-23 09:52:04] [INFO ] Flatten gal took : 1 ms
[2026-05-23 09:52:04] [INFO ] Flatten gal took : 1 ms
[2026-05-23 09:52:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality5674290298713709896.gal : 1 ms
[2026-05-23 09:52:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality4645856858033259081.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5674290298713709896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4645856858033259081.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,166,0.011177,4284,2,359,5,1468,6,0,160,1524,0


Converting to forward existential form...Done !
original formula: E(EX(TRUE) U (!((AF(AX((pl_cops_n3>=1))) + EX(AG((pl_finalizing<=pl_robber_absent_n3))))) + !(A(A((pl_incoming_cops_n4<=pl_finished_movin...230
=> equivalent forward existential formula: ([FwdG((FwdU(Init,EX(TRUE)) * !(EX(!(E(TRUE U !((pl_finalizing<=pl_robber_absent_n3))))))),!(!(EX(!((pl_cops_n3>...571
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
(forward)formula 0,1,0.10672,9504,1,0,228,25054,129,120,1243,24217,263
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2026-05-23 09:52:05] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:05] [INFO ] Flatten gal took : 2 ms
Total runtime 225974 ms.

BK_STOP 1779529925112

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-CRL005X001"
export BK_EXAMINATION="CTLCardinality"
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-CRL005X001, examination is CTLCardinality"
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-177946967700449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-CRL005X001.tgz
mv CopsAndRobbers-PT-CRL005X001 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;