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.r338-smll-178021499200294.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 ErlangenMainframeV2-PT-bP11C06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 96M
-rw-r--r-- 1 mcc users 7.4K May 27 09:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 27 09:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 27 09:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 27 09:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 27 10:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 27 10:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 27 10:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 09:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 27 09:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 27 09:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 27 09:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 96M May 26 18:17 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 ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-00
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-01
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-02
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-03
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-04
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-05
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-06
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-07
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-08
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-09
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-10
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-11
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-12
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-13
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-14
FORMULA_NAME ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780412969846

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP11C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-06-02 15:09:32] [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-06-02 15:09:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 15:09:37] [INFO ] Load time of PNML (sax parser for PT used): 5150 ms
[2026-06-02 15:09:37] [INFO ] Transformed 344 places.
[2026-06-02 15:09:38] [INFO ] Transformed 70343 transitions.
[2026-06-02 15:09:38] [INFO ] Found NUPN structural information;
[2026-06-02 15:09:38] [INFO ] Parsed PT model containing 344 places and 70343 transitions and 1913839 arcs in 6136 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 17738 steps (4 resets) in 120042 ms. (0 steps per ms) remains 8/12 properties
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-06-02 15:10:10] [INFO ] Flatten gal took : 27458 ms
BEST_FIRST walk for 31872 steps (8 resets) in 20018 ms. (1 steps per ms) remains 8/8 properties
BEST_FIRST walk for 6117 steps (0 resets) in 20026 ms. (0 steps per ms) remains 8/8 properties
BEST_FIRST walk for 17497 steps (2 resets) in 20040 ms. (0 steps per ms) remains 8/8 properties
BEST_FIRST walk for 6918 steps (0 resets) in 20054 ms. (0 steps per ms) remains 7/8 properties
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7264 steps (0 resets) in 20023 ms. (0 steps per ms) remains 7/7 properties
[2026-06-02 15:10:35] [INFO ] Flatten gal took : 24442 ms
[2026-06-02 15:10:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17917569892040724997.gal : 2855 ms
[2026-06-02 15:10:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7375630624427454879.prop : 10 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/ReachabilityCardinality17917569892040724997.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7375630624427454879.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 5580 steps (0 resets) in 20049 ms. (0 steps per ms) remains 7/7 properties
BEST_FIRST walk for 29368 steps (6 resets) in 20008 ms. (1 steps per ms) remains 7/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15585599074228379519.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-596351870559203106.kers'
[2026-06-02 15:10:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15585599074228379519.kers, --Pflows, --basisKERS=/tmp/petrispot-output-596351870559203106.kers]
Culled 0 columns in 432 ms.
// Phase 1: matrix 70343 rows 344 cols 1913839 entries
Finished phase 1 with 311 SingleSign rule and 3 generalized
[2026-06-02 15:10:47] [INFO ] Computed 30 invariants in 1798 ms
Computed 30 P flows in 1800 ms.
Exported basis to /tmp/petrispot-output-596351870559203106.kers
Total runtime 2052 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 127/235 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 127/253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 109/344 variables, 12/265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 109/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 8974ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 70343/70343 transitions.
Graph (trivial) has 153 edges and 344 vertex of which 6 / 344 are part of one of the 2 SCC in 60 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 340 transition count 70283
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 110 place count 287 transition count 70280
Reduce places removed 1 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 17 rules applied. Total rules applied 127 place count 286 transition count 70264
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 143 place count 270 transition count 70264
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 143 place count 270 transition count 70255
Deduced a syphon composed of 9 places in 166 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 161 place count 261 transition count 70255
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 180 place count 242 transition count 70236
Iterating global reduction 4 with 19 rules applied. Total rules applied 199 place count 242 transition count 70236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 203 place count 242 transition count 70232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 204 place count 241 transition count 70232
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 204 place count 241 transition count 70231
Deduced a syphon composed of 1 places in 135 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 206 place count 240 transition count 70231
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 210 place count 236 transition count 54661
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 215 place count 235 transition count 54661
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 216 place count 234 transition count 39109
Iterating global reduction 6 with 1 rules applied. Total rules applied 217 place count 234 transition count 39109
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 66 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 263 place count 211 transition count 39086
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 65 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 269 place count 208 transition count 39092
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 284 place count 208 transition count 39077
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 299 place count 193 transition count 39077
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 300 place count 193 transition count 39077
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 303 place count 193 transition count 39077
Applied a total of 303 rules in 47803 ms. Remains 193 /344 variables (removed 151) and now considering 39077/70343 (removed 31266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47833 ms. Remains : 193/344 places, 39077/70343 transitions.
RANDOM walk for 40000 steps (8 resets) in 70409 ms. (0 steps per ms) remains 5/7 properties
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 15936 ms. (2 steps per ms) remains 5/5 properties
BEST_FIRST walk for 28029 steps (6 resets) in 20012 ms. (1 steps per ms) remains 4/5 properties
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 31495 steps (6 resets) in 15125 ms. (2 steps per ms) remains 3/4 properties
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 22197 steps (4 resets) in 19912 ms. (1 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 12700 ms. (3 steps per ms) remains 3/3 properties
[2026-06-02 15:12:23] [INFO ] Flow matrix only has 39072 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13997804516129580550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16681331787419771870.kers'
[2026-06-02 15:12:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13997804516129580550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16681331787419771870.kers]
Culled 0 columns in 273 ms.
// Phase 1: matrix 39072 rows 193 cols 1034763 entries
Finished phase 1 with 161 SingleSign rule and 3 generalized
[2026-06-02 15:12:24] [INFO ] Computed 29 invariants in 910 ms
Computed 29 P flows in 911 ms.
Exported basis to /tmp/petrispot-output-16681331787419771870.kers
Total runtime 1048 ms.
[2026-06-02 15:12:25] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 73/135 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 58/193 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 39265/39265 variables, and 222 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38355 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 193/193 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 73/135 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 58/193 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality7375630624427454879.prop.
SMT process timed out in 107692ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 62 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 39077/39077 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 193 transition count 39063
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 179 transition count 39061
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 177 transition count 39061
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 32 place count 177 transition count 39054
Deduced a syphon composed of 7 places in 45 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 47 place count 169 transition count 39054
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 51 place count 165 transition count 39048
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 165 transition count 39048
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 164 transition count 36456
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 164 transition count 36456
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 26 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 91 place count 147 transition count 36439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 146 transition count 36448
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 146 transition count 36444
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 101 place count 142 transition count 36444
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 105 place count 142 transition count 36444
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 142 transition count 36444
Applied a total of 108 rules in 21187 ms. Remains 142 /193 variables (removed 51) and now considering 36444/39077 (removed 2633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21188 ms. Remains : 142/193 places, 36444/39077 transitions.
RANDOM walk for 40000 steps (8 resets) in 86944 ms. (0 steps per ms) remains 3/3 properties
BEST_FIRST walk for 29243 steps (8 resets) in 20011 ms. (1 steps per ms) remains 2/3 properties
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10886 steps (1 resets) in 20019 ms. (0 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 13593 ms. (2 steps per ms) remains 2/2 properties
[2026-06-02 15:15:09] [INFO ] Flow matrix only has 36434 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4626071437015429508.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15407574744826732661.kers'
[2026-06-02 15:15:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4626071437015429508.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15407574744826732661.kers]
Culled 0 columns in 166 ms.
// Phase 1: matrix 36434 rows 142 cols 933621 entries
Finished phase 1 with 111 SingleSign rule and 3 generalized
[2026-06-02 15:15:10] [INFO ] Computed 28 invariants in 742 ms
Computed 28 P flows in 743 ms.
Exported basis to /tmp/petrispot-output-15407574744826732661.kers
Total runtime 865 ms.
[2026-06-02 15:15:10] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/107 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/142 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36434/36576 variables, 142/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36576 variables, 10/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36576 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/36576 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36576/36576 variables, and 180 constraints, problems are : Problem set: 0 solved, 2 unsolved in 48951 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 142/142 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/107 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 35/142 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 36434/36576 variables, 142/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36576 variables, 10/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 130817ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 36444/36444 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 20 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 140 transition count 36442
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 140 transition count 36441
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 7 place count 139 transition count 36440
Applied a total of 7 rules in 6497 ms. Remains 139 /142 variables (removed 3) and now considering 36440/36444 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6497 ms. Remains : 139/142 places, 36440/36444 transitions.
RANDOM walk for 40000 steps (8 resets) in 83315 ms. (0 steps per ms) remains 2/2 properties
BEST_FIRST walk for 28988 steps (6 resets) in 20012 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 10653 ms. (3 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 285892 steps, run timeout after 87001 ms. (steps per millisecond=3 ) properties seen :1 out of 2
Probabilistic random walk after 285892 steps, saw 134187 distinct states, run finished after 87022 ms. (steps per millisecond=3 ) properties seen :1
FORMULA ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2026-06-02 15:19:23] [INFO ] Flow matrix only has 36430 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14492988118095095814.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14299347293584450217.kers'
[2026-06-02 15:19:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14492988118095095814.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14299347293584450217.kers]
Culled 0 columns in 165 ms.
// Phase 1: matrix 36430 rows 139 cols 933613 entries
Finished phase 1 with 108 SingleSign rule and 3 generalized
[2026-06-02 15:19:24] [INFO ] Computed 28 invariants in 718 ms
Computed 28 P flows in 719 ms.
Exported basis to /tmp/petrispot-output-14299347293584450217.kers
Total runtime 850 ms.
[2026-06-02 15:19:24] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/101 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/139 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 36569/36569 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24340 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 139/139 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/101 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/139 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 36569/36569 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 71410 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 139/139 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 97136ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3023 ms.
Support contains 56 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 36440/36440 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 139 transition count 36439
Deduced a syphon composed of 1 places in 21 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 138 transition count 36439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 25 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 36438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 136 transition count 34710
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 136 transition count 34710
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 136 transition count 34709
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 135 transition count 34709
Applied a total of 8 rules in 11495 ms. Remains 135 /139 variables (removed 4) and now considering 34709/36440 (removed 1731) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11495 ms. Remains : 135/139 places, 34709/36440 transitions.
RANDOM walk for 40000 steps (8 resets) in 82801 ms. (0 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 9449 ms. (4 steps per ms) remains 1/1 properties
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
Interrupted probabilistic random walk after 214871 steps, run timeout after 69002 ms. (steps per millisecond=3 ) properties seen :0 out of 1
Probabilistic random walk after 214871 steps, saw 102028 distinct states, run finished after 69003 ms. (steps per millisecond=3 ) properties seen :0
[2026-06-02 15:22:47] [INFO ] Flow matrix only has 34699 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16262397222116679417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2259240833095850258.kers'
[2026-06-02 15:22:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16262397222116679417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2259240833095850258.kers]
Culled 0 columns in 150 ms.
// Phase 1: matrix 34699 rows 135 cols 892135 entries
Finished phase 1 with 104 SingleSign rule and 3 generalized
[2026-06-02 15:22:48] [INFO ] Computed 28 invariants in 627 ms
Computed 28 P flows in 628 ms.
Exported basis to /tmp/petrispot-output-2259240833095850258.kers
Total runtime 740 ms.
[2026-06-02 15:22:48] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/100 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/135 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :3 after 5
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :6 after 16
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :16 after 3076
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34834/34834 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20877 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 135/135 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/100 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :3076 after 54300
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :54300 after 56508
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :56508 after 60477
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 35/135 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :60477 after 65788
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :65788 after 69186
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 34834/34834 variables, and 166 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76790 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 135/135 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98822ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5993 ms.
Support contains 56 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 34709/34709 transitions.
Applied a total of 0 rules in 2562 ms. Remains 135 /135 variables (removed 0) and now considering 34709/34709 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2563 ms. Remains : 135/135 places, 34709/34709 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 34709/34709 transitions.
Applied a total of 0 rules in 2556 ms. Remains 135 /135 variables (removed 0) and now considering 34709/34709 (removed 0) transitions.
[2026-06-02 15:24:37] [INFO ] Flow matrix only has 34699 transitions (discarded 10 similar events)
[2026-06-02 15:24:37] [INFO ] Invariant cache hit.
[2026-06-02 15:25:02] [INFO ] Implicit Places using invariants in 25342 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25449 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/135 places, 34709/34709 transitions.
Applied a total of 0 rules in 2233 ms. Remains 134 /134 variables (removed 0) and now considering 34709/34709 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30256 ms. Remains : 134/135 places, 34709/34709 transitions.
RANDOM walk for 40000 steps (8 resets) in 76892 ms. (0 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 9825 ms. (4 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 214176 steps, run timeout after 66002 ms. (steps per millisecond=3 ) properties seen :0 out of 1
Probabilistic random walk after 214176 steps, saw 101528 distinct states, run finished after 66003 ms. (steps per millisecond=3 ) properties seen :0
[2026-06-02 15:26:33] [INFO ] Flow matrix only has 34699 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14480531674189824079.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18307085746317026572.kers'
[2026-06-02 15:26:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14480531674189824079.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18307085746317026572.kers]
Culled 0 columns in 152 ms.
// Phase 1: matrix 34699 rows 134 cols 857575 entries
Finished phase 1 with 104 SingleSign rule and 3 generalized
[2026-06-02 15:26:34] [INFO ] Computed 27 invariants in 711 ms
Computed 27 P flows in 712 ms.
Exported basis to /tmp/petrispot-output-18307085746317026572.kers
Total runtime 833 ms.
[2026-06-02 15:26:34] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/99 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/134 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34699/34833 variables, 134/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34833 variables, 10/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34833 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/34833 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34833/34833 variables, and 171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33318 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 134/134 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/99 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 35/134 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Invariant property ErlangenMainframeV2-PT-bP11C06-ReachabilityCardinality-2024-01 does not hold.
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :69186 after 1.45286e+06
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :1.45286e+06 after 1.53461e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 34833/34833 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70054 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 134/134 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 104649ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3347 ms.
Support contains 56 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 34709/34709 transitions.
Applied a total of 0 rules in 2246 ms. Remains 134 /134 variables (removed 0) and now considering 34709/34709 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2246 ms. Remains : 134/134 places, 34709/34709 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 34709/34709 transitions.
Applied a total of 0 rules in 2296 ms. Remains 134 /134 variables (removed 0) and now considering 34709/34709 (removed 0) transitions.
[2026-06-02 15:28:26] [INFO ] Flow matrix only has 34699 transitions (discarded 10 similar events)
[2026-06-02 15:28:26] [INFO ] Invariant cache hit.
[2026-06-02 15:28:45] [INFO ] Implicit Places using invariants in 19933 ms returned []
Implicit Place search using SMT only with invariants took 19936 ms to find 0 implicit places.
Running 34708 sub problems to find dead transitions.
[2026-06-02 15:28:46] [INFO ] Flow matrix only has 34699 transitions (discarded 10 similar events)
[2026-06-02 15:28:46] [INFO ] Invariant cache hit.
[2026-06-02 15:28:47] [INFO ] State equation strengthened by 10 read => feed constraints.
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :1.53461e+06 after 1.36119e+07
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :1.36119e+07 after 7.82868e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 34708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/34833 variables, and 12 constraints, problems are : Problem set: 0 solved, 34708 unsolved in 30826 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/134 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 34708/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 34708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/34833 variables, and 12 constraints, problems are : Problem set: 0 solved, 34708 unsolved in 30634 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/134 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 34625/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 189219ms problems are : Problem set: 0 solved, 34708 unsolved
Search for dead transitions found 0 dead transitions in 189596ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212135 ms. Remains : 134/134 places, 34709/34709 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 134 transition count 34699
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 134 transition count 34697
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 132 transition count 34697
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 132 transition count 34697
Applied a total of 15 rules in 7084 ms. Remains 132 /134 variables (removed 2) and now considering 34697/34709 (removed 12) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7421523587776333595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1546315675586724105.kers'
[2026-06-02 15:32:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7421523587776333595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1546315675586724105.kers]
Culled 0 columns in 149 ms.
// Phase 1: matrix 34697 rows 132 cols 857571 entries
Finished phase 1 with 102 SingleSign rule and 3 generalized
[2026-06-02 15:32:03] [INFO ] Computed 27 invariants in 644 ms
Computed 27 P flows in 654 ms.
Exported basis to /tmp/petrispot-output-1546315675586724105.kers
Total runtime 771 ms.
[2026-06-02 15:32:04] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-06-02 15:32:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-06-02 15:32:04] [INFO ] [Nat]Absence check using 15 positive and 12 generalized place invariants in 6 ms returned sat
[2026-06-02 15:32:34] [INFO ] After 30629ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-06-02 15:33:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25068 ms
TRAPS : Iteration 1
[2026-06-02 15:33:03] [INFO ] After 59438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-06-02 15:33:04] [INFO ] After 60716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 68961 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-06-02 15:33:19] [INFO ] Flatten gal took : 13488 ms
[2026-06-02 15:33:19] [INFO ] Applying decomposition
[2026-06-02 15:33:33] [INFO ] Flatten gal took : 13618 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3554988377139163660.txt' '-o' '/tmp/graph3554988377139163660.bin' '-w' '/tmp/graph3554988377139163660.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3554988377139163660.bin' '-l' '-1' '-v' '-w' '/tmp/graph3554988377139163660.weights' '-q' '0' '-e' '0.001'
[2026-06-02 15:34:11] [INFO ] Decomposing Gal with order
[2026-06-02 15:34:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 15:34:40] [INFO ] Removed a total of 874943 redundant transitions.
[2026-06-02 15:34:42] [INFO ] Flatten gal took : 22310 ms
[2026-06-02 15:34:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 10213 ms.
[2026-06-02 15:34:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8549685116902892778.gal : 569 ms
[2026-06-02 15:34:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2327252813251117717.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8549685116902892778.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2327252813251117717.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality2327252813251117717.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 112867
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8.87939e+06 after 5.77363e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.7257e+09 after 8.12328e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.12328e+09 after 2.88095e+10
Detected timeout of ITS tools.
[2026-06-02 16:05:01] [INFO ] Flatten gal took : 5456 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15453469104053494439
[2026-06-02 16:05:01] [INFO ] Too many transitions (34709) to apply POR reductions. Disabling POR matrices.
[2026-06-02 16:05:02] [INFO ] Built C files in 1304ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15453469104053494439
Running compilation step : cd /tmp/ltsmin15453469104053494439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-06-02 16:05:05] [INFO ] Applying decomposition
[2026-06-02 16:05:10] [INFO ] Flatten gal took : 5410 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4049527118698023778.txt' '-o' '/tmp/graph4049527118698023778.bin' '-w' '/tmp/graph4049527118698023778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4049527118698023778.bin' '-l' '-1' '-v' '-w' '/tmp/graph4049527118698023778.weights' '-q' '0' '-e' '0.001'
[2026-06-02 16:05:26] [INFO ] Decomposing Gal with order
[2026-06-02 16:05:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 16:05:39] [INFO ] Removed a total of 426318 redundant transitions.
[2026-06-02 16:05:40] [INFO ] Flatten gal took : 9508 ms
[2026-06-02 16:05:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 6224 ms.
[2026-06-02 16:05:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3211872662677225648.gal : 488 ms
[2026-06-02 16:05:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15448041526473453130.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3211872662677225648.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15448041526473453130.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality15448041526473453130.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 298
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :298 after 127800
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :127800 after 223736
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :223736 after 8.13923e+08

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ErlangenMainframeV2-PT-bP11C06"
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 ErlangenMainframeV2-PT-bP11C06, 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 r338-smll-178021499200294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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