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-177946967700453.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is CopsAndRobbers-PT-CRL005X001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 9.8K Mar 6 13:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 6 13:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 13:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 15 08:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 08:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 6 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 6 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 6 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 08:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 29K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779529849155

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-CRL005X001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-23 09:50:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 09:50:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:50:50] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2026-05-23 09:50:50] [INFO ] Transformed 35 places.
[2026-05-23 09:50:50] [INFO ] Transformed 39 transitions.
[2026-05-23 09:50:50] [INFO ] Parsed PT model containing 35 places and 39 transitions and 174 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10971194886863632024.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13940789275385229269.kers'
[2026-05-23 09:50:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10971194886863632024.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13940789275385229269.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 30 cols 119 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-23 09:50:50] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13940789275385229269.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30000 steps (7 resets) in 56 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-23 09:50:50] [INFO ] Invariant cache hit.
[2026-05-23 09:50:50] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2026-05-23 09:50:50] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2026-05-23 09:50:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:50] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2026-05-23 09:50:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 09:50:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-23 09:50:50] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-23 09:50:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2026-05-23 09:50:50] [INFO ] Computed and/alt/rep : 28/95/28 causal constraints (skipped 1 transitions) in 5 ms.
[2026-05-23 09:50:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2026-05-23 09:50:51] [INFO ] Added : 19 causal constraints over 5 iterations in 164 ms. Result :sat
Minimization took 18 ms.
[2026-05-23 09:50:51] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2026-05-23 09:50:51] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-23 09:50:51] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2026-05-23 09:50:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 09:50:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-23 09:50:51] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-23 09:50:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2026-05-23 09:50:51] [INFO ] Computed and/alt/rep : 28/95/28 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-23 09:50:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2026-05-23 09:50:51] [INFO ] Added : 19 causal constraints over 5 iterations in 84 ms. Result :sat
Minimization took 18 ms.
[2026-05-23 09:50:51] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2026-05-23 09:50:51] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-23 09:50:51] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2026-05-23 09:50:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 09:50:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-23 09:50:51] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2026-05-23 09:50:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2026-05-23 09:50:51] [INFO ] Computed and/alt/rep : 28/95/28 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-23 09:50:51] [INFO ] Added : 3 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 39/39 transitions.
Graph (complete) has 130 edges and 35 vertex of which 31 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 31 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 29 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 28 transition count 36
Applied a total of 7 rules in 23 ms. Remains 28 /35 variables (removed 7) and now considering 36/39 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 28/35 places, 36/39 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3843937370140540297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9518108723090177230.kers'
[2026-05-23 09:50:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3843937370140540297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9518108723090177230.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 36 rows 23 cols 105 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-23 09:50:51] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9518108723090177230.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 684 ms. (1459 steps per ms)
BEST_FIRST walk for 1000000 steps (4 resets) in 562 ms. (1776 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-23 09:50:52] [INFO ] Invariant cache hit.
[2026-05-23 09:50:52] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-23 09:50:52] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-23 09:50:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:52] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2026-05-23 09:50:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 09:50:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-23 09:50:52] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-23 09:50:52] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2026-05-23 09:50:52] [INFO ] Computed and/alt/rep : 25/140/25 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-23 09:50:52] [INFO ] Added : 3 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 36/36 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 28/28 places, 36/36 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 36/36 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2026-05-23 09:50:52] [INFO ] Invariant cache hit.
[2026-05-23 09:50:52] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-23 09:50:52] [INFO ] Invariant cache hit.
[2026-05-23 09:50:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:52] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 135 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/28 places, 36/36 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 142 ms. Remains : 27/28 places, 36/36 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9499128359720526400.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7172689031171620481.kers'
[2026-05-23 09:50:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9499128359720526400.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7172689031171620481.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 36 rows 22 cols 95 entries
Finished phase 1 with 19 SingleSign rule and 1 generalized
[2026-05-23 09:50:53] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7172689031171620481.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (3 resets) in 508 ms. (1964 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 479 ms. (2083 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-23 09:50:53] [INFO ] Invariant cache hit.
[2026-05-23 09:50:54] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-23 09:50:54] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 09:50:54] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-23 09:50:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:54] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2026-05-23 09:50:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 09:50:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-23 09:50:54] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 7 ms returned sat
[2026-05-23 09:50:54] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-23 09:50:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-23 09:50:54] [INFO ] Computed and/alt/rep : 25/115/25 causal constraints (skipped 1 transitions) in 3 ms.
[2026-05-23 09:50:54] [INFO ] Added : 3 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 36/36 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 27/27 places, 36/36 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 36/36 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2026-05-23 09:50:54] [INFO ] Invariant cache hit.
[2026-05-23 09:50:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-23 09:50:54] [INFO ] Invariant cache hit.
[2026-05-23 09:50:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:54] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2026-05-23 09:50:54] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2026-05-23 09:50:54] [INFO ] Invariant cache hit.
[2026-05-23 09:50:54] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 36/62 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 1/63 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/63 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/63 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 46 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 36/62 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 22/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 1/63 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/63 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 72 constraints, problems are : Problem set: 0 solved, 26 unsolved in 6050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7135ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 7140ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7266 ms. Remains : 27/27 places, 36/36 transitions.
RANDOM walk for 30005 steps (7 resets) in 470 ms. (63 steps per ms) remains 0/2 properties
[2026-05-23 09:51:01] [INFO ] Flatten gal took : 37 ms
[2026-05-23 09:51:01] [INFO ] Flatten gal took : 18 ms
[2026-05-23 09:51:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9854970680892130640.gal : 5 ms
[2026-05-23 09:51:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9600048713535113621.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9854970680892130640.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9600048713535113621.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
FORMULA CopsAndRobbers-PT-CRL005X001-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-23 09:51:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (2 resets) in 463 ms. (2155 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 11891 ms.

BK_STOP 1779529862271

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is CopsAndRobbers-PT-CRL005X001, examination is UpperBounds"
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-177946967700453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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