Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400375.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is FireWire-PT-17, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400375
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 153K May 29 14:32 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-ReachabilityFireability-2025-00
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-01
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-02
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-03
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-04
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-05
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-06
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-07
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-08
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-09
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-10
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-11
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-12
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-13
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-14
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748893234814

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
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
ReachabilityFireability PT
Running Version 202505121319
[2025-06-02 19:40:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 19:40:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:40:38] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2025-06-02 19:40:38] [INFO ] Transformed 428 places.
[2025-06-02 19:40:38] [INFO ] Transformed 656 transitions.
[2025-06-02 19:40:38] [INFO ] Found NUPN structural information;
[2025-06-02 19:40:38] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 464 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (9 resets) in 2790 ms. (14 steps per ms) remains 12/16 properties
FORMULA FireWire-PT-17-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-17-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-17-ReachabilityFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-17-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 19:40:39] [INFO ] Flatten gal took : 297 ms
[2025-06-02 19:40:39] [INFO ] Flatten gal took : 149 ms
BEST_FIRST walk for 40004 steps (11 resets) in 895 ms. (44 steps per ms) remains 12/12 properties
[2025-06-02 19:40:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7017752342220428445.gal : 155 ms
BEST_FIRST walk for 40000 steps (17 resets) in 634 ms. (62 steps per ms) remains 11/12 properties
FORMULA FireWire-PT-17-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (16 resets) in 389 ms. (102 steps per ms) remains 11/11 properties
[2025-06-02 19:40:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13780287444092825287.prop : 14 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7017752342220428445.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13780287444092825287.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40000 steps (16 resets) in 410 ms. (97 steps per ms) remains 11/11 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40000 steps (12 resets) in 403 ms. (99 steps per ms) remains 11/11 properties
Loading property file /tmp/ReachabilityCardinality13780287444092825287.prop.
BEST_FIRST walk for 40000 steps (11 resets) in 370 ms. (107 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (15 resets) in 342 ms. (116 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (15 resets) in 309 ms. (129 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 7
BEST_FIRST walk for 40000 steps (9 resets) in 312 ms. (127 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :13 after 19
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :19 after 80
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :80 after 97
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :97 after 141
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :141 after 313
BEST_FIRST walk for 40001 steps (14 resets) in 323 ms. (123 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :313 after 601
BEST_FIRST walk for 40000 steps (12 resets) in 220 ms. (180 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (13 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
// Phase 1: matrix 656 rows 428 cols
[2025-06-02 19:40:40] [INFO ] Computed 9 invariants in 62 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 319/428 variables, 9/118 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :601 after 178142
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 319/437 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 656/1084 variables, 428/865 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :178142 after 195054
Invariant property FireWire-PT-17-ReachabilityFireability-2025-13 does not hold.
FORMULA FireWire-PT-17-ReachabilityFireability-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 6 (INCLUDED_ONLY) 0/1084 variables, 0/865 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/1084 variables, 0/865 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 865 constraints, problems are : Problem set: 1 solved, 10 unsolved in 3246 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 11/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem FireWire-PT-17-ReachabilityFireability-2025-00 is UNSAT
FORMULA FireWire-PT-17-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 321/428 variables, 9/116 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 321/437 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:40:45] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:40:45] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:40:45] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:40:45] [INFO ] Deduced a trap composed of 93 places in 443 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:40:46] [INFO ] Deduced a trap composed of 95 places in 385 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:40:46] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:40:46] [INFO ] Deduced a trap composed of 102 places in 233 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:40:47] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Reachability property FireWire-PT-17-ReachabilityFireability-2025-08 is true.
FORMULA FireWire-PT-17-ReachabilityFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
[2025-06-02 19:40:47] [INFO ] Deduced a trap composed of 106 places in 212 ms of which 36 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 9/446 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/446 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Reachability property FireWire-PT-17-ReachabilityFireability-2025-07 is true.
FORMULA FireWire-PT-17-ReachabilityFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :195054 after 228181
At refinement iteration 6 (OVERLAPS) 656/1084 variables, 428/874 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1084 variables, 5/879 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 879 constraints, problems are : Problem set: 4 solved, 7 unsolved in 5027 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8528ms problems are : Problem set: 4 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 656/656 transitions.
Graph (trivial) has 269 edges and 428 vertex of which 4 / 428 are part of one of the 1 SCC in 9 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1099 edges and 425 vertex of which 419 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 419 transition count 561
Reduce places removed 89 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 108 rules applied. Total rules applied 201 place count 330 transition count 542
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 220 place count 311 transition count 542
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 220 place count 311 transition count 532
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 240 place count 301 transition count 532
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 291 place count 250 transition count 480
Iterating global reduction 3 with 51 rules applied. Total rules applied 342 place count 250 transition count 480
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 343 place count 250 transition count 479
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 343 place count 250 transition count 468
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 365 place count 239 transition count 468
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 373 place count 231 transition count 456
Iterating global reduction 4 with 8 rules applied. Total rules applied 381 place count 231 transition count 456
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 384 place count 231 transition count 453
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 386 place count 230 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 387 place count 229 transition count 452
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 443 place count 201 transition count 424
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 471 place count 187 transition count 468
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 474 place count 187 transition count 465
Free-agglomeration rule applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 495 place count 187 transition count 444
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 516 place count 166 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 517 place count 166 transition count 443
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 523 place count 166 transition count 443
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 525 place count 166 transition count 443
Applied a total of 525 rules in 402 ms. Remains 166 /428 variables (removed 262) and now considering 443/656 (removed 213) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 416 ms. Remains : 166/428 places, 443/656 transitions.
RANDOM walk for 40000 steps (1371 resets) in 1199 ms. (33 steps per ms) remains 6/7 properties
FORMULA FireWire-PT-17-ReachabilityFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (326 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (329 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (325 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (331 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (159 resets) in 227 ms. (175 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (445 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
[2025-06-02 19:40:50] [INFO ] Flow matrix only has 438 transitions (discarded 5 similar events)
// Phase 1: matrix 438 rows 166 cols
[2025-06-02 19:40:50] [INFO ] Computed 7 invariants in 5 ms
[2025-06-02 19:40:50] [INFO ] State equation strengthened by 30 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 104/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 438/599 variables, 161/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 5/604 variables, 5/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/604 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 203 constraints, problems are : Problem set: 0 solved, 6 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 104/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:40:51] [INFO ] Deduced a trap composed of 39 places in 328 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:40:51] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 438/599 variables, 161/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 30/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 5/604 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/604 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 209 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2817 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3482ms problems are : Problem set: 0 solved, 6 unsolved
Reachability property FireWire-PT-17-ReachabilityFireability-2025-09 is true.
FORMULA FireWire-PT-17-ReachabilityFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property FireWire-PT-17-ReachabilityFireability-2025-03 does not hold.
Reachability property FireWire-PT-17-ReachabilityFireability-2025-02 is true.
FORMULA FireWire-PT-17-ReachabilityFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :228181 after 840566
Parikh walk visited 0 properties in 2421 ms.
Support contains 41 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 443/443 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 166 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 165 transition count 442
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 164 transition count 439
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 164 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 163 transition count 438
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 158 transition count 460
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 18 place count 158 transition count 458
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 23 place count 158 transition count 453
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 28 place count 153 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 153 transition count 449
Applied a total of 32 rules in 55 ms. Remains 153 /166 variables (removed 13) and now considering 449/443 (removed -6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 153/166 places, 449/443 transitions.
RANDOM walk for 40000 steps (1476 resets) in 341 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (363 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (353 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (175 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :840566 after 873835
BEST_FIRST walk for 40004 steps (481 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 378815 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :1 out of 4
Probabilistic random walk after 378815 steps, saw 98658 distinct states, run finished after 3011 ms. (steps per millisecond=125 ) properties seen :1
FORMULA FireWire-PT-17-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2025-06-02 19:40:59] [INFO ] Flow matrix only has 437 transitions (discarded 12 similar events)
// Phase 1: matrix 437 rows 153 cols
[2025-06-02 19:40:59] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 19:40:59] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 110/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 437/586 variables, 149/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/586 variables, 29/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/586 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/590 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/590 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 590/590 variables, and 189 constraints, problems are : Problem set: 0 solved, 3 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 29/29 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
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 110/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:00] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:00] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:00] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 437/586 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/586 variables, 29/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/586 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/590 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/590 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 590/590 variables, and 194 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1919 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2378ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 532 ms.
Support contains 39 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 449/449 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 152 transition count 448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 152 transition count 447
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 151 transition count 447
Applied a total of 4 rules in 29 ms. Remains 151 /153 variables (removed 2) and now considering 447/449 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 151/153 places, 447/449 transitions.
RANDOM walk for 40000 steps (1531 resets) in 246 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (400 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (175 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (550 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 494634 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 3
Probabilistic random walk after 494634 steps, saw 139436 distinct states, run finished after 3003 ms. (steps per millisecond=164 ) properties seen :0
[2025-06-02 19:41:05] [INFO ] Flow matrix only has 435 transitions (discarded 12 similar events)
// Phase 1: matrix 435 rows 151 cols
[2025-06-02 19:41:05] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 19:41:05] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 108/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 435/582 variables, 147/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 31/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/586 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/586 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/586 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 189 constraints, problems are : Problem set: 0 solved, 3 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 31/31 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
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 108/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:06] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:06] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:06] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:06] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 435/582 variables, 147/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 31/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/586 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/586 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 586/586 variables, and 195 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1629ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 947 ms.
Support contains 39 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 447/447 transitions.
Applied a total of 0 rules in 9 ms. Remains 151 /151 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 151/151 places, 447/447 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 447/447 transitions.
Applied a total of 0 rules in 8 ms. Remains 151 /151 variables (removed 0) and now considering 447/447 (removed 0) transitions.
[2025-06-02 19:41:08] [INFO ] Flow matrix only has 435 transitions (discarded 12 similar events)
[2025-06-02 19:41:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:41:08] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-02 19:41:08] [INFO ] Flow matrix only has 435 transitions (discarded 12 similar events)
[2025-06-02 19:41:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:41:08] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-02 19:41:08] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:41:08] [INFO ] Redundant transitions in 37 ms returned []
Running 445 sub problems to find dead transitions.
[2025-06-02 19:41:08] [INFO ] Flow matrix only has 435 transitions (discarded 12 similar events)
[2025-06-02 19:41:08] [INFO ] Invariant cache hit.
[2025-06-02 19:41:08] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:15] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:15] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:15] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:15] [INFO ] Deduced a trap composed of 60 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:16] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:16] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:17] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (OVERLAPS) 435/586 variables, 151/165 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/586 variables, 31/196 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/586 variables, and 196 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:41:42] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (OVERLAPS) 435/586 variables, 151/166 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 31/197 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/586 variables, 445/642 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:42:02] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/586 variables, and 643 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60357ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 60371ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60891 ms. Remains : 151/151 places, 447/447 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 702 edges and 151 vertex of which 149 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 149 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 149 transition count 433
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 149 transition count 430
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 21 place count 146 transition count 430
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 146 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 146 transition count 429
Applied a total of 27 rules in 129 ms. Remains 146 /151 variables (removed 5) and now considering 429/447 (removed 18) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 429 rows 146 cols
[2025-06-02 19:42:09] [INFO ] Computed 7 invariants in 6 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 19:42:09] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-02 19:42:09] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 19:42:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-02 19:42:09] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:42:10] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 4 ms to minimize.
[2025-06-02 19:42:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
TRAPS : Iteration 1
[2025-06-02 19:42:10] [INFO ] After 684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-06-02 19:42:10] [INFO ] After 896ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2025-06-02 19:42:10] [INFO ] Flatten gal took : 76 ms
[2025-06-02 19:42:10] [INFO ] Flatten gal took : 65 ms
[2025-06-02 19:42:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15010116961522548411.gal : 10 ms
[2025-06-02 19:42:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1676982596038206588.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15010116961522548411.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1676982596038206588.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1676982596038206588.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :7 after 13
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :13 after 14
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :14 after 16
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :16 after 21
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :21 after 31
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :31 after 51
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :51 after 91
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :91 after 923
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :923 after 4150
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :4150 after 9199
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :9199 after 63019
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :63019 after 174412
Invariant property FireWire-PT-17-ReachabilityFireability-2025-12 does not hold.
Invariant property FireWire-PT-17-ReachabilityFireability-2025-10 does not hold.
Reachability property FireWire-PT-17-ReachabilityFireability-2025-06 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 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,4.41964e+06,11.9579,115872,2,8085,21,254078,6,0,1014,413025,0
Total reachable state count : 4419642

Verifying 3 reachability properties.
Reachability property FireWire-PT-17-ReachabilityFireability-2025-06 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-ReachabilityFireability-2025-06,1,11.9594,115872,2,147,21,254078,7,0,1020,413025,0
Invariant property FireWire-PT-17-ReachabilityFireability-2025-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-ReachabilityFireability-2025-10,18,14.3114,115872,2,177,21,254078,8,0,1123,413025,0
Invariant property FireWire-PT-17-ReachabilityFireability-2025-12 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-ReachabilityFireability-2025-12,105,14.3661,115872,2,354,21,254078,9,0,1140,413025,0
Over-approximation ignoring read arcs solved 0 properties in 15751 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 19:42:25] [INFO ] Flatten gal took : 41 ms
[2025-06-02 19:42:25] [INFO ] Applying decomposition
[2025-06-02 19:42:25] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph975099157537757554.txt' '-o' '/tmp/graph975099157537757554.bin' '-w' '/tmp/graph975099157537757554.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph975099157537757554.bin' '-l' '-1' '-v' '-w' '/tmp/graph975099157537757554.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:42:25] [INFO ] Decomposing Gal with order
[2025-06-02 19:42:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:42:25] [INFO ] Removed a total of 542 redundant transitions.
[2025-06-02 19:42:25] [INFO ] Flatten gal took : 133 ms
[2025-06-02 19:42:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 26 ms.
[2025-06-02 19:42:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8862713421749650313.gal : 17 ms
[2025-06-02 19:42:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15924321889235028822.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8862713421749650313.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15924321889235028822.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality15924321889235028822.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 167
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :167 after 184583
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :184583 after 1.03218e+06
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.03218e+06 after 6.38904e+06
Invariant property FireWire-PT-17-ReachabilityFireability-2025-10 does not hold.
FORMULA FireWire-PT-17-ReachabilityFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.28378e+08 after 4.03762e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.03762e+09 after 3.40239e+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,82.8068,1439476,7244,246,1.91132e+06,9125,1157,5.87474e+06,106,44831,0
Total reachable state count : 1870302369374

Verifying 3 reachability properties.
Reachability property FireWire-PT-17-ReachabilityFireability-2025-06 is true.
FORMULA FireWire-PT-17-ReachabilityFireability-2025-06 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
FireWire-PT-17-ReachabilityFireability-2025-06,60,83.3364,1439476,145,22,1.91132e+06,9125,1161,5.87474e+06,109,44831,15
Invariant property FireWire-PT-17-ReachabilityFireability-2025-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-ReachabilityFireability-2025-10,1404,83.4488,1439476,180,32,1.91132e+06,9125,1322,5.87474e+06,120,44831,11919
Invariant property FireWire-PT-17-ReachabilityFireability-2025-12 does not hold.
FORMULA FireWire-PT-17-ReachabilityFireability-2025-12 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-ReachabilityFireability-2025-12,1.50637e+06,83.5159,1439476,531,66,1.91132e+06,9125,1329,5.87474e+06,120,44831,19842
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 192034 ms.

BK_STOP 1748893429650

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="ReachabilityFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-17, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102400375"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;