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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 123M
-rw-r--r-- 1 mcc users 6.9K May 27 09:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 27 09:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 27 09:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 26K May 27 09:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 27 10:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 09:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 27 09:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 27 09:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 27 09:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:46 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 122M 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-bP14C01-ReachabilityCardinality-2024-00
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-01
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-02
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-03
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-04
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-05
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-06
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-07
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-08
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-09
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-10
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-11
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-12
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-13
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-14
FORMULA_NAME ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780440597601

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-bP14C01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-06-02 22:49:59] [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 22:49:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 22:50:06] [INFO ] Load time of PNML (sax parser for PT used): 6561 ms
[2026-06-02 22:50:06] [INFO ] Transformed 348 places.
[2026-06-02 22:50:06] [INFO ] Transformed 74085 transitions.
[2026-06-02 22:50:06] [INFO ] Found NUPN structural information;
[2026-06-02 22:50:06] [INFO ] Parsed PT model containing 348 places and 74085 transitions and 2458524 arcs in 7448 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 29455 steps (8 resets) in 120018 ms. (0 steps per ms) remains 7/11 properties
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-06-02 22:50:41] [INFO ] Flatten gal took : 30353 ms
BEST_FIRST walk for 13317 steps (2 resets) in 20018 ms. (0 steps per ms) remains 7/7 properties
BEST_FIRST walk for 21246 steps (3 resets) in 19639 ms. (1 steps per ms) remains 6/7 properties
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10619 steps (0 resets) in 20010 ms. (0 steps per ms) remains 6/6 properties
BEST_FIRST walk for 25293 steps (6 resets) in 20013 ms. (1 steps per ms) remains 6/6 properties
BEST_FIRST walk for 14601 steps (2 resets) in 20023 ms. (0 steps per ms) remains 6/6 properties
[2026-06-02 22:51:08] [INFO ] Flatten gal took : 26954 ms
BEST_FIRST walk for 21669 steps (4 resets) in 20029 ms. (1 steps per ms) remains 6/6 properties
[2026-06-02 22:51:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14545601396241836276.gal : 3303 ms
[2026-06-02 22:51:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7872668718942844590.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/ReachabilityCardinality14545601396241836276.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7872668718942844590.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 18545 steps (3 resets) in 20015 ms. (0 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7143080543977205816.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6891312388846441943.kers'
[2026-06-02 22:51:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7143080543977205816.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6891312388846441943.kers]
Culled 0 columns in 417 ms.
// Phase 1: matrix 74085 rows 348 cols 2458524 entries
Finished phase 1 with 309 SingleSign rule and 3 generalized
[2026-06-02 22:51:16] [INFO ] Computed 36 invariants in 1820 ms
Computed 36 P flows in 1822 ms.
Exported basis to /tmp/petrispot-output-6891312388846441943.kers
Total runtime 2192 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 132/198 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 132/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 25/223 variables, 13/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 25/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 125/348 variables, 15/259 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 125/384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 8781ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 74085/74085 transitions.
Graph (trivial) has 192 edges and 348 vertex of which 10 / 348 are part of one of the 4 SCC in 35 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 342 transition count 74007
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 89 rules applied. Total rules applied 157 place count 275 transition count 73985
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 174 place count 258 transition count 73985
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 174 place count 258 transition count 73977
Deduced a syphon composed of 8 places in 169 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 191 place count 249 transition count 73977
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 210 place count 230 transition count 73958
Iterating global reduction 3 with 19 rules applied. Total rules applied 229 place count 230 transition count 73958
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 236 place count 223 transition count 50897
Ensure Unique test removed 4 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 247 place count 219 transition count 50897
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 250 place count 216 transition count 7889
Iterating global reduction 3 with 3 rules applied. Total rules applied 253 place count 216 transition count 7889
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 6 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 337 place count 174 transition count 7847
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 341 place count 172 transition count 7858
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 342 place count 172 transition count 7857
Free-agglomeration rule applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 357 place count 172 transition count 7842
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 374 place count 157 transition count 7840
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 377 place count 157 transition count 7837
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 378 place count 157 transition count 7836
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 379 place count 156 transition count 7836
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 381 place count 156 transition count 7836
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 382 place count 155 transition count 7835
Applied a total of 382 rules in 51055 ms. Remains 155 /348 variables (removed 193) and now considering 7835/74085 (removed 66250) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51076 ms. Remains : 155/348 places, 7835/74085 transitions.
RANDOM walk for 40000 steps (8 resets) in 10030 ms. (3 steps per ms) remains 1/6 properties
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1253 ms. (31 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9314863328967055182.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7576211377393537092.kers'
[2026-06-02 22:52:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9314863328967055182.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7576211377393537092.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 38 ms.
// Phase 1: matrix 7835 rows 154 cols 212344 entries
Finished phase 1 with 121 SingleSign rule and 3 generalized
[2026-06-02 22:52:17] [INFO ] Computed 31 invariants in 135 ms
Computed 31 P flows in 136 ms.
Exported basis to /tmp/petrispot-output-7576211377393537092.kers
Total runtime 165 ms.
[2026-06-02 22:52:17] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/133 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/155 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7835/7990 variables, 155/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7990 variables, 25/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7990 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/7990 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7990/7990 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4214 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 155/155 constraints, ReadFeed: 25/25 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/133 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/155 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7835/7990 variables, 155/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7990 variables, 25/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 52379ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 7835/7835 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 155 transition count 7825
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 145 transition count 7825
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 20 place count 145 transition count 7820
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 30 place count 140 transition count 7820
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 36 place count 134 transition count 7044
Ensure Unique test removed 1 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 43 place count 133 transition count 7044
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 47 place count 129 transition count 3458
Ensure Unique test removed 1 places
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 128 transition count 3458
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 127 transition count 2434
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 127 transition count 2434
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 74 place count 117 transition count 2424
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 81 place count 117 transition count 2417
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 116 transition count 2289
Ensure Unique test removed 1 places
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 115 transition count 2289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 113 transition count 2290
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 113 transition count 2289
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 98 place count 113 transition count 2280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 98 place count 113 transition count 2279
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 112 transition count 2279
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 104 place count 112 transition count 2275
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 109 place count 108 transition count 2274
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 110 place count 108 transition count 2273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 111 place count 107 transition count 2273
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 112 place count 107 transition count 2272
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 113 place count 107 transition count 2272
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 114 place count 107 transition count 2271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 115 place count 106 transition count 2270
Applied a total of 115 rules in 2468 ms. Remains 106 /155 variables (removed 49) and now considering 2270/7835 (removed 5565) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2470 ms. Remains : 106/155 places, 2270/7835 transitions.
RANDOM walk for 40000 steps (8 resets) in 4297 ms. (9 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 901 ms. (44 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 139083 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 1
Probabilistic random walk after 139083 steps, saw 61154 distinct states, run finished after 3233 ms. (steps per millisecond=43 ) properties seen :0
[2026-06-02 22:53:16] [INFO ] Flow matrix only has 2268 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10999241873498814854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12901385554623211387.kers'
[2026-06-02 22:53:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10999241873498814854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12901385554623211387.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 13 ms.
// Phase 1: matrix 2268 rows 105 cols 54365 entries
Finished phase 1 with 76 SingleSign rule and 2 generalized
[2026-06-02 22:53:16] [INFO ] Computed 28 invariants in 37 ms
Computed 28 P flows in 38 ms.
Exported basis to /tmp/petrispot-output-12901385554623211387.kers
Total runtime 47 ms.
[2026-06-02 22:53:16] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/106 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2268/2374 variables, 106/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2374 variables, 21/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2374 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2374 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2374/2374 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1126 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 106/106 constraints, ReadFeed: 21/21 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/106 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2268/2374 variables, 106/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2374 variables, 21/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2374 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2374 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2374 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2374/2374 variables, and 157 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5679 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 106/106 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7039ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 217 ms.
Support contains 34 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2270/2270 transitions.
Applied a total of 0 rules in 164 ms. Remains 106 /106 variables (removed 0) and now considering 2270/2270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 106/106 places, 2270/2270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2270/2270 transitions.
Applied a total of 0 rules in 182 ms. Remains 106 /106 variables (removed 0) and now considering 2270/2270 (removed 0) transitions.
[2026-06-02 22:53:25] [INFO ] Flow matrix only has 2268 transitions (discarded 2 similar events)
[2026-06-02 22:53:25] [INFO ] Invariant cache hit.
[2026-06-02 22:53:29] [INFO ] Implicit Places using invariants in 4532 ms returned [30, 82]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 5617 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/106 places, 2270/2270 transitions.
Applied a total of 0 rules in 146 ms. Remains 104 /104 variables (removed 0) and now considering 2270/2270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5947 ms. Remains : 104/106 places, 2270/2270 transitions.
RANDOM walk for 40000 steps (8 resets) in 3780 ms. (10 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 697 ms. (57 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 151629 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 1
Probabilistic random walk after 151629 steps, saw 64364 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2026-06-02 22:53:34] [INFO ] Flow matrix only has 2268 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11606740737550179063.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10345484340547896086.kers'
[2026-06-02 22:53:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11606740737550179063.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10345484340547896086.kers]
Culled 0 columns in 8 ms.
// Phase 1: matrix 2268 rows 104 cols 52188 entries
Finished phase 1 with 76 SingleSign rule and 2 generalized
[2026-06-02 22:53:34] [INFO ] Computed 26 invariants in 28 ms
Computed 26 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-10345484340547896086.kers
Total runtime 35 ms.
[2026-06-02 22:53:34] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/90 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/104 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2268/2372 variables, 104/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2372 variables, 21/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2372 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2372 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2372/2372 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1294 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 104/104 constraints, ReadFeed: 21/21 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/90 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/104 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2268/2372 variables, 104/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2372 variables, 21/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2372 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2372 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2372/2372 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3632 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 104/104 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5001ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 168 ms.
Support contains 34 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2270/2270 transitions.
Applied a total of 0 rules in 1284 ms. Remains 104 /104 variables (removed 0) and now considering 2270/2270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1284 ms. Remains : 104/104 places, 2270/2270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2270/2270 transitions.
Applied a total of 0 rules in 145 ms. Remains 104 /104 variables (removed 0) and now considering 2270/2270 (removed 0) transitions.
[2026-06-02 22:53:40] [INFO ] Flow matrix only has 2268 transitions (discarded 2 similar events)
[2026-06-02 22:53:40] [INFO ] Invariant cache hit.
[2026-06-02 22:53:43] [INFO ] Implicit Places using invariants in 2248 ms returned []
[2026-06-02 22:53:43] [INFO ] Flow matrix only has 2268 transitions (discarded 2 similar events)
[2026-06-02 22:53:43] [INFO ] Invariant cache hit.
[2026-06-02 22:53:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-06-02 22:53:46] [INFO ] Implicit Places using invariants and state equation in 3753 ms returned []
Implicit Place search using SMT with State Equation took 6007 ms to find 0 implicit places.
[2026-06-02 22:53:47] [INFO ] Redundant transitions in 415 ms returned []
Running 2263 sub problems to find dead transitions.
[2026-06-02 22:53:47] [INFO ] Flow matrix only has 2268 transitions (discarded 2 similar events)
[2026-06-02 22:53:47] [INFO ] Invariant cache hit.
[2026-06-02 22:53:47] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
Loading property file /tmp/ReachabilityCardinality7872668718942844590.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 99/2372 variables, and 9 constraints, problems are : Problem set: 0 solved, 2263 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 8/12 constraints, Generalized P Invariants (flows): 1/14 constraints, State Equation: 0/104 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2263/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 3 (OVERLAPS) 4/103 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/2372 variables, and 13 constraints, problems are : Problem set: 0 solved, 2263 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/14 constraints, State Equation: 0/104 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2207/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64855ms problems are : Problem set: 0 solved, 2263 unsolved
Search for dead transitions found 0 dead transitions in 64892ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71614 ms. Remains : 104/104 places, 2270/2270 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 19 edges and 104 vertex of which 2 / 104 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 817 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 102 transition count 2265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 101 transition count 2265
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 101 transition count 2263
Free-agglomeration rule applied 13 times with reduction of 1536 identical transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 19 place count 101 transition count 714
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 32 place count 88 transition count 714
Applied a total of 32 rules in 401 ms. Remains 88 /104 variables (removed 16) and now considering 714/2270 (removed 1556) transitions.
Running SMT prover for 1 properties.
[2026-06-02 22:54:52] [INFO ] Flow matrix only has 458 transitions (discarded 256 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12045529071241340059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14572361966735433242.kers'
[2026-06-02 22:54:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12045529071241340059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14572361966735433242.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 458 rows 88 cols 8631 entries
Finished phase 1 with 61 SingleSign rule and 2 generalized
[2026-06-02 22:54:52] [INFO ] Computed 25 invariants in 8 ms
Computed 25 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14572361966735433242.kers
Total runtime 9 ms.
[2026-06-02 22:54:52] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-06-02 22:54:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-06-02 22:54:52] [INFO ] [Nat]Absence check using 11 positive and 14 generalized place invariants in 5 ms returned sat
[2026-06-02 22:54:53] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-06-02 22:54:53] [INFO ] State equation strengthened by 256 read => feed constraints.
[2026-06-02 22:54:53] [INFO ] After 55ms SMT Verify possible using 256 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-06-02 22:54:53] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-06-02 22:54:53] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-06-02 22:54:53] [INFO ] Flatten gal took : 109 ms
[2026-06-02 22:54:53] [INFO ] Flatten gal took : 88 ms
[2026-06-02 22:54:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9349320966868567219.gal : 46 ms
[2026-06-02 22:54:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15459716666264651990.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9349320966868567219.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15459716666264651990.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
Loading property file /tmp/ReachabilityCardinality15459716666264651990.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 1753
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1753 after 459460
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :459460 after 462688
Detected timeout of ITS tools.
[2026-06-02 22:55:08] [INFO ] Flatten gal took : 81 ms
[2026-06-02 22:55:08] [INFO ] Applying decomposition
[2026-06-02 22:55:08] [INFO ] Flatten gal took : 83 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/graph12920952101942885953.txt' '-o' '/tmp/graph12920952101942885953.bin' '-w' '/tmp/graph12920952101942885953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12920952101942885953.bin' '-l' '-1' '-v' '-w' '/tmp/graph12920952101942885953.weights' '-q' '0' '-e' '0.001'
[2026-06-02 22:55:09] [INFO ] Decomposing Gal with order
[2026-06-02 22:55:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 22:55:10] [INFO ] Removed a total of 9827 redundant transitions.
[2026-06-02 22:55:10] [INFO ] Flatten gal took : 616 ms
[2026-06-02 22:55:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 294 ms.
[2026-06-02 22:55:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7549839197189471626.gal : 25 ms
[2026-06-02 22:55:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11170392148680821289.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7549839197189471626.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11170392148680821289.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/ReachabilityCardinality11170392148680821289.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 9668
Reachability property ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-15 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.1233e+06,0.226744,9468,254,20,2445,117,1065,10558,61,214,0
Total reachable state count : 5123296

Verifying 1 reachability properties.
Reachability property ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-15,2560,0.240395,9468,58,18,2445,117,1211,10558,79,214,0
Over-approximation ignoring read arcs solved 0 properties in 18929 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-06-02 22:55:41] [INFO ] Flatten gal took : 27941 ms
[2026-06-02 22:55:41] [INFO ] Applying decomposition
[2026-06-02 22:56:10] [INFO ] Flatten gal took : 29731 ms
[2026-06-02 22:57:03] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1216232770395261742.txt' '-o' '/tmp/graph1216232770395261742.bin' '-w' '/tmp/graph1216232770395261742.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:714)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:71)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-06-02 22:57:23] [INFO ] Flatten gal took : 20717 ms
[2026-06-02 22:57:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10548015124705376314.gal : 2474 ms
[2026-06-02 22:57:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3593653677717990693.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10548015124705376314.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3593653677717990693.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
Loading property file /tmp/ReachabilityCardinality3593653677717990693.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6 after 19
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :19 after 49155
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :49155 after 584340
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :584340 after 585232
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :585232 after 587957
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :587957 after 594692
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :594692 after 605220
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :605220 after 621314
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :621314 after 655549
Detected timeout of ITS tools.
[2026-06-02 23:27:30] [INFO ] Flatten gal took : 3057 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13429390903641304399
[2026-06-02 23:27:32] [INFO ] Too many transitions (2270) to apply POR reductions. Disabling POR matrices.
[2026-06-02 23:27:35] [INFO ] Applying decomposition
[2026-06-02 23:27:35] [INFO ] Built C files in 2590ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13429390903641304399
Running compilation step : cd /tmp/ltsmin13429390903641304399;'/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 23:27:38] [INFO ] Flatten gal took : 3843 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/graph6171615229809102625.txt' '-o' '/tmp/graph6171615229809102625.bin' '-w' '/tmp/graph6171615229809102625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6171615229809102625.bin' '-l' '-1' '-v' '-w' '/tmp/graph6171615229809102625.weights' '-q' '0' '-e' '0.001'
[2026-06-02 23:27:57] [INFO ] Decomposing Gal with order
[2026-06-02 23:27:57] [INFO ] Rewriting arrays to variables to allow decomposition.
Compilation finished in 25015 ms.
Running link step : cd /tmp/ltsmin13429390903641304399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 108 ms.
Running LTSmin : cd /tmp/ltsmin13429390903641304399;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ErlangenMainframeV2PTbP14C01ReachabilityCardinality202415==true'
[2026-06-02 23:28:05] [INFO ] Removed a total of 26782 redundant transitions.
[2026-06-02 23:28:06] [INFO ] Flatten gal took : 5867 ms
[2026-06-02 23:28:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3542 ms.
[2026-06-02 23:28:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8725344276205875791.gal : 145 ms
[2026-06-02 23:28:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1201952937097893616.prop : 2 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/ReachabilityCardinality8725344276205875791.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1201952937097893616.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/ReachabilityCardinality1201952937097893616.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 72
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :72 after 2160
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2160 after 26880
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26880 after 2.9591e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.36632e+10,186.213,2023556,18823,35,1.74062e+06,187,7425,1.0539e+07,58,653,0
Total reachable state count : 33663169840

Verifying 1 reachability properties.
Reachability property ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-15 is true.
FORMULA ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ErlangenMainframeV2-PT-bP14C01-ReachabilityCardinality-2024-15,1.06445e+08,188.266,2023556,10068,29,1.74062e+06,187,7500,1.0539e+07,67,653,22644
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2480006 ms.

BK_STOP 1780443080608

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

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