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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.9K Mar 6 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 6 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 08:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Mar 6 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 6 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Mar 6 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 133K 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-CRL025X003-CTLCardinality-2024-00
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-01
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-02
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-03
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-04
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-05
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-06
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-07
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-08
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-09
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-10
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-11
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-12
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-13
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-14
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779530689064

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-CRL025X003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 10:04:50] [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 10:04:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 10:04:50] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2026-05-23 10:04:50] [INFO ] Transformed 135 places.
[2026-05-23 10:04:50] [INFO ] Transformed 179 transitions.
[2026-05-23 10:04:50] [INFO ] Parsed PT model containing 135 places and 179 transitions and 834 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 86 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 179/179 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 130 transition count 179
Applied a total of 5 rules in 19 ms. Remains 130 /135 variables (removed 5) and now considering 179/179 (removed 0) transitions.
Running 129 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6889043419544481822.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8179898976222150811.kers'
[2026-05-23 10:04:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6889043419544481822.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8179898976222150811.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 105 cols 549 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-23 10:04:50] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8179898976222150811.kers
Total runtime 1 ms.
[2026-05-23 10:04:50] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 20/309 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 309/309 variables, and 209 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 130/130 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 49/237 constraints. Problems are: Problem set: 0 solved, 129 unsolved
SMT process timed out in 40202ms, After SMT, problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40216ms
[2026-05-23 10:05:30] [INFO ] Invariant cache hit.
[2026-05-23 10:05:30] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-23 10:05:30] [INFO ] Invariant cache hit.
[2026-05-23 10:05:30] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:05:31] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 130/135 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40836 ms. Remains : 130/135 places, 179/179 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:05:31] [INFO ] Invariant cache hit.
[2026-05-23 10:05:31] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-23 10:05:31] [INFO ] Invariant cache hit.
[2026-05-23 10:05:31] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:05:31] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 130/130 places, 179/179 transitions.
Support contains 86 out of 130 places after structural reductions.
[2026-05-23 10:05:31] [INFO ] Flatten gal took : 37 ms
[2026-05-23 10:05:31] [INFO ] Flatten gal took : 16 ms
[2026-05-23 10:05:32] [INFO ] Input system was already deterministic with 179 transitions.
RANDOM walk for 40002 steps (9 resets) in 1702 ms. (23 steps per ms) remains 34/79 properties
BEST_FIRST walk for 4003 steps (9 resets) in 35 ms. (111 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (9 resets) in 62 ms. (63 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (9 resets) in 76 ms. (51 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (9 resets) in 42 ms. (93 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4002 steps (9 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 28/31 properties
BEST_FIRST walk for 4003 steps (9 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (9 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (9 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (9 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 36 ms. (108 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (10 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (9 resets) in 37 ms. (105 steps per ms) remains 27/27 properties
[2026-05-23 10:05:32] [INFO ] Invariant cache hit.
[2026-05-23 10:05:32] [INFO ] State equation strengthened by 50 read => feed constraints.
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp78 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 22 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 2 (OVERLAPS) 28/61 variables, 12/15 constraints. Problems are: Problem set: 19 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 19 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/75 variables, 13/28 constraints. Problems are: Problem set: 19 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/28 constraints. Problems are: Problem set: 19 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 152/227 variables, 75/103 constraints. Problems are: Problem set: 19 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 23/126 constraints. Problems are: Problem set: 19 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/126 constraints. Problems are: Problem set: 19 solved, 8 unsolved
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 9 (OVERLAPS) 73/300 variables, 46/172 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 27/199 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/199 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 9/309 variables, 9/208 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/309 variables, 0/208 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/309 variables, 0/208 constraints. Problems are: Problem set: 21 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 208 constraints, problems are : Problem set: 21 solved, 6 unsolved in 1334 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 130/130 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 32/44 variables, 3/3 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 26/70 variables, 25/29 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/29 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 147/217 variables, 70/99 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 18/117 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 4/121 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/121 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 81/298 variables, 49/170 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 32/202 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 2/204 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/204 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 11/309 variables, 11/215 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/309 variables, 0/215 constraints. Problems are: Problem set: 21 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/309 variables, 0/215 constraints. Problems are: Problem set: 21 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 215 constraints, problems are : Problem set: 21 solved, 6 unsolved in 4677 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 130/130 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 6/27 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6023ms problems are : Problem set: 21 solved, 6 unsolved
Parikh walk visited 0 properties in 17069 ms.
Support contains 12 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 179/179 transitions.
Graph (complete) has 595 edges and 130 vertex of which 118 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 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 118 transition count 178
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 117 transition count 178
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 116 transition count 177
Applied a total of 5 rules in 28 ms. Remains 116 /130 variables (removed 14) and now considering 177/179 (removed 2) transitions.
Running 127 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2561712039002688269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5020109333462528252.kers'
[2026-05-23 10:05:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2561712039002688269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5020109333462528252.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 177 rows 91 cols 521 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-23 10:05:55] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5020109333462528252.kers
Total runtime 1 ms.
[2026-05-23 10:05:55] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 8/293 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 293/293 variables, and 195 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 116/116 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 95/281 constraints. Problems are: Problem set: 0 solved, 127 unsolved
SMT process timed out in 40079ms, After SMT, problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 40080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40110 ms. Remains : 116/130 places, 177/179 transitions.
RANDOM walk for 40008 steps (8 resets) in 314 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (9 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 530010 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 6
Probabilistic random walk after 530010 steps, saw 204611 distinct states, run finished after 3007 ms. (steps per millisecond=176 ) properties seen :0
[2026-05-23 10:06:39] [INFO ] Invariant cache hit.
[2026-05-23 10:06:39] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 30/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 145/213 variables, 68/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 18/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 80/293 variables, 48/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 32/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 194 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1112 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 116/116 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 30/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 26/68 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 145/213 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 18/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 80/293 variables, 48/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 32/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/293 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/293 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/293 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/293 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 205 constraints, problems are : Problem set: 0 solved, 6 unsolved in 14725 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 116/116 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 15843ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 5 properties in 56 ms.
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 177/177 transitions.
Graph (complete) has 557 edges and 116 vertex of which 111 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 111 /116 variables (removed 5) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 111/116 places, 177/177 transitions.
RANDOM walk for 40008 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (9 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1341190 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :0 out of 1
Probabilistic random walk after 1341190 steps, saw 517245 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9013311375519707177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4533358566996458748.kers'
[2026-05-23 10:06:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9013311375519707177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4533358566996458748.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 177 rows 86 cols 511 entries
Finished phase 1 with 83 SingleSign rule and 0 generalized
[2026-05-23 10:06:58] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4533358566996458748.kers
Total runtime 1 ms.
[2026-05-23 10:06:58] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/129 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 27/156 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/181 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 107/288 variables, 93/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 50/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/288 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 111/111 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/129 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 27/156 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 25/181 variables, 25/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 107/288 variables, 93/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 50/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/288 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/288 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/288 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 111/111 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1264ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1492 steps, including 166 resets, run visited all 1 properties in 5 ms. (steps per millisecond=298 )
Parikh walk visited 1 properties in 10 ms.
Successfully simplified 21 atomic propositions for a total of 16 simplifications.
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 10:06:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-23 10:06:59] [INFO ] Flatten gal took : 11 ms
[2026-05-23 10:06:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 10:06:59] [INFO ] Flatten gal took : 12 ms
[2026-05-23 10:06:59] [INFO ] Input system was already deterministic with 179 transitions.
Support contains 55 out of 130 places (down from 61) after GAL structural reductions.
Computed a total of 4 stabilizing places and 51 stable transitions
Graph (complete) has 795 edges and 130 vertex of which 110 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 179/179 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 112 transition count 179
Applied a total of 18 rules in 3 ms. Remains 112 /130 variables (removed 18) and now considering 179/179 (removed 0) transitions.
Running 129 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13192220543647980508.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2570943629284434318.kers'
[2026-05-23 10:06:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13192220543647980508.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2570943629284434318.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 87 cols 513 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-23 10:06:59] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2570943629284434318.kers
Total runtime 0 ms.
[2026-05-23 10:06:59] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 2/291 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/291 variables, and 190 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 112/112 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 121/309 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/291 variables, and 309 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/112 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 121/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40069ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40071ms
[2026-05-23 10:07:39] [INFO ] Invariant cache hit.
[2026-05-23 10:07:39] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-23 10:07:39] [INFO ] Invariant cache hit.
[2026-05-23 10:07:39] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:07:41] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 112/130 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41701 ms. Remains : 112/130 places, 179/179 transitions.
[2026-05-23 10:07:41] [INFO ] Flatten gal took : 10 ms
[2026-05-23 10:07:41] [INFO ] Flatten gal took : 9 ms
[2026-05-23 10:07:41] [INFO ] Input system was already deterministic with 179 transitions.
[2026-05-23 10:07:41] [INFO ] Flatten gal took : 8 ms
[2026-05-23 10:07:41] [INFO ] Flatten gal took : 8 ms
[2026-05-23 10:07:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality9445653937274085722.gal : 5 ms
[2026-05-23 10:07:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality4910951321226535279.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/CTLCardinality9445653937274085722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4910951321226535279.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,1.28528e+06,1.0559,41256,2,11816,5,153618,6,0,622,166585,0


Converting to forward existential form...Done !
original formula: (EF(((((pl_robber_here_n23>=1)||(pl_robber_here_n2<=pl_finalizing))||((pl_robber_here_n7>=2)&&(pl_moved_robber<=pl_robber_absent_n11))) *...236
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U ((((pl_robber_here_n23>=1)||(pl_robber_here_n2<=pl_finalizing))||((pl_robber_here_n7>=...299
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, t29, t30, t32, t34...554
(forward)formula 0,1,14.7007,442408,1,0,496,2.42297e+06,387,200,5139,1.55519e+06,528
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 179/179 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 112 transition count 179
Applied a total of 18 rules in 3 ms. Remains 112 /130 variables (removed 18) and now considering 179/179 (removed 0) transitions.
Skipped dead transition search.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17152452761999876388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9094541054870069863.kers'
[2026-05-23 10:07:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17152452761999876388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9094541054870069863.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 87 cols 513 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-23 10:07:56] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9094541054870069863.kers
Total runtime 1 ms.
[2026-05-23 10:07:56] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-23 10:07:56] [INFO ] Invariant cache hit.
[2026-05-23 10:07:56] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:07:57] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1395 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 112/130 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1400 ms. Remains : 112/130 places, 179/179 transitions.
[2026-05-23 10:07:57] [INFO ] Flatten gal took : 11 ms
[2026-05-23 10:07:57] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:07:57] [INFO ] Input system was already deterministic with 179 transitions.
[2026-05-23 10:07:57] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:07:57] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:07:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality9060671215928158408.gal : 3 ms
[2026-05-23 10:07:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality4654647888244172606.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/CTLCardinality9060671215928158408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4654647888244172606.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,1.28528e+06,1.01711,42136,2,9626,5,164333,6,0,622,165273,0


Converting to forward existential form...Done !
original formula: AG(AF((AF(!(E((pl_end_n6<=2) U (pl_finalizing>=2)))) * E(EX((pl_end_n8>=3)) U (pl_cops_n22>2)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((!(EG(!(!(E((pl_end_n6<=2) U (pl_finalizing>=2)))))) * E(EX((pl_end_n8>=3)) U (pl_cops_n...173
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, t29, t30, t32, t34...554
Using saturation style SCC detection
(forward)formula 0,0,11.6791,349720,1,0,568,1.92246e+06,395,259,5095,1.17552e+06,576
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 179/179 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 110 transition count 179
Applied a total of 20 rules in 3 ms. Remains 110 /130 variables (removed 20) and now considering 179/179 (removed 0) transitions.
Running 129 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-598663840762724546.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17047309029687460358.kers'
[2026-05-23 10:08:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-598663840762724546.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17047309029687460358.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 85 cols 509 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-23 10:08:09] [INFO ] Computed 28 invariants in 2 ms
Computed 28 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17047309029687460358.kers
Total runtime 3 ms.
[2026-05-23 10:08:09] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/289 variables, and 188 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/110 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 129/317 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 317 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/110 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40055ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40056ms
[2026-05-23 10:08:49] [INFO ] Invariant cache hit.
[2026-05-23 10:08:49] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 10:08:49] [INFO ] Invariant cache hit.
[2026-05-23 10:08:49] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:08:51] [INFO ] Implicit Places using invariants and state equation in 1396 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 110/130 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41543 ms. Remains : 110/130 places, 179/179 transitions.
[2026-05-23 10:08:51] [INFO ] Flatten gal took : 12 ms
[2026-05-23 10:08:51] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:08:51] [INFO ] Input system was already deterministic with 179 transitions.
[2026-05-23 10:08:51] [INFO ] Flatten gal took : 19 ms
[2026-05-23 10:08:51] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:08:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality12847561121688215068.gal : 3 ms
[2026-05-23 10:08:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality5110243984467923683.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/CTLCardinality12847561121688215068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5110243984467923683.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,1.28528e+06,1.09678,41896,2,9657,5,162325,6,0,620,164826,0


Converting to forward existential form...Done !
original formula: AF((EG((pl_robber_here_n24>pl_cops_n15)) * AX((pl_robber_here_n19<1))))
=> equivalent forward existential formula: [FwdG(Init,!((EG((pl_robber_here_n24>pl_cops_n15)) * !(EX(!((pl_robber_here_n19<1)))))))] = 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, t29, t30, t32, t34...554
(forward)formula 0,0,7.33785,210992,1,0,545,967886,386,223,5011,830192,547
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 179/179 transitions.
Graph (complete) has 795 edges and 130 vertex of which 110 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 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 110 transition count 178
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 178
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 108 transition count 177
Applied a total of 5 rules in 24 ms. Remains 108 /130 variables (removed 22) and now considering 177/179 (removed 2) transitions.
Running 127 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-32763165725694888.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17027925086627098825.kers'
[2026-05-23 10:08:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-32763165725694888.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17027925086627098825.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 177 rows 83 cols 505 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-23 10:08:58] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17027925086627098825.kers
Total runtime 1 ms.
[2026-05-23 10:08:58] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 186 constraints, problems are : Problem set: 0 solved, 127 unsolved in 19036 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 127/313 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 313 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39085ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 39086ms
[2026-05-23 10:09:37] [INFO ] Invariant cache hit.
[2026-05-23 10:09:37] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 10:09:37] [INFO ] Invariant cache hit.
[2026-05-23 10:09:37] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:09:39] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
[2026-05-23 10:09:39] [INFO ] Redundant transitions in 12 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 108/130 places, 177/179 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40673 ms. Remains : 108/130 places, 177/179 transitions.
[2026-05-23 10:09:39] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:09:39] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:09:39] [INFO ] Input system was already deterministic with 177 transitions.
[2026-05-23 10:09:39] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:09:39] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:09:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality11942177811043005129.gal : 2 ms
[2026-05-23 10:09:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality13691738399131087470.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/CTLCardinality11942177811043005129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13691738399131087470.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,1.17028e+06,0.857562,34004,2,7647,5,133931,6,0,610,129212,0


Converting to forward existential form...Done !
original formula: EF(EG((pl_incoming_cops_n13>2)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(pl_incoming_cops_n13>2))] != FALSE
Hit Full ! (commute/partial/dont) 174/0/3
(forward)formula 0,0,3.35707,100688,1,0,21,483266,19,2,3744,273439,21
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-03 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 : 130/130 places, 179/179 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 112 transition count 179
Applied a total of 18 rules in 5 ms. Remains 112 /130 variables (removed 18) and now considering 179/179 (removed 0) transitions.
Running 129 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1560832369099645942.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8169579946310060142.kers'
[2026-05-23 10:09:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1560832369099645942.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8169579946310060142.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 87 cols 513 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-23 10:09:42] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8169579946310060142.kers
Total runtime 2 ms.
[2026-05-23 10:09:42] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 2/291 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/291 variables, and 190 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 112/112 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 121/309 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/291 variables, and 309 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/112 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 121/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40065ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40066ms
[2026-05-23 10:10:22] [INFO ] Invariant cache hit.
[2026-05-23 10:10:22] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-23 10:10:22] [INFO ] Invariant cache hit.
[2026-05-23 10:10:22] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:10:24] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 112/130 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41485 ms. Remains : 112/130 places, 179/179 transitions.
[2026-05-23 10:10:24] [INFO ] Flatten gal took : 10 ms
[2026-05-23 10:10:24] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:10:24] [INFO ] Input system was already deterministic with 179 transitions.
[2026-05-23 10:10:24] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:10:24] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:10:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality4101367421368831192.gal : 1 ms
[2026-05-23 10:10:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality5927404207904421909.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/CTLCardinality4101367421368831192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5927404207904421909.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,1.28528e+06,1.09452,42144,2,11239,5,154863,6,0,622,166660,0


Converting to forward existential form...Done !
original formula: AG(((EX((EF((pl_incoming_cops_n1>=2)) + (pl_finished_moving<=0))) + (pl_end_n25<=pl_incoming_cops_n17)) + (((pl_robber_absent_n10<=pl_rob...282
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((((pl_robber_absent_n10<=pl_robber_here_n7) * EX((pl_end_n2<=pl_robber_here_n20))) + ((p...348
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, t29, t30, t32, t34...554
(forward)formula 0,0,21.0783,588464,1,0,497,3.40446e+06,385,199,5046,1.8139e+06,504
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 179/179 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 110 transition count 179
Applied a total of 20 rules in 2 ms. Remains 110 /130 variables (removed 20) and now considering 179/179 (removed 0) transitions.
Running 129 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7717459192812731062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13424506362430960155.kers'
[2026-05-23 10:10:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7717459192812731062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13424506362430960155.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 85 cols 509 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-23 10:10:45] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13424506362430960155.kers
Total runtime 1 ms.
[2026-05-23 10:10:45] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/289 variables, and 188 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/110 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 129/317 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 317 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20009 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/110 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40051ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40051ms
[2026-05-23 10:11:25] [INFO ] Invariant cache hit.
[2026-05-23 10:11:25] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-23 10:11:25] [INFO ] Invariant cache hit.
[2026-05-23 10:11:25] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:11:26] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 110/130 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41174 ms. Remains : 110/130 places, 179/179 transitions.
[2026-05-23 10:11:26] [INFO ] Flatten gal took : 10 ms
[2026-05-23 10:11:26] [INFO ] Flatten gal took : 10 ms
[2026-05-23 10:11:26] [INFO ] Input system was already deterministic with 179 transitions.
[2026-05-23 10:11:26] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:11:26] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:11:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality18076021475741290615.gal : 1 ms
[2026-05-23 10:11:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality15137243742677767840.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/CTLCardinality18076021475741290615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15137243742677767840.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,1.28528e+06,1.0601,41816,2,9657,5,162325,6,0,620,164826,0


Converting to forward existential form...Done !
original formula: AF((AX(EF((pl_cops_n3<2))) * (pl_robber_absent_n13<=pl_cops_n14)))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(E(TRUE U (pl_cops_n3<2))))) * (pl_robber_absent_n13<=pl_cops_n14))))] = 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, t29, t30, t32, t34...554
(forward)formula 0,0,11.0678,348760,1,0,446,1.64274e+06,386,176,5077,1.33672e+06,428
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 179/179 transitions.
Graph (complete) has 795 edges and 130 vertex of which 110 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 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 110 transition count 178
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 109 transition count 178
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 108 transition count 177
Applied a total of 5 rules in 12 ms. Remains 108 /130 variables (removed 22) and now considering 177/179 (removed 2) transitions.
Running 127 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1901338282755861245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11060281401533874971.kers'
[2026-05-23 10:11:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1901338282755861245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11060281401533874971.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 177 rows 83 cols 505 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-23 10:11:37] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11060281401533874971.kers
Total runtime 1 ms.
[2026-05-23 10:11:37] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 186 constraints, problems are : Problem set: 0 solved, 127 unsolved in 19121 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 127/313 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 313 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39159ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 39159ms
[2026-05-23 10:12:17] [INFO ] Invariant cache hit.
[2026-05-23 10:12:17] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-23 10:12:17] [INFO ] Invariant cache hit.
[2026-05-23 10:12:17] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:12:18] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
[2026-05-23 10:12:18] [INFO ] Redundant transitions in 9 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 108/130 places, 177/179 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40768 ms. Remains : 108/130 places, 177/179 transitions.
[2026-05-23 10:12:18] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:12:18] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:12:18] [INFO ] Input system was already deterministic with 177 transitions.
[2026-05-23 10:12:18] [INFO ] Flatten gal took : 8 ms
[2026-05-23 10:12:18] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:12:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality7173242887136093691.gal : 1 ms
[2026-05-23 10:12:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality16098919944827453677.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/CTLCardinality7173242887136093691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16098919944827453677.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,1.17028e+06,0.897571,34004,2,7647,5,133931,6,0,610,129212,0


Converting to forward existential form...Done !
original formula: EG((pl_incoming_cops_n5<1))
=> equivalent forward existential formula: [FwdG(Init,(pl_incoming_cops_n5<1))] != FALSE
Hit Full ! (commute/partial/dont) 174/0/3
(forward)formula 0,1,10.753,325540,1,0,23,1.57628e+06,19,3,3744,1.40652e+06,21
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 179/179 transitions.
Graph (complete) has 795 edges and 130 vertex of which 111 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.4 ms
Discarding 19 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 111 transition count 178
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 110 transition count 178
Applied a total of 3 rules in 17 ms. Remains 110 /130 variables (removed 20) and now considering 178/179 (removed 1) transitions.
Running 128 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17888322715563784043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7979164116998125478.kers'
[2026-05-23 10:12:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17888322715563784043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7979164116998125478.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 178 rows 85 cols 509 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-23 10:12:29] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7979164116998125478.kers
Total runtime 1 ms.
[2026-05-23 10:12:29] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 2/109 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 178/287 variables, 109/137 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 50/187 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 1/288 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 288/288 variables, and 189 constraints, problems are : Problem set: 0 solved, 128 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/110 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 2/109 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 178/287 variables, 109/137 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 50/187 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 124/311 constraints. Problems are: Problem set: 0 solved, 128 unsolved
SMT process timed out in 40052ms, After SMT, problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 40054ms
[2026-05-23 10:13:09] [INFO ] Invariant cache hit.
[2026-05-23 10:13:09] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-23 10:13:09] [INFO ] Invariant cache hit.
[2026-05-23 10:13:09] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:13:11] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
[2026-05-23 10:13:11] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/130 places, 178/179 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41564 ms. Remains : 110/130 places, 178/179 transitions.
[2026-05-23 10:13:11] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:13:11] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:13:11] [INFO ] Input system was already deterministic with 178 transitions.
[2026-05-23 10:13:11] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:13:11] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:13:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality2654326708380428536.gal : 1 ms
[2026-05-23 10:13:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality4298611790248381414.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/CTLCardinality2654326708380428536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4298611790248381414.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,1.22778e+06,1.04387,39924,2,9168,5,162727,6,0,616,155961,0


Converting to forward existential form...Done !
original formula: (AF((((pl_wait_cops>=3) + AF((pl_robber_absent_n4<=0))) + EG((((pl_incoming_cops_n19<=pl_robber_here_n23)&&(pl_end_n9<=1))&&(pl_end_n9>pl...207
=> equivalent forward existential formula: ([FwdG(Init,!((((pl_wait_cops>=3) + !(EG(!((pl_robber_absent_n4<=0))))) + EG((((pl_incoming_cops_n19<=pl_robber_...278
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...552
(forward)formula 0,0,6.91444,201008,1,0,527,984213,382,215,4984,789773,532
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 179/179 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 111 transition count 179
Applied a total of 19 rules in 6 ms. Remains 111 /130 variables (removed 19) and now considering 179/179 (removed 0) transitions.
Running 129 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9000357449279406123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4722476318154609254.kers'
[2026-05-23 10:13:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9000357449279406123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4722476318154609254.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 86 cols 511 entries
Finished phase 1 with 83 SingleSign rule and 0 generalized
[2026-05-23 10:13:18] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4722476318154609254.kers
Total runtime 0 ms.
[2026-05-23 10:13:18] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 1/290 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 290/290 variables, and 189 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 111/111 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 125/313 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/290 variables, and 313 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/111 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 125/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40045ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40046ms
[2026-05-23 10:13:58] [INFO ] Invariant cache hit.
[2026-05-23 10:13:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 10:13:58] [INFO ] Invariant cache hit.
[2026-05-23 10:13:58] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:13:59] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 111/130 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41108 ms. Remains : 111/130 places, 179/179 transitions.
[2026-05-23 10:13:59] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:13:59] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:13:59] [INFO ] Input system was already deterministic with 179 transitions.
[2026-05-23 10:13:59] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:13:59] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:13:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality9409743375242185114.gal : 1 ms
[2026-05-23 10:13:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality8221920285526743583.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/CTLCardinality9409743375242185114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8221920285526743583.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,1.28528e+06,1.04003,40796,2,11678,5,148981,6,0,621,164157,0


Converting to forward existential form...Done !
original formula: EG((A(((pl_end_n20<=2) + E(E((pl_cops_n7<=pl_cops_n13) U (pl_incoming_cops_n14<=1)) U (pl_cops_n7>=2))) U (pl_robber_absent_n10>=1)) * ((...297
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((pl_robber_absent_n10>=1)) U (!(((pl_end_n20<=2) + E(E((pl_cops_n7<=pl_cops_n13) U (pl_incomi...437
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, t29, t30, t32, t34...554
Detected timeout of ITS tools.
[2026-05-23 10:14:29] [INFO ] Flatten gal took : 10 ms
[2026-05-23 10:14:29] [INFO ] Applying decomposition
[2026-05-23 10:14:29] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16992646296155678780.txt' '-o' '/tmp/graph16992646296155678780.bin' '-w' '/tmp/graph16992646296155678780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16992646296155678780.bin' '-l' '-1' '-v' '-w' '/tmp/graph16992646296155678780.weights' '-q' '0' '-e' '0.001'
[2026-05-23 10:14:29] [INFO ] Decomposing Gal with order
[2026-05-23 10:14:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 10:14:29] [INFO ] Removed a total of 180 redundant transitions.
[2026-05-23 10:14:29] [INFO ] Flatten gal took : 204 ms
[2026-05-23 10:14:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 10 ms.
[2026-05-23 10:14:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality4565154922304399117.gal : 3 ms
[2026-05-23 10:14:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality11415855648916991798.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/CTLCardinality4565154922304399117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11415855648916991798.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,1.28528e+06,1.13932,37720,2,10400,5,141867,6,0,621,158067,0


Converting to forward existential form...Done !
original formula: EG((A(((gi0.gi1.gu25.pl_end_n20<=2) + E(E((gu17.pl_cops_n7<=gu17.pl_cops_n13) U (gi0.gi0.gu18.pl_incoming_cops_n14<=1)) U (gu17.pl_cops_n...413
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((gi0.gi0.gu14.pl_robber_absent_n10>=1)) U (!(((gi0.gi1.gu25.pl_end_n20<=2) + E(E((gu17.pl_cop...579
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.t7, gi0.gi0.t12, gi0.gi0.t17, gi0.gi0.t22, gi0.gi0.t27, gi0.gi0.t32, gi0.gi0.t35, gi0...833
(forward)formula 0,1,26.4839,776504,1,0,1663,3.94269e+06,372,1217,4583,4.21982e+06,1804
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 179/179 transitions.
Graph (complete) has 795 edges and 130 vertex of which 110 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 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 110 transition count 178
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 109 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 108 transition count 177
Applied a total of 5 rules in 11 ms. Remains 108 /130 variables (removed 22) and now considering 177/179 (removed 2) transitions.
Running 127 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4967512987335675809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16701234461651346476.kers'
[2026-05-23 10:14:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4967512987335675809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16701234461651346476.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 177 rows 83 cols 505 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-23 10:14:56] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16701234461651346476.kers
Total runtime 1 ms.
[2026-05-23 10:14:56] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 186 constraints, problems are : Problem set: 0 solved, 127 unsolved in 18912 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 127/313 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 313 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38950ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 38950ms
[2026-05-23 10:15:35] [INFO ] Invariant cache hit.
[2026-05-23 10:15:35] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-23 10:15:35] [INFO ] Invariant cache hit.
[2026-05-23 10:15:35] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:15:36] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 1583 ms to find 0 implicit places.
[2026-05-23 10:15:36] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 108/130 places, 177/179 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40553 ms. Remains : 108/130 places, 177/179 transitions.
[2026-05-23 10:15:36] [INFO ] Flatten gal took : 22 ms
[2026-05-23 10:15:37] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:15:37] [INFO ] Input system was already deterministic with 177 transitions.
[2026-05-23 10:15:37] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:15:37] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:15:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality2119768347665346259.gal : 1 ms
[2026-05-23 10:15:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality16508242500861908239.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/CTLCardinality2119768347665346259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16508242500861908239.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,1.17028e+06,0.878458,34056,2,7647,5,133931,6,0,610,129212,0


Converting to forward existential form...Done !
original formula: AF((pl_cops_n10>pl_incoming_cops_n4))
=> equivalent forward existential formula: [FwdG(Init,!((pl_cops_n10>pl_incoming_cops_n4)))] = FALSE
Hit Full ! (commute/partial/dont) 170/0/7
(forward)formula 0,0,8.66791,263524,1,0,23,1.22925e+06,20,3,3755,1.05515e+06,21
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 179/179 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 112 transition count 179
Applied a total of 18 rules in 5 ms. Remains 112 /130 variables (removed 18) and now considering 179/179 (removed 0) transitions.
Running 129 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3044658439248568304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-574565401586164868.kers'
[2026-05-23 10:15:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3044658439248568304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-574565401586164868.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 87 cols 513 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-23 10:15:45] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-574565401586164868.kers
Total runtime 1 ms.
[2026-05-23 10:15:45] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 2/291 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/291 variables, and 190 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20009 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 112/112 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 121/309 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/291 variables, and 309 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20009 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/112 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 121/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40044ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40045ms
[2026-05-23 10:16:25] [INFO ] Invariant cache hit.
[2026-05-23 10:16:25] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-23 10:16:25] [INFO ] Invariant cache hit.
[2026-05-23 10:16:25] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:16:27] [INFO ] Implicit Places using invariants and state equation in 1428 ms returned []
Implicit Place search using SMT with State Equation took 1511 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 112/130 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41563 ms. Remains : 112/130 places, 179/179 transitions.
[2026-05-23 10:16:27] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:16:27] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:16:27] [INFO ] Input system was already deterministic with 179 transitions.
[2026-05-23 10:16:27] [INFO ] Flatten gal took : 8 ms
[2026-05-23 10:16:27] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:16:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality3430065491670324594.gal : 2 ms
[2026-05-23 10:16:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality12316505439580294961.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/CTLCardinality3430065491670324594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12316505439580294961.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,1.28528e+06,1.11346,41760,2,10820,5,159255,6,0,622,164116,0


Converting to forward existential form...Done !
original formula: AX(EF((((pl_end_n3<2) * AX((pl_wait_cops>2))) * EG((pl_end_n18>=3)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (((pl_end_n3<2) * !(EX(!((pl_wait_cops>2))))) * EG((pl_end_n18>=3))))))] = 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, t29, t30, t32, t34...554
(forward)formula 0,0,6.14061,185148,1,0,423,809512,388,158,5152,650881,426
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-11 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 : 130/130 places, 179/179 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 116 transition count 179
Applied a total of 14 rules in 2 ms. Remains 116 /130 variables (removed 14) and now considering 179/179 (removed 0) transitions.
Running 129 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17754114591587594692.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7285129999676238821.kers'
[2026-05-23 10:16:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17754114591587594692.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7285129999676238821.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 91 cols 521 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-23 10:16:33] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7285129999676238821.kers
Total runtime 1 ms.
[2026-05-23 10:16:33] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 6/295 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/295 variables, and 194 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 116/116 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 105/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/295 variables, and 293 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/116 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 105/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40051ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40052ms
[2026-05-23 10:17:13] [INFO ] Invariant cache hit.
[2026-05-23 10:17:13] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-23 10:17:13] [INFO ] Invariant cache hit.
[2026-05-23 10:17:13] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:17:15] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 116/130 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41789 ms. Remains : 116/130 places, 179/179 transitions.
[2026-05-23 10:17:15] [INFO ] Flatten gal took : 8 ms
[2026-05-23 10:17:15] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:17:15] [INFO ] Input system was already deterministic with 179 transitions.
[2026-05-23 10:17:15] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:17:15] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:17:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality8173232228156134495.gal : 1 ms
[2026-05-23 10:17:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality4314616587958645412.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/CTLCardinality8173232228156134495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4314616587958645412.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,1.28528e+06,1.08693,42016,2,12782,5,160041,6,0,626,166377,0


Converting to forward existential form...Done !
original formula: ((EF((AX((pl_robber_absent_n11<=pl_cops_n25)) + EF((pl_end_n1<=pl_end_n20)))) * AF((((pl_end_n10<=pl_cops_n12)||(pl_cops_n12<=pl_end_n2))...235
=> equivalent forward existential formula: (([(Init * !(E(TRUE U (!(EX(!((pl_robber_absent_n11<=pl_cops_n25)))) + E(TRUE U (pl_end_n1<=pl_end_n20))))))] = ...370
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, t29, t30, t32, t34...554
(forward)formula 0,1,18.5864,543024,1,0,516,3.07792e+06,397,212,5251,1.81454e+06,548
FORMULA CopsAndRobbers-PT-CRL025X003-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 10:17:34] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:17:34] [INFO ] Flatten gal took : 3 ms
Total runtime 764033 ms.

BK_STOP 1779531454236

--------------------
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-CRL025X003"
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-CRL025X003, 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-177946967700473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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