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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.5K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 6 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 6 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 13:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 191K 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 CO4-PT-13-ReachabilityCardinality-2024-00
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-01
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-02
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-03
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-04
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-05
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-06
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-07
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-08
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-09
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-10
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-11
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-12
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-13
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-14
FORMULA_NAME CO4-PT-13-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779523193127

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-23 07:59:54] [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 07:59:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:59:54] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2026-05-23 07:59:54] [INFO ] Transformed 649 places.
[2026-05-23 07:59:54] [INFO ] Transformed 816 transitions.
[2026-05-23 07:59:54] [INFO ] Found NUPN structural information;
[2026-05-23 07:59:54] [INFO ] Parsed PT model containing 649 places and 816 transitions and 2232 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 172 places in 10 ms
Reduce places removed 172 places and 227 transitions.
FORMULA CO4-PT-13-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 07:59:55] [INFO ] Flatten gal took : 155 ms
RANDOM walk for 40000 steps (224 resets) in 1684 ms. (23 steps per ms) remains 6/8 properties
FORMULA CO4-PT-13-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-13-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-23 07:59:55] [INFO ] Flatten gal took : 96 ms
BEST_FIRST walk for 40001 steps (199 resets) in 348 ms. (114 steps per ms) remains 6/6 properties
[2026-05-23 07:59:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11869886877392274925.gal : 81 ms
BEST_FIRST walk for 40002 steps (244 resets) in 320 ms. (124 steps per ms) remains 6/6 properties
[2026-05-23 07:59:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17384889432702215315.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/ReachabilityCardinality11869886877392274925.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17384889432702215315.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (225 resets) in 328 ms. (121 steps per ms) remains 6/6 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 ...330
Loading property file /tmp/ReachabilityCardinality17384889432702215315.prop.
BEST_FIRST walk for 40001 steps (174 resets) in 351 ms. (113 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :9 after 14
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :14 after 72
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :72 after 83
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :83 after 101
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :101 after 137
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :137 after 198
BEST_FIRST walk for 40001 steps (148 resets) in 629 ms. (63 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (245 resets) in 305 ms. (130 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16902518836391632008.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6185413398175007662.kers'
[2026-05-23 07:59:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16902518836391632008.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6185413398175007662.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 589 rows 477 cols 1578 entries
Finished phase 1 with 458 SingleSign rule and 10 generalized
[2026-05-23 07:59:56] [INFO ] Computed 9 invariants in 6 ms
Computed 9 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6185413398175007662.kers
Total runtime 7 ms.
All remaining problems are real, not stopping.
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :198 after 37433
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 347/380 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 347/384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 25/405 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 25/413 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :37433 after 37612
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 72/477 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 72/486 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 589/1066 variables, 477/965 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1066 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1066 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1066/1066 variables, and 966 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3385 ms.
Refiners :[Domain max(s): 477/477 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 477/477 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem CO4-PT-13-ReachabilityCardinality-2024-13 is UNSAT
FORMULA CO4-PT-13-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 347/380 variables, 4/37 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 347/384 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 1/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 25/405 variables, 4/389 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 25/414 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 1/415 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 0/415 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 72/477 variables, 1/416 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 72/488 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 1/489 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/477 variables, 1/490 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/477 variables, 0/490 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 589/1066 variables, 477/967 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1066 variables, 5/972 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1066 variables, 1/973 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1066 variables, 0/973 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/1066 variables, 0/973 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1066/1066 variables, and 973 constraints, problems are : Problem set: 1 solved, 5 unsolved in 3016 ms.
Refiners :[Domain max(s): 477/477 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 477/477 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6565ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
FORMULA CO4-PT-13-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 626 ms.
Support contains 23 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 589/589 transitions.
Graph (trivial) has 439 edges and 477 vertex of which 3 / 477 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 874 edges and 475 vertex of which 441 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.6 ms
Discarding 34 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 262 rules applied. Total rules applied 264 place count 441 transition count 311
Reduce places removed 238 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 255 rules applied. Total rules applied 519 place count 203 transition count 294
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 16 rules applied. Total rules applied 535 place count 195 transition count 286
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 540 place count 192 transition count 284
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 543 place count 191 transition count 282
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 5 with 18 rules applied. Total rules applied 561 place count 190 transition count 265
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 580 place count 174 transition count 262
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 580 place count 174 transition count 260
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 584 place count 172 transition count 260
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 606 place count 150 transition count 238
Iterating global reduction 7 with 22 rules applied. Total rules applied 628 place count 150 transition count 238
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 628 place count 150 transition count 233
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 638 place count 145 transition count 233
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 650 place count 133 transition count 198
Iterating global reduction 7 with 12 rules applied. Total rules applied 662 place count 133 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 663 place count 133 transition count 197
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 664 place count 132 transition count 196
Iterating global reduction 8 with 1 rules applied. Total rules applied 665 place count 132 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 666 place count 132 transition count 195
Performed 32 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 9 with 64 rules applied. Total rules applied 730 place count 100 transition count 159
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 760 place count 85 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 781 place count 85 transition count 155
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 788 place count 78 transition count 134
Iterating global reduction 10 with 7 rules applied. Total rules applied 795 place count 78 transition count 134
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 800 place count 78 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 805 place count 78 transition count 124
Free-agglomeration rule applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 813 place count 78 transition count 116
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 822 place count 70 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 823 place count 69 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 824 place count 68 transition count 114
Applied a total of 824 rules in 118 ms. Remains 68 /477 variables (removed 409) and now considering 114/589 (removed 475) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 68/477 places, 114/589 transitions.
RANDOM walk for 40000 steps (8 resets) in 734 ms. (54 steps per ms) remains 2/4 properties
FORMULA CO4-PT-13-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-13-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/2 properties
FORMULA CO4-PT-13-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-23 08:00:03] [INFO ] Flow matrix only has 107 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16597511884441402106.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18311957196035895195.kers'
[2026-05-23 08:00:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16597511884441402106.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18311957196035895195.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 68 cols 293 entries
Finished phase 1 with 63 SingleSign rule and 0 generalized
[2026-05-23 08:00:03] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18311957196035895195.kers
Total runtime 1 ms.
[2026-05-23 08:00:03] [INFO ] State equation strengthened by 54 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) 35/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/140 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 54/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/158 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 11/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/160 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/160 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/172 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/175 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/175 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/175 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 54/54 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) 35/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/140 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 54/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/158 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/160 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/160 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/160 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/172 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/172 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/175 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/175 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/175 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 230ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 511 steps, including 67 resets, run visited all 1 properties in 2 ms. (steps per millisecond=255 )
FORMULA CO4-PT-13-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 6 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 9733 ms.

BK_STOP 1779523204019

--------------------
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
++ 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 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="CO4-PT-13"
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 CO4-PT-13, 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-177946967700382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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