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.r130-smll-177955809100430.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 FlexibleBarrier-PT-18b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.3K Mar 7 06:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 7 06:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 06:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 7 06:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 06:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 7 06:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 06:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 06:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-12
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-13
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-14
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779920510134

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-18b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-27 22:21:52] [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-27 22:21:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 22:21:53] [INFO ] Load time of PNML (sax parser for PT used): 410 ms
[2026-05-27 22:21:53] [INFO ] Transformed 4370 places.
[2026-05-27 22:21:53] [INFO ] Transformed 5037 transitions.
[2026-05-27 22:21:53] [INFO ] Found NUPN structural information;
[2026-05-27 22:21:53] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 640 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (325 resets) in 3717 ms. (10 steps per ms) remains 10/12 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (25 resets) in 278 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (25 resets) in 240 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (26 resets) in 172 ms. (231 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (27 resets) in 166 ms. (239 steps per ms) remains 10/10 properties
[2026-05-27 22:21:55] [INFO ] Flatten gal took : 625 ms
BEST_FIRST walk for 40004 steps (25 resets) in 472 ms. (84 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (26 resets) in 440 ms. (90 steps per ms) remains 10/10 properties
[2026-05-27 22:21:55] [INFO ] Flatten gal took : 385 ms
BEST_FIRST walk for 40004 steps (25 resets) in 410 ms. (97 steps per ms) remains 10/10 properties
[2026-05-27 22:21:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13312962864985019264.gal : 161 ms
[2026-05-27 22:21:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5326856439336851807.prop : 7 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/ReachabilityCardinality13312962864985019264.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5326856439336851807.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (23 resets) in 1152 ms. (34 steps per ms) remains 10/10 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 ...329
BEST_FIRST walk for 40004 steps (24 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (25 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6879699968744448127.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8420694767549948163.kers'
[2026-05-27 22:21:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6879699968744448127.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8420694767549948163.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 5037 rows 4370 cols 12657 entries
Finished phase 1 with 4350 SingleSign rule and 0 generalized
[2026-05-27 22:21:56] [INFO ] Computed 20 invariants in 36 ms
Computed 20 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-8420694767549948163.kers
Total runtime 43 ms.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality5326856439336851807.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 4229/4358 variables, 19/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4358 variables, 4229/4377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4358/9407 variables, and 4377 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5054 ms.
Refiners :[Domain max(s): 4358/4370 constraints, Positive P Invariants (semi-flows): 19/20 constraints, State Equation: 0/4370 constraints, PredecessorRefiner: 10/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 4229/4358 variables, 19/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4358 variables, 4229/4377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :19 after 62
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :62 after 1954
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :1954 after 85245
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :85245 after 1.65003e+08
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :1.65003e+08 after 6.18449e+14
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :6.18449e+14 after 1.97457e+26
SMT process timed out in 25801ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 129 out of 4370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Graph (trivial) has 4087 edges and 4370 vertex of which 92 / 4370 are part of one of the 15 SCC in 28 ms
Free SCC test removed 77 places
Drop transitions (Empty/Sink Transition effects.) removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 966 transitions
Trivial Post-agglo rules discarded 966 transitions
Performed 966 trivial Post agglomeration. Transition count delta: 966
Iterating post reduction 0 with 966 rules applied. Total rules applied 967 place count 4293 transition count 3978
Reduce places removed 966 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 1 with 999 rules applied. Total rules applied 1966 place count 3327 transition count 3945
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 1999 place count 3294 transition count 3945
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 303 Pre rules applied. Total rules applied 1999 place count 3294 transition count 3642
Deduced a syphon composed of 303 places in 9 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 3 with 606 rules applied. Total rules applied 2605 place count 2991 transition count 3642
Discarding 1680 places :
Symmetric choice reduction at 3 with 1680 rule applications. Total rules 4285 place count 1311 transition count 1962
Iterating global reduction 3 with 1680 rules applied. Total rules applied 5965 place count 1311 transition count 1962
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 5965 place count 1311 transition count 1955
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 5979 place count 1304 transition count 1955
Discarding 237 places :
Symmetric choice reduction at 3 with 237 rule applications. Total rules 6216 place count 1067 transition count 1718
Iterating global reduction 3 with 237 rules applied. Total rules applied 6453 place count 1067 transition count 1718
Ensure Unique test removed 214 transitions
Reduce isomorphic transitions removed 214 transitions.
Iterating post reduction 3 with 214 rules applied. Total rules applied 6667 place count 1067 transition count 1504
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 6877 place count 962 transition count 1399
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 6908 place count 962 transition count 1368
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 6925 place count 945 transition count 1351
Iterating global reduction 5 with 17 rules applied. Total rules applied 6942 place count 945 transition count 1351
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 6948 place count 942 transition count 1351
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 6954 place count 942 transition count 1345
Free-agglomeration rule applied 666 times.
Iterating global reduction 5 with 666 rules applied. Total rules applied 7620 place count 942 transition count 679
Reduce places removed 666 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Iterating post reduction 5 with 815 rules applied. Total rules applied 8435 place count 276 transition count 530
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 6 with 55 rules applied. Total rules applied 8490 place count 276 transition count 475
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 8495 place count 276 transition count 475
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 8517 place count 276 transition count 453
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8518 place count 275 transition count 452
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 93 edges and 274 vertex of which 20 / 274 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
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 6 with 5 rules applied. Total rules applied 8523 place count 264 transition count 449
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 8546 place count 261 transition count 429
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 17 Pre rules applied. Total rules applied 8546 place count 261 transition count 412
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 8580 place count 244 transition count 412
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 8594 place count 244 transition count 398
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 46 rules applied. Total rules applied 8640 place count 221 transition count 375
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 8642 place count 221 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 8644 place count 221 transition count 371
Free-agglomeration rule applied 15 times.
Iterating global reduction 10 with 15 rules applied. Total rules applied 8659 place count 221 transition count 356
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 25 rules applied. Total rules applied 8684 place count 206 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 8687 place count 206 transition count 343
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 8689 place count 206 transition count 341
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 8691 place count 204 transition count 341
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 8693 place count 204 transition count 339
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 8697 place count 202 transition count 337
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 8698 place count 202 transition count 337
Applied a total of 8698 rules in 2030 ms. Remains 202 /4370 variables (removed 4168) and now considering 337/5037 (removed 4700) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2044 ms. Remains : 202/4370 places, 337/5037 transitions.
RANDOM walk for 40000 steps (8 resets) in 1006 ms. (39 steps per ms) remains 7/10 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 5/7 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 216 ms. (184 steps per ms) remains 4/5 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 3/4 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/3 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-27 22:22:24] [INFO ] Flow matrix only has 317 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17962134310799779350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9590616384215352667.kers'
[2026-05-27 22:22:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17962134310799779350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9590616384215352667.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 317 rows 202 cols 739 entries
Finished phase 1 with 183 SingleSign rule and 0 generalized
[2026-05-27 22:22:24] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9590616384215352667.kers
Total runtime 5 ms.
[2026-05-27 22:22:24] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 103/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 49/164 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 263/427 variables, 164/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 43/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 51/478 variables, 11/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 20/498 variables, 5/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 11/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/498 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 15/513 variables, 11/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/513 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/513 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 5/518 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/519 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/519 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/519 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 270 constraints, problems are : Problem set: 0 solved, 2 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 202/202 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 103/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 49/164 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 263/427 variables, 164/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 43/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 51/478 variables, 11/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/478 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/478 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/478 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 20/498 variables, 5/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 11/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/498 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/498 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 15/513 variables, 11/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/513 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/513 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 5/518 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/518 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/518 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 1/519 variables, 2/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/519 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/519 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 519/519 variables, and 400 constraints, problems are : Problem set: 0 solved, 2 unsolved in 13402 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 202/202 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 129/129 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14122ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 80 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 38 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 46104 ms.

BK_STOP 1779920558932

--------------------
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="FlexibleBarrier-PT-18b"
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 FlexibleBarrier-PT-18b, 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 r130-smll-177955809100430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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