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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 7.3K Mar 7 05:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 05:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 05:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 05:52 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.7K Mar 15 10:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 05:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Mar 7 05:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 05:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 7 05:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:13 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 536K 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-12b-ReachabilityCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-12
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-13
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-14
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779895536127

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-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-27 15:25:38] [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 15:25:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 15:25:38] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2026-05-27 15:25:38] [INFO ] Transformed 1988 places.
[2026-05-27 15:25:38] [INFO ] Transformed 2289 transitions.
[2026-05-27 15:25:38] [INFO ] Found NUPN structural information;
[2026-05-27 15:25:38] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 613 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (462 resets) in 2897 ms. (13 steps per ms) remains 9/11 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-27 15:25:40] [INFO ] Flatten gal took : 460 ms
BEST_FIRST walk for 40004 steps (47 resets) in 1083 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 328 ms. (121 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (44 resets) in 205 ms. (194 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 163 ms. (243 steps per ms) remains 9/9 properties
[2026-05-27 15:25:40] [INFO ] Flatten gal took : 369 ms
BEST_FIRST walk for 40004 steps (47 resets) in 460 ms. (86 steps per ms) remains 9/9 properties
[2026-05-27 15:25:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5980038915857411995.gal : 194 ms
BEST_FIRST walk for 40003 steps (45 resets) in 767 ms. (52 steps per ms) remains 9/9 properties
[2026-05-27 15:25:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1029865811879639706.prop : 7 ms
BEST_FIRST walk for 40003 steps (45 resets) in 150 ms. (264 steps per ms) remains 8/9 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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/ReachabilityCardinality5980038915857411995.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1029865811879639706.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (46 resets) in 160 ms. (248 steps per ms) remains 8/8 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 40003 steps (46 resets) in 164 ms. (242 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10633793386807086687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1635026721486292603.kers'
[2026-05-27 15:25:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10633793386807086687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1635026721486292603.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2289 rows 1988 cols 5727 entries
Finished phase 1 with 1974 SingleSign rule and 0 generalized
[2026-05-27 15:25:41] [INFO ] Computed 14 invariants in 13 ms
Computed 14 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1635026721486292603.kers
Total runtime 17 ms.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality1029865811879639706.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1862/1976 variables, 13/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1976 variables, 1862/1989 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1976 variables, 0/1989 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 12/1988 variables, 1/1990 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1988 variables, 12/2002 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1988 variables, 0/2002 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 40
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :40 after 44
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :44 after 1036
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :1036 after 65612
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :65612 after 1.00765e+08
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :1.00765e+08 after 1.40879e+14
At refinement iteration 8 (OVERLAPS) 2289/4277 variables, 1988/3990 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4277 variables, 0/3990 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4277/4277 variables, and 3990 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5048 ms.
Refiners :[Domain max(s): 1988/1988 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 1988/1988 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1862/1976 variables, 13/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1976 variables, 1862/1989 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 12087ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 114 out of 1988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1477 edges and 1988 vertex of which 56 / 1988 are part of one of the 9 SCC in 25 ms
Free SCC test removed 47 places
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 315 place count 1941 transition count 1918
Reduce places removed 314 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 338 rules applied. Total rules applied 653 place count 1627 transition count 1894
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 677 place count 1603 transition count 1894
Performed 225 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 225 Pre rules applied. Total rules applied 677 place count 1603 transition count 1669
Deduced a syphon composed of 225 places in 5 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 3 with 450 rules applied. Total rules applied 1127 place count 1378 transition count 1669
Discarding 689 places :
Symmetric choice reduction at 3 with 689 rule applications. Total rules 1816 place count 689 transition count 980
Iterating global reduction 3 with 689 rules applied. Total rules applied 2505 place count 689 transition count 980
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2505 place count 689 transition count 977
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2511 place count 686 transition count 977
Discarding 86 places :
Symmetric choice reduction at 3 with 86 rule applications. Total rules 2597 place count 600 transition count 891
Iterating global reduction 3 with 86 rules applied. Total rules applied 2683 place count 600 transition count 891
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 2745 place count 600 transition count 829
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 2893 place count 526 transition count 755
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 2904 place count 526 transition count 744
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 2915 place count 515 transition count 733
Iterating global reduction 5 with 11 rules applied. Total rules applied 2926 place count 515 transition count 733
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 2932 place count 512 transition count 733
Free-agglomeration rule applied 152 times.
Iterating global reduction 5 with 152 rules applied. Total rules applied 3084 place count 512 transition count 581
Reduce places removed 152 places and 0 transitions.
Iterating post reduction 5 with 152 rules applied. Total rules applied 3236 place count 360 transition count 581
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 3238 place count 358 transition count 579
Iterating global reduction 6 with 2 rules applied. Total rules applied 3240 place count 358 transition count 579
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3242 place count 358 transition count 577
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 7 with 24 rules applied. Total rules applied 3266 place count 358 transition count 553
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 3272 place count 358 transition count 553
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3273 place count 357 transition count 552
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 57 edges and 356 vertex of which 8 / 356 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 4 rules applied. Total rules applied 3277 place count 352 transition count 550
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 3287 place count 350 transition count 542
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 3287 place count 350 transition count 533
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 3305 place count 341 transition count 533
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 3345 place count 321 transition count 513
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 3351 place count 318 transition count 513
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 3354 place count 318 transition count 510
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 3359 place count 318 transition count 505
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 3364 place count 318 transition count 500
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3373 place count 313 transition count 496
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 3374 place count 313 transition count 495
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3375 place count 313 transition count 494
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 3376 place count 312 transition count 494
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 3377 place count 312 transition count 493
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 3379 place count 312 transition count 493
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 3380 place count 312 transition count 493
Applied a total of 3380 rules in 841 ms. Remains 312 /1988 variables (removed 1676) and now considering 493/2289 (removed 1796) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 851 ms. Remains : 312/1988 places, 493/2289 transitions.
RANDOM walk for 40000 steps (1206 resets) in 1018 ms. (39 steps per ms) remains 7/8 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (80 resets) in 373 ms. (106 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (77 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (78 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (88 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (77 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (78 resets) in 168 ms. (236 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (80 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
[2026-05-27 15:25:54] [INFO ] Flow matrix only has 481 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11283318651793710229.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8114523567059414967.kers'
[2026-05-27 15:25:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11283318651793710229.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8114523567059414967.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 481 rows 312 cols 1270 entries
Finished phase 1 with 299 SingleSign rule and 0 generalized
[2026-05-27 15:25:54] [INFO ] Computed 13 invariants in 2 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8114523567059414967.kers
Total runtime 3 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 209/312 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 481/793 variables, 312/325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/793 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/793 variables, and 325 constraints, problems are : Problem set: 0 solved, 7 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 209/312 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 481/793 variables, 312/349 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/793 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/793 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 793/793 variables, and 355 constraints, problems are : Problem set: 0 solved, 7 unsolved in 7362 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8239ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 1111 ms.
Support contains 65 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 493/493 transitions.
Graph (trivial) has 181 edges and 312 vertex of which 5 / 312 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 309 transition count 477
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 298 transition count 477
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 298 transition count 476
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 297 transition count 476
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 44 place count 278 transition count 457
Iterating global reduction 2 with 19 rules applied. Total rules applied 63 place count 278 transition count 457
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 277 transition count 456
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 277 transition count 456
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 277 transition count 455
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 96 place count 262 transition count 440
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 100 place count 262 transition count 436
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 110 place count 252 transition count 426
Iterating global reduction 4 with 10 rules applied. Total rules applied 120 place count 252 transition count 426
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 130 place count 252 transition count 416
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 251 transition count 415
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 147 place count 251 transition count 400
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 149 place count 250 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 157 place count 250 transition count 391
Free-agglomeration rule applied 121 times with reduction of 5 identical transitions.
Iterating global reduction 6 with 121 rules applied. Total rules applied 278 place count 250 transition count 265
Reduce places removed 122 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 52 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 6 with 175 rules applied. Total rules applied 453 place count 128 transition count 212
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 454 place count 127 transition count 211
Iterating global reduction 7 with 1 rules applied. Total rules applied 455 place count 127 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 456 place count 127 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 470 place count 127 transition count 196
Applied a total of 470 rules in 109 ms. Remains 127 /312 variables (removed 185) and now considering 196/493 (removed 297) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 127/312 places, 196/493 transitions.
RANDOM walk for 40000 steps (1183 resets) in 468 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (95 resets) in 298 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (87 resets) in 86 ms. (459 steps per ms) remains 1/2 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13845785916837665382.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15664741958702665232.kers'
[2026-05-27 15:26:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13845785916837665382.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15664741958702665232.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 196 rows 126 cols 430 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-27 15:26:04] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15664741958702665232.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/122 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/314 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/317 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/323 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, State Equation: 124/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 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/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/122 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 192/314 variables, 122/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/317 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/323 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, State Equation: 124/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 797ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 378 steps, including 30 resets, run visited all 1 properties in 1 ms. (steps per millisecond=378 )
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8 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 26961 ms.

BK_STOP 1779895565323

--------------------
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-12b"
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-12b, 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-177955809100382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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