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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 7.7K Mar 6 13:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 6 13:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 6 13:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 6 13:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Mar 6 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 6 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 6 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 08:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 19 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 3.0M 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-KFL084N009K003X002-ReachabilityCardinality-2024-00
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-01
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-02
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-03
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-04
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-05
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-06
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-07
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-08
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-09
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-10
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-11
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-12
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-13
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-14
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779539597830

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-KFL084N009K003X002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-23 12:33:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 12:33:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 12:33:19] [INFO ] Load time of PNML (sax parser for PT used): 256 ms
[2026-05-23 12:33:19] [INFO ] Transformed 426 places.
[2026-05-23 12:33:19] [INFO ] Transformed 3615 transitions.
[2026-05-23 12:33:19] [INFO ] Parsed PT model containing 426 places and 3615 transitions and 21342 arcs in 386 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2026-05-23 12:33:20] [INFO ] Flatten gal took : 789 ms
[2026-05-23 12:33:21] [INFO ] Flatten gal took : 201 ms
RANDOM walk for 40000 steps (202 resets) in 5402 ms. (7 steps per ms) remains 5/16 properties
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (18 resets) in 452 ms. (88 steps per ms) remains 5/5 properties
[2026-05-23 12:33:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7345740854653677127.gal : 248 ms
[2026-05-23 12:33:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1508167764922509552.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7345740854653677127.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1508167764922509552.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (16 resets) in 456 ms. (87 steps per ms) remains 5/5 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40002 steps (18 resets) in 345 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (23 resets) in 751 ms. (53 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (15 resets) in 357 ms. (111 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7114604567048110626.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16791956858395369135.kers'
[2026-05-23 12:33:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7114604567048110626.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16791956858395369135.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 14 ms.
// Phase 1: matrix 3615 rows 342 cols 14118 entries
Finished phase 1 with 338 SingleSign rule and 1 generalized
[2026-05-23 12:33:21] [INFO ] Computed 87 invariants in 25 ms
Computed 87 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-16791956858395369135.kers
Total runtime 33 ms.
Loading property file /tmp/ReachabilityCardinality1508167764922509552.prop.
[2026-05-23 12:33:22] [INFO ] State equation strengthened by 187 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-03 is UNSAT
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-11 is UNSAT
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-12 is UNSAT
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-13 is UNSAT
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 323/346 variables, 12/12 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/420 variables, 74/86 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/86 constraints. Problems are: Problem set: 4 solved, 1 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :9 after 11
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :11 after 13
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :13 after 16
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :16 after 21
At refinement iteration 5 (OVERLAPS) 3612/4032 variables, 420/506 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4032 variables, 187/693 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4032 variables, 0/693 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/4041 variables, 6/699 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4041 variables, 1/700 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4041 variables, 0/700 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/4041 variables, 0/700 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4041/4041 variables, and 700 constraints, problems are : Problem set: 4 solved, 1 unsolved in 1212 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, State Equation: 426/426 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 251/252 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :21 after 1040
At refinement iteration 3 (OVERLAPS) 1932/2184 variables, 252/253 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2184 variables, 0/253 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/2191 variables, 4/257 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2191 variables, 0/257 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2193 variables, 1/258 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2193 variables, 0/258 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1680/3873 variables, 2/260 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3873 variables, 187/447 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3873 variables, 0/447 constraints. Problems are: Problem set: 4 solved, 1 unsolved
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1040 after 1377
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4041/4041 variables, and 615 constraints, problems are : Problem set: 4 solved, 1 unsolved in 2061 ms.
Refiners :[Positive P Invariants (semi-flows): 2/87 constraints, State Equation: 426/426 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3702ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 3615/3615 transitions.
Graph (complete) has 8154 edges and 426 vertex of which 343 are kept as prefixes of interest. Removing 83 places using SCC suffix rule.12 ms
Discarding 83 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 343 transition count 3614
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 342 transition count 3614
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 341 transition count 3613
Applied a total of 5 rules in 569 ms. Remains 341 /426 variables (removed 85) and now considering 3613/3615 (removed 2) transitions.
Running 3573 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-5359162570255225620.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13699447879827178494.kers'
[2026-05-23 12:33:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5359162570255225620.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13699447879827178494.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 2 ms.
// Phase 1: matrix 3613 rows 257 cols 13948 entries
Finished phase 1 with 255 SingleSign rule and 0 generalized
[2026-05-23 12:33:26] [INFO ] Computed 86 invariants in 19 ms
Computed 86 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-13699447879827178494.kers
Total runtime 22 ms.
[2026-05-23 12:33:26] [INFO ] State equation strengthened by 187 read => feed constraints.
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1377 after 17680
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/3954 variables, and 86 constraints, problems are : Problem set: 0 solved, 3573 unsolved in 20081 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/341 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3573/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3573 unsolved
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :17680 after 147298
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/3954 variables, and 86 constraints, problems are : Problem set: 0 solved, 3573 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/341 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3321/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45618ms problems are : Problem set: 0 solved, 3573 unsolved
Search for dead transitions found 0 dead transitions in 45638ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46260 ms. Remains : 341/426 places, 3613/3615 transitions.
RANDOM walk for 40000 steps (248 resets) in 2308 ms. (17 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (22 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 298560 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 298560 steps, saw 128795 distinct states, run finished after 3007 ms. (steps per millisecond=99 ) properties seen :0
[2026-05-23 12:34:15] [INFO ] Invariant cache hit.
[2026-05-23 12:34:15] [INFO ] State equation strengthened by 187 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/46 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3488/3534 variables, 44/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3534 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3534 variables, 63/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3534 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 420/3954 variables, 294/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3954 variables, 85/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3954 variables, 124/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3954 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3954 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3954/3954 variables, and 614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 341/341 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/46 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3488/3534 variables, 44/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3534 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3534 variables, 63/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3534 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 420/3954 variables, 294/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3954 variables, 85/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3954 variables, 124/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3954 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3954 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/3954 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3954/3954 variables, and 615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1243 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 341/341 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2064ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 13 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 58818 ms.

BK_STOP 1779539657881

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -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-KFL084N009K003X002"
export BK_EXAMINATION="ReachabilityCardinality"
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-KFL084N009K003X002, examination is ReachabilityCardinality"
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-177946967800542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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