Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r011-oct2-167813600500655.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is AutonomousCar-PT-08b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600500655
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 517K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678740902600

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:55:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 20:55:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:55:05] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2023-03-13 20:55:05] [INFO ] Transformed 357 places.
[2023-03-13 20:55:05] [INFO ] Transformed 1128 transitions.
[2023-03-13 20:55:05] [INFO ] Found NUPN structural information;
[2023-03-13 20:55:05] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 84 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 16) seen :5
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1128 rows 357 cols
[2023-03-13 20:55:07] [INFO ] Computed 13 place invariants in 22 ms
[2023-03-13 20:55:08] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 20:55:08] [INFO ] After 682ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 20:55:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-13 20:55:12] [INFO ] After 3207ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-13 20:55:13] [INFO ] Deduced a trap composed of 35 places in 811 ms of which 20 ms to minimize.
[2023-03-13 20:55:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 937 ms
[2023-03-13 20:55:13] [INFO ] Deduced a trap composed of 36 places in 435 ms of which 3 ms to minimize.
[2023-03-13 20:55:14] [INFO ] Deduced a trap composed of 38 places in 425 ms of which 2 ms to minimize.
[2023-03-13 20:55:14] [INFO ] Deduced a trap composed of 33 places in 411 ms of which 3 ms to minimize.
[2023-03-13 20:55:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1503 ms
[2023-03-13 20:55:17] [INFO ] Deduced a trap composed of 35 places in 434 ms of which 1 ms to minimize.
[2023-03-13 20:55:18] [INFO ] Deduced a trap composed of 35 places in 575 ms of which 0 ms to minimize.
[2023-03-13 20:55:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1185 ms
[2023-03-13 20:55:18] [INFO ] After 9428ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 2404 ms.
[2023-03-13 20:55:20] [INFO ] After 12066ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 134 ms.
Support contains 87 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Graph (trivial) has 197 edges and 357 vertex of which 4 / 357 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1428 edges and 355 vertex of which 348 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 348 transition count 1029
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 102 rules applied. Total rules applied 194 place count 259 transition count 1016
Reduce places removed 6 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 22 rules applied. Total rules applied 216 place count 253 transition count 1000
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 19 rules applied. Total rules applied 235 place count 237 transition count 997
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 236 place count 236 transition count 997
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 26 Pre rules applied. Total rules applied 236 place count 236 transition count 971
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 288 place count 210 transition count 971
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 315 place count 183 transition count 944
Iterating global reduction 5 with 27 rules applied. Total rules applied 342 place count 183 transition count 944
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 345 place count 183 transition count 941
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 6 with 40 rules applied. Total rules applied 385 place count 163 transition count 921
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 390 place count 163 transition count 916
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 405 place count 163 transition count 901
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 420 place count 148 transition count 901
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 422 place count 148 transition count 899
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 426 place count 148 transition count 899
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 427 place count 147 transition count 898
Applied a total of 427 rules in 481 ms. Remains 147 /357 variables (removed 210) and now considering 898/1128 (removed 230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 495 ms. Remains : 147/357 places, 898/1128 transitions.
Incomplete random walk after 10000 steps, including 223 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 898 rows 147 cols
[2023-03-13 20:55:22] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-13 20:55:22] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-13 20:55:22] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 20:55:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-13 20:55:24] [INFO ] After 2017ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 20:55:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:55:26] [INFO ] After 2062ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 20:55:27] [INFO ] Deduced a trap composed of 7 places in 391 ms of which 13 ms to minimize.
[2023-03-13 20:55:28] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 0 ms to minimize.
[2023-03-13 20:55:28] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 1 ms to minimize.
[2023-03-13 20:55:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 896 ms
[2023-03-13 20:55:29] [INFO ] Deduced a trap composed of 17 places in 331 ms of which 0 ms to minimize.
[2023-03-13 20:55:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 375 ms
[2023-03-13 20:55:30] [INFO ] Deduced a trap composed of 19 places in 309 ms of which 1 ms to minimize.
[2023-03-13 20:55:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
[2023-03-13 20:55:30] [INFO ] After 5906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1855 ms.
[2023-03-13 20:55:32] [INFO ] After 9970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 75 ms.
Support contains 87 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 898/898 transitions.
Applied a total of 0 rules in 74 ms. Remains 147 /147 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 147/147 places, 898/898 transitions.
Incomplete random walk after 10000 steps, including 223 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 404453 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{6=1}
Probabilistic random walk after 404453 steps, saw 67320 distinct states, run finished after 3006 ms. (steps per millisecond=134 ) properties seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
[2023-03-13 20:55:36] [INFO ] Invariant cache hit.
[2023-03-13 20:55:36] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-13 20:55:36] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 20:55:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-13 20:55:38] [INFO ] After 1566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 20:55:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:55:39] [INFO ] After 1405ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 20:55:40] [INFO ] Deduced a trap composed of 13 places in 348 ms of which 0 ms to minimize.
[2023-03-13 20:55:40] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 0 ms to minimize.
[2023-03-13 20:55:41] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 0 ms to minimize.
[2023-03-13 20:55:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 867 ms
[2023-03-13 20:55:42] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 1 ms to minimize.
[2023-03-13 20:55:42] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 0 ms to minimize.
[2023-03-13 20:55:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 682 ms
[2023-03-13 20:55:43] [INFO ] After 4629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1351 ms.
[2023-03-13 20:55:44] [INFO ] After 7726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 162 ms.
Support contains 62 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 898/898 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 147 transition count 886
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 136 transition count 883
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 133 transition count 882
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 30 place count 133 transition count 881
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 132 transition count 881
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 35 place count 129 transition count 878
Iterating global reduction 3 with 3 rules applied. Total rules applied 38 place count 129 transition count 878
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 294 place count 129 transition count 622
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 4 with 14 rules applied. Total rules applied 308 place count 122 transition count 615
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 309 place count 121 transition count 614
Iterating global reduction 4 with 1 rules applied. Total rules applied 310 place count 121 transition count 614
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 319 place count 121 transition count 605
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 328 place count 112 transition count 605
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 329 place count 112 transition count 604
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 334 place count 112 transition count 604
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 335 place count 111 transition count 603
Applied a total of 335 rules in 111 ms. Remains 111 /147 variables (removed 36) and now considering 603/898 (removed 295) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 111/147 places, 603/898 transitions.
Incomplete random walk after 10000 steps, including 207 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 603 rows 111 cols
[2023-03-13 20:55:45] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-13 20:55:45] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-13 20:55:45] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 20:55:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-13 20:55:46] [INFO ] After 841ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 20:55:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:55:47] [INFO ] After 644ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 20:55:47] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2023-03-13 20:55:47] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-13 20:55:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
[2023-03-13 20:55:48] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 45 ms to minimize.
[2023-03-13 20:55:48] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 0 ms to minimize.
[2023-03-13 20:55:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 649 ms
[2023-03-13 20:55:48] [INFO ] After 2349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 705 ms.
[2023-03-13 20:55:49] [INFO ] After 4026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 85 ms.
Support contains 57 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 603/603 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 602
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 109 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 109 transition count 601
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 597
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 105 transition count 597
Applied a total of 12 rules in 38 ms. Remains 105 /111 variables (removed 6) and now considering 597/603 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 105/111 places, 597/603 transitions.
Incomplete random walk after 10000 steps, including 246 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 601870 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 601870 steps, saw 93881 distinct states, run finished after 3003 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 597 rows 105 cols
[2023-03-13 20:55:53] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-13 20:55:53] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-13 20:55:53] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 20:55:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 23 ms returned sat
[2023-03-13 20:55:54] [INFO ] After 913ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 20:55:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:55:55] [INFO ] After 786ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 20:55:55] [INFO ] Deduced a trap composed of 11 places in 295 ms of which 1 ms to minimize.
[2023-03-13 20:55:56] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 0 ms to minimize.
[2023-03-13 20:55:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1303 ms
[2023-03-13 20:55:57] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 1 ms to minimize.
[2023-03-13 20:55:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-13 20:55:57] [INFO ] After 3072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 709 ms.
[2023-03-13 20:55:58] [INFO ] After 4807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 55 ms.
Support contains 57 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 597/597 transitions.
Applied a total of 0 rules in 26 ms. Remains 105 /105 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 105/105 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 597/597 transitions.
Applied a total of 0 rules in 20 ms. Remains 105 /105 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-03-13 20:55:58] [INFO ] Invariant cache hit.
[2023-03-13 20:55:58] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-13 20:55:58] [INFO ] Invariant cache hit.
[2023-03-13 20:55:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:55:58] [INFO ] Implicit Places using invariants and state equation in 222 ms returned [99, 104]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 289 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 103/105 places, 597/597 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 103 transition count 596
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 596
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 102 transition count 595
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 101 transition count 595
Applied a total of 4 rules in 56 ms. Remains 101 /103 variables (removed 2) and now considering 595/597 (removed 2) transitions.
// Phase 1: matrix 595 rows 101 cols
[2023-03-13 20:55:58] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-13 20:55:58] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-13 20:55:58] [INFO ] Invariant cache hit.
[2023-03-13 20:55:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:55:58] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 101/105 places, 595/597 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 695 ms. Remains : 101/105 places, 595/597 transitions.
Incomplete random walk after 10000 steps, including 314 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 533863 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 533863 steps, saw 84174 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 20:56:02] [INFO ] Invariant cache hit.
[2023-03-13 20:56:02] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-13 20:56:02] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 20:56:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-13 20:56:03] [INFO ] After 854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 20:56:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:56:04] [INFO ] After 806ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 20:56:04] [INFO ] Deduced a trap composed of 10 places in 337 ms of which 0 ms to minimize.
[2023-03-13 20:56:05] [INFO ] Deduced a trap composed of 15 places in 299 ms of which 1 ms to minimize.
[2023-03-13 20:56:05] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 0 ms to minimize.
[2023-03-13 20:56:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 962 ms
[2023-03-13 20:56:06] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 1 ms to minimize.
[2023-03-13 20:56:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2023-03-13 20:56:06] [INFO ] After 3022ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 680 ms.
[2023-03-13 20:56:07] [INFO ] After 4629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 62 ms.
Support contains 57 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 595/595 transitions.
Applied a total of 0 rules in 32 ms. Remains 101 /101 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 101/101 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 595/595 transitions.
Applied a total of 0 rules in 26 ms. Remains 101 /101 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2023-03-13 20:56:07] [INFO ] Invariant cache hit.
[2023-03-13 20:56:07] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-13 20:56:07] [INFO ] Invariant cache hit.
[2023-03-13 20:56:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:56:07] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-13 20:56:07] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-13 20:56:07] [INFO ] Invariant cache hit.
[2023-03-13 20:56:07] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 651 ms. Remains : 101/101 places, 595/595 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 594
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 101 transition count 593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 100 transition count 593
Applied a total of 3 rules in 31 ms. Remains 100 /101 variables (removed 1) and now considering 593/595 (removed 2) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 593 rows 100 cols
[2023-03-13 20:56:07] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-13 20:56:07] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-13 20:56:08] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 20:56:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-13 20:56:08] [INFO ] After 761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 20:56:09] [INFO ] Deduced a trap composed of 8 places in 359 ms of which 1 ms to minimize.
[2023-03-13 20:56:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2023-03-13 20:56:10] [INFO ] After 2006ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 761 ms.
[2023-03-13 20:56:10] [INFO ] After 2889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-13 20:56:10] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-13 20:56:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 101 places, 595 transitions and 6841 arcs took 11 ms.
[2023-03-13 20:56:11] [INFO ] Flatten gal took : 195 ms
Total runtime 66022 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 08b
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 101 places, 595 transitions, 6841 arcs.
Final Score: 5697.653
Took : 24 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678740997123

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 7554:
syntax error

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="AutonomousCar-PT-08b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is AutonomousCar-PT-08b, 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 r011-oct2-167813600500655"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08b.tgz
mv AutonomousCar-PT-08b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;