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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.3K Mar 6 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 6 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 13:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 6 13:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K 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.2K Mar 15 08:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 6 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Mar 6 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 6 13:31 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 134K 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-HRL014X002-CTLCardinality-2024-00
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-01
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-02
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-03
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-04
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-05
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-06
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-07
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-08
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-09
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-10
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-11
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-12
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-13
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-14
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779531245324

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-HRL014X002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 10:14:06] [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:14:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 10:14:06] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2026-05-23 10:14:06] [INFO ] Transformed 80 places.
[2026-05-23 10:14:06] [INFO ] Transformed 158 transitions.
[2026-05-23 10:14:06] [INFO ] Parsed PT model containing 80 places and 158 transitions and 807 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Support contains 59 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 158/158 transitions.
Applied a total of 0 rules in 9 ms. Remains 80 /80 variables (removed 0) and now considering 158/158 (removed 0) transitions.
Running 130 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-9225168974311583179.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8219766374807800178.kers'
[2026-05-23 10:14:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9225168974311583179.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8219766374807800178.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 158 rows 66 cols 541 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-23 10:14:06] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8219766374807800178.kers
Total runtime 1 ms.
[2026-05-23 10:14:06] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 16/80 variables, 3/18 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 4/22 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/22 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 158/238 variables, 80/102 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 42/144 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/144 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/238 variables, 0/144 constraints. Problems are: Problem set: 28 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 144 constraints, problems are : Problem set: 28 solved, 102 unsolved in 4088 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 80/80 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 16/80 variables, 3/18 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 4/22 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 8/30 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 9/39 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/39 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 158/238 variables, 80/119 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 42/161 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 102/263 constraints. Problems are: Problem set: 28 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/238 variables, and 263 constraints, problems are : Problem set: 28 solved, 102 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 80/80 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 102/130 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24333ms problems are : Problem set: 28 solved, 102 unsolved
Search for dead transitions found 28 dead transitions in 24347ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 28 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9260100425120402745.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12466455523744772860.kers'
[2026-05-23 10:14:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9260100425120402745.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12466455523744772860.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 130 rows 66 cols 429 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-23 10:14:31] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12466455523744772860.kers
Total runtime 1 ms.
[2026-05-23 10:14:31] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-23 10:14:31] [INFO ] Invariant cache hit.
[2026-05-23 10:14:31] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:14:31] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/80 places, 130/158 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24598 ms. Remains : 80/80 places, 130/158 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 130/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Running 102 sub problems to find dead transitions.
[2026-05-23 10:14:31] [INFO ] Invariant cache hit.
[2026-05-23 10:14:31] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 16/80 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 130/210 variables, 80/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 28/139 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/210 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 140 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5728 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 80/80 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 16/80 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 130/210 variables, 80/127 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 28/155 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 102/257 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 258 constraints, problems are : Problem set: 0 solved, 102 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 80/80 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25771ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 25772ms
[2026-05-23 10:14:57] [INFO ] Invariant cache hit.
[2026-05-23 10:14:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-23 10:14:57] [INFO ] Invariant cache hit.
[2026-05-23 10:14:57] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:14:57] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 25901 ms. Remains : 80/80 places, 130/130 transitions.
Support contains 59 out of 80 places after structural reductions.
[2026-05-23 10:14:57] [INFO ] Flatten gal took : 33 ms
[2026-05-23 10:14:57] [INFO ] Flatten gal took : 15 ms
[2026-05-23 10:14:57] [INFO ] Input system was already deterministic with 130 transitions.
Support contains 58 out of 80 places (down from 59) after GAL structural reductions.
RANDOM walk for 40001 steps (223 resets) in 1789 ms. (22 steps per ms) remains 20/68 properties
BEST_FIRST walk for 4001 steps (23 resets) in 28 ms. (137 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4002 steps (15 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (14 resets) in 28 ms. (137 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (22 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (19 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (16 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (17 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (19 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (27 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (21 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (20 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (20 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (14 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
[2026-05-23 10:14:58] [INFO ] Invariant cache hit.
[2026-05-23 10:14:58] [INFO ] State equation strengthened by 28 read => feed constraints.
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp59 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 2 (OVERLAPS) 57/75 variables, 11/13 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/80 variables, 5/18 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/18 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/210 variables, 80/98 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 28/126 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/126 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/126 constraints. Problems are: Problem set: 18 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 126 constraints, problems are : Problem set: 18 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 80/80 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 1 unsolved
Problem AtomicPropp55 is UNSAT
After SMT solving in domain Int declared 2/210 variables, and 0 constraints, problems are : Problem set: 19 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/80 constraints, ReadFeed: 0/28 constraints, PredecessorRefiner: 0/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 19 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 19 atomic propositions for a total of 16 simplifications.
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 10:14:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-23 10:14:58] [INFO ] Flatten gal took : 11 ms
[2026-05-23 10:14:58] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 10:14:58] [INFO ] Flatten gal took : 9 ms
[2026-05-23 10:14:58] [INFO ] Input system was already deterministic with 130 transitions.
Support contains 40 out of 80 places (down from 50) after GAL structural reductions.
Computed a total of 4 stabilizing places and 29 stable transitions
Graph (complete) has 514 edges and 80 vertex of which 66 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 130/130 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 67 transition count 130
Applied a total of 13 rules in 4 ms. Remains 67 /80 variables (removed 13) and now considering 130/130 (removed 0) transitions.
Running 102 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-4295423852367872647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1258421572088659142.kers'
[2026-05-23 10:14:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4295423852367872647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1258421572088659142.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 130 rows 53 cols 403 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 10:14:58] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1258421572088659142.kers
Total runtime 0 ms.
[2026-05-23 10:14:58] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/197 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 113 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7378 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 67/67 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 97/208 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 102 unsolved
SMT process timed out in 27413ms, After SMT, problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 27414ms
[2026-05-23 10:15:25] [INFO ] Invariant cache hit.
[2026-05-23 10:15:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-23 10:15:25] [INFO ] Invariant cache hit.
[2026-05-23 10:15:25] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:15:25] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 67/80 places, 130/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27676 ms. Remains : 67/80 places, 130/130 transitions.
[2026-05-23 10:15:26] [INFO ] Flatten gal took : 10 ms
[2026-05-23 10:15:26] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:15:26] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:15:26] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:15:26] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:15:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality7294332245610155142.gal : 4 ms
[2026-05-23 10:15:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality10610932745483318954.ctl : 6 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/CTLCardinality7294332245610155142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10610932745483318954.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,17158,0.176714,10708,2,2110,5,24969,6,0,396,30326,0


Converting to forward existential form...Done !
original formula: EX(AG(((pl_end_n8<=pl_incoming_cops_n5)&&(pl_robber_absent_n4<=2))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((pl_end_n8<=pl_incoming_cops_n5)&&(pl_robber_absent_n4<=2))))))] != 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...526
(forward)formula 0,0,3.11216,99796,1,0,356,560052,282,128,3533,314590,349
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 80/80 places, 130/130 transitions.
Graph (complete) has 514 edges and 80 vertex of which 68 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 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 68 transition count 129
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 67 transition count 129
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 66 transition count 128
Applied a total of 5 rules in 26 ms. Remains 66 /80 variables (removed 14) and now considering 128/130 (removed 2) transitions.
Running 100 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-7912634542695826397.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4379398768132380388.kers'
[2026-05-23 10:15:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7912634542695826397.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4379398768132380388.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 128 rows 52 cols 401 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-23 10:15:29] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4379398768132380388.kers
Total runtime 0 ms.
[2026-05-23 10:15:29] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 128/192 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 28/109 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 2/194 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 113 constraints, problems are : Problem set: 0 solved, 100 unsolved in 9851 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 2/64 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 128/192 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 28/110 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 90/200 constraints. Problems are: Problem set: 0 solved, 100 unsolved
SMT process timed out in 29893ms, After SMT, problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 29893ms
[2026-05-23 10:15:59] [INFO ] Invariant cache hit.
[2026-05-23 10:15:59] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-23 10:15:59] [INFO ] Invariant cache hit.
[2026-05-23 10:15:59] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:15:59] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2026-05-23 10:15:59] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 66/80 places, 128/130 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30195 ms. Remains : 66/80 places, 128/130 transitions.
[2026-05-23 10:15:59] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:15:59] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:15:59] [INFO ] Input system was already deterministic with 128 transitions.
[2026-05-23 10:15:59] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:15:59] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:15:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality5807412761891046801.gal : 3 ms
[2026-05-23 10:15:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality7219308855383722286.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/CTLCardinality5807412761891046801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7219308855383722286.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,14218,0.133188,9608,2,2041,5,21393,6,0,387,22567,0


Converting to forward existential form...Done !
original formula: AG(E((pl_end_n11<=pl_end_n12) U EG((pl_cops_n2<=0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((pl_end_n11<=pl_end_n12) U EG((pl_cops_n2<=0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t7, t8, t10, t12, t13, t15, t17, t18, t20, t22, t23, t25, t27, t28, t30, t32, t33...534
(forward)formula 0,0,3.80993,130304,1,0,526,747769,282,222,3514,503258,570
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 130/130 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 66 transition count 130
Applied a total of 14 rules in 6 ms. Remains 66 /80 variables (removed 14) and now considering 130/130 (removed 0) transitions.
Running 102 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-5510213814918309569.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13397521901616270772.kers'
[2026-05-23 10:16:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5510213814918309569.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13397521901616270772.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 130 rows 52 cols 401 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-23 10:16:03] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13397521901616270772.kers
Total runtime 0 ms.
[2026-05-23 10:16:03] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 112 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5327 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 102/213 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/196 variables, and 217 constraints, problems are : Problem set: 0 solved, 102 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25359ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 25359ms
[2026-05-23 10:16:28] [INFO ] Invariant cache hit.
[2026-05-23 10:16:28] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-23 10:16:28] [INFO ] Invariant cache hit.
[2026-05-23 10:16:28] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:16:28] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 66/80 places, 130/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25589 ms. Remains : 66/80 places, 130/130 transitions.
[2026-05-23 10:16:28] [INFO ] Flatten gal took : 9 ms
[2026-05-23 10:16:28] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:16:28] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:16:28] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:16:28] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:16:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality6694067712912675496.gal : 1 ms
[2026-05-23 10:16:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality1693927713509593958.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/CTLCardinality6694067712912675496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1693927713509593958.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,17158,0.172903,10488,2,1893,5,23148,6,0,395,29207,0


Converting to forward existential form...Done !
original formula: EF(EG(AX(!(E((pl_finalizing<=1) U (pl_incoming_cops_n10>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!(!(E((pl_finalizing<=1) U (pl_incoming_cops_n10>=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...526
(forward)formula 0,1,0.843855,33772,1,0,332,144188,286,116,3486,116377,313
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 130/130 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 67 transition count 130
Applied a total of 13 rules in 1 ms. Remains 67 /80 variables (removed 13) and now considering 130/130 (removed 0) transitions.
Running 102 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-3836166799348706106.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18209288252558863613.kers'
[2026-05-23 10:16:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3836166799348706106.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18209288252558863613.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 130 rows 53 cols 403 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 10:16:29] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18209288252558863613.kers
Total runtime 1 ms.
[2026-05-23 10:16:29] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/197 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 113 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7415 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 67/67 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 97/208 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/197 variables, and 212 constraints, problems are : Problem set: 0 solved, 102 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/67 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 97/102 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 27451ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 27451ms
[2026-05-23 10:16:57] [INFO ] Invariant cache hit.
[2026-05-23 10:16:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-23 10:16:57] [INFO ] Invariant cache hit.
[2026-05-23 10:16:57] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:16:57] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 67/80 places, 130/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27668 ms. Remains : 67/80 places, 130/130 transitions.
[2026-05-23 10:16:57] [INFO ] Flatten gal took : 9 ms
[2026-05-23 10:16:57] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:16:57] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:16:57] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:16:57] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:16:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality3292543264093661150.gal : 1 ms
[2026-05-23 10:16:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality15322103344431103105.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/CTLCardinality3292543264093661150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15322103344431103105.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,17158,0.174039,10780,2,2110,5,24969,6,0,396,30326,0


Converting to forward existential form...Done !
original formula: AX(AG((EG(((pl_incoming_cops_n4<=pl_start_robber)&&(pl_finished_moving>=1))) * ((pl_end_n8<1)||(pl_robber_absent_n1>pl_start_cops)))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(EG(((pl_incoming_cops_n4<=pl_start_robber)&&(pl_finished_moving>=1)))))] = FALSE * [(...243
(forward)formula 0,0,0.263259,11100,1,0,10,24975,10,2,950,30326,4
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 80/80 places, 130/130 transitions.
Graph (complete) has 514 edges and 80 vertex of which 66 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 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 66 transition count 129
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 65 transition count 129
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 64 transition count 128
Applied a total of 5 rules in 9 ms. Remains 64 /80 variables (removed 16) and now considering 128/130 (removed 2) transitions.
Running 100 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-8639810185398678826.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14575098098810544168.kers'
[2026-05-23 10:16:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8639810185398678826.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14575098098810544168.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 128 rows 50 cols 397 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-23 10:16:57] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14575098098810544168.kers
Total runtime 0 ms.
[2026-05-23 10:16:57] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 128/192 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 28/109 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 111 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8359 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 128/192 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 28/109 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 100 unsolved
SMT process timed out in 28397ms, After SMT, problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 28398ms
[2026-05-23 10:17:26] [INFO ] Invariant cache hit.
[2026-05-23 10:17:26] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 10:17:26] [INFO ] Invariant cache hit.
[2026-05-23 10:17:26] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:17:26] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2026-05-23 10:17:26] [INFO ] Redundant transitions in 8 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 64/80 places, 128/130 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28697 ms. Remains : 64/80 places, 128/130 transitions.
[2026-05-23 10:17:26] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:17:26] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:17:26] [INFO ] Input system was already deterministic with 128 transitions.
[2026-05-23 10:17:26] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:17:26] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:17:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality7575380518415616222.gal : 1 ms
[2026-05-23 10:17:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality7109034101732043968.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/CTLCardinality7575380518415616222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7109034101732043968.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,14218,0.124871,9308,2,1584,5,20545,6,0,385,22292,0


Converting to forward existential form...Done !
original formula: EG(AG((pl_incoming_cops_n12<=1)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((pl_incoming_cops_n12<=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t7, t8, t10, t12, t13, t15, t17, t18, t20, t22, t23, t25, t27, t28, t30, t32, t33...534
(forward)formula 0,0,1.50636,56692,1,0,311,306065,284,104,3509,177361,332
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 130/130 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 67 transition count 130
Applied a total of 13 rules in 2 ms. Remains 67 /80 variables (removed 13) and now considering 130/130 (removed 0) transitions.
Running 102 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-8149096923525227624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14601637067090245840.kers'
[2026-05-23 10:17:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8149096923525227624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14601637067090245840.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 130 rows 53 cols 403 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 10:17:28] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14601637067090245840.kers
Total runtime 1 ms.
[2026-05-23 10:17:28] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/197 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 113 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7202 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 67/67 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 97/208 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 102 unsolved
SMT process timed out in 27243ms, After SMT, problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 27243ms
[2026-05-23 10:17:55] [INFO ] Invariant cache hit.
[2026-05-23 10:17:55] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 10:17:55] [INFO ] Invariant cache hit.
[2026-05-23 10:17:55] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:17:55] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 67/80 places, 130/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27499 ms. Remains : 67/80 places, 130/130 transitions.
[2026-05-23 10:17:55] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:17:55] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:17:55] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:17:55] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:17:55] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:17:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality15413774789437719611.gal : 1 ms
[2026-05-23 10:17:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality4267499500274603802.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/CTLCardinality15413774789437719611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4267499500274603802.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,17158,0.174953,10764,2,2324,5,24336,6,0,396,30331,0


Converting to forward existential form...Done !
original formula: AX(EF(((pl_end_n11>=2) * AF((pl_robber_absent_n9<=0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((pl_end_n11>=2) * !(EG(!((pl_robber_absent_n9<=0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, t29, t30, t32, t34...526
(forward)formula 0,0,4.16269,142192,1,0,564,803909,287,241,3467,564674,585
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 130/130 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 67 transition count 130
Applied a total of 13 rules in 4 ms. Remains 67 /80 variables (removed 13) and now considering 130/130 (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-15538660033963341934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3004670708696637683.kers'
[2026-05-23 10:17:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15538660033963341934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3004670708696637683.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 130 rows 53 cols 403 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 10:17:59] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3004670708696637683.kers
Total runtime 1 ms.
[2026-05-23 10:17:59] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 10:17:59] [INFO ] Invariant cache hit.
[2026-05-23 10:17:59] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:18:00] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 67/80 places, 130/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 67/80 places, 130/130 transitions.
[2026-05-23 10:18:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:18:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:18:00] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:18:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:18:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:18:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality364539011904177545.gal : 1 ms
[2026-05-23 10:18:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality2769570302702572531.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/CTLCardinality364539011904177545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2769570302702572531.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 -...282
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,17158,0.147875,10328,2,1887,5,22648,6,0,396,27935,0


Converting to forward existential form...Done !
original formula: EF((A(((AF((pl_incoming_cops_n7>=2)) + EG((pl_robber_here_n2<=pl_finished_moving))) + ((AF((pl_wait_cops<=pl_incoming_cops_n8)) * AF((pl_...337
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((E(!(!(E(TRUE U !((!(EX(!((pl_robber_here_n5>=1)))) * (pl_cops_n8<=pl_robber_absent_n10)...1186
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...526
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,9.48176,290224,1,0,1310,1.73119e+06,316,825,3630,1.19673e+06,1478
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 130/130 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 69 transition count 130
Applied a total of 11 rules in 4 ms. Remains 69 /80 variables (removed 11) and now considering 130/130 (removed 0) transitions.
Running 102 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-6996344475057549201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8592185982639581158.kers'
[2026-05-23 10:18:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6996344475057549201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8592185982639581158.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 130 rows 55 cols 407 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-23 10:18:09] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8592185982639581158.kers
Total runtime 1 ms.
[2026-05-23 10:18:09] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 3/199 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/199 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 116 constraints, problems are : Problem set: 0 solved, 102 unsolved in 8234 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 69/69 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 87/198 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/199 variables, and 199 constraints, problems are : Problem set: 0 solved, 102 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/69 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 87/102 constraints, Known Traps: 0/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 28280ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 28280ms
[2026-05-23 10:18:38] [INFO ] Invariant cache hit.
[2026-05-23 10:18:38] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-23 10:18:38] [INFO ] Invariant cache hit.
[2026-05-23 10:18:38] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:18:38] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 69/80 places, 130/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28500 ms. Remains : 69/80 places, 130/130 transitions.
[2026-05-23 10:18:38] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:18:38] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:18:38] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:18:38] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:18:38] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:18:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality12897334041572164812.gal : 2 ms
[2026-05-23 10:18:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality6273183512088872850.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/CTLCardinality12897334041572164812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6273183512088872850.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,17158,0.18452,11176,2,2380,5,25259,6,0,398,33379,0


Converting to forward existential form...Done !
original formula: EF(((AF(AG(((pl_cops_n4<=0)||(pl_cops_n9<=0)))) + (E(!(AF((pl_cops_n4<=pl_robber_here_n5))) U EG(((pl_init_cops>=2)||(pl_robber_absent_n3...362
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !(((pl_cops_n4<=0)||(pl_cops_n9<=0)))))))))] != FALSE + [(FwdU((FwdU(Ini...701
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...526
Using saturation style SCC detection
(forward)formula 0,1,1.80807,67536,1,0,362,343602,290,133,3640,205064,360
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-12 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 : 80/80 places, 130/130 transitions.
Graph (complete) has 514 edges and 80 vertex of which 66 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 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 66 transition count 129
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 65 transition count 129
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 64 transition count 128
Applied a total of 5 rules in 13 ms. Remains 64 /80 variables (removed 16) and now considering 128/130 (removed 2) transitions.
Running 100 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-117355646541507230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15373966853226768475.kers'
[2026-05-23 10:18:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-117355646541507230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15373966853226768475.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 128 rows 50 cols 397 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-23 10:18:40] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15373966853226768475.kers
Total runtime 0 ms.
[2026-05-23 10:18:40] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 128/192 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 28/109 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 111 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8468 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 128/192 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
SMT process timed out in 28502ms, After SMT, problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 28502ms
[2026-05-23 10:19:08] [INFO ] Invariant cache hit.
[2026-05-23 10:19:08] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 10:19:08] [INFO ] Invariant cache hit.
[2026-05-23 10:19:08] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:19:08] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2026-05-23 10:19:08] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 64/80 places, 128/130 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28807 ms. Remains : 64/80 places, 128/130 transitions.
[2026-05-23 10:19:08] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:19:08] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:19:08] [INFO ] Input system was already deterministic with 128 transitions.
[2026-05-23 10:19:08] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:19:08] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:19:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality8580125779665808802.gal : 1 ms
[2026-05-23 10:19:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality146839682561992733.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/CTLCardinality8580125779665808802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality146839682561992733.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 -...282
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,14218,0.132479,9300,2,1584,5,20545,6,0,385,22292,0


Converting to forward existential form...Done !
original formula: A((pl_cops_n2<=0) U !(EG(!(EG((pl_wait_cops>=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EG((pl_wait_cops>=1))))))))) * !(E(!(!(EG(!(EG((pl_wait_cops>=1)))))) U (!((pl_cops_n2<=...209
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t7, t8, t10, t12, t13, t15, t17, t18, t20, t22, t23, t25, t27, t28, t30, t32, t33...534
(forward)formula 0,0,3.15275,113628,1,0,354,653569,286,131,3489,381786,400
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 80/80 places, 130/130 transitions.
Graph (complete) has 514 edges and 80 vertex of which 69 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 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 69 transition count 129
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 68 transition count 129
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 67 transition count 128
Applied a total of 5 rules in 13 ms. Remains 67 /80 variables (removed 13) and now considering 128/130 (removed 2) transitions.
Running 100 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-9329429412299942168.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14117783102635320584.kers'
[2026-05-23 10:19:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9329429412299942168.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14117783102635320584.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 128 rows 53 cols 403 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 10:19:12] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14117783102635320584.kers
Total runtime 1 ms.
[2026-05-23 10:19:12] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 128/192 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 28/109 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 3/195 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 114 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8103 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 67/67 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 128/192 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 28/109 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 85/194 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 100 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 64/67 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 85/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 28139ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 28139ms
[2026-05-23 10:19:40] [INFO ] Invariant cache hit.
[2026-05-23 10:19:40] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-23 10:19:40] [INFO ] Invariant cache hit.
[2026-05-23 10:19:40] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:19:40] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2026-05-23 10:19:40] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 67/80 places, 128/130 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28428 ms. Remains : 67/80 places, 128/130 transitions.
[2026-05-23 10:19:40] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:19:40] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:19:40] [INFO ] Input system was already deterministic with 128 transitions.
[2026-05-23 10:19:40] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:19:40] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:19:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality16462025039523764701.gal : 1 ms
[2026-05-23 10:19:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality10664812686120999281.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/CTLCardinality16462025039523764701.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10664812686120999281.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,14218,0.128346,9496,2,1793,5,21299,6,0,388,22537,0


Converting to forward existential form...Done !
original formula: (AF((pl_end_n5>0)) * !(A(AG(((pl_robber_here_n10>0)&&((pl_robber_absent_n6>=1)||(pl_end_n2>=1)))) U !(AF((pl_end_n1<1))))))
=> equivalent forward existential formula: ([FwdG(Init,!((pl_end_n5>0)))] = FALSE * [((Init * !(EG(!(!(!(EG(!((pl_end_n1<1))))))))) * !(E(!(!(!(EG(!((pl_en...304
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t7, t8, t10, t12, t13, t15, t17, t18, t20, t22, t23, t25, t27, t28, t30, t32, t33...534
Using saturation style SCC detection
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 126/0/2
(forward)formula 0,0,3.49168,125432,1,0,479,712786,301,254,3665,508408,520
FORMULA CopsAndRobbers-PT-HRL014X002-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-23 10:19:44] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:19:44] [INFO ] Flatten gal took : 3 ms
Total runtime 337691 ms.

BK_STOP 1779531584207

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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-HRL014X002"
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-HRL014X002, 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-177946967700481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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