fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r130-smll-177955809000278
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for FireWire-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2341.728 213258.00 407986.00 533.20 TFTFTTTFTTFTTTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r130-smll-177955809000278.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 FireWire-PT-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.3K Mar 7 05:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 7 05:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 05:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 05:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 10:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 7 05:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Mar 7 05:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 7 05:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 7 05:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 153K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779838552241

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-26 23:35:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 23:35:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 23:35:55] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2026-05-26 23:35:55] [INFO ] Transformed 428 places.
[2026-05-26 23:35:55] [INFO ] Transformed 656 transitions.
[2026-05-26 23:35:55] [INFO ] Found NUPN structural information;
[2026-05-26 23:35:55] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 445 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (12 resets) in 2025 ms. (19 steps per ms) remains 14/15 properties
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (11 resets) in 1046 ms. (38 steps per ms) remains 14/14 properties
[2026-05-26 23:35:56] [INFO ] Flatten gal took : 524 ms
BEST_FIRST walk for 40000 steps (10 resets) in 1092 ms. (36 steps per ms) remains 14/14 properties
[2026-05-26 23:35:56] [INFO ] Flatten gal took : 219 ms
[2026-05-26 23:35:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17971693580289506798.gal : 63 ms
BEST_FIRST walk for 40001 steps (16 resets) in 698 ms. (57 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (10 resets) in 301 ms. (132 steps per ms) remains 14/14 properties
[2026-05-26 23:35:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12431928844642528263.prop : 12 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/ReachabilityCardinality17971693580289506798.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12431928844642528263.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

BEST_FIRST walk for 40000 steps (21 resets) in 496 ms. (80 steps per ms) remains 14/14 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12431928844642528263.prop.
BEST_FIRST walk for 40000 steps (8 resets) in 489 ms. (81 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (15 resets) in 221 ms. (180 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (13 resets) in 435 ms. (91 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 372 ms. (107 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :13 after 19
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :19 after 80
BEST_FIRST walk for 40000 steps (10 resets) in 388 ms. (102 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :80 after 97
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :97 after 141
Reachability property FireWire-PT-17-ReachabilityCardinality-2024-00 is true.
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :141 after 313
BEST_FIRST walk for 40000 steps (11 resets) in 388 ms. (102 steps per ms) remains 14/14 properties
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :313 after 381
BEST_FIRST walk for 40000 steps (14 resets) in 495 ms. (80 steps per ms) remains 14/14 properties
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :381 after 731
BEST_FIRST walk for 40000 steps (14 resets) in 469 ms. (85 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (11 resets) in 367 ms. (108 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 1073331 steps, run timeout after 9001 ms. (steps per millisecond=119 ) properties seen :6 out of 14
Probabilistic random walk after 1073331 steps, saw 247449 distinct states, run finished after 9008 ms. (steps per millisecond=119 ) properties seen :6
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17757448200919978188.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14834172510909629228.kers'
[2026-05-26 23:36:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17757448200919978188.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14834172510909629228.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 656 rows 428 cols 1904 entries
Finished phase 1 with 419 SingleSign rule and 0 generalized
[2026-05-26 23:36:07] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14834172510909629228.kers
Total runtime 4 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem FireWire-PT-17-ReachabilityCardinality-2024-03 is UNSAT
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 268/428 variables, 9/169 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 268/437 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Reachability property FireWire-PT-17-ReachabilityCardinality-2024-04 is true.
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :731 after 178638
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/437 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 656/1084 variables, 428/865 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1084 variables, 0/865 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/1084 variables, 0/865 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 865 constraints, problems are : Problem set: 1 solved, 7 unsolved in 3657 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem FireWire-PT-17-ReachabilityCardinality-2024-09 is UNSAT
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-17-ReachabilityCardinality-2024-15 is UNSAT
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 278/428 variables, 9/159 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 278/437 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 6/443 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/443 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 656/1084 variables, 428/871 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1084 variables, 3/874 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 874 constraints, problems are : Problem set: 3 solved, 5 unsolved in 5011 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8829ms problems are : Problem set: 3 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 119 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 656/656 transitions.
Graph (complete) has 1103 edges and 428 vertex of which 423 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 423 transition count 606
Reduce places removed 49 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 63 rules applied. Total rules applied 114 place count 374 transition count 592
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 128 place count 360 transition count 592
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 128 place count 360 transition count 582
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 148 place count 350 transition count 582
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 180 place count 318 transition count 550
Iterating global reduction 3 with 32 rules applied. Total rules applied 212 place count 318 transition count 550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 213 place count 318 transition count 549
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 213 place count 318 transition count 545
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 221 place count 314 transition count 545
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 223 place count 312 transition count 505
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 312 transition count 505
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 265 place count 292 transition count 485
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 283 place count 283 transition count 500
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 283 transition count 499
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 313 place count 283 transition count 470
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 342 place count 254 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 344 place count 254 transition count 468
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 352 place count 254 transition count 468
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 353 place count 254 transition count 468
Applied a total of 353 rules in 332 ms. Remains 254 /428 variables (removed 174) and now considering 468/656 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 254/428 places, 468/656 transitions.
RANDOM walk for 40000 steps (42 resets) in 864 ms. (46 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (23 resets) in 611 ms. (65 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (28 resets) in 246 ms. (161 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (30 resets) in 290 ms. (137 steps per ms) remains 3/5 properties
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (21 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8114047208714566796.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9460108358199672179.kers'
[2026-05-26 23:36:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8114047208714566796.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9460108358199672179.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 254 cols 1516 entries
Finished phase 1 with 247 SingleSign rule and 0 generalized
[2026-05-26 23:36:17] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9460108358199672179.kers
Total runtime 3 ms.
[2026-05-26 23:36:17] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 150/238 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 462/700 variables, 238/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/700 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 21/721 variables, 15/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/721 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/722 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/722 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/722 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 722/722 variables, and 264 constraints, problems are : Problem set: 0 solved, 3 unsolved in 751 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 254/254 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/2 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/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 150/238 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 462/700 variables, 238/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/700 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/700 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 21/721 variables, 15/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/721 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/721 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/722 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/722 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/722 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :178638 after 189275
Reachability property FireWire-PT-17-ReachabilityCardinality-2024-11 is true.
At refinement iteration 17 (INCLUDED_ONLY) 0/722 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/722 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/722 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/722 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 722/722 variables, and 276 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5734 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 254/254 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6517ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1157 ms.
Support contains 88 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 468/468 transitions.
Graph (trivial) has 45 edges and 254 vertex of which 2 / 254 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 832 edges and 253 vertex of which 252 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 252 transition count 458
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 245 transition count 455
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 242 transition count 455
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 22 place count 242 transition count 450
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 32 place count 237 transition count 450
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 37 place count 232 transition count 445
Iterating global reduction 3 with 5 rules applied. Total rules applied 42 place count 232 transition count 445
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 56 place count 225 transition count 438
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 223 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 63 place count 223 transition count 442
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 69 place count 223 transition count 436
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 75 place count 217 transition count 436
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 217 transition count 436
Applied a total of 76 rules in 87 ms. Remains 217 /254 variables (removed 37) and now considering 436/468 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 217/254 places, 436/468 transitions.
RANDOM walk for 40000 steps (63 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (24 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (11 resets) in 252 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (13 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 465735 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 3
Probabilistic random walk after 465735 steps, saw 110594 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2026-05-26 23:36:28] [INFO ] Flow matrix only has 433 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9244216786798917020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9205266867299744711.kers'
[2026-05-26 23:36:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9244216786798917020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9205266867299744711.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 433 rows 217 cols 1455 entries
Finished phase 1 with 210 SingleSign rule and 0 generalized
[2026-05-26 23:36:28] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9205266867299744711.kers
Total runtime 3 ms.
[2026-05-26 23:36:28] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 120/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 433/641 variables, 208/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/650 variables, 9/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/650 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 228 constraints, problems are : Problem set: 0 solved, 3 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 217/217 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/2 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/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 120/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 433/641 variables, 208/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 9/650 variables, 9/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/650 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/650 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/650 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 650/650 variables, and 235 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2172 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 217/217 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2908ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1044 ms.
Support contains 88 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 436/436 transitions.
Applied a total of 0 rules in 12 ms. Remains 217 /217 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 217/217 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 436/436 transitions.
Applied a total of 0 rules in 10 ms. Remains 217 /217 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2026-05-26 23:36:32] [INFO ] Flow matrix only has 433 transitions (discarded 3 similar events)
[2026-05-26 23:36:32] [INFO ] Invariant cache hit.
[2026-05-26 23:36:32] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-26 23:36:32] [INFO ] Flow matrix only has 433 transitions (discarded 3 similar events)
[2026-05-26 23:36:32] [INFO ] Invariant cache hit.
[2026-05-26 23:36:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-26 23:36:32] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2026-05-26 23:36:32] [INFO ] Redundant transitions in 46 ms returned [349]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 434 sub problems to find dead transitions.
[2026-05-26 23:36:32] [INFO ] Flow matrix only has 432 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3640013888620760301.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11491571917386629552.kers'
[2026-05-26 23:36:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3640013888620760301.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11491571917386629552.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 432 rows 217 cols 1451 entries
Finished phase 1 with 210 SingleSign rule and 0 generalized
[2026-05-26 23:36:32] [INFO ] Computed 7 invariants in 8 ms
Computed 7 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-11491571917386629552.kers
Total runtime 11 ms.
[2026-05-26 23:36:32] [INFO ] State equation strengthened by 4 read => feed constraints.
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :189275 after 199267
Reachability property FireWire-PT-17-ReachabilityCardinality-2024-14 is true.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 434 unsolved
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :199267 after 219430
Reachability property FireWire-PT-17-ReachabilityCardinality-2024-12 is true.
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 5 (OVERLAPS) 432/649 variables, 217/240 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/649 variables, and 245 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 217/217 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Invariant property FireWire-PT-17-ReachabilityCardinality-2024-07 does not hold.
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :219430 after 259766
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :259766 after 374021
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (OVERLAPS) 432/649 variables, 217/241 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 434 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :374021 after 593153
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 434/679 constraints. Problems are: Problem set: 0 solved, 434 unsolved
SMT process timed out in 60394ms, After SMT, problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/217 places, 435/436 transitions.
Applied a total of 0 rules in 35 ms. Remains 217 /217 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61022 ms. Remains : 217/217 places, 435/436 transitions.
RANDOM walk for 40000 steps (19 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (28 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (39 resets) in 273 ms. (145 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (38 resets) in 167 ms. (238 steps per ms) remains 3/3 properties
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :593153 after 1.72666e+06
Interrupted probabilistic random walk after 468935 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 3
Probabilistic random walk after 468935 steps, saw 111281 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
[2026-05-26 23:37:36] [INFO ] Flow matrix only has 432 transitions (discarded 3 similar events)
[2026-05-26 23:37:36] [INFO ] Invariant cache hit.
[2026-05-26 23:37:36] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 120/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 432/640 variables, 208/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/649 variables, 9/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/649 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 649/649 variables, and 228 constraints, problems are : Problem set: 0 solved, 3 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 217/217 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/2 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/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 120/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 432/640 variables, 208/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 9/649 variables, 9/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/649 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/649 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/649 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 649/649 variables, and 236 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3383 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 217/217 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3934ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1030 ms.
Support contains 88 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 217 /217 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 217/217 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 217 /217 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2026-05-26 23:37:41] [INFO ] Flow matrix only has 432 transitions (discarded 3 similar events)
[2026-05-26 23:37:41] [INFO ] Invariant cache hit.
[2026-05-26 23:37:41] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-26 23:37:41] [INFO ] Flow matrix only has 432 transitions (discarded 3 similar events)
[2026-05-26 23:37:41] [INFO ] Invariant cache hit.
[2026-05-26 23:37:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-26 23:37:42] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2026-05-26 23:37:42] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 534 ms. Remains : 217/217 places, 435/435 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 788 edges and 217 vertex of which 216 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 216 transition count 432
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 216 transition count 432
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 216 transition count 431
Applied a total of 6 rules in 37 ms. Remains 216 /217 variables (removed 1) and now considering 431/435 (removed 4) transitions.
Running SMT prover for 3 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15335331801373329634.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-547849399485890640.kers'
[2026-05-26 23:37:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15335331801373329634.kers, --Pflows, --basisKERS=/tmp/petrispot-output-547849399485890640.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 431 rows 216 cols 1448 entries
Finished phase 1 with 209 SingleSign rule and 0 generalized
[2026-05-26 23:37:42] [INFO ] Computed 7 invariants in 7 ms
Computed 7 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-547849399485890640.kers
Total runtime 9 ms.
[2026-05-26 23:37:42] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-26 23:37:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-26 23:37:42] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-26 23:37:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
TRAPS : Iteration 1
[2026-05-26 23:37:43] [INFO ] After 581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-26 23:37:43] [INFO ] After 789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2026-05-26 23:37:43] [INFO ] Flatten gal took : 66 ms
[2026-05-26 23:37:43] [INFO ] Flatten gal took : 65 ms
[2026-05-26 23:37:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9869965548901784482.gal : 9 ms
[2026-05-26 23:37:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11422234237807365196.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/ReachabilityCardinality9869965548901784482.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11422234237807365196.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/ReachabilityCardinality11422234237807365196.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :15 after 16
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :16 after 22
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :22 after 42
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :42 after 83
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :83 after 223
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :223 after 6757
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :6757 after 9160
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :9160 after 168742
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :168742 after 409088
Invariant property FireWire-PT-17-ReachabilityCardinality-2024-10 does not hold.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :409088 after 464572
Detected timeout of ITS tools.
[2026-05-26 23:37:58] [INFO ] Flatten gal took : 31 ms
[2026-05-26 23:37:58] [INFO ] Applying decomposition
[2026-05-26 23:37:58] [INFO ] Flatten gal took : 26 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/graph11758784703028664065.txt' '-o' '/tmp/graph11758784703028664065.bin' '-w' '/tmp/graph11758784703028664065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11758784703028664065.bin' '-l' '-1' '-v' '-w' '/tmp/graph11758784703028664065.weights' '-q' '0' '-e' '0.001'
[2026-05-26 23:37:58] [INFO ] Decomposing Gal with order
[2026-05-26 23:37:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 23:37:58] [INFO ] Removed a total of 588 redundant transitions.
[2026-05-26 23:37:58] [INFO ] Flatten gal took : 152 ms
[2026-05-26 23:37:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 29 ms.
[2026-05-26 23:37:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7933246596421245580.gal : 11 ms
[2026-05-26 23:37:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14614725236288140181.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/ReachabilityCardinality7933246596421245580.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14614725236288140181.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/ReachabilityCardinality14614725236288140181.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :9 after 4287
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4287 after 29907
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :29907 after 2.2394e+06
Reachability property FireWire-PT-17-ReachabilityCardinality-2024-02 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.2394e+06 after 2.50458e+08
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31831 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-26 23:38:14] [INFO ] Flatten gal took : 38 ms
[2026-05-26 23:38:14] [INFO ] Applying decomposition
[2026-05-26 23:38:14] [INFO ] Flatten gal took : 45 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/graph2948529224556287946.txt' '-o' '/tmp/graph2948529224556287946.bin' '-w' '/tmp/graph2948529224556287946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2948529224556287946.bin' '-l' '-1' '-v' '-w' '/tmp/graph2948529224556287946.weights' '-q' '0' '-e' '0.001'
[2026-05-26 23:38:14] [INFO ] Decomposing Gal with order
[2026-05-26 23:38:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 23:38:14] [INFO ] Removed a total of 542 redundant transitions.
[2026-05-26 23:38:14] [INFO ] Flatten gal took : 108 ms
[2026-05-26 23:38:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 27 ms.
[2026-05-26 23:38:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5682613268825824391.gal : 31 ms
[2026-05-26 23:38:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15380475307171487662.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/ReachabilityCardinality5682613268825824391.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15380475307171487662.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/ReachabilityCardinality15380475307171487662.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 583
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :583 after 937589
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :937589 after 1.8413e+06
Invariant property FireWire-PT-17-ReachabilityCardinality-2024-10 does not hold.
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property FireWire-PT-17-ReachabilityCardinality-2024-02 is true.
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.28378e+08 after 1.1559e+10
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,1.8703e+12,69.6376,1395136,8739,332,1.38249e+06,4393,1145,1.06694e+07,112,24912,0
Total reachable state count : 1870302369374

Verifying 3 reachability properties.
Invariant property FireWire-PT-17-ReachabilityCardinality-2024-01 does not hold.
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-01 FALSE 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
FireWire-PT-17-ReachabilityCardinality-2024-01,3.03986e+07,70.4142,1395136,966,78,1.38249e+06,4393,1174,1.06694e+07,122,24912,11518
Reachability property FireWire-PT-17-ReachabilityCardinality-2024-02 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
FireWire-PT-17-ReachabilityCardinality-2024-02,44,70.5469,1395136,163,27,1.38249e+06,4393,1471,1.06694e+07,133,24912,36372
Invariant property FireWire-PT-17-ReachabilityCardinality-2024-10 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-17-ReachabilityCardinality-2024-10,7.57332e+06,70.6077,1395136,467,38,1.38249e+06,4393,1487,1.06694e+07,134,24912,41528
All properties solved without resorting to model-checking.
Total runtime 210877 ms.

BK_STOP 1779838765499

--------------------
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="FireWire-PT-17"
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 FireWire-PT-17, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955809000278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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